Novel formulation and realisation of discrete cosine transform using distributed arithmetic

A new algorithm is introduced such that one can convert an odd prime length, N, discrete cosine transform (DCT) into two (N-1)/2 length cyclic correlations. This formulation enables realization of the DCT by using distributed arithmetic and it also results in an extremely regular structure which is most suitable for VLSI realization. The proposed algorithm can be realized efficiently and easily by dedicated hardware or gate array technology. The structure of the hardware required is so simple that it involves only memory and adders. This can achieve a high performance DCT chip at a minimum cost and development time. An example is given to show the feasibility and the structural regularity of the algorithm