Introducing the fast inverse NFT

Vishal Vaibhav, Sander Wahls

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

5 Citations (Scopus)

Abstract

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 + log2 N)) complexity for N samples of a signal comprising K eigenvalues.

Original languageEnglish
Title of host publicationProceedings 2017 Optical Fiber Communications Conference and Exhibition (OCF 2017)
Place of PublicationPiscataway, NJ, USA
PublisherIEEE
Pages1670-1673
ISBN (Electronic)879-1-943580-23-1
ISBN (Print)978-1-5090-6229-4
Publication statusPublished - 2017
Event2017 Optical Fiber Communications Conference and Exhibition, OFC 2017 - Los Angeles, United States
Duration: 19 Mar 201723 Mar 2017

Conference

Conference2017 Optical Fiber Communications Conference and Exhibition, OFC 2017
CountryUnited States
CityLos Angeles
Period19/03/1723/03/17

Keywords

  • Fourier transforms
  • Eigenvalues and eigenfunctions
  • Solids
  • Nonlinear optics
  • Scattering
  • Solitons
  • Frequency division multiplexing

Fingerprint Dive into the research topics of 'Introducing the fast inverse NFT'. Together they form a unique fingerprint.

Cite this