Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

An algorithm for a fast two-dimensional 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
$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)
Grissom, E.A. ; Intergraph Corp., Huntsville, AL, USA ; Rajan, P.K.

The authors present an algorithm for the implementation of the two-dimensional discrete cosine transform (DCT) for 2n×2n data points. This algorithm is based on a recently published fast one-dimensional DCT algorithm. The new algorithm is recursive, fast, and numerically stable. The two-dimensional decomposition in this new algorithm is based on the vector-radix approach. In this approach, the data matrix is partitioned into four subblocks, each of which, after some processing is transformed by a lower order DCT. The results from the lower order transforms are then combined to form the desired two-dimensional DCT. The overall complexity of the new transform is compared in terms of the number of multiplications and additions required to perform the two-dimensional DCT with those of a row/column implementation using the fast one-dimensional transform

Published in:

System Theory, 1990., Twenty-Second Southeastern Symposium on

Date of Conference:

11-13 Mar 1990