Fast Discrete Cosine Transform Pruning

IEEE Transactions on Signal Processing

Volumn 42, Issue 7, 1994, Pages 1833-1837

  Skodras, Athanassios N ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA COMPRESSION; FREQUENCY DOMAIN ANALYSIS; IMAGE PROCESSING; MATHEMATICAL TRANSFORMATIONS; SIGNAL ENCODING; SIGNAL FILTERING AND PREDICTION; SPEECH PROCESSING;

FAST DISCRETE COSINE TRANSFORMATIONS; PRUNING;

SIGNAL PROCESSING;

EID: 0028466911     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/78.298293     Document Type: Article

References (9)

1. N. Ahmed, T. Natarajan, and K. R. Rao, “Discrete cosine transform,” IEEE Trans. Comput., vol. C-23, pp. 90–93, Jan. 1974.
2. K. R. Rao and P. Yip, Discrete Cosine Transform: Algorithms, Advantages, Applications. new York: Academic, 1990.
3. F. Arguello and E. L. Zapata, “Fast cosine transform based on successive doubling method,” Electron. Letters, vol. 26, no. 19, pp. 1616–1618, Sept. 1990.
4. S. C. Chan and K. L. Ho, “A new two-dimensional fast cosine transform algorithm,” IEEE Trans. Signal Processing, vol. 39, no. 2, pp. 481—485, Feb. 1991.
5. J. D. Markel, “FFT pruning,” IEEE Trans. Audio Electroacoust., vol. AU-19, no. 4, pp. 305–311, Dec. 1971.
6. 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.
7. H. V. Sorensen, C. S. Burrus, and D. L. Jones, “A new efficient algorithm for computing a few DFT points,” in Proc. ISCAS'88, 1988, pp. 1915–1918.
8. Z. Wang, “Pruning the fast discrete cosine transform,” IEEE Trans. Commun., vol. 39, no. 5, pp. 640–643, May 1991.
9. A. N. Skodras and A. G. Constantinides, “Efficient input-reordering algorithms for fast DCT,” Electron. Lett., vol. 27, no. 21, pp. 1973–1975, Oct. 1991.