2015 Tyrrhenian International Workshop on Digital Communications (TIWDC) 2015
DOI: 10.1109/tiwdc.2015.7323325
|View full text |Cite
|
Sign up to set email alerts
|

Numerical methods for the inverse nonlinear fourier transform

Abstract: We introduce a new numerical method for the computation of the inverse nonlinear Fourier transform and compare its computational complexity and accuracy to those of other methods available in the literature. For a given accuracy, the proposed method requires the lowest number of operations

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
22
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 14 publications
(22 citation statements)
references
References 12 publications
0
22
0
Order By: Relevance
“…As noted in [66], the NFT shares many of the properties of the ordinary Fourier transform, including the generalized Parseval identity Despite their apparent promise at achieving relatively large spectral efficiencies and enabling transmission at higher launch powers than conventional techniques, considerably more work needs to be done before any of these NFT-based techniques will be competitive in practice. The computational resources required to compute forward and inverse NFTs numerically, even using the fast algorithms of [82][83][84], is substantial. The impact on the overall transmission system of larger launch powers and nonstandard waveforms needs to be assessed.…”
Section: Probabilistic Shapingmentioning
confidence: 99%
“…As noted in [66], the NFT shares many of the properties of the ordinary Fourier transform, including the generalized Parseval identity Despite their apparent promise at achieving relatively large spectral efficiencies and enabling transmission at higher launch powers than conventional techniques, considerably more work needs to be done before any of these NFT-based techniques will be competitive in practice. The computational resources required to compute forward and inverse NFTs numerically, even using the fast algorithms of [82][83][84], is substantial. The impact on the overall transmission system of larger launch powers and nonstandard waveforms needs to be assessed.…”
Section: Probabilistic Shapingmentioning
confidence: 99%
“…There has been a lot of recent work on the NFT [1]- [8], including experimental demonstration of NFT-based transmission strategies [9]- [15] and numerical methods [16]- [18] focused on "fast" algorithms. A final branch of research has been the information-theoretical understanding of the optical channel in the NFT-spectral domain, including noise models [19], [20] and bounds on "per-soliton" capacity [21].…”
Section: Introductionmentioning
confidence: 99%
“…At the end we mention a recent work on the INFT methods by Civelli et al [129]: the authors introduced yet another INFT first order solution algorithm based on iterated convolutions with the GLME kernel using the FFT, which demonstrated the better performance in terms of accuracy and time consumption that the 1st order TIB [52] and the Nyström conjugate gradient method [130]. However, the last approach has not been tested so far on the transmission-related problems.…”
Section: B Numerical Methods For the Inftmentioning
confidence: 99%