相关论文: Nonlinear Spectral Characterization of Discrete Da…
The nonlinear Fourier transform (NFT), a powerful tool in soliton theory and exactly solvable models, is a method for solving integrable partial differential equations governing wave propagation in certain nonlinear media. The NFT…
In this article, we study the properties of the nonlinear Fourier spectrum in order to gain better control of the temporal support of the signals synthesized using the inverse nonlinear Fourier transform (NFT). In particular, we provide…
We present an efficient, fast and robust Nonlinear Fourier Transform (NFT) algorithm to detect eigenvalues of the discrete spectrum. It outperforms other known NFT algorithms as it detects the eigenvalues from the continuous spectrum, the…
The nonlinear Fourier transform, which is also known as the forward scattering transform, decomposes a periodic signal into nonlinearly interacting waves. In contrast to the common Fourier transform, these waves no longer have to be…
The nonlinear Fourier transform (NFT) decomposes waveforms propagating through optical fiber into nonlinear degrees of freedom, which are preserved during transmission. By encoding information on the nonlinear spectrum, a transmission…
Multi-soliton pulses, as special solutions of the Nonlinear Schroedinger Equation (NLSE), are potential candidates for optical fiber transmission where the information is modulated and recovered in the so-called nonlinear Fourier domain.…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
A simple least-squares optimisation enables the determination of the spectrum for irregularly sampled data that is readily reconstructed using an adjoint transformation of the Non-Uniform Fast Fourier Transform (NFFT). This is an…
The nonlinear Fourier transform (NFT) has recently gained significant attention in fiber optic communications and other engineering fields. Although several numerical algorithms for computing the NFT have been published, the design of…
In this note, we study the convergence from the discrete to the continuous non-linear Fourier transform. Relations between spectral problems and questions in complex function theory provide a new approach to the study of scattering problems…
The nonlinear Schr\"odinger equation (NSE) is well-known to model an ideal fiber-optic communication channel. Even though the NSE is a nonlinear evolution equation, it can be solved analytically using a nonlinear Fourier transform (NFT).…
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…
Symmetry learning has proven to be an effective approach for extracting the hidden structure of data, with the concept of equivariance relation playing the central role. However, most of the current studies are built on architectural theory…
In the presence of additive Gaussian noise, the statistics of the nonlinear Fourier transform (NFT) of a pulse are not yet completely known in closed form. In this paper, we propose a novel approach to study this problem. Our contributions…
We define a nonlinear Fourier transform which maps sequences of contractive $n \times n$ matrices to $SU(2n)$-valued functions on the circle $\mathbb{T}$. We characterize the image of finitely supported sequences and square-summable…
Addressing the optical communication systems employing the nonlinear Fourier transform (NFT) for the data modulation/demodulation, we provide an explicit proof for the properties of the signals emerging in the so-called b-modulation method,…
We propose a general algebraic analytic scheme for the spectral transform of solutions of nonlinear evolution equations. This allows us to give the general integrable evolution corresponding to an arbitrary time and space dependence of the…
Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. In this paper, we pay special attention to the description of complex-data FFT. We analyze two common descriptions of…
This paper is devoted to a discussion of the Discrete Fourier Transform (DFT) representation of a chaotic finite-duration sequence. This representation has the advantage that is itself a finite-duration sequence corresponding to samples…
The nonlinear Fourier transform discussed in these notes is the map from the potential of a one dimensional discrete Dirac operator to the transmission and reflection coefficients thereof. Emphasis is on this being a nonlinear variant of…