On the theoretical lower bound of the multiplicative complexity for DCT
A discussion of discrete cosine transforms (DCT) algorithms based on convolutions is presented. It is shown that these approaches can provide effective solutions to realize DCTs. They provide a theoretical lower bound on the number of multiplications required for the realization of DCTs. Some fast short-length DCT algorithms are derived from these approaches.<<ETX>>