Related papers: The Fourier Cosine Method for Discrete Probability…
This paper introduces the theory and hardware implementation of two new algorithms for computing a single component of the discrete Fourier transform. In terms of multiplicative complexity, both algorithms are more efficient, in general,…
We discuss efficient algorithms for the accurate forward and reverse evaluation of the discrete Fourier-Bessel transform (dFBT) as numerical tools to assist in the 2D polar convolution of two radially symmetric functions, relevant, e.g., to…
Modern design of complex optical systems relies heavily on computational tools. These typically utilize geometrical optics as well as Fourier optics, which enables the use of diffractive elements to manipulate light with features on the…
Approximate methods have been considered as a means to the evaluation of discrete transforms. In this work, we propose and analyze a class of integer transforms for the discrete Fourier, Hartley, and cosine transforms (DFT, DHT, and DCT),…
Digital filters for recursively computing the discrete Fourier transform (DFT) and estimating the frequency spectrum of sampled signals are examined, with an emphasis on magnitude-response and numerical stability. In this tutorial-style…
The paper describes some probabilistic and combinatorial aspects of the nonlinear Fourier transform associated with the AKNS-ZS problems. In the first of the two main results, we show that a family of polytopes that appear in a power…
We formulate a novel approach to solve a class of stochastic problems, referred to as data-consistent inverse (DCI) problems, which involve the characterization of a probability measure on the parameters of a computational model whose…
A class of high-order lowpass filters, the discrete singular convolution (DSC) filters, is utilized to facilitate the Fourier pseudospectral method for the solution of hyperbolic conservation law systems. The DSC filters are implemented…
How could the Fourier and other transforms be naturally discovered if one didn't know how to postulate them? In the case of the Discrete Fourier Transform (DFT), we show how it arises naturally out of analysis of circulant matrices. In…
This paper proposes the option-implied Fourier-cosine method, iCOS, for non-parametric estimation of risk-neutral densities, option prices, and option sensitivities. The iCOS method leverages the Fourier-based COS technique, proposed by…
The Fourier transform of the deeply virtual Compton scattering amplitude (DVCS) with respect to the skewness parameter \zeta= Q^2/ 2 p.q can be used to provide an image of the target hadron in the boost-invariant variable \sigma, the…
For certain types of statistical models, the characteristic function (Fourier transform) is available in closed form, whereas the probability density function has an intractable form, typically as an infinite sum of probability weighted…
We analyze the Double Fourier Sphere (DFS) method on the rotation group $\mathcal{SO}(3)$ in the frequency domain and demonstrate its central role in fast algorithms. Fast Fourier algorithms on $\mathcal{SO}(3)$ are commonly formulated as a…
We prove that a positive-definite measure in $\mathbb{R}^n$ with uniformly discrete support and discrete closed spectrum, is representable as a finite linear combination of Dirac combs, translated and modulated. This extends our recent…
We show that the Fourier transform of the Deeply Virtual Compton Scattering (DVCS) amplitude with respect to the skewness variable $\zeta$ at fixed invariant momentum transfer squared $t$ provides a unique way to visualize the structure of…
The Fractional Fourier Transform is a ubiquitous signal processing tool in basic and applied sciences. The Fractional Fourier Transform generalizes every property and application of the Fourier Transform. Despite the practical importance of…
Fourier transform-based methods enable accurate, dispersion-free simulations of time-domain scattering problems by evaluating solutions to the Helmholtz equation at a discrete set of frequencies sufficient to approximate the inverse Fourier…
We present an alternative method to filter a distribution, that is strictly confined within a sphere of given radius $r_c$, so that its Fourier transform is optimally confined within another sphere of radius $k_c$. In electronic structure…
We show, in a formal way, how a class of complex quasiprobability distribution functions may be introduced by using the fractional Fourier transform. This leads to the Fresnel transform of a characteristic function instead of the usual…
A discrete complexified quaternion Fourier transform is introduced. This is a generalization of the discrete quaternion Fourier transform to the case where either or both of the signal/image and the transform kernel are complex…