2016
DOI: 10.1109/jlt.2016.2577702
|View full text |Cite
|
Sign up to set email alerts
|

Bi-Directional Algorithm for Computing Discrete Spectral Amplitudes in the NFT

Abstract: The nonlinear Fourier transform (NFT) represents a signal in terms of its continuous spectrum, discrete eigenvalues and the corresponding discrete spectral amplitudes. This paper presents a new bi-directional algorithm for computing the discrete spectral amplitudes, which addresses the significant problem of rounding errors inherent in previously-known techniques. We use the proposed method to obtain accurate spectral-domain noise statistics for 2-soliton signals using numerical simulation.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
37
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 43 publications
(40 citation statements)
references
References 33 publications
3
37
0
Order By: Relevance
“…A visible effect is the fact that the BER is not the same for the four different constellations, but it is worse for the two constellations associated with the eigenvalue with a higher imaginary part. This effect can be related to the dependency of the noise variance of both the eigenvalues and the corresponding scattering coefficients on the imaginary part of the eigenvalues themselves [44][45][46][47][48]; an analysis of the noise distribution for the various eigenvalues and scattering coefficients is provided in the Supplementary Material. In order to demonstrate fiber transmission with the proposed system, a transmission was performed over a link of N spans of SMF with span length L = 41.5 and L = 83 km.…”
Section: Resultsmentioning
confidence: 99%
“…A visible effect is the fact that the BER is not the same for the four different constellations, but it is worse for the two constellations associated with the eigenvalue with a higher imaginary part. This effect can be related to the dependency of the noise variance of both the eigenvalues and the corresponding scattering coefficients on the imaginary part of the eigenvalues themselves [44][45][46][47][48]; an analysis of the noise distribution for the various eigenvalues and scattering coefficients is provided in the Supplementary Material. In order to demonstrate fiber transmission with the proposed system, a transmission was performed over a link of N spans of SMF with span length L = 41.5 and L = 83 km.…”
Section: Resultsmentioning
confidence: 99%
“…There are well known problems with the computation of the coefficient b(ζ k ). We used the bi-directional algorithm [17] to find b(ζ k ) by the formula (11). Figure 5 presents the errors (68) of computing the phase coefficients for the maximum eigenvalue ζ 0 (61) with respect to the amplitude A of the potential (59).…”
Section: Numerical Results For Discrete Spectrummentioning
confidence: 99%
“…The procedure is a natural generalization of the solitonbased methods [2], the progenitor of NFT-based transmission. The further extension of this direction involves the utilization of norming constants together with eigenvalues [6,14,15,16,17]. Our approach conforms closely with this methodology; the algorithms and signal processing NFT methods developed in our article target fast efficient computation of both the eigenvalues and norming constants.…”
Section: Introductionmentioning
confidence: 91%
“…4.3. However, as we shall see, the computation of the norming constants brings about some additional problems [17,39].…”
Section: Ways Of the Residues Evaluationmentioning
confidence: 99%