Fast Numerical Nonlinear Fourier Transforms

DOI10.1109/TIT.2015.2485944MaRDI QIDQ2977198zbMATH OpenOpenAlexFDO

Authors Sander Wahls, H. Vincent Poor

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.1605

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Abstract: 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 sinusoidal. Physically relevant waveforms are often available for the analysis instead. The details of the transform depend on the waveforms underlying the analysis, which in turn are specified through the implicit assumption that the signal is governed by a certain evolution equation. For example, water waves generated by the Korteweg-de Vries equation can be expressed in terms of cnoidal waves. Light waves in optical fiber governed by the nonlinear Schr"odinger equation (NSE) are another example. Nonlinear analogs of classic problems such as spectral analysis and filtering arise in many applications, with information transmission in optical fiber, as proposed by Yousefi and Kschischang, being a very recent one. The nonlinear Fourier transform is eminently suited to address them -- at least from a theoretical point of view. Although numerical algorithms are available for computing the transform, a "fast" nonlinear Fourier transform that is similarly effective as the fast Fourier transform is for computing the common Fourier transform has not been available so far. The goal of this paper is to address this problem. Two fast numerical methods for computing the nonlinear Fourier transform with respect to the NSE are presented. The first method achieves a runtime of $O(D^2)$ floating point operations, where $D$ is the number of sample points. The second method applies only to the case where the NSE is defocusing, but it achieves an $O(Dlo{g}^{2}D)$ runtime. Extensions of the results to other evolution equations are discussed as well.

Cited in

(25)

• Quantum path computing: computing architecture with propagation paths in multiple plane diffraction of classical sources of fermion and boson particles
• Fast sixth-order algorithm based on the generalized Cayley transform for the Zakharov-Shabat system associated with nonlinear Schrödinger equation
• Reliable computation of the eigenvalues of the discrete KdV spectrum
• Fast algorithms for solving the inverse scattering problem for the Zakharov-Shabat system of equations and their applications
• Direct nonlinear Fourier transform algorithms for the computation of solitonic spectra in focusing nonlinear Schrödinger equation
• The computational efficiency of nonlinear frequency domain methods
• Introducing phase jump tracking -- a fast method for eigenvalue evaluation of the direct Zakharov-Shabat problem
• Fast computation and practical use of amplitudes at non-Fourier frequencies
• scientific article; zbMATH DE number 432881 (Why is no real title available?)
• Scattering data computation for the Zakharov-Shabat system
• scientific article; zbMATH DE number 3970070 (Why is no real title available?)
• scientific article; zbMATH DE number 1960289 (Why is no real title available?)
• scientific article; zbMATH DE number 1979263 (Why is no real title available?)
• Nonequispaced fast Fourier transforms without oversampling
• Nonlinear Fourier transform -- towards the construction of nonlinear Fourier modes
• scientific article; zbMATH DE number 1421270 (Why is no real title available?)
• Fast Fourier Transform for Discontinuous Functions
• Fast Gauss transforms with complex parameters using NFFTs
• On computing high-dimensional Riemann theta functions
• Inverse scattering transform for nonlinear Schrödinger systems on a nontrivial background: a survey of classical results, new developments and future directions
• Right and left inverse scattering problems formulations for the Zakharov-Shabat system
• High-order block Toeplitz inner-bordering method for solving the Gelfand-Levitan-Marchenko equation
• Periodic finite-band solutions to the focusing nonlinear Schrödinger equation by the Fokas method: inverse and direct problems
• Numerical approaches in nonlinear Fourier transform-based signal processing for telecommunications
• Fast eight-order Pade schemes based on Chebyshev polynomials for direct Zakharov-Shabat problem

This page was built for publication: Fast Numerical Nonlinear Fourier Transforms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2977198)