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 language | English |
---|---|
Title of host publication | Proceedings 2017 Optical Fiber Communications Conference and Exhibition (OCF 2017) |
Place of Publication | Piscataway, NJ, USA |
Publisher | IEEE |
Pages | 1670-1673 |
ISBN (Electronic) | 879-1-943580-23-1 |
ISBN (Print) | 978-1-5090-6229-4 |
Publication status | Published - 2017 |
Event | 2017 Optical Fiber Communications Conference and Exhibition, OFC 2017 - Los Angeles, United States Duration: 19 Mar 2017 → 23 Mar 2017 |
Conference
Conference | 2017 Optical Fiber Communications Conference and Exhibition, OFC 2017 |
---|---|
Country/Territory | United States |
City | Los Angeles |
Period | 19/03/17 → 23/03/17 |
Keywords
- Fourier transforms
- Eigenvalues and eigenfunctions
- Solids
- Nonlinear optics
- Scattering
- Solitons
- Frequency division multiplexing