Skip to main content
Log in

Abstract

A scheme for reducing the hardware resources to implement on LUT-based FPGA devices the twiddle factors required in Fast Fourier Transform (FFT) processors is presented. The proposed scheme reduces the number of embedded block RAM for large FFTs and the number of slices for FFT lengths higher than 128 points. Results are given for Xilinx devices, but they can be generalized for other advanced LUT-based devices like ALTERA Stratix.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. L. Wanhammar, DSP Integrated Circuits, Academic, New York, 1999.

    Google Scholar 

  2. D. Cohen, “Simplified Control of FFT Hardware,” IEEE Trans. Acoust. Speech Signal Process., ASSP-24, 1976, pp. 577–579.

    Article  Google Scholar 

  3. B.B. Bass, “A Low-Power, High-Performance, 1024-point FFT Processor,” IEEE J. Solid-State Circuits, vol. 34, no. 3, March 1999, pp. 380–387.

    Article  MathSciNet  Google Scholar 

  4. S. He and M. Torkelson, “Design and Implementation of a 1024-point Pipeline FFT Processor,” in Proc. IEEE 1998 Custom Integrated Circuits Conference, 1998, pp. 131–134.

  5. J. Fox and P.A. Thomas, “A Self-Testing 2 CMOS Chipset for FFT Applications,” IEEE J. Solid-State Circuits, vol. 22, no. 1, 1987, pp. 15–19.

    Article  Google Scholar 

  6. T.J. Ding, J.V. McCanny and Y. Hu, “Rapid Design of Application Specific FFT Cores,” IEEE Trans. Signal Process., vol. 47, no. 5, 1999, pp. 1371–1381.

    Article  Google Scholar 

  7. Y. Ma and L. Wanjammar, “Hardware Efficient Control of Memory Addressing for High Performance FFT Processors,” IEEE Trans. Signal Process., 2000, vol. 48, no. 3, 2000, pp. 917–921.

    Article  Google Scholar 

  8. Y. Chang and K.K. Parhi, “An Efficient Pipelined FFT Architecture,” IEEE Trans. Circuits Syst. II, Analog and Digit. Signal Process., vol. 50, no. 6, 2003, pp. 322–325.

    Article  Google Scholar 

  9. R. Makowitz and M. Mayr, “Optimal Pipeline FFT Processing Based on Embedded Static RAM,” in Proc. of ICSPAT’97.

  10. M. Hasan and T. Arslan, “Scheme for Reducing Size of Coefficient Memory in FFT processor,” IEE Electronic Letters, vol. 38, no. 4, 2002, pp. 163–164.

    Article  Google Scholar 

  11. J. Agrawal and J. Ninan, “Hardware Modifications in Radix-2 Cascade FFT Processors,” IEEE Trans. Acoust. Speech and Signal Process., vol. 26, no. 2, 1978, pp. 171–172.

    Article  Google Scholar 

  12. S. Saponara, L. Serafini and L. Fanucci, “Low-power FFT/IFFT VLSI Macro Cell for Scalable Broadband VDSL Modem,” in Proc. The 3rd IEEE International Workshop on System-on-Chip for Real-Time Applications, 2003, pp. 161–166.

  13. W. Wu, S.-S. Chin and S. Hong, “ A Coarse-grained FPGA Architecture for Reconfigurable Baseband Modulator/Demodulator,” in Proc. Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002, vol. 2, 2002, pp. 1613–1618.

  14. Y.-W. Lin, H.-Y. Liu and C.Y. Lee, “A Dynamic Scalling FFT Processor for DVB-T Applications,” IEEE J. Solid-State Circuits, vol. 39, no. 11, 2004, pp. 2005–2013.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to T. Sansaloni.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sansaloni, T., Pérez-Pascual, A., Torres, V. et al. Scheme for Reducing the Storage Requirements of FFT Twiddle Factors on FPGAs. J VLSI Sign Process Syst Sign Image Video Technol 47, 183–187 (2007). https://doi.org/10.1007/s11265-007-0055-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-007-0055-8

Keywords

Navigation