Fast Nonlinear Fourier Transform Algorithms Using Higher Order Exponential Integrators

12/03/2018
by   Shrinivas Chimmalgi, et al.
0

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 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.

READ FULL TEXT
research
08/26/2019

Fast Nonlinear Fourier Transform using Chebyshev Polynomials

We explore the class of exponential integrators known as exponential tim...
research
03/26/2019

Efficient Nonlinear Fourier Transform Algorithms of Order Four on Equispaced Grid

We explore two classes of exponential integrators in this letter to desi...
research
02/21/2018

Communication Using Eigenvalues of Higher Multiplicity of the Nonlinear Fourier Transform

Eigenvalues of higher multiplicity of the Nonlinear Fourier Transform (N...
research
06/12/2016

Efficient KLMS and KRLS Algorithms: A Random Fourier Feature Perspective

We present a new framework for online Least Squares algorithms for nonli...
research
04/20/2020

Sampling and Inference of Networked Dynamics using Log-Koopman Nonlinear Graph Fourier Transform

Networked nonlinear dynamics underpin the complex functionality of many ...
research
07/03/2021

A fast algorithm for computing the Boys function

We present a new fast algorithm for computing the Boys function using no...
research
07/26/2022

QFT-based Homogenization

Efficient numerical characterization is a key problem in composite mater...

Please sign up or login with your details

Forgot password? Click here to reset