Architecture-oriented regular algorithms for discrete sine and cosine transforms

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.