By Topic

A refined fast 2-D discrete cosine transform algorithm with regular butterfly 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

3 Author(s)
Yuh-Ming Huang ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ., Taipei, Taiwan ; Ja-Ling Wu, ; Chiou-Ting Hsu

A fast computation algorithm for the two-dimensional discrete cosine transform (2-D DCT) is derived based on index permutation. As a result, only the computation of N N-point 1-D DCTs and some post-additions are required for the computation of an (N×N)-point 2-D DCT. Furthermore, as compared with the method of Cho and Lee (1992), the derivation of the refined algorithm is more succinct, and the associated post-addition stage possesses a more regular butterfly structure. The regular structure of the proposed algorithm makes it more suitable for VLSI and parallel implementations

Published in:

Consumer Electronics, IEEE Transactions on  (Volume:44 ,  Issue: 2 )