Recursive algorithm for the discrete cosine transform with general lengths

Electronics Letters

Volumn 30, Issue 3, 1994, Pages 197-198

  Chau, L P ^a   Siu, W C ^a  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

Author keywords

Algorithm theory; Discrete cosine transforms

Indexed keywords

ALGORITHMS; MATHEMATICAL TRANSFORMATIONS; VLSI CIRCUITS;

DISCRETE COSINE TRANSFORM; RECURSIVE ALGORITHMS;

DIGITAL SIGNAL PROCESSING;

EID: 0028762544     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:19940182     Document Type: Article

References (8)

1. HOU, H.S.: ‘A fast recursive algorithm for computing the discrete cosine transform’, IEEE Trans., 1987, ASSP-35, pp. 1455–1461
2. FEIG, E., and WINOGRAD, S.: ‘Fast algorithms for prime length discrete cosine transforms’, IEEE Trans., 1992, SP-40, pp. 2174–2193
3. CHAN, Y.H., and SIU, W.C.; ‘Algorithm for prime length discrete cosine transforms’, Electron. Lett., 1990, 26, pp. 206–208
4. CHO, N.I., and LEE, S.U.: ‘A fast 4×4 algorithm for the recursive 2-D DCT', IEEE Trans., 1992, SP-40, pp. 2166–2172
5. m. IEEE Asian Electronics Conf., 1987, pp. 71–76
6. LEE, B.G.; ‘Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform’, IEEE Trans., 1989, ASSP-37, pp. 237–244
7. GOERTZEL, G.: ‘An algorithm for the evaluation of finite trigonometric series’, Amer. Math Monthly, 1958, 65, pp. 34–35
8. CANARIS, J.: ‘A VLSI architecture for the real time computation of discrete trigonometric transforms’, J. VLSI Signal Process., 1993,5, pp. 95–104