pith. sign in

arxiv: 1904.09807 · v1 · pith:7WE5FABOnew · submitted 2019-04-22 · 📡 eess.SP · cs.AI· cs.IT· math.IT· stat.ML

Revisiting Multi-Step Nonlinearity Compensation with Machine Learning

classification 📡 eess.SP cs.AIcs.ITmath.ITstat.ML
keywords bettercompensationefficientmulti-stepnonlinearityappearsapproachesassumption
0
0 comments X
read the original abstract

For the efficient compensation of fiber nonlinearity, one of the guiding principles appears to be: fewer steps are better and more efficient. We challenge this assumption and show that carefully designed multi-step approaches can lead to better performance-complexity trade-offs than their few-step counterparts.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.