The discrete Fourier transform of r-even functions
نویسندگان
چکیده
We give a detailed study of the discrete Fourier transform (DFT) of r-even arithmetic functions, which form a subspace of the space of r-periodic arithmetic functions. We consider the DFT of sequences of r-even functions, their mean values and Dirichlet series. Our results generalize properties of the Ramanujan sum. We show that some known properties of r-even functions and of the Ramanujan sum can be obtained in a simple manner via the DFT.
منابع مشابه
Discrete Ramanujan-Fourier Transform of Even Functions (mod $r$)
An arithmetical function f is said to be even (mod r) if f (n) = f ((n, r)) for all n ∈ Z + , where (n, r) is the greatest common divisor of n and r. We adopt a linear algebraic approach to show that the Discrete Fourier Transform of an even function (mod r) can be written in terms of Ramanujan's sum and may thus be referred to as the Discrete Ramanujan-Fourier Transform.
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملImageCompression Using Real Fourier Transform, Its Wavelet Transform And Hybrid Wavelet With DCT
This paper proposes new image compression technique that uses Real Fourier Transform. Discrete Fourier Transform (DFT) contains complex exponentials. It contains both cosine and sine functions. It gives complex values in the output of Fourier Transform. To avoid these complex values in the output, complex terms in Fourier Transform are eliminated. This can be done by using coefficients of Discr...
متن کاملExamples discussion 08
[08.3] Compute e−πx 2 ∗ e−πx2 and sinx x ∗ sinx x . (Be careful what you assert: sin x x is not in L (R).) Discussion: The idea is to invoke f ∗ g = (f̂ · ĝ)̂ for even functions f, g ∈ L, since for even functions the inverse Fourier transform is the same as the forward Fourier transform. Conveniently, Gaussians are in L ∩ L, and have Fourier transforms which are again Gaussians: ̂ e−πax(ξ) = 1 √ a...
متن کاملDetection of high impedance faults in distribution networks using Discrete Fourier Transform
In this paper, a new method for extracting dynamic properties for High Impedance Fault (HIF) detection using discrete Fourier transform (DFT) is proposed. Unlike conventional methods that use features extracted from data windows after fault to detect high impedance fault, in the proposed method, using the disturbance detection algorithm in the network, the normalized changes of the selected fea...
متن کامل