Share Email Print

Proceedings Paper

A Fast Recursive Two Dimensional Cosine Transform
Author(s): Chingwo Ma
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper presents a recursive, radix two by two, fast algorithm for computing the two dimensional discrete cosine transform (2D-DCT). The algorithm allows the generation of the next higher order 2D-DCT from four identical lower order 2D-DCT's with the structure being similar to the two dimensional fast Fourier transform (2D-FFT). As a result, the method for implementing this recursive 2D-DCT requires fewer multipliers and adders than other 2D-DCT algorithms.

Paper Details

Date Published: 27 March 1989
PDF: 9 pages
Proc. SPIE 1002, Intelligent Robots and Computer Vision VII, (27 March 1989); doi: 10.1117/12.960315
Show Author Affiliations
Chingwo Ma, Pacific Bell (United States)

Published in SPIE Proceedings Vol. 1002:
Intelligent Robots and Computer Vision VII
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top