Algorithm for p/sup m/-length discrete cosine transform
A novel algorithm is introduced that makes it possible to realize a discrete cosine transform (DCT) by correlations. A p/sup 2/-length DCT can be realized through four (p-1)/2-length and two (p-1)p/2-length cyclic correlations with a cost of N-1 multiplications. This formulation is potentially useful for the realization of the DCT using VLSI techniques, especially if the distributed arithmetic technique is used.<<ETX>>