Architecture-oriented regular algorithms for discrete sine and cosine transforms

Jaakko T. Astola; David Akopian

doi:10.1117/12.234740

13 March 1996 Architecture-oriented regular algorithms for discrete sine and cosine transforms

Jaakko T. Astola, David Akopian

Proceedings Volume 2666, Image and Video Processing IV; (1996) https://doi.org/10.1117/12.234740
Event: Electronic Imaging: Science and Technology, 1996, San Jose, CA, United States

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.

Citation Download Citation

Jaakko T. Astola and David Akopian "Architecture-oriented regular algorithms for discrete sine and cosine transforms", Proc. SPIE 2666, Image and Video Processing IV, (13 March 1996); https://doi.org/10.1117/12.234740

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available