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
fDate :
7/1/1992 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
