DocumentCode
786124
Title
Fast algorithms for the discrete cosine transform
Author
Feig, Ephraim ; Winograd, Shmuel
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Volume
40
Issue
9
fYear
1992
fDate
9/1/1992 12:00:00 AM
Firstpage
2174
Lastpage
2193
Abstract
Several fast algorithms for computing discrete cosine transforms (DCTs) and their inverses on multidimensional inputs of sizes which are powers of 2 are introduced. Because the 1-D 8-point DCT and the 2-D 8×8-point DCT are so widely used, they are discussed in detail. Algorithms for computing scaled DCTs and their inverses are also presented. These have applications in compression of continuous tone image data, where the DCT is generally followed by scaling and quantization
Keywords
inverse problems; parallel algorithms; transforms; 1D 8-point DCT; 2D 8×8-point DCT; compression; continuous tone image data; discrete cosine transform; fast algorithms; inverses; pipelined algorithms; scaled DCTs; Arithmetic; Books; Discrete cosine transforms; Equations; Image coding; Matrix converters; Multidimensional systems; Polynomials; Quantization; Tensile stress;
fLanguage
English
Journal_Title
Signal Processing, IEEE Transactions on
Publisher
ieee
ISSN
1053-587X
Type
jour
DOI
10.1109/78.157218
Filename
157218
Link To Document