A GENERALIZED MOBIUS TRANSFORM AND ARITHMETIC FOURIER-TRANSFORMS

A general approach to arithmetic Fourier transforms is developed. The implementation is based on the concept of killer polynomials and the s olution of an arithmetic deconvolution problem pertaining to a general ized Mobius transform. This results in an extension of the Bruns proce dure, valid for all prime numbers, and in an AFT that extracts directl y the sine coefficients from the Fourier series.