A fast recursive algorithm for the discrete sine transform
Aditi Gupta, K.R. Rao · IEEE Transactions on Acoustics Speech and Signal Processing · 1990
A fast recursive algorithm for the discrete sine transform (DST) is developed. An N-point DST can be generated from two identical N/2-point DSTs. Besides being recursive, this algorithm requires fewer multipliers and adders than other DST algorithms. It can be considered as a generalization of the Cooley-Tukey FFT (fast Fourier transform) algorithm. The structure of the algorithm is suitable for VLSI implementation.>