Related papers: Correcting for the alias effect when measuring the…
A conjecture is proposed concerning the recovery of a discrete magnitude spectrum through a nonlinear transformation involving the Newman's phase sequence. Given a discrete magnitude spectrum sampled from a continuous function, consider the…
We show that in a certain, angle-averaged squeezed limit, the $N$-point function of matter is related to the response of the matter power spectrum to a long-wavelength density perturbation,…
The most popular algorithm for the nonuniform fast Fourier transform (NUFFT) uses the dilation of a kernel $\phi$ to spread (or interpolate) between given nonuniform points and a uniform upsampled grid, combined with an FFT and diagonal…
Correlation functions measured as a function of $\Delta \eta, \Delta \phi$ have emerged as a powerful tool to study the dynamics of particle production in nuclear collisions at high energy. They are however subject, like any other…
The $N$-point discrete Fourier transform (DFT) is a cornerstone for several signal processing applications. Many of these applications operate in real-time, making the computational complexity of the DFT a critical performance indicator to…
A test based on tapering is proposed for use in testing a global linear hypothesis under a functional linear model. The test statistic is constructed as a weighted sum of squared linear combinations of Fourier coefficients, a tapered…
The computational efficiency of many neural operators, widely used for learning solutions of PDEs, relies on the fast Fourier transform (FFT) for performing spectral computations. As the FFT is limited to equispaced (rectangular) grids,…
A two-dimensional Fourier transform of hadron form factors allows to determine their charge density in transverse space. We show that this method can be applied to any virtual photon induced transition, such as \gamma *(q)+N -> \pi N. Only…
We consider a nonlinear Fourier transform (NFT)-based transmission scheme, where data is embedded into the imaginary part of the nonlinear discrete spectrum. Inspired by probabilistic amplitude shaping, we propose a probabilistic eigenvalue…
The Dirac-{\delta} distribution may be realized through sequences of convlutions, the latter being also regarded as approximation to the identity. The present study proposes the so called pre-orthogonal adaptive Fourier decomposition…
Correlations in the Lyman-$\alpha$ (Ly$\alpha$) forest, both as a function of line of sight separation (1D) and 3D separation, provide a unique window to the distribution of matter at redshifts not accessible by current galaxy surveys.…
We propose a Fast Fourier Transform based Periodic Interpolation Method (FFT-PIM), a flexible and computationally efficient approach for computing the scalar potential given by a superposition sum in a unit cell of an infinitely periodic…
For \psi a nontrivial additive character on the finite field F_q, the map t \mapsto \sum_{x \in F_q} \psi(f(x)+tx) is the Fourier transform of the map t \mapsto \psi(f(t))$. As is well-known, this has a cohomological interpretation,…
We show that exponential sums (ES) of the form \begin{equation*} S(f, N)= \sum_{k=0}^{N-1} \sqrt{w_k} e^{2 \pi i f(k)}, \end{equation*} can be efficiently carried out with a quantum computer (QC). Here $N$ can be exponentially large, $w_k$…
Recent developments of Perturbation Theory (PT), specifically the Effective Field Theory of Large Scale Structure (EFTofLSS) and its equivalents, have proven powerful in analyzing galaxy clustering statistics such as the galaxy power…
The usual procedure for estimating the significance of a peak in a power spectrum is to calculate the probability of obtaining that value or a larger value by chance (known as the "p-value"), on the assumption that the time series contains…
Analytic signals constitute a class of signals that are widely applied in time-frequency analysis such as extracting instantaneous frequency (IF) or phase derivative in the characterization of ultrashort laser pulse. The purpose of this…
The graph Fourier transform (GFT) is in general dense and requires O(n^2) time to compute and O(n^2) memory space to store. In this paper, we pursue our previous work on the approximate fast graph Fourier transform (FGFT). The FGFT is…
The special affine Fourier transform (SAFT) is a promising tool for analyzing non-stationary signals with more degrees of freedom. However, the SAFT fails in obtaining the local features of non-transient signals due to its global kernel and…
In dealing with high-dimensional data, factor models are often used for reducing dimensions and extracting relevant information. The spectrum of covariance matrices from power data exhibits two aspects: 1) bulk, which arises from random…