Fast Nonlinear Fourier Transform Algorithms Using Higher Order Exponential Integrators

Research output: Contribution to journalArticleScientificpeer-review

5 Citations (Scopus)
46 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)145161-145176
JournalIEEE Access
Volume7
Issue number1
DOIs
Publication statusPublished - 2019

Keywords

  • Nonlinear Fourier transform
  • transforms for signal processing
  • nonlinear signal processing
  • Eigenvalues and eigenfunctions

Fingerprint Dive into the research topics of 'Fast Nonlinear Fourier Transform Algorithms Using Higher Order Exponential Integrators'. Together they form a unique fingerprint.

Cite this