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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications Jg. 28; H. 2; S. 304 - 307
Hauptverfasser: Yip, P., Rao, K.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.02.1980
Schlagworte:
Bit error rate
Computational modeling
Convolutional codes
Decoding
Discrete transforms
Equations
Error analysis
Power generation
Statistics
Viterbi algorithm
ISSN:0090-6778
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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