By Topic

Direct formulation for the realization of discrete cosine transform using recursive structure

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

2 Author(s)
Lap-Pui Chau ; Dept. of Electron. Eng., Hong Kong Polytech. Univ., Hung Hom, Hong Kong ; Wan-Chi Siu,

Effective formulations for the conversion of the Discrete Fourier Transform (DFT) into recursive structure are available and have been found very effective for realization using software, hardware, and VLSI techniques. Little research work has been reported on an effective way to convert the Discrete Cosine Transform (DCT) into recursive form and the related realization. In this paper, we propose a new method to convert a prime length DCT into a recursive structure. A trivial approach is to use a conventional approach to convert the DCT into DFT and to apply Goertzel's algorithm for the rest of the realization. However, this method is inefficient and requires the realization of long length DFT's. In our approach, we suggest using some suitable mappings to convert a prime length DCT into two suitable transforms with approximately half of the original length to effect fast realization. The number of operations is greatly reduced and the structure is extremely regular

Published in:

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on  (Volume:42 ,  Issue: 1 )