Fast Nonlinear Fourier Transform using Chebyshev Polynomials

by   Vishal Vaibhav, et al.

We explore the class of exponential integrators known as exponential time differencing (ETD) method in this letter to design low complexity nonlinear Fourier transform (NFT) algorithms that compute discrete approximations of the scattering coefficients in terms of the Chebyshev polynomials for real values of the spectral parameter. In particular, we discuss ETD Runge-Kutta methods which yield algorithms with complexity O(N^2N) (where N is the number of samples of the signal) and an order of convergence that matches the underlying one-step method.


page 1

page 2

page 3

page 4


Efficient Nonlinear Fourier Transform Algorithms of Order Four on Equispaced Grid

We explore two classes of exponential integrators in this letter to desi...

A Fast Chebyshev Spectral Method for Nonlinear Fourier Transform

In this letter, we present a fast and well-conditioned spectral method b...

Fast Nonlinear Fourier Transform Algorithms Using Higher Order Exponential Integrators

The nonlinear Fourier transform (NFT) has recently gained significant at...

A Chebyshev Spectral Method for Nonlinear Fourier Transform: Norming Constants

In this paper, we present a Chebyshev based spectral method for the comp...

Multi-layered Cepstrum for Instantaneous Frequency Estimation

We propose the multi-layered cepstrum (MLC) method to estimate multiple ...

Is FFT Fast Enough for Beyond-5G Communications?

In this work, we consider the complexity and throughput limits of the Fa...

Decision-Feedback Detection Strategy for Nonlinear Frequency-Division Multiplexing

By exploiting a causality property of the nonlinear Fourier transform, a...

Please sign up or login with your details

Forgot password? Click here to reset