Abstract
A fast algorithm for constructing multi-solitons with linear complexity in the number of samples and eigenvalues is introduced. The algorithm is shown to be significantly faster than the conventional Darboux transform in a numerical example, with acceptable error.
| Original language | English |
|---|---|
| Title of host publication | Proceedings 2017 43rd European Conference on Optical Communication (ECOC) |
| Editors | P. Andrekson, L.K. Oxenlöwe |
| Place of Publication | Piscataway, NJ, USA |
| Publisher | IEEE |
| Number of pages | 3 |
| ISBN (Print) | 978-1-5386-5624-2 |
| DOIs | |
| Publication status | Published - 2017 |
| Event | 2017 43rd European Conference on Optical Communication - Gothenburg, Sweden Duration: 17 Sept 2017 → 21 Sept 2017 Conference number: 43rd http://ecoc2017.org/ |
Conference
| Conference | 2017 43rd European Conference on Optical Communication |
|---|---|
| Abbreviated title | ECOC 2017 |
| Country/Territory | Sweden |
| City | Gothenburg |
| Period | 17/09/17 → 21/09/17 |
| Internet address |
Bibliographical note
Accepted Author ManuscriptKeywords
- Darboux
- multi-soliton
- Nonlinear Fourier Transform
- Inverse NFT
Fingerprint
Dive into the research topics of 'Discrete Darboux based fast inverse nonlinear Fourier transform algorithm for multi-solitons'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver