Fast discrete sine transform algorithms
- 1 February 1990
- journal article
- Published by Elsevier in Signal Processing
- Vol. 19 (2) , 91-102
- https://doi.org/10.1016/0165-1684(90)90033-u
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Comments on “on the computation and the effectiveness of discrete sine transform”Computers and Electrical Engineering, 1986
- Comments on "A Fast Computational Algorithm for the Discrete Sine Transform"IEEE Transactions on Communications, 1986
- On computing the discrete Fourier and cosine transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
- The discreteW transformApplied Mathematics and Computation, 1985
- Fast decimation-in-time algorithms for a family of discrete sine and cosine transformsCircuits, Systems, and Signal Processing, 1984
- Simple FFT and DCT algorithms with reduced number of operationsSignal Processing, 1984
- Fast algorithms for the discrete W transform and for the discrete Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1984
- A fast algorithm for the discrete sine transform implemented by the fast cosine transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1982
- A Fast Computational Algorithm for the Discrete Sine TransformIEEE Transactions on Communications, 1980
- A Fast Karhunen-Loeve Transform for a Class of Random ProcessesIEEE Transactions on Communications, 1976