A fast recursive algorithm for computing the discrete cosine transform

IEEE Transactions on Acoustics, Speech, and Signal Processing

Volumn 35, Issue 10, 1987, Pages 1455-1461

  Hou, Hsieh S ^a  

^a AEROSPACE CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (20)

1. N. Ahmed, T. Natarajan, and K.R. Rao, “Discrete cosine transform,” IEEE Trans. Comput., vol. C-23, pp. 90–93, Jan. 1974.
2. M. Hamidi and J. Pearl, “Comparison of the cosine and Fourier transforms of Markov-1 signals,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-24, pp. 428–429, Oct. 1976.
3. R.J. Clark, “Relation between the Karhunen-Loève and cosine transform,” IEE Proc, vol. 128, pt. F, no. 6, pp. 359–360, Nov. 1981.
4. N. Chelemal-D and K.R. Rao, “Fast computational algorithms for the discrete cosine transform,” presented at the 9th Annu. Asilomar Conf. Circuit, Syst., Comput., Pacific Grove, CA, Nov. 1985.
5. R.M. Haralick, “A storage efficient way to implement the discrete cosine transform,” IEEE Trans. Comput., vol. C-25, pp. 764–765, July 1976.
6. B.D. Tseng and W.C. Miller, “On computing the discrete cosine transform,” IEEE Trans. Comput., vol. C-27, pp. 966–968, Oct. 1978.
7. M.J. Narashimha and A.M. Peterson, “On the computation of the discrete cosine transform,” IEEE Trans. Commun., vol. COM-26, pp. 934–936, June 1978.
8. M. Vetterli and H. Nussbaumer, “Simple FFT and DCT algorithms with reduced number of operations,” Signal Processing, vol. 6, no. 4, pp. 267–278, Aug. 1984.
9. H.S. Hou, “The fast Hartley transform algorithm,” IEEE Trans. Comput., vol. C-36, pp. 147–156, Feb. 1987.
10. D. Hein and N. Ahmed, “On a real-time Walsh-Hadamard cosine transform image processor,” IEEE Trans. Electromagn. Compat., vol. EMC-20, pp. 453–457, Aug. 1978.
11. H.W. Jones, D.N. Hein, and S.C. Knauer, “The Karhunen-Loève, discrete cosine and related transforms via the Hadamard transform,” in Proc. Int. Telemeter. Conf., Los Angeles, CA, Nov. 14-16, 1978, pp. 87–98.
12. 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,.pp. 1004–1008, Sept. 1977.
13. Z. Wang, “Fast algorithms for the discrete W transform and for the discrete Fourier transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 803–816, Aug. 1984.
14. B.G. Lee, “A new algorithm to compute the discrete cosine transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-32, pp. 1243–1245, Dec. 1984.
15. M. Ghanbari and D.E. Pearson, “Fast cosine transform implementation for television signals,” IEE Proc-F, vol. 129, no. 1, pp. 59–68, Feb. 1982.
16. N. Suehiro and M, Hatori, “Fast algorithms for the DFT and other sinusoidal transforms,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-34, pp. 642–644, June 1986.
17. L.R. Rabiner and B. Gold, Theory and Applications of Digital Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1975, pp. 368–369.
18. B.G. Kashef and A. Habibi, “Direct computation of higher-order DCT coefficients from lower-order DCT coefficients,” presented at the SPIE 28th Annu. Int. Tech. Symp., San Diego, CA, Aug. 19–24, 1984.
19. M.A. Haque, “A two-dimensional fast cosine transform,” IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-33, pp. 1532–1539, Dec. 1985.
20. A.K. Jain, “A sinusoidal family of unitary transforms,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-1, pp. 356–365, Oct. 1969.