DocumentCode
886157
Title
On the multiplicative complexity of discrete cosine transforms
Author
Feig, Ephraim ; Winograd, Shmuel
Author_Institution
IBM T.J. Watson Res. Center, Yorktown Heights, NY, USA
Volume
38
Issue
4
fYear
1992
fDate
7/1/1992 12:00:00 AM
Firstpage
1387
Lastpage
1391
Abstract
The multiplicative complexity of discrete cosine transforms (DCTs) of arbitrary dimensions on input sizes, which are powers of two, are obtained. New upper bounds on the multiplicative complexity of scaled DCTs on input sizes, which are powers of two, are also obtained
Keywords
computational complexity; transforms; DCT; discrete cosine transforms; multiplicative complexity; upper bounds; Algorithm design and analysis; Discrete cosine transforms; Discrete transforms; Image coding; Multidimensional signal processing; Multidimensional systems; Quantization; Signal processing algorithms; Tensile stress; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.144722
Filename
144722
Link To Document