Papers
Topics
Authors
Recent
Search
2000 character limit reached

Data Transmission based on Exact Inverse Periodic Nonlinear Fourier Transform, Part II: Waveform Design and Experiment

Published 28 Nov 2019 in eess.SP, cs.IT, and math.IT | (1911.12615v2)

Abstract: The nonlinear Fourier transform has the potential to overcome limits on performance and achievable data rates which arise in modern optical fiber communication systems when nonlinear interference is treated as noise. The periodic nonlinear Fourier transform (PNFT) has been much less investigated compared to its counterpart based on vanishing boundary conditions. In this paper, we design a first experiment based on the PNFT in which information is encoded in the invariant nonlinear main spectrum. To this end, we propose a method to construct a set of periodic waveforms each having the same fixed period, by employing the exact inverse PNFT algorithm developed in Part I. We demonstrate feasibility of the transmission scheme in experiment in good agreement with simulations and obtain a bit-error ratio of $10{-3}$ over a distance of 2000 km. It is shown that the transmission reach is significantly longer than expected from a naive estimate based on group velocity dispersion and cyclic prefix length, which is explained through a dominating solitonic component in the transmitted waveform. Our constellation design can be generalized to an arbitrary number of nonlinear degrees of freedom.

Citations (11)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.