The Design Of Optimal Dft Algorithms Using Dynamic Programming

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 31, Issue 2, 1983, Pages 378-387

  Johnson, Howard W ^a   Burrus, C Sidney ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETE FOURIER TRANSFORM ALGORITHMS; DYNAMIC PROGRAMMING ALGORITHMS;

COMPUTER PROGRAMMING;

EID: 0020737790     PISSN: 00963518     EISSN: None     Source Type: Journal    
DOI: 10.1109/TASSP.1983.1164071     Document Type: Article

References (13)

1. S. Winograd, “On computing the discrete Fourier transform,” Proc. Nat. Acad. ScL U.S., vol. 73, pp. 1005–1006, Apr. 1976.
2. S. Winograd, “On computing the discrete Fourier transform,” Math. Comput., vol. 32, no. 141, pp. 175–199, Jaa 1978.
3. H. F. Silverman, “An introduction to programming the Winograd Fourier transform algorithm ‘WFTA’,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 152-165, Apr. 1977.
4. D. P. Kolba and T. W. Parks, “A prime factor FFT algorithm using high-speed convolution,” EiTir Trans. Acoust., Speech, Signal Processing, vol. ASSP-25, pp. 281–294, Aug. 1977.
5. L. R. Morris, “A comparative study of time efficient FFT and WFTA programs for general purpose computers,” IEEE Trans. Acoust., Speech, Signal Processing, voL ASSP-26, pp. 141-150, Apr. 1978.
6. Programs for Digital Signal Processing. New York: IEEE Press, 1979.
7. H. Nawab and J. H. McClellan, “Bounds on the minimum number of data transfers in WFTA and FFT programs,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-27, pp. 393–397, Aug. 1979.
8. R. Bellman, in Dynamic Programming. Princeton, NJ. Princeton Univ. Press, 1957.
9. H. W. Johnson and C. S. Burrus, “New organizations for the DFT,” in Proc. Asilomar Conf., Pacific Grove, CA, Nov. 1981, pp. 82-87.
10. H. W. Johnson, “The design of DFT algorithms,” Ph.D. dissertation, Rice Univ., Houston, TX, May 1982.
11. J. H. McClellan and C. M. Rader, Number Theory in Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1979.
12. H. J. Nussbaumer, in FFT and Convolution Algorithms. Berlin. Springer-Verlag, 1981.
13. H. W. Johnson and C. S. Burrus, “Large DFT modules: 11,13,17, 19 and 25,” Dep. Elec. Eng., Rice University, Houston, TX, Tech. Rep. 8105, Dec. 13, 1981.