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

Spectral Efficiency Optimization in Flexi-Grid Long-Haul Optical Systems

Abstract: Abstract-Flexible grid optical networks allow a better exploitation of fiber capacity, by enabling a denser frequency allocation. A tighter channel spacing, however, requires narrower filters, which increase linear intersymbol interference (ISI), and may dramatically reduce system reach. Commercial coherent receivers are based on symbol by symbol detectors, which are quite sensitive to ISI. In this context, Nyquist spacing is considered as the ultimate limit to wavelength-division multiplexing (WDM) packing.In… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
3
2

Relationship

2
3

Authors

Journals

citations
Cited by 10 publications
(5 citation statements)
references
References 35 publications
0
5
0
Order By: Relevance
“…In particular, I A =87.5 Gb/s, I B =95 Gb/s (I A +I B =182.5 Gb/s) in the maximized scheme, and I A =100 Gb/s, I B =76 Gb/s (I A +I B =176 Gb/s) otherwise. In this figure are also reported simulations with LDPC codes with different code rates (the same applied in [13]), which best approach the achievable bound, showing that although some penalty must be taken into account, a good matching is evident. Each dot on the graph indicates the code rate of S A and S B respectively, in addition to the corresponding C/I.…”
Section: Numerical Resultsmentioning
confidence: 88%
See 3 more Smart Citations
“…In particular, I A =87.5 Gb/s, I B =95 Gb/s (I A +I B =182.5 Gb/s) in the maximized scheme, and I A =100 Gb/s, I B =76 Gb/s (I A +I B =176 Gb/s) otherwise. In this figure are also reported simulations with LDPC codes with different code rates (the same applied in [13]), which best approach the achievable bound, showing that although some penalty must be taken into account, a good matching is evident. Each dot on the graph indicates the code rate of S A and S B respectively, in addition to the corresponding C/I.…”
Section: Numerical Resultsmentioning
confidence: 88%
“…3, already introduced in sect. IIA, shows the main simulation results of the presented work, namely the net bit rate achievable bounds of signal S A and S B as a function of S A OSNR and C/I, which entails the S B OSNR; these bounds were theoretically computed by exploiting the principles in [23] (see also [13], [20] for details) to determine the average mutual information per symbol, successively multiplied by the nominal bit rate R.…”
Section: Numerical Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…Results are hence presented both as bit error rate (BER) computations by employing practical LDPC codes and as achievable bit rate lower bounds (ABR), that represents a useful method to evaluate the theoretical system performance without resorting to practical codes. 1 For insights on the usefulness of such bounds with respect to BER measurements, please refer to [27]. The computation of these bounds exploits indeed the principles of auxiliary channel and mismatched detection, and, in brief, it takes advantage of samples r k to yield a bound I LB ≤ I, which, despite being a lower bound, is achievable for the considered receiver, in the sense that it is theoretically possible to design a code that reaches the predicted performance.…”
Section: A Theorymentioning
confidence: 99%