Recursive algorithm for the realization of the discrete cosine transform

Recursive algorithms have been found very effective for realization using software and VLSI techniques. Recently, some recursive algorithms have been proposed for the realization of the discrete cosine transform (DCT). In this paper, an efficient recursive algorithm for the computation of the DCT is proposed. By using some appropriate iterative techniques, the formulation of the arbitrary length forward DCT (FDCT) and inverse DCT (IDCT) can be effectively implemented by recursive equations, and the hardware complexity is further reduced as compared to approaches in the literature. The proposed algorithm is suitable for both software and VLSI implementations