A New Fast Discrete Fourier Transform

Journal of VLSI Signal Processing Systems for Signal, Image, and Video Technology

Volumn 20, Issue 3, 1998, Pages 219-232

  Zhou, Feng ^a,b   Kornerup, Peter ^{a,b,c,d,e,f,g,h,i}  

^a ZHEJIANG UNIVERSITY   (China)

^b UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^c Signal Processing Lab   (Sweden)

^d AARHUS UNIVERSITY   (Denmark)

^e University Computer Center   (Taiwan)

^f Signal Processing Lab ^*

^g UNIVERSITY OF LOUISIANA AT LAFAYETTE   (United States)

^h SOUTHERN METHODIST UNIVERSITY   (United States)

ⁱ Computer Science Department ^*

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FOURIER TRANSFORMS; COMPUTER HARDWARE; DATA REDUCTION; FUNCTIONS; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; NUMBER THEORY;

DISCRETE FOURIER TRANSFORMS (DFT); DISCRETE FOURIER TRANSFORM (DFT); PLANE ROTATIONS; SPLIT-RADIX METHODS;

DIGITAL SIGNAL PROCESSING; FAST FOURIER TRANSFORMS;

EID: 0032316473     PISSN: 13875485     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. J.W. Cooley and J.W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Comp., Vol. 19, No. 90, pp. 297-301, April 1965.
2. W.T. Cochran et al., "What is the fast Fourier transform?," Proc. IEEE, Vol. 55, pp. 1664-1674, Oct. 1967.
3. R.C. Singleton, "On computing the fast Fourier transform," CACM, Vol. 10, pp. 153-161, Feb. 1971.
4. G.D. Bergland, "A guided tour of the fast Fourier transform," IEEE Spectrum, Vol. 6, No. 7, pp. 41-52, July 1969.
5. J.B. Martens, "Recursive cyclotomic factorization - A new algorithm for calculating the discrete Fourier transform," IEEE Trans. on ASSP, Vol. ASSP-32, pp. 750-761, April 1984.
6. M. Vetterli and H.J. Nussbaumer, "Simple FFT and DCT algorithm with reduced number of operation," Signal Processing, Vol. 6, pp. 267-278, July 1984.
7. Z. Wang, "Fast algorithms for the discrete W transform and the discrete Fourier transform," IEEE Trans. on ASSP, Vol. ASSP-32, pp. 803-816, Aug. 1984.
8. P. Duhamel, "Implementation of Split-Radix FFT algorithms for complex, real, and real-symmetric data," IEEE Trans. on ASSP, Vol. ASSP-34, No. 2, pp. 285-295, April 1986.
9. C.D. Thompson, "Fourier transforms in VLSI," IEEE Trans. Comp., Vol. 10, pp. 1047-1057, Nov. 1983.
10. A. Norton and A.J. Siberger, "Parallelization and performance analysis of the Cooley-Tukey FFT algorithm for shared-memory architecture," IEEE Trans. Comp., Vol. C-36, No. 5, pp. 581-591, May 1987.
11. K. Yamashita et al., "A Wafer-scale 170000-gate FFT processor with built-in test circuits," IEEE Journal of Solid-State Circuits, Vol. 23, pp. 336-342, 1988.
12. J. O'Brien et al., "A 200 MIPS signal-chip 1K FFT processor," 1989 Proc. IEEE Int. Solid-State Circuits Conf., pp. 166-167, Feb. 1989.
13. J. You and S.S. Wong, "A high performance single chip FFT array processor for Wafer scale integration," Proc. of the Int. Conf. on Wafer Scale Integration, pp. 60-67, 1990.
14. J.E. Whelchel et al., "The systolic phase rotation FFT - A new algorithm and parallel processor architecture," Proc. 1990. Int. Conf. Acoust., Speech, Signal Processing, Vol. 2, pp. 1021-1024, 1990.
15. E.E. Swartzlander, Jr. et al., "A Radix-8 scale FFT processor," Journal of VLSI Signal Processing, Vol. 4, Nos. 2/3, pp. 165-176, May 1992.
16. T. Chen and L. Zhu, "An expandable column FFT architecture using circuit switching networks," Journal of VLSI Signal Processing, Vol. 6, No. 3, pp. 243-257, Dec. 1993.
17. F. Zhou and P. Kornerup, "A high speed DCT/IDCT using a pipelined CORDIC algorithm," Proc. 12th IEEE Symposium on Computer Arithmetic, IEEE Press, pp. 180-187, July 1995.