By Topic

Fast algorithm and implementation of 2-D discrete cosine transform

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
$33 $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)
Nam Ik Cho ; Dept. of Control & Instrum. Eng., Seoul Nat. Univ., South Korea ; San Uk Lee

An algorithm for the fast computation of a 2-D discrete cosine transform (DCT) is presented. It is shown that the N×N DCT, where N=2m, can be computed using only N 1-D DCTs and additions, instead of using 2N 1-D DCTs as in the conventional row-column approach. Hence the total number of multiplications for the proposed algorithm is only half of that required for the row-column approach and is also less than that of most of other fast algorithms, whereas the number of additions is almost comparable to that of others. It is also shown that only N /2 1-D DCT module are required for hardware parallel implementation of the proposed algorithm. Thus the number of actual multipliers being used is only a quarter of that required for the conventional approach

Published in:

IEEE Transactions on Circuits and Systems  (Volume:38 ,  Issue: 3 )