Recursive fast computation of the two-dimensional discrete cosine transform

IEE Proceedings: Vision, Image and Signal Processing

Volumn 146, Issue 1, 1999, Pages 25-32

  Fang, W H ^a   Hu, N C ^a   Shih, S K ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CORRELATION METHODS; COSINE TRANSFORMS; MATRIX ALGEBRA; VECTORS;

DISCRETE COSINE TRANSFORM (DCT);

SIGNAL PROCESSING;

EID: 0032676582     PISSN: 1350245X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1049/ip-vis:19990021     Document Type: Article

References (16)

1. RAO, K.R., and YIP, R.: 'Discrete cosine transform' (Academic Press, San Diego, CA, 1990)
2. CHO, N.I., and LEE, S.U.: 'Fast algorithm and implementation of 2-D discrete cosine transform', IEEE Trans. Circuits Syst., 1991, 38, (3), pp. 297-305
3. DUHAMEL, P., and GUILLEMOT, C.: 'Polynomial transform computation of the 2-D DCT'. Proceedings of IEEE international conference on Acoust., speech, signal processing, ICASSP'90, Albuquerqe, NM, April 1990, pp. 1515-1518
4. DUHAMEL, P., and GUILLEMOT, C.: 'A polynomial-transform based computation of the 2-D DCT with minimum multiplicative complexity'. Proceedings of IEEE international conference on Acoust., speech, signal processing, ICASSP'96, Atlanta, GA, May 1996, pp. 1347-1350
5. WU, H.R., and PAOLOUI, F.J.: 'A two-dimensional fast cosine transform algorithm based on Hou's approach', IEEE Trans. Signal Process., 1991, 39, (2), pp. 544-546
6. HOU, H.S.: 'A fast recursive algorithm for computing the discrete cosine transform', IEEE Trans. Acoust. Speech: Signal Process., 1987, 35, (10), pp. 1455-1461
7. KUNG, S.S., and LEE, M.H.: 'An expanded 2-D DCT algorithm based on convolution', IEEE Trans. Consum. Electron., 1993, 39, (3), pp. 159-165.
8. HU, N.-C., and LU, F.-F.: 'Fast computation of the two-dimensional generalized Hartley transforms', IEE Proc. Vis. Image Signal Process., 1995, 142, (1), pp. 35-39
9. GERTNER, I.: 'A new efficient algorithm to compute the two-dimensional discrete Fourier transform', IEEE Trans. Acoust. Speech Signal Process., 1988, 36, (7), pp. 1036-1050
10. HU, N.-C., and LIN, K.-C.: 'Skew-circular/circular correlation decomposition of prime-factor DCT', IEE Proc. Vis. Image Signal Process., 1995, 142, (4), pp. 241-246
11. HU, N.-C, and LOUH, S.-W.: Two-stage decomposition of the DCT', IEE Proc. Vis. Image Signal Process., 1995, 142, (5), pp. 319-326
12. MCCLELLAN, J.H., and RADER, C.M.: 'Number theory in digital signal processing' (Prentice-Hall, Englewood Cliffs, NJ, 1979)
13. HEIDEMAN, M.T.: 'Computation of an odd-length DCT from a real-valued DFT of the same length', IEEE Trans. Signal Process., 1992, 40, (1), pp. 54-61
14. NUSSBAUMER, H.H.: 'Fast Fourier transform and convolution algorithms' (Springer-Verlag, New York, 1982)
15. MALVER, H.S.: 'Signal processing with lapped transforms' (Artech House, Norwood, MA, 1992)
16. CHO, N.I., and LEE, S.U.: 'A fast 4×4 algorithm for the recursive 2-D DCT', IEEE Trans. Signal Process.. 1992, 40, (9), pp. 2166-2173