Improved arithmetic Fourier transform algorithm
Paparao Palacharla, Anjan Kumar Ghosh · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1990
A new improved version of the arithmetic Fourier transform algorithm is presented. This algorithm computes the Fourier coefficients of continuous -time signals using the number-theoretic technique ofMobius inversion. The major advantage of this algorithm is that it needs mostly addition operations, except for a few real multiplications. The improved version can be realized efficiently on integrated circuit chips and optical parallel processors using tapped delay lines.