A Fast Computational Algorithm for the Discrete Sine Transform
- 1 February 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 28 (2) , 304-307
- https://doi.org/10.1109/tcom.1980.1094656
Abstract
A sparse-matrix factorization is developed for the discrete sine transform (DST). This factorization has a recursive structure and leads directly to an efficient algorithm for implementing the DST, a feature most desirable and very similar ot that of the DCT. This algorithm requires fewer arithmetic operations compared to that for the discrete cosine transform (DCT).Keywords
This publication has 6 references indexed in Scilit:
- Video-bandwidth compression: a study in tradeoffsIEEE Spectrum, 1979
- Microprocessor System For TV Imagery CompressionPublished by SPIE-Intl Soc Optical Eng ,1977
- Interframe Cosine Transform Image CodingIEEE Transactions on Communications, 1977
- A Fast Computational Algorithm for the Discrete Cosine TransformIEEE Transactions on Communications, 1977
- A Fast Karhunen-Loeve Transform for a Class of Random ProcessesIEEE Transactions on Communications, 1976
- A survey ol digital picture codingComputer, 1974