A generalized output pruning algorithm for matrix-vector multiplication and its application to compute pruning discrete cosine transform

IEEE Transactions on Signal Processing

Volumn 48, Issue 2, 2000, Pages 561-563

  Huang, Yuh Ming ^a   Wu, Ja Ling ^b   Chang, Chi Lun ^b  

^a NATIONAL CHI NAN UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSINE TRANSFORMS; MATRIX ALGEBRA; VECTORS;

ORTHOGONAL DISCRETE TRANSFORM (ODT); PRUNING ALGORITHM;

SIGNAL PROCESSING;

EID: 0033908971     PISSN: 1053587X     EISSN: None     Source Type: Journal    
DOI: 10.1109/78.823984     Document Type: Article

References (7)

1. Z. Wang, "Pruning the fast discrete cosine transform," IEEE Trans. Commun., vol. 39, pp. 640-643, May 1991.
2. A. N. Skodras, "Fast discrete cosine transform pruning," IEEE Trans. Signal Processing, vol. 42, pp. 1833-1837, July 1994.
3. C. A. Christopoulos, J. Bormans, J. Cornells, and A. N. Skodras, "The vector-radix fast cosine transform: Pruning and complexity analysis," Signal Process., vol. 43, pp. 197-205, May 1998.
4. H. S. Hou, "A fast recursive algorithm for computing the discrete cosine transform," IEEE Trans. Acoust., Speech Signal Processing, vol. ASSP-35, pp. 1455-1461, Oct. 1987.
5. B. G. Lee, "A new algorithm to compute the discrete cosine transform," IEEE Trans. Acoust., Speech Signal Processing, vol. ASSP-32, pp. 1243-1245, 1984.
6. E. Feig and S. Winograd, "Fast algorithms for the discrete cosine transform," IEEE Trans. Signal Processing, vol. 40, pp. 2174-2193, Sept. 1992.
7. I. W. Selesnick and C. S. Burrus, "Automatic generation of prime length FFT programs," IEEE Trans. Signal Processing, vol. 44, pp. 14-24, Jan. 1996.