By Topic

A fast algorithm suitable for DCT implementation with integer multiplication

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Yeonsik Jeong ; Dept. of Electron. Eng., Yonsei Univ., Seoul, South Korea ; Imgeun Lee ; Taekhyun Yun ; Gooman Park
more authors

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

Published in:

TENCON '96. Proceedings., 1996 IEEE TENCON. Digital Signal Processing Applications  (Volume:2 )

Date of Conference:

26-29 Nov 1996