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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on communications Ročník 28; číslo 2; s. 304 - 307
Hlavní autori: Yip, P., Rao, K.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 01.02.1980
Predmet:
Bit error rate
Computational modeling
Convolutional codes
Decoding
Discrete transforms
Equations
Error analysis
Power generation
Statistics
Viterbi algorithm
ISSN:0090-6778
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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).
ISSN:0090-6778
DOI:10.1109/TCOM.1980.1094656