Related papers: Efficient polar convolution based on the discrete …
Filtered backprojection (FBP) algorithm is a popular choice for complicated trajectory SAR image formation processing due to its inherent nonlinear motion compensation capability. However, how to efficiently autofocus the defocused FBP…
The use of Fourier methods in wave-front reconstruction can significantly reduce the computation time for large telescopes with a high number of degrees of freedom. However, Fourier algorithms for discrete data require a rectangular data…
Many interesting and fundamentally practical optimization problems, ranging from optics, to signal processing, to radar and acoustics, involve constraints on the Fourier transform of a function. It is well-known that the {\em fast Fourier…
We present a fast algorithm for computing the diffracted field from arbitrary binary (sharp-edged) planar apertures and occulters in the scalar Fresnel approximation, for up to moderately high Fresnel numbers ($\lesssim 10^3$). It uses a…
In the present paper, optimal quadrature formulas in the sense of Sard are constructed for numerical integration of the integral $\int_a^be^{2\pi i\omega x}\varphi(x)d x$ with $\omega\in \mathbb{R}$ in the Sobolev space $L_2^{(m)}[a,b]$ of…
One of the most efficient ways to produce unconditional simulations is with the kernel convolution using fast Fourier transform (FFT) [1]. However, when data is located on a surface, this approach is not efficient because data needs to be…
We introduce a new class of multilevel, adaptive, dual-space methods for computing fast convolutional transforms. These methods can be applied to a broad class of kernels, from the Green's functions for classical partial differential…
Recent research in deep learning (DL) has investigated the use of the Fast Fourier Transform (FFT) to accelerate the computations involved in Convolutional Neural Networks (CNNs) by replacing spatial convolution with element-wise…
Filtering of digital signals is accomplished on an Excel spreadsheet using fast Fourier transform (FFT) convolution in which the kernel is either a Gaussian or a cosine modulated Gaussian. Pedagogical examples of low-pass and band-pass…
We demonstrate the use of the Fast Fourier Transform Beam Propagation Method (FFT BPM) to simulate dynamic diffraction effects, including scattering from deformed crystals with arbitrary shapes in Bragg, Laue, and asymmetric geometries. The…
We construct an algorithm for implementing the discrete wavelet transform by means of matrices in SO_2(R) for orthonormal compactly supported wavelets and matrices in SL_m(R), m > = 2, for compactly supported biorthogonal wavelets. We show…
The fast Fourier transform, FFT, is a useful and prevalent algorithm in signal processing. It characterizes the spectral components of a signal, or is used in combination with other operations to perform more complex computations such as…
The precise analysis and accurate measurement of harmonic provides a reliable scientific industrial application. However, the high-performance DSP processor is the important method of electrical harmonic analysis. Hence, in this research…
In recent years it has turned out that shearlets have the potential to retrieve directional information so that they became interesting for many applications. Moreover the continuous shearlet transform has the outstanding property to stem…
The polar decomposition of a matrix is a key element in the quantum linear algebra toolbox. We show that the problem of quantum polar decomposition, recently studied in Lloyd et al. [LBP+20], has a simple and concise implementation via the…
Localization microscopy often relies on detailed models of point spread functions. For applications such as deconvolution or PSF engineering, accurate models for light propagation in imaging systems with high numerical aperture are…
Being exact at both short- and long-time limits, the Gaussian approximation is widely used to calculate neutron incoherent inelastic scattering functions in liquids. However, to overcome a few numerical difficulties, extra physical…
Optical two-dimensional Fourier-transformed (2DFT) spectroscopy is used to study the coherent optical response of potassium vapor in a thin transmission cell. Rephasing and non-rephasing spectra of the D1 and D2 transitions are obtained and…
We introduce a Fourier-based fast algorithm for Gaussian process regression in low dimensions. It approximates a translationally-invariant covariance kernel by complex exponentials on an equispaced Cartesian frequency grid of $M$ nodes.…
In this paper, we develop a fast and accurate pseudospectral method to approximate numerically the half Laplacian $(-\Delta)^{1/2}$ of a function on $\mathbb{R}$, which is equivalent to the Hilbert transform of the derivative of the…