Multiplicative complexity of discrete cosine and sine transform
Weihong Ma · Electronics Letters · 1991
By use of the closure operation for an odd integer set, the minimal number of real multiplications needed to compute length-2m four-type discrete cosine and sine transforms over the field Q, of rational numbers has been demonstrated.