Fast discrete cosine transform approximation for JPEG image compression
The discrete cosine transform (DCT) is widely applied in various fields including image data compression and was chosen as a basis of International JPEG (Joint Photographic Experts Group) Still Image Compression Standard. All known DCT implementations are sufficiently complicated, because the multiplication operations are making use of. This paper presents a new computational scheme for JPEG baseline system implementation in which the register shifts and additions are used only.
KeywordsDiscrete Cosine Transform Operator Composition Inverse Discrete Cosine Transform Joint Photographic Expert Group JPEG Standard
Unable to display preview. Download preview PDF.
- 1.V.F.Babkin: Method and apparatus for the realization of two-dimensional discrete cosine transform for an 8×8 image fragment. Patent is pending in the USA, Dec. 1991.Google Scholar
- 2.C.Loeffer, A.Ligtenberg, S.Moschytz: Practical fast 1-d DCT algorithm with 11 multiplications. Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing 3, D4-2, 988–991 (1989)Google Scholar
- 3.H.S.Hou: A fast recursive algorithm for computing the discrete cosine transform. IEEE Trans. Acoust., Speech, Signal Processing ASSP-35, no.10, 1455–1461 (1987)Google Scholar
- 4.M.Vetterli, A.Ligtenberg: A discrete Fourier — cosine transform chip. IEEE J. Selected Areas in Commun. SAC-4, no.1, 49–61 (1986)Google Scholar