Fast algorithms for the discrete W transform and for the discrete Fourier transform

Zhongde Wang · IEEE Transactions on Acoustics Speech and Signal Processing · 1984

A systematic method of sparse matrix factorization is developed for all four versions of the discrete W transform, the discrete cosine transform, and the discrete sine transform, as well as for the discrete Fourier transform. The factorization leads to fast algorithms in which only real arithmetic is involved. A scheme for reducing multiplications and a convenient index system are introduced. This makes new algorithms more efficient than conventional algorithms for the discrete Fourier transform, the discrete cosine transform, and the discrete sine transform.

Read the paper · More papers on PaperTik