Title :
A fast recursive algorithm for the discrete sine transform
Author :
Gupta, A. ; Rao, K. Raghava
Author_Institution :
Dept. of Electr. Eng., Texas Univ., Arlington, TX, USA
fDate :
3/1/1990 12:00:00 AM
Abstract :
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
Keywords :
VLSI; fast Fourier transforms; matrix algebra; signal processing; Cooley-Tukey FFT; VLSI implementation; adders; algorithm generalization; discrete sine transform; fast Fourier transform; fast recursive algorithm; multipliers; signal processing; Data compression; Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Fourier transforms; Image coding; Image reconstruction; Karhunen-Loeve transforms; Random processes; Sparse matrices;
Journal_Title :
Acoustics, Speech and Signal Processing, IEEE Transactions on
