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ženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on communications Ročník 28; číslo 2; s. 304 - 307
Hlavní autoři: Yip, P., Rao, K.
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.02.1980
Témata:
Bit error rate
Computational modeling
Convolutional codes
Decoding
Discrete transforms
Equations
Error analysis
Power generation
Statistics
Viterbi algorithm
ISSN:0090-6778
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
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