Related papers: An SU(2n)-valued nonlinear Fourier transform
We consider non oscillatory functions and prove an everywhere Fourier Inversion Theorem for functions of very moderate decrease. The proofs rely on some ideas in nonstandard analysis.
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks…
Fourier transformations of several functions of one and two variables are evaluated and then used to derive some integral and series identities. It is shown that certain double Mordell integrals can be reduced to a sum of products of…
Based on the matrix expression of general nonlinear numerical analogues presented by the present author, this paper proposes a novel philosophy of nonlinear computation and analysis. The nonlinear problems are considered an ill-posed linear…
Although being powerful, the differential transform method yet suffers from a drawback which is how to compute the differential transform of nonlinear non-autonomous functions that can limit its applicability. In order to overcome this…
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\{\U(2), \textrm{CNOT}\}$, the discrete Fourier transforms $F_N=(\omega^{ij})_{N\times N},i,j=0,1,..., N-1,…
Wavelets, known to be useful in non-linear multi-scale processes and in multi-resolution analysis, are shown to have a q-deformed algebraic structure. The translation and dilation operators of the theory associate with any scaling equation…
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…
A rapid transformation is derived between spherical harmonic expansions and their analogues in a bivariate Fourier series. The change of basis is described in two steps: firstly, expansions in normalized associated Legendre functions of all…
We propose a neural network for both forward and inverse continuous nonlinear Fourier transforms, NFT and INFT respectively. We demonstrate the network's capability to perform NFT and INFT for a random mix of NFDM-QAM signals. The network…
Recasting the $N$-point one loop scalar integral from Feynman to Schwinger parameters gives an integrand with a Gaussian form. By application of a Fourier transform, it is easy to derive explicit expressions for the two, three and…
Fourier transform is applied to annular beams of simplified flat two-level geometry: bright outer ring with a darker core. The pattern of focal beam profile (i.e. far field) is calculated and characterized with respect of its intensity…
Consider the Fourier transform on the group $GL(2,R)$ of real $2\times 2$-matrices. We show that Fourier-images of polynomial differential operators on $GL(2,R)$ are differential-difference operators with coefficients meromorphic in…
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more)…
We study two discretisations of the nonlinear Fourier transform of AKNS-ZS type, ${\cal F}^E$ and ${\cal F}^D$. Transformation ${\cal F}^D$ is suitable for studying the distributions of the form $u = \sum_{n = 1}^N u_n \, \delta_{x_n}$,…
UD integrals published by N. Usyukina and A. Davydychev in 1992-1993 are integrals corresponding to ladder-type Feynman diagrams. The results are UD functions $\Phi^{(L)},$ where $L$ is the number of loops. They play an important role in…
The nonlinear Fourier transform has the potential to overcome limits on performance and achievable data rates which arise in modern optical fiber communication systems when nonlinear interference is treated as noise. The periodic nonlinear…
We provide explicit commutative sequence space representations for classical function and distribution spaces on the real half-line. This is done by evaluating at the Fourier transforms of the elements of an orthonormal wavelet basis.
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…
Fourier transformations of pseudo-Boolean functions are popular tools for analyzing functions of binary sequences. Real-world functions often have structures that manifest in a sparse Fourier transform, and previous works have shown that…