SLGP Header

Design of Reversible FFT Algorithm

IJEECC Front Page

Fast Fourier Transform (FFT) is the most important computation involved in almost all signal processing task, in which, (N/2)log2N umbers of complex multiplications and N log2N numbers of complex additions are involved. Where N is the size of FFT and it is based on the input data length. when the input data length is high, automatically the number of computation of multiplication and addition involved also increases and intern increases the energy consumed by the system. Hence it is emerging fact that the increase in energy consumption must be reduced and which can be easily achieved with the use of reversible logic gates. In the contest of designing reversible logic circuits for FFT implementation become essential. This paper proposes a design of Reversible FFT in both form DIT and DIF using reversible gates.
Keywords: Reversible Logic gates, Reversible FFT, Quantum computing, Low power design.


  1. Landauer, R., 1961. Irreversibility and heat generation in the computing process, IBM J.Research and Development, 5 (3): 183-191.
  2. Bennett, C.H., 1973. Logical reversibility of computation, IBM J. Research and Development, 17: 525-532.
  3. Feynman, R., 1985. Quantum mechanical computers, Optics News, 11: 11-20.
  4. D.M.Smith, 2003. Using Multiple Precision Arithmetic, IEEE Journal of Computing in Science & Engineering .
  5. Mahamad, S.N., 2010. Constructing Online Testable Circuits Using Reversible Logic, IEEE Journal of Instrumentation and Measurement, Vol.59, No 1, pp. 101-109, Jan 2010.
  6. Toffoli T., 1980. Reversible computing, Tech Memo MIT/LCS/TM-151. MIT Lab for Computer Science.
  7. Saravanan M, Suresh Manic K, 2013. Novel Reversible Code Converters Using Reversible Logic Gates, International Journal of Electrical and Electronics Engineering Research, Vol. 3, pp.161-166.
  8. Rohit Sreerama, Paidi Satish, Neelima K, 2012. An Algorithm for Variable Precision Based Floating Point Multiplication, Springer, pp 238-242.