The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Probabilistic Constellation Shaping for Optical Fiber Communications
Open accessAbstract
We review probabilistic constellation shaping (PCS), which has been a key enabler for several recent record-setting optical fiber communications experiments. PCS provides both fine-grained rate adaptability and energy efficiency (sensitivity) gains. We discuss the reasons for the fundamentally better performance of PCS over other constellation shaping techniques that also achieve rate adaptability, such as time-division hybrid modulation, and examine in detail the impact of sub-optimum shaping and forward error correction (FEC) on PCS systems. As performance metrics for systems with PCS, we compare information-theoretic measures such as mutual information (MI), generalized MI (GMI), and normalized GMI, which enable optimization and quantification of the information rate (IR) that can be achieved by PCS and FEC. We derive the optimal parameters of PCS and FEC that maximize the IR for both ideal and non-ideal PCS and FEC. To avoid plausible pitfalls in practice, we carefully revisit key assumptions that are typically made for ideal PCS and FEC systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Low-density parity-check codes
Gallager, R. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057683 · Cited by 10,602
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
Berrou, C., Glavieux, A., & Thitimajshima, P. (2002) · Proceedings of ICC '93 - IEEE International Conference on Communications · doi:10.1109/icc.1993.397441 · Cited by 6,738
Design of capacity-approaching irregular low-density parity-check codes
Richardson, T. J., Shokrollahi, M. A., & Urbanke, R. L. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910578 · Cited by 3,335
Convergence behavior of iteratively decoded parallel concatenated codes
ten Brink, S. (2001) · IEEE Transactions on Communications · doi:10.1109/26.957394 · Cited by 2,386
Capacity Limits of Optical Fiber Networks
Essiambre, R.-J., Kramer, G., Winzer, P. J., Foschini, G. J., & Goebel, B. (2010) · Journal of Lightwave Technology · doi:10.1109/jlt.2009.2039464 · Cited by 2,362
Self-citationNear Shannon limit performance of low density paritycheck codes
MacKay, D. J. C., & Neal, R. M. (1996) · Electronics Letters · doi:10.1049/el:19961141 · Cited by 1,923
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
Chung, S.-Y., Forney, G. D., Richardson, T. J., & Urbanke, R. (2001) · IEEE Communications Letters · doi:10.1109/4234.905935 · Cited by 1,539
Computation of channel capacity and rate-distortion functions
Blahut, R. (1972) · IEEE Transactions on Information Theory · doi:10.1109/tit.1972.1054855 · Cited by 1,381
Metadata
- Authors
- Cho, J., & Winzer, P. J.
- Venue
- Journal of Lightwave Technology
- Published
- 2019-03-15
- Volume
- 37
- Issue
- 6
- Pages
- 1590-1607
- ISSN
- 0733-8724 (ISSN-L)
- 1558-2213
- OpenAlex
- W2913859666
- Cited by
- 438
- References
- 24
- FWCI
- 17.45
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Probabilistic Constellation Shaping for Optical Fiber Communications. https://app.cochat.ai/papers/10.1109/jlt.2019.2898855
- The paper
- Cho, J., & Winzer, P. J. (2019). Probabilistic Constellation Shaping for Optical Fiber Communications. Journal of Lightwave Technology. https://doi.org/10.1109/jlt.2019.2898855
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
