Journal
IEEE ACCESS
Volume 7, Issue -, Pages 145161-145176Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2019.2945480
Keywords
Nonlinear Fourier transform; transforms for signal processing; fast algorithms for DSP; nonlinear signal processing
Categories
Funding
- European Research Council (ERC) under the European Union's Horizon 2020 Research and Innovation Programme [716669]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available