论文信息 - A Fast Computational Algorithm for the Discrete Sine Transform

A Fast Computational Algorithm for the Discrete Sine Transform

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).

K. R. Rao | P. Yip

[1] G. G. Murray. Microprocessor System For TV Imagery Compression , 1977, Optics & Photonics.

[2] A. Jain,et al. A Fast Karhunen-Loeve Transform for a Class of Random Processes , 1976, IEEE Trans. Commun..

[3] P. Camana. Image processing: Video-bandwidth compression: A study in tradeoffs: In this fledgling field, designers are matching criteria to applications and developing `first-cut¿ hardware , 1979 .

[4] Guner S. Robinson,et al. A survey ol digital picture coding , 1974, Computer.

[5] M. S. Corrington. Implementation of fast cosine transforms using real arithmetic , 1978 .

[6] Wen-Hsiung Chen,et al. A Fast Computational Algorithm for the Discrete Cosine Transform , 1977, IEEE Trans. Commun..

[7] J. Roese,et al. Interframe Cosine Transform Image Coding , 1977, IEEE Trans. Commun..