Computation of an Odd-Length DCT from a Real-Valued DFT of the Same Length

IEEE Transactions on Signal Processing

Volumn 40, Issue 1, 1992, Pages 54-61

  Heideman, Michael T ^a  

^a Etak   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES--FOURIER TRANSFORMS;

DISCRETE COSINE TRANSFORM(DCT);

SIGNAL PROCESSING;

EID: 0026692462     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.157181     Document Type: Article

References (21)

1. N. Ahmed, T. Natarajan, and K. R. Rao, “Discrete cosine transform,” IEEE Trans. Comput vol. C-23, no. 1, pp. 90–93, Jan. 1974.
2. M. J. Narasimha and A. M. Peterson, “On the computation of the discrete cosine transform,” IEEE Trans. Commun., vol. COM-26, no. 6, pp. 934–936, June 1978.
3. R. M. Haralick, “A storage efficient way to implement the discrete cosine transform,” IEEE Trans. Comput., vol. C-25, no. 7, pp. 764 765, July 1976.
4. W.-H. Chen, C. H. Smith, and S. C. Fralick, “A fast computational algorithm for the discrete cosine transform, ” IEEE Trans. Commun., vol. COM-25, no. 9, pp. 1004–1009, Sept. 1977.
5. H. S. Malvar, “Fast computation of the discrete cosine transform and the discrete Hartley transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, no. 10, pp. 1484–1485, Oct. 1987.
6. B. G. Lee, “A new 1 algorithm to compute the discrete cosine transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, no. 6, pp. 1243- 1245, Dec 1984.
7. J. Makhoul, “A fast cosine transform in one and two dimensions,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP 28, no. 1, pp. 27–34, Feb. 1980.
8. H. S. Hou, “A fast recursive algorithm for computing the discrete cosine transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, no. 10, pp. 1455–1461, Oct. 1987.
9. P. P. N. Yang and M. J. Narasimha, “Prime factor decomposition of the discrete cosine transform and its hardware realization,” in Proc 1985 IEEE Int. Conf. Acoust., Speech, Signal Processing (Tampa, FL), Mar. 26–29, 1985, pp. 772–775.
10. M. Vetterli and H. J. Nussbaumer, “Simple FFT and DCT algorithms with reduced number of operations,” Signal Processing, vol. 6, no 4, pp 267–278, Aug. 1984.
11. Z. Wang, “On computing the discrete Fourier and cosine transforms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, no. 5, pp. 1341–1344, Oct. 1985.
12. S. Winograd, “On computing the discrete Fourier transform,” Math. Comput., vol. 32, no. 141, pp. 175–199, Jan. 1978; reprinted in Number Theory in Digital Signal Processing, J. H. McClellan and C. M. Rader, Eds. Englewood Cliffs, NJ: Prentice-Hall, 1979, pp. 125–149.
13. H. J. Nussbaumer, Fast Fourier Transform and Convolution Algorithms. Berlin, Heidelberg, and New York: Springer, 1981.
14. C. S. Burrus and P. W. Eschenbacher, “An in-place, in-order prime factor FFT algorithm,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-29, no. 4, pp. 806–817, Aug. 1981.
15. H. W. Johnson and C. S. Burrus, “Large DFT modules: 11, 13, 17, 19 and 25,” Tech. Rep. 8105, Dep. Elec. Eng., Rice Univ., Hous-ton, TX, Dec. 13, 1981.
16. C. S. Burrus and T. W. Parks, DFT/FFT and Convolution Algorithms. New York: Wiley, 1985.
17. R. Stasiriski, “Easy generation of small-A discrete Fourier transform algorithms,” Proc. Inst. Elec. Eng., part G, vol. 133, no. 3, pp. 133-139,June 1986.
18. R. Stasirtski, “Prime factor DFT algorithms for new small-A DFT modules,” Proc. Inst. Elec. Eng., part G, vol. 134, no. 3, pp. 117— 126, June 1987.
19. 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.
20. M. T. Heideman, C. S. Burrus, and H. W. Johnson, “Prime factor FFT algorithms for real-valued series,” in Proc. 1984 IEEE Int. Conf. Acoust., Speech, Signal Processing (San Diego, CA), Mar. 19–21, 1984, pp. 28A.7.1-28A.7.4.
21. M. T. Heideman and C. S. Burrus, “On the number of multiplications necessary to compute a length-2” DFT,” IEEE Trans. Acoust.