Fast Nonlinear Fourier Transform Algorithms Using Higher Order Exponential Integrators
arXiv:1812.00703 · doi:10.1109/ACCESS.2019.2945480
Abstract
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 highly accurate low-complexity algorithms remains a challenge. In this paper, we present new fast forward NFT algorithms that achieve accuracies that are orders of magnitudes better than current methods, at comparable run times and even for moderate sampling intervals. The new algorithms are compared to existing solutions in multiple, extensive numerical examples.
arXiv commentAccepted version
References in corpus (7)
- The Magnus expansion and some of its applications
- Quantum Communication
- Information Transmission using the Nonlinear Fourier Transform, Part II: Numerical Methods
- Information Transmission using the Nonlinear Fourier Transform, Part I: Mathematical Tools
- Fast Numerical Nonlinear Fourier Transforms
- Direct nonlinear Fourier transform algorithms for the computation of solitonic spectra in focusing nonlinear Schrödinger equation
- Higher Order Convergent Fast Nonlinear Fourier Transform
Cited by in corpus (6)
- Exponential Fourth Order Schemes for Direct Zakharov-Shabat problem
- Introducing phase jump tracking -- a fast method for eigenvalue evaluation of the direct Zakharov-Shabat problem
- LeXInt: Package for Exponential Integrators employing Leja interpolation
- Data Transmission based on Exact Inverse Periodic Nonlinear Fourier Transform, Part II: Waveform Design and Experiment
- Successive Eigenvalue Removal for Multi-Soliton Spectral Amplitude Estimation
- Fast sixth-order algorithm based on the generalized Cayley transform for the Zakharov-Shabat system in optical applications