Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Architecture-oriented regular algorithms for discrete sine and cosine transforms

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Astola, J. ; Signal Process. Lab., Tampere Univ. of Technol., Finland ; Akopian, D.

We propose fast algorithms for a class of trigonometric transforms. These algorithms have a unified structure and simple data exchange similar to the constant geometry Pease (1968) algorithm derived from the Cooley-Tukey (1965) FFT. We can easily extend many of the parallel FFT approaches for these algorithms. The idea of the method is to localize the nonregularities peculiar to fast algorithms for other trigonometric transforms 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 the node functions can be the basis for parallel constructs

Published in:

Signal Processing, IEEE Transactions on  (Volume:47 ,  Issue: 4 )