On arithmetic Cosine transform algorithm

A new Fourier technique for digital signal processing by use of the number-theoretic method of the Mobius inversion of series called Arithmetic Fourier Transform (AFT) was developed recently. This approach only needs o(N) multiplications and is quite suitable for VLSI implementation. ln this paper, it is noted that tile computation of Discret Cosine Transform (DCT) by using this approach called Arithmetic Cosine Transform (ACT) Is quite simple. The number of multiplications needed is N, and the architecture of the computation is rather simple. Finally, a computer simulation is given.