Efficient formulation for the realization of Discrete Cosine Transform using recursive structure

Effective formulations for the conversion of the Discrete Fourier Transform (DFT) into recursive structure are available and have been found very effective for the realization using software, hardware and VLSI techniques. Little research work has been reported on the effective way to convert the Discrete Cosine Transform (DCT) into recursive form and the related realization. In this paper, we propose a new method to convert a prime length DCT into a recursive structure. A trivial approach is to convert the DCT into DFT and to apply Goertzel's algorithm for the rest of the realization. However, this method is inefficient. In our approach, we convert a prime length DCT into suitable transforms with half of the original length to effect fast realization. The number of operations is greatly reduced and the structure is extremely regular.