Title :
Pruning the fast discrete cosine transform
Author_Institution :
Dept. of Electr. Telecommun., Bejiing Univ. of Posts & Telecommun., China
fDate :
5/1/1991 12:00:00 AM
Abstract :
The matrix representation of the simple structured algorithm for the discrete cosine transform (DCT), which was first introduced by Y. Morikawa et al. (1985) based on the successive order reduction of the Tchebycheff polynomial, and retrieved by a simpler approach by Z. Wang (1988), is reviewed. A fast pruning algorithm for the DCT is then developed
Keywords :
transforms; DCT; Tchebycheff polynomial; fast discrete cosine transform; fast pruning algorithm; matrix representation; structured algorithm; successive order reduction; Communications Society; Computer applications; Discrete cosine transforms; Helium; Image coding; Polynomials; Quantization; Roundoff errors; Signal processing algorithms; Telecommunication computing;
Journal_Title :
Communications, IEEE Transactions on
