DocumentCode :
751825
Title :
A Fast Computational Algorithm for the Discrete Cosine Transform
Author :
Chen, Wen-Hsiung ; Smith, C. Harrison ; Fralick, S.C.
Author_Institution :
Compression Labs., Inc., Campbell, CA, USA
Volume :
25
Issue :
9
fYear :
1977
fDate :
9/1/1977 12:00:00 AM
Firstpage :
1004
Lastpage :
1009
Abstract :
A Fast Discrete Cosine Transform algorithm has been developed which provides a factor of six improvement in computational complexity when compared to conventional Discrete Cosine Transform algorithms using the Fast Fourier Transform. The algorithm is derived in the form of matrices and illustrated by a signal-flow graph, which may be readily translated to hardware or software implementations.
Keywords :
Transforms; Computational complexity; Discrete Fourier transforms; Discrete cosine transforms; Discrete transforms; Equations; Fast Fourier transforms; Hardware; Laboratories; Matrix decomposition; Software algorithms;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOM.1977.1093941
Filename :
1093941
Link To Document :
بازگشت