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

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications Vol. 28; no. 2; pp. 304 - 307
Main Authors: Yip, P., Rao, K.
Format: Journal Article
Language:English
Published: IEEE 01.02.1980
Subjects:
Bit error rate
Computational modeling
Convolutional codes
Decoding
Discrete transforms
Equations
Error analysis
Power generation
Statistics
Viterbi algorithm
ISSN:0090-6778
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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