Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

On the computation of two-dimensional DCT

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

4 Author(s)
Guoan Bi ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore ; Gang Li ; Kai-Kuang Ma ; Tan, T.C.

A new fast algorithm for the type-II two-dimensional (2-D) discrete cosine transform (DCT) is presented. It shows that the 2-D DCT can be decomposed into cosine-cosine, cosine-sine, sine-cosine, and sine-sine sequences that can be further decomposed into a number of similar sequences. Compared with other reported algorithms, the proposed one achieves savings on the number of arithmetic operations and has a recursive computational structure that leads to a simplification of the input/output indexing process. Furthermore, the new algorithm supports transform sizes (p1*2m1)×(p2*2 m2), where p1 and p2 are arbitrarily odd integers, which provides a wider range of choices on transform sizes for various applications

Published in:

Signal Processing, IEEE Transactions on  (Volume:48 ,  Issue: 4 )