The multiplicative complexity of discrete cosine transforms (Q1802353): Difference between revisions

Multiplicative complexity of the discrete cosine transforms is evaluated in relation to that of the discrete Fourier transforms. The complexity measure is defined here to be the minimum number of non-rational multiplications required to compute jointly the real and imaginary outputs of the product of an arbitrary real vector by a complex matrix.