We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

A progressive, recursive, fast, 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

1 Author(s)
Costa, M.H.M. ; Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA

A new algorithm to calculate the discrete cosine transform (DCT) and its inverse is described. The algorithm is recursive in that it breaks the DCT transformation of an array of size N into two DCTs of size N/2. The proposed recursive algorithm has the ability to gradually reconstruct the original data from its DCT array, with progressively higher levels of resolution. In regard to speed, it requires O(N logN) operations, where N is the array size, but it is not the fastest algorithm if only the full resolution reconstruction is desired. The algorithm can be extended to multidimensional arrays in a straightforward way

Published in:

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Date of Conference:

27 Jun-1 Jul 1994