On the multiplicative complexity of discrete cosine transforms

Authors:
E. Feig;S. Winograd
Affiliations:
IBM T.J. Watson Res. Center, Yorktown Heights, NY;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 4

A fast algorithm for the computation of 2-D forward and inverse MDCT

Signal Processing
Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

Signal Processing
Improvement of the Discrete Cosine Transform calculation by means of a recursive method

Mathematical and Computer Modelling: An International Journal
Design optimization of the quantization and a pipelined 2D-DCT for real-time applications

Multimedia Tools and Applications

Quantified Score

Hi-index	754.84

Visualization

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