TY - JOUR
T1 - Fast nonlinear Fourier transform algorithms using higher order exponential integrators
AU - Chimmalgi, Shrinivas
AU - Prins, Peter J.
AU - Wahls, Sander
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
KW - Nonlinear Fourier transform
KW - transforms for signal processing
KW - nonlinear signal processing
KW - Eigenvalues and eigenfunctions
UR - http://www.scopus.com/inward/record.url?scp=85073604031&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2019.2945480
DO - 10.1109/ACCESS.2019.2945480
M3 - Article
SN - 2169-3536
VL - 7
SP - 145161
EP - 145176
JO - IEEE Access
JF - IEEE Access
IS - 1
ER -