Ramanujan sums and discrete Fourier transforms
Authors:
- 21 March 2005
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 12 (4) , 293-296
Abstract
A special class of even-symmetric periodic signals is introduced. The most distinctive feature of these signals is that their real-valued Fourier coefficients can be calculated by forming a weighted average of the signal values using integer-valued coefficients. The signals arise from number-theoretic concepts concerning a class of functions called even arithmetical functions. The integer-valued weighting coefficients, being sums of complex roots of unity, are the Ramanujan sums and may be computed recursively or through closed-form arithmetical relations. The recursive method of computation is based on the cyclotomic polynomials and is described in detail. If the signal values are integers, the computation of the discrete Fourier transform (DFT) coefficients of this class of signals can be performed in an exact quantization-error-free manner by performing arithmetical operations on integers. The theoretical development is supplemented by concrete examples.Keywords
This publication has 6 references indexed in Scilit:
- Ramanujan sums for signal processing of low-frequency noisePhysical Review E, 2002
- Symmetric FFTsMathematics of Computation, 1986
- A fast Fourier transform algorithm for symmetric real-valued seriesIEEE Transactions on Audio and Electroacoustics, 1972
- The finite Fourier transformIEEE Transactions on Audio and Electroacoustics, 1969
- Representations of even functions (mod r), Arithmetical identitiesDuke Mathematical Journal, 1958
- A CLASS OF ARITHMETICAL FUNCTIONSProceedings of the National Academy of Sciences, 1955