Convolution and Cross-correlation of Ramanujan-fourier Series
نویسنده
چکیده
where x̄ is the complex conjugate of x This paper uses the machinery of almost periodic functions to prove that even without uniform convergence the connection between a pair of almost periodic functions and the constants of the associated Fourier series exists for both the convolution and cross-correlation. The general results for two almost periodic functions are narrowed and applied to Ramanujan sums and finally applied to support the specific relation (1). The Wiener-Khinchin fomula, (1), connecting the auto-correlation of an arithmetic function and the coefficients of its Ramanujan Fourier series is a powerful link between the circle method and the sieve methods found in number theory. The application of this Weiner-Khinchin formula to number theory is described in the works of H. G. Gadiyar and R. Padma [4], [5], [6], [7]. The Wiener-Khinchin fomula is used in [4] to prove the Hardy-Littlewood conjecture and is used in [6] to prove the density of Sophie primes.
منابع مشابه
Properties of the magnitude terms of orthogonal scaling functions
The spectrum of the convolution of two continuous functions can be determined as the continuous Fourier transform of the cross-correlation function. The same can be said about the spectrum of the convolution of two infinite discrete sequences, which can be determined as the discrete time Fourier transform of the cross-correlation function of the two sequences. In current digital signal processi...
متن کاملRota meets Ramanujan: Probabilistic interpretation of Ramanujan - Fourier series
In this paper the ideas of Rota and Ramanujan are shown to be central to understanding problems in additive number theory. The circle and sieve methods are two different facets of the same theme of interplay between probability and Fourier series used to great advantage by Wiener in engineering. Norbert Wiener forged a powerful tool for electrical engineers by combining two distinct branches of...
متن کاملLinking the Circle and the Sieve: Ramanujan- Fourier Series
Currently the circle and the sieve methods are the key tools in analytic number theory. In this paper the unifying theme of the two methods is shown to be Ramanujan Fourier series.
متن کاملRamanujan sums analysis of long-period sequences and 1/f noise
Ramanujan sums are exponential sums with exponent defined over the irreducible fractions. Until now, they have been used to provide converging expansions to some arithmetical functions appearing in the context of number theory. In this paper, we provide an application of Ramanujan sum expansions to periodic, quasiperiodic and complex time series, as a vital alternative to the Fourier transform....
متن کاملFast Computation of Convolution Operations via Low-Rank Approximation
Methods for the approximation of 2D discrete convolution operations are derived for the case when a low-rank approximation of one of the input matrices is available. Algorithms based on explicit computation and on the Fast Fourier Transform are described. Applications to the computation of cross-correlation and autocorrelation are discussed. Both theory and numerical experiments show that the u...
متن کامل