A fast recursive pruned DCT for image compression applications

Author

El-Sharkawy, Mohamed ; Eshmawy, Waleed

Author_Institution

Dept. of Electr. Eng., Purdue Univ., Indianapolis, IN, USA

Volume

2

fYear

1994

fDate

3-5 Aug 1994

Firstpage

887

Abstract

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 utilizes it to compress images using the JPEG algorithm. The proposed pruned DCT algorithm improves the compression ratio and reduces both the complexity and execution time of the modified JPEG algorithm

Keywords

data compression; discrete cosine transforms; image coding; JPEG algorithm; complexity; compression ratio improvement; execution time; fast recursive pruned DCT; image compression applications; recursive algorithm; Compression algorithms; Computational efficiency; Computer applications; Discrete cosine transforms; Equations; Hardware; Image coding; Multiplexing; Pipelines; Signal processing; Transform coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1994., Proceedings of the 37th Midwest Symposium on

Conference_Location

Lafayette, LA

Print_ISBN

0-7803-2428-5

Type

conf

DOI

10.1109/MWSCAS.1994.518955

Filename

518955