Introducing the fast inverse NFT

In optical fiber communication, the nonlinear frequency division multiplexing scheme requires a fast inverse nonlinear Fourier transform (NFT). We present two algorithms with O (N(K + log
²
N)) complexity for N samples of a signal comprising K eigenvalues.