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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

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 )