On the computation of the prime factor DST

Abstract 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. The DST of odd length can be implemented on the existing VLSI architectures of the DFT, while the DST of even length can be implemented on slightly modified DFT architectures. A comparison of the algorithm with other fast ones points out its computational efficiency, which is mainly based on the advantages of the prime factor decomposition and the proper choice of the index mappings.