A fast algorithm suitable for DCT implementation with integer multiplication

Author

Jeong, Yeonsik ; Lee, Imgeun ; Yun, Taekhyun ; Park, Gooman ; Park, Kyu Tae

Author_Institution

Dept. of Electron. Eng., Yonsei Univ., Seoul, South Korea

Volume

2

fYear

1996

fDate

26-29 Nov 1996

Firstpage

784

Abstract

The discrete cosine transform (DCT) has wide applications in speech and image data compression. We propose a novel fast DCT algorithm. The proposed algorithm is based on the symmetric property of the DCT kernel matrix. This decomposes an N-point DCT into an N/2-point DCT and can be iterated further. Because it has fewer multiplication steps, when converting the algorithm into hardware implementation with integer computation, we can reduce the error

Keywords

data compression; digital arithmetic; discrete cosine transforms; image coding; matrix multiplication; transform coding; DCT implementation; DCT kernel matrix; discrete cosine transform; error reduction; fast DCT algorithm; hardware implementation; image data compression; integer multiplication; speech data compression; symmetric property; Computed tomography; Data compression; Decorrelation; Discrete cosine transforms; Hardware; Karhunen-Loeve transforms; Kernel; Matrix converters; Signal processing algorithms; Speech;

fLanguage

English

Publisher

ieee

Conference_Titel

TENCON '96. Proceedings., 1996 IEEE TENCON. Digital Signal Processing Applications

Conference_Location

Perth, WA

Print_ISBN

0-7803-3679-8

Type

conf

DOI

10.1109/TENCON.1996.608445

Filename

608445