Recursive Algorithms for the Forward and Inverse Discrete Cosine Transform with Arbitrary Length

IEEE Signal Processing Letters

Volumn 1, Issue 7, 1994, Pages 101-102

  Jullien, G A ^a   Miller, W C ^a  

^a UNIVERSITY OF WINDSOR   (Canada)

^b BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

CHEBYSHEV APPROXIMATION; DIGITAL FILTERS; IMAGE PROCESSING; INVERSE PROBLEMS; MATHEMATICAL TRANSFORMATIONS; POLYNOMIALS; RECURSIVE FUNCTIONS;

CHEBYSHEV POLYNOMIALS; FORWARD DISCRETE COSINE TRANSFORM; INVERSE DISCRETE COSINE TRANSFORM; RECURSIVE ALGORITHMS;

ALGORITHMS;

EID: 0028464540     PISSN: 10709908     EISSN: 15582361     Source Type: Journal    
DOI: 10.1109/97.311803     Document Type: Article

References (4)

1. K. R. Rao and P. Yip, Discrete Cosine Transform. New York: Academic 1990.
2. L.-P. Chau and W.-C. Siu. “Recursive algorithm for the discrete cosine transform with Elect. Lett., vol. 30, 197–198, 1994.
3. J. Canaris, “A VLSI architecture for the real time computation of discrete trigomometric transforms,” J. VLSI Signal Processing, vol. 5, pp. 95–104, 1993.
4. Z. Wang, “Two new kinds of the Chebyshev polynomials,” J. Beijing Univ. Posts Telecommun., vol. 12, no. 2, pp. 46–54, 1989.