Share Email Print

Proceedings Paper

Fast regular 2D algorithms for trigonometric transforms
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

2D fast cosine and sine transforms with regular structure are developed for 2n X 2n data points. These algorithms are extended versions of the 1D fast regular algorithms introduced in our recent paper. The rationale for these 2D algorithms for sine/cosine transforms in a 2D decomposition of data sequences into 2D subblocks with reduced dimension, rather than 1D, separable treatments for the columns and rows of the data sets. As a result the number of multiplications is 25 percent less than in row- column approach. Numerous algorithms of these type were proposed previously for discrete Fourier transform (DFT) and discrete cosine transform of type 2 (DCT-II). In DCT-II case the algorithms do not have a regular structure as is the case in DFT algorithms and motivation of this work is to derive 2D algorithms for discrete sine and cosine transforms with regular constant geometry structures. Extension to 2n X 2m data points is straightforward.

Paper Details

Date Published: 10 January 1997
PDF: 12 pages
Proc. SPIE 3024, Visual Communications and Image Processing '97, (10 January 1997); doi: 10.1117/12.263300
Show Author Affiliations
Jaakko T. Astola, Tampere Univ. of Technology (Finland)
David Akopian, Tampere Univ. of Technology (Finland)

Published in SPIE Proceedings Vol. 3024:
Visual Communications and Image Processing '97
Jan Biemond; Edward J. Delp, Editor(s)

© SPIE. Terms of Use
Back to Top