Implementation of the discrete cosine transform and its inverse by recursive structures

This paper discusses the recursive implementation of the discrete cosine transform (DCT) and its inverse (IDCT). The transform is constructed by using recursive filter structure to generate the transform kernel values. We first derive two trigonometric equations, which can be represented as the Chebyshev polynomial. Then we demonstrate that general length of the DCT and IDCT can be efficiently implemented by using the regressive structure derived from the recursive formulae. The computational complexity of each data throughput in these architectures is less than that in the conventional ones by as many as 50%. The proposed architectures are regular and suitable for parallel VLSI implementation