A Fast Recursive Pruned Discrete Cosine Transform

✍ Scribed by M. Elsharkawy; W. Eshmawy

• Publisher: Elsevier Science
• Year: 1995
• Tongue: English
• Weight: 379 KB
• Volume: 5
• Category: Article
• ISSN: 1051-2004
• DOI: 10.1006/dspr.1995.1014

✦ Synopsis

El-Sharkawy, M., and Eshmawy, W., A Fast Recursive Pruned Discrete Cosine Transform, Digital Signal Processing 5 (1995), 140-148.

This paper presents a recursive algorithm for computing the pruned DCT with a structure that allows the generation of the next higher-order pruned DCT from two identical lower order pruned DCTs. The implementation of the proposed algorithm does not require bit-reversal shuffling, coefficient inversions, or divisions. To illustrate the usefulness of the proposed recursive pruned DCT algorithm, we utilize it to compress images using the JPEG algorithm. The proposed pruned DCT algorithm improves the com pression ratio and reduces both the complexity and execution time of the modified JPEG algorithm. 1995 Academic Press, Inc.