LINEAR FILTERING APPROACH TO COMPUTATION OF DISCRETE FOURIER TRANSFORM

[1] FAST FOURIER TRANSFORM - A DETAILED EXPLANATION IS OFFERED OF AN ALGORITHM THAT REDUCES COMPUTER TIME AND ALLOWS ITS USER TO EMPLOY POWERFUL FREQUENCY TECHNIQUES ONCE CONDIDERED INEFFICIENT [J]. IEEE SPECTRUM, 1967, 4 (12) : 63 - &

[2] COCHRAN JW, 1967, P IEEE, V55, P1664

[3] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J]. MATHEMATICS OF COMPUTATION, 1965, 19 (90) : 297 - &

[4] MACDUFFEE CC, 1940, INTRODUCTION ABSTRAC

[5] CHIRP Z-TRANSFORM ALGORITHM AND ITS APPLICATION [J]. BELL SYSTEM TECHNICAL JOURNAL, 1969, 48 (05): : 1249 - +

[6] STOCKHAM TG, 1966, AFIPS C P, V28, P229

[7] VINAGRADOV IM, 1958, ELEMENTS NUMBER THEO

[1] FAST FOURIER TRANSFORM - A DETAILED EXPLANATION IS OFFERED OF AN ALGORITHM THAT REDUCES COMPUTER TIME AND ALLOWS ITS USER TO EMPLOY POWERFUL FREQUENCY TECHNIQUES ONCE CONDIDERED INEFFICIENT [J]. IEEE SPECTRUM, 1967, 4 (12) : 63 - &

[2] COCHRAN JW, 1967, P IEEE, V55, P1664

[3] AN ALGORITHM FOR MACHINE CALCULATION OF COMPLEX FOURIER SERIES [J]. MATHEMATICS OF COMPUTATION, 1965, 19 (90) : 297 - &

[4] MACDUFFEE CC, 1940, INTRODUCTION ABSTRAC

[5] CHIRP Z-TRANSFORM ALGORITHM AND ITS APPLICATION [J]. BELL SYSTEM TECHNICAL JOURNAL, 1969, 48 (05): : 1249 - +

[6] STOCKHAM TG, 1966, AFIPS C P, V28, P229

[7] VINAGRADOV IM, 1958, ELEMENTS NUMBER THEO