Share Email Print

Proceedings Paper

Architecture-oriented regular algorithms for discrete sine and cosine transforms
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We propose for a class of trigonometric transforms fast algorithms with a unified structure and a simple data exchange similar to constant geometry isomorphic to the Cooley-Tukey FFT algorithm. One can easily extend many of the parallel FFT approaches for these algorithms. The idea of the method is to localize the nonregularities into the nodes of the Cooley-Tukey FFT type computational graph. Only the basic operation in the nodes of the computational graph will be different for different transforms. Thus a simple programmable processor element for executing of node function can be the basis for parallel constructs.

Paper Details

Date Published: 13 March 1996
PDF: 12 pages
Proc. SPIE 2666, Image and Video Processing IV, (13 March 1996); doi: 10.1117/12.234740
Show Author Affiliations
Jaakko T. Astola, Tampere Univ. of Technology (Finland)
David Akopian, Tampere Univ. of Technology (Finland)

Published in SPIE Proceedings Vol. 2666:
Image and Video Processing IV
Robert L. Stevenson; M. Ibrahim Sezan, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?