On arithmetic cosine transform algorithm
Qian Huisheng, Li Ping, Feng Zhou · 2002
A new Fourier technique for digital signal processing by use of the number-theoretic method of the Mobius inversion of series called the arithmetic Fourier transform (AFT) was developed previously. This approach only needs O(N) multiplications and is quite suitable for VLSI implementation. It is noted that the computation of the discret cosine transform (DCT) by using this approach called the 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.