ON THE COMPUTATION OF THE PRIME FACTOR DST

In this paper a new algorithm based on prime factor decomposition for computing the discrete sine transform (DST) is presented. The proposed 1-D N-point DST algorithm is indirectly computed by using the DFT. Th e DST of odd length can be implemented on the existing VLSI architectu res of the DFT, while the DST of even length can be implemented on sli ghtly modified DFT architectures. A comparison of the algorithm with o ther fast ones points out its computational efficiency, which is mainl y based on the advantages of the prime factor decomposition and the pr oper choice of the index mappings.