Title :
A generalized Mobius transform and arithmetic Fourier transforms
Author_Institution :
Dept. of Inf. Technol.-INTEC, Gent, Belgium
fDate :
11/1/1994 12:00:00 AM
Abstract :
A general approach to arithmetic Fourier transforms (AFT) is developed. The implementation is based on the concept of killer polynomials and the solution of an arithmetic deconvolution problem pertaining to a generalized Mobius transform. This results in an extension of the Bruns (1903) procedure, valid for all prime numbers, and in an AFT that extracts directly the sine coefficients from the Fourier series
Keywords :
Fourier transforms; arithmetic; polynomials; signal processing; Bruns procedure; Fourier series; arithmetic Fourier transforms; arithmetic deconvolution problem; generalized Mobius transform; killer polynomials; periodic function; prime numbers; signal processing; sine coefficients; Arithmetic; Convergence; Deconvolution; Equations; Fourier series; Fourier transforms; Helium; Polynomials;
Journal_Title :
Signal Processing, IEEE Transactions on
