Efficient Computation of the DFT with Only a Subset of Input or Output Points

IEEE Transactions on Signal Processing

Volumn 41, Issue 3, 1993, Pages 1184-1200

  Sorensen, Henrik V ^a   Burrus, C Sidney ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIALS; REDUNDANCY; SIGNAL PROCESSING;

DFT; FFT ALGORITHMS; PRIME-FACTOR ALGORITHMS; TRANSFORM DECOMPOSITION;

FAST FOURIER TRANSFORMS;

EID: 0027554491     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.205723     Document Type: Article

References (20)

1. G. D. Bergland, "A radix-eight fast-Fourier transform subroutine for real-valued series," IEEE Trans. Audio Electroacoust., vol. AU-17, no. 2, pp. 138–144, June 1969.
2. C. G. Boncelet, Jr., "A rearranged DFT algorithm requiring N2/6 multiplications," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, no. 6, pp. 1658–1659, Dec. 1986.
3. C. S. Burrus and T. W. Parks, DFT/FFT and Convolution Algorithms. New York: Wiley, 1985.
4. J. W. Cooley and J. W. Tukey, "An algorithm for the machine calculation of complex Fourier series," Math. Comput., vol. 19, no. 90, pp. 297–301, Apr. 1965.
5. G. C. Danielson and C. Lanczos, "Some improvements in practical Fourier analysis and their application to X-ray scattering from liquids," J. Franklin Inst., vol. 233, nos. 4 and 5, pp. 365-380 and 435-452, Apr. and May 1942.
6. R. de Wild, "Method for partial spectrum computation," Proc. Inst.Elec. Eng., vol. 134, no. 7, pp. 659–666, Dec. 1987.
7. G. Goertzel, "An algorithm for the evaluation of finite trigonometric series," Amer. Math. Monthly, vol. 65, no. 1, pp. 34–35, Jan. 1958.
8. D. P. Kolba and T. W. Parks, "A prime factor FFT algorithm using high-speed convolution," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, no. 4, pp. 281–294, Aug. 1977.
9. J. D. Markel, "FFT pruning," IEEE Trans. Audio Electroacoust., vol. AU-19, no. 4, pp. 305–311, Dec. 1971.
10. K. Nagai, "Pruning the decimation-in-time FFT algorithm with frequency shift," IEEE Trans. Acoust., Speech, Signal Processing, vol.ASSP-34, no. 4, pp. 1008–1010, Aug. 1986.
11. A. V. Oppenheim and R. W. Schafer, Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975.
12. C. Runge, "Ueber die zerlegung empirisch gegebener periodischer funktionen in sinuswellen," Z. Math. Phys., vol. 48, pp. 443–456, 1903 (in Germany).
13. R. C. Singleton, "An algorithm for computing the mixed radix fast Fourier transform," IEEE Trans. Audio Electroacoust., vol. AU-17, no. 2, pp. 93–103, June 1969.
14. D. P. Skinner, "Pruning the decimation in-time FFT algorithm," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-24, no. 2, pp. 193–194, Apr. 1976.
15. H. V. Sorensen and C. S. Burrus, "A new efficient algorithm for computing a few DFT points," Proc. IEEE 1988 Int. Symp. Circuits Syst., June 7-9, 1988, pp. 1915-1918.
16. H. V. Sorensen, M. T. Heideman, and C. S. Burrus, "On computing the split-radix FFT," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, no. 11, pp. 152–156, Feb. 1986.
17. H. V. Sorensen, D. L. Jones, M. T. Heideman, and C. S. Burrus, "Real-valued fast Fourier transform algorithms," IEEE Trans.Acoust., Speech, Signal Processing, vol. ASSP-35, no. 6, pp. 849–863, June 1987.
18. T. V. Sreenivas and P. V. S. Rao, "High resolution narrow-band spectra by FFT pruning," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-28, no. 2, pp. 254–257, Apr. 1980.
19. T. V. Sreenivas and P. V. S. Rao, "FFT algorithm for both input and output pruning," IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-27, no. 3, pp. 291–292, June 1979.
20. S. Winograd, "On computing the discrete Fourier transform," Math.Comput., vol. 32, no. 141, pp. 175-199. Jan. 1978.