Related papers: Fast Inverse Nonlinear Fourier Transform
The paper is devoted to the development of the octonion Fourier transform (OFT) theory initiated in 2011 in articles by Hahn and Snopek. It is also a continuation and generalization of earlier work by Blaszczyk and Snopek, where they proved…
We consider the problem of computing the Walsh-Hadamard Transform (WHT) of some $N$-length input vector in the presence of noise, where the $N$-point Walsh spectrum is $K$-sparse with $K = {O}(N^{\delta})$ scaling sub-linearly in the input…
In many applications data are measured or defined on a spherical manifold; spherical harmonic transforms are then required to access the frequency content of the data. We derive algorithms to perform forward and inverse spin spherical…
Computing Fourier transforms of k-sparse signals, where only k of N frequencies are non-zero, is fundamental in compressed sensing, radar, and medical imaging. While the Fast Fourier Transform (FFT) evaluates all N frequencies in $O(N \log…
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 Number Theoretic Transform (NTT) can be regarded as a variant of the Discrete Fourier Transform. NTT has been quite a powerful mathematical tool in developing Post-Quantum Cryptography and Homomorphic Encryption. The Fourier Transform…
We present a new method for computing the Near-To-Far-Field (NTFF) transformation in FDTD simulations which has an overall scaling of $O(N^3)$ instead of the standard $O(N^4)$. By mapping the far field with a cartesian coordinate system the…
The technologically-relevant task of feature extraction from data performed in deep-learning systems is routinely accomplished as repeated fast Fourier transforms (FFT) electronically in prevalent domain-specific architectures such as in…
A generalized Nonlinear Fourier Transform (GNFT), which includes eigenvalues of higher multiplicity, is considered for information transmission over fiber optic channels. Numerical algorithms are developed to compute the direct and inverse…
Discrete transforms such as the discrete Fourier transform (DFT) and the discrete Hartley transform (DHT) are important tools in numerical analysis. The successful application of transform techniques relies on the existence of efficient…
The Frequency Domain Reflectometry (FDR) is studied as a powerful tool to detect hard or soft faults in star-shaped networks of nonuniform lossless transmission lines. Processing the FDR measurements leads to solve an inverse scattering…
In this paper, we develop the numerical inverse scattering transform (NIST) for solving the derivative nonlinear Schrodinger (DNLS) equation. The key technique involves formulating a Riemann-Hilbert problem (RHP) that is associated with the…
A special class of multicomponent NLS equations, generalizing the vector NLS and related to the {\bf BD.I}-type symmetric are shown to be integrable through the inverse scattering method (ISM). The corresponding fundamental analytic…
The pseudo-polar Fourier transform is a specialized non-equally spaced Fourier transform, which evaluates the Fourier transform on a near-polar grid, known as the pseudo-polar grid. The advantage of the pseudo-polar grid over other…
An inverse nonequispaced fast Fourier transform (iNFFT) is a fast algorithm to compute the Fourier coefficients of a trigonometric polynomial from nonequispaced sampling data. However, various applications such as magnetic resonance imaging…
Although Fourier series approximation is ubiquitous in computational physics owing to the Fast Fourier Transform (FFT) algorithm, efficient techniques for the fast evaluation of a three-dimensional truncated Fourier series at a set of…
This proposal relates to the design, analysis and application of a novel numerical scheme for the solution of axisymmetric scattering problems. To this end, a procedure is introduced to iteratively evaluate the solution of the…
An integrated photonic circuit architecture to perform a modified-convolution operation based on the Discrete Fractional Fourier Transform (DFrFT) is introduced. This is accomplished by utilizing two nonuniformly-coupled waveguide lattices…
State-of-the-art methods in multidimensional NLTE radiative transfer are based on the use of local approximate lambda operator within either Jacobi or Gauss-Seidel iterative schemes. Here we propose another approach to the solution of 2D…
The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The…