On the multiplicative complexity of discrete cosine transforms
Ephraim Feig, Shmuel Winograd · IEEE Transactions on Information Theory · 1992
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.>