Low-cost fast VLSI algorithm for discrete fourier transform

IEEE Transactions on Circuits and Systems I: Regular Papers

Volumn 54, Issue 4, 2007, Pages 791-806

  Cheng, Chao ^a   Parhi, Keshab K ^a  

^a University of Minnesota   (United States)

Author keywords

Cyclic convolution; Discrete Fourier transforms (DFTs); Systolic array; VLSI

Indexed keywords

ALGORITHMS; CONVOLUTION; DISCRETE FOURIER TRANSFORMS; FAST FOURIER TRANSFORMS; SYSTOLIC ARRAYS;

CONVOLUTION ALGORITHM; CYCLIC CONVOLUTION;

VLSI CIRCUITS;

EID: 34247238158     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCSI.2006.888772     Document Type: Article

References (14)

1. L. W. Chang and M. Y. Chen, "A new systolic array for discrete fourier transform," IEEE Trans. Acoust., Speech, Signal Process., vol. 36, no. 10, pp. 1665-1666, Oct. 1988.
2. N. Rama Murthy and M. N. S. Swamy, "On the real-time computation of DFT and DCT through systolic architectures," IEEE Trans. Signal Process. vol. 42, no. 4, pp. 988-991, Apr. 1994.
3. D. C. Kar and V. V. Bapeswara Rao, "A new systolic realization for the discrete fourier transform," IEEE Trans. Signal Process., vol. 41, no. 5, pp. 2008-2010, May 1993.
4. C. M. Liu and C. W. Jen, "A new systolic array algorithm for discrete Fourier transform," in Proc. IEEE Int. Conf. on Circuits Syst., May 1991, pp. 2212-2215.
5. J. I. Guo, C. M. Liu, and C. W. Jen, "The efficient memory-based VLSI array designs for DFT and DCT," IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 37, no. 10, pp. 723-733, Oct. 1992.
6. T. S. Chang, J. I. Guo, and C. W. Jen, "Hardware-efficient DFT designs with cyclic convolution and subexpression sharing," IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 47, no. 9, pp. 886-892, Sep. 2000.
7. J. Choi and V. Boriakoff, "A new linear systolic array for FFT computation," IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 39, no. 4, pp. 236-239, Apr. 1992.
8. V. Boriakoff, "FFT computation with systolic arrays, a new architecture," IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process., vol. 41, no. 4, pp. 278-284, Apr. 1994.
9. C.-H. Chang, C.-L. Wang, and Y.-T. Chang, "Efficient VLSI architectures for fast computation of the discrete Fourier transform and its inverse," IEEE Trans. Signal Process., vol. 48, no. 11, pp. 3206-3216, Nov. 2000.
10. C. Cheng and K. K. Parhi, "Hardware efficient fast DCT based on novel cyclic convolution structures," IEEE Trans. Signal Process., vol. 54, no. 11, pp. 4419-4434, Nov. 2007.
11. C. Cheng and K. K. Parhi, "Hardware efficient fast parallel FIR filter structures based on iterated short convolution," IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 51, no. 8, pp. 1492-1500, Aug. 2004.
12. H. S. Silverman, "An introduction to programming the Winograd Fourier transform algorithm," IEEE Trans. Acoust., Speech, Signal Process. vol. ASSP-25, no. 2, pp. 152-165, Feb. 1977.
13. P. Lavoie, "A high-speed CMOS implementation of the Winograd Fourier transform algorithm," IEEE Trans. Signal Process., vol. 44, no. 8, pp. 2121-2126, Aug. 1996.
14. R. Tolimieri, M. An, and C. Lu, Algorithms for Discrete Fourier Transform and Convolution. New York: Springer-Verlag, 1989.