Efficient Hardware Implementation of 1024 Point Radix-4 FFT

  • Senthilkumar Ranganathan
  • Ravikumar Krishnan
  • H. S. Sriharsha
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 264)


Since FFT algorithm is extremely demanding task and has several applications in the areas of signal processing and communication systems, it must be precisely designed to induce an efficient implementation of the parameters involving area and performance. To fulfill this requirement an optimized architecture is demonstrated in this paper for computing 1024-point, Radix-4 FFT using FPGA and is majorly compared with Xilinx LogiCoreTM FFT IP and found that proposed design is more efficient and effective in terms of area and performance. A novel architecture referred to as 2-D Vector Rotation and Complex Math Processor has been proposed in this paper. This single structure rotation helps in effectively carrying out the complex multiplications. The algorithm implements multiplexor hardware for computing the complex multipliers, thus consuming the minimal hardware resources. The entire RTL design is described using Verilog HDL and simulated using Xilinx ISim[TM]. This experimental result is tested on Spartan-6 XC6SLX150T. The result shows 557 LUT’s, 837 Flip Flops, 3 DSP Slices, Maximum Frequency of 215 MHz. This is about 52% improvement in resource usage and 5% upgrade in the performance.


FPGA FFT 2-D Vector Rotation Complex Math Processor 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Burrus, C.S., Perks, T.W.: DFUFFT and Convolution Algorithms. Wiley Interscience, New York (1985)Google Scholar
  2. 2.
    Cooley, J.W., Lewis, P.A.W., Welch, P.D.: Historical notes on the fast Fourier transform. Proc. IEEE 55, 1675–1677 (1967)CrossRefGoogle Scholar
  3. 3.
    Shu, C.J., Peng, X.: Dept. of Electron. & Eng. Tsinghua Univ., BeijingGoogle Scholar
  4. 4.
    Mateer, T.: Ph.D. dissertation, Dept. Mathematical Science., Clemson Uni., Clemson., SC Google Scholar
  5. 5.
    Silvia, M., Giancarlo, R., Gaetano, S.: A parallel fast Fourier transform. Mod. Phy. C 10, 781–805 (1999)CrossRefMATHGoogle Scholar
  6. 6.
    Grioryan, A.M., Agaian, S.S.: Split mangeable efficient algorithm for Fourier and Hadamard transform. IEEE Trans. Signal Processs. 48(1), 172–183 (2000)CrossRefGoogle Scholar
  7. 7.
    Chan, I.C., Ho, K.L.: Split vector-radix fast Fouriet transform. IEEE Trasn. Signal Process. 40, 2029–2040 (1992)CrossRefMATHGoogle Scholar
  8. 8.
    Cooley, J.W., Tukey, W.: An Algorithm for the Machine Calculation of Complex Fourier Series. Math. of Computations 19, 297–301 (1965)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Knight, W.R., Kaiser, R.: A Simple Fixed-Point Error Bound for the Fast Fourier Transform. IEEE Trans. Acoustics, Speech and Signal Proc. 27(6), 615–620 (1979)CrossRefGoogle Scholar
  10. 10.
    Saidi, A.: Decimation-in-Time-Frequency FFT Algorithm. In: Proc. IEEE International Conf. on Acoustics, Speech, and Signal Processing, vol. 3, pp. 453–456 (1994)Google Scholar
  11. 11.
    Xilinx® Logic coreTM, Fast Fourier Transform V8.0, Xilinx® (2012)Google Scholar
  12. 12.
    Zhong, G., Zheng, H., Jin, Z., Chen, D., Pang, Z.: 1024-Point Pipeline FFT Processor with Pointer FIFOs based on FPGA. In: 2011 IEEE/IFIP 19th International Conference on VLSI and System-on-Chip (2011)Google Scholar
  13. 13.
    He, H., Guo, H.: The Realization of FFT Algorithm based on FPGA Co-processor. In: Second International Symposium on Intelligent Information Technology Application, vol. 3, pp. 239–243 (December 2008)Google Scholar
  14. 14.
    Oh, J.-Y., Lim, M.-S.: Area and power efficient pipeline FFT algorithm. In: IEEE Workshop on Signal Processing Systems Design and Implementation, November 2-4, pp. 520–525 (2005)Google Scholar
  15. 15.
    Wang, H.-Y., Wu, J.-J., Chiu, C.-W., Lai, Y.-H.: A Modified Pipeline FFT Architecture. In: 2010 International Conference on Electrical and Control Engineering (ICECE), pp. 4611–4614 (June 2010)Google Scholar
  16. 16.
    Sukhsawas, S., Benkrid, K.: A high-level implementation of a high performance pipeline FFT on Virtex-E FPGAs. In: Proceedings of the IEEE Computer society Annual Symposium on VLSI, February 19-20, pp. 229–232 (2004)Google Scholar
  17. 17.
    He, S., Torkelson, M.: Design and implementation of a 1024-point pipeline FFT processor. In: Proceedings of the IEEE 1998 Custom Integrated Circuits Conference, May 11-14, pp. 131–134 (1998)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Senthilkumar Ranganathan
    • 1
  • Ravikumar Krishnan
    • 2
  • H. S. Sriharsha
    • 3
  1. 1.Institution of Engineers (India)ChennaiIndia
  2. 2.KCG college of technologyChennaiIndia
  3. 3.Asmaitha Wireless Technologies Pvt. LtdBangaloreIndia

Personalised recommendations