Hardware Implementation of FFT/IFFT Algorithms Incorporating Efficient Computational Elements

  • Konguvel ElangoEmail author
  • Kannan Muniandi
Original Article


Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT) computations involve quite a large number of complex multiplications and complex additions. Optimizing the FFT processing elements in terms of complex multiplication reduces area and power consumption. In this paper, complex multipliers in the FFT processors are replaced by area and power efficient approximate multipliers. Approximate arithmetic computation appears to be effective solution for the systems that exhibit an intrinsic error tolerance. The computational errors arising because of approximation can be considered as trade-off for the significant gains in power and area. Approximate 8- and 16-bit multipliers are used in radix-2 butterfly unit which is the crucial computational component in FFT/IFFT processing. The designed FFT/IFFT processing units are analyzed, synthesized and simulated in Altera Cyclone II EP2C35F672C6 Field Programmable Gate Array (FPGA) device. Experimental results show that the proposed 16-point FFT architecture incorporating approximate complex multiplier achieves an area and power efficiency of 33.47% and 1.8% respectively compared to accurate 16-point FFT processor. The 8-point and 16-point Decimation In Time (DIT)—FFT incorporating approximate computational elements operate at a speed of 26.69 Gbps and 46.20 Gbps, respectively.


FFT IFFT OFDM Approximate computing FPGA implementation 



  1. 1.
    Konguvel E, Kannan M (2018) A survey on FFT/IFFT processors for next generation telecommunication systems. J Circ Syst Comput 27(3):1830001CrossRefGoogle Scholar
  2. 2.
    Manuel BR, Konguvel E, Kannan M (2017) An area efficient high speed optimized FFT algorithm. Signal Processing, Communication and Networking (ICSCN), 2017 Fourth International Conference on IEEEGoogle Scholar
  3. 3.
    Venkatachalam S, Ko S-B (2017) Design of power and area efficient approximate multipliers. IEEE Trans Very Large Scale Integr (VLSI) Syst 25(5):1782–1786CrossRefGoogle Scholar
  4. 4.
    Lin C-H, Lin C (2013) High accuracy approximate multiplier with error correction. In: Proc. IEEE 31st Int. Conf. Comput. Design, pp 33–38Google Scholar
  5. 5.
    Bansal Y, Madhu C (2016) A novel high-speed approach for 16–16 vedic multiplication with compressor adders. Comput Elect Eng 49:39–49CrossRefGoogle Scholar
  6. 6.
    Esposito D, Strollo AGM, Napoli E, De Caro D, Petra N (2018) Approximate multipliers based on new approximate compressors. IEEE Trans Circ Syst I. Google Scholar
  7. 7.
    Yang T, Ukezono T, Sato T (2017) Low-power and high-speed approximate multiplier design with a tree compressor. 2017 IEEE international conference on computer design (ICCD), Boston, MA, pp 89–96Google Scholar
  8. 8.
    Xilinx: LogiCORE IP Fast Fourier Transform V7.1 DS260, March 2011Google Scholar
  9. 9.
    Vinay Kumar M, David Selvakumar A, Sobha PM (2015) Area and frequency optimized 1024 point Radix-2 FFT processor on FPGA. 2015 International Conference on VLSI Systems, Architecture, Technology and Applications (VLSI-SATA), Bangalore, pp 1–6Google Scholar
  10. 10.
    Mookherjee S, DeBrunner L, DeBrunner V (2015) A low power radix-2 FFT accelerator for FPGA. 2015 49th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, pp 447–451Google Scholar

Copyright information

© The Korean Institute of Electrical Engineers 2019

Authors and Affiliations

  1. 1.Department of Electronics Engineering, Madras Institute of Technology CampusAnna UniversityChennaiIndia

Personalised recommendations