Translator Disclaimer
13 March 1996 Architecture-oriented regular algorithms for discrete sine and cosine transforms
Author Affiliations +
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.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
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
PROCEEDINGS
12 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top