Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

2D Discrete cosine transform computation by fast polynomial transform algorithms

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)
Pei, Soo-Chang ; National Taiwan University, Taiwan, Rep. of China ; Eng-Fong Huang

The 2D forward and inverse discrete cosine transforms (DCT) are mapped by polynomial transforms into several one-dimensional DFTs; This algorithm is more attractive for computing the "inverse" 2D DCT, it nicely eliminates N2premultiplications for the forward algorithm, and requires only N reduced real DFTs of size 2N; This inverse 2D DCT algorithm is 3 times faster than the forward one, more importantly it requires much less computation complexity than the most efficient recent algorithms.

Published in:

Acoustics, Speech, and Signal Processing, IEEE International Conference on ICASSP '84.  (Volume:9 )

Date of Conference:

Mar 1984