18 February 2011 On the reduced-complexity of LDPC decoders for beyond 400 Gb/s serial optical transmission
Author Affiliations +
Proceedings Volume 7988, Optical Transmission Systems, Switching, and Subsystems VIII; 79881G (2011); doi: 10.1117/12.888344
Event: Asia Communications and Photonics Conference and Exhibition, 2010, Shanghai, Shanghai, China
Abstract
Two reduced-complexity (RC) LDPC decoders are proposed, which can be used in combination with large-girth LDPC codes to enable beyond 400 Gb/s serial optical transmission. We show that optimally attenuated RC min-sum sum algorithm performs only 0.45 dB worse than conventional sum-product algorithm, while having lower storage memory requirements and much lower latency. We further evaluate the proposed algorithms for use in beyond 400 Gb/s serial optical transmission in combination with PolMUX 32-IPQ-based signal constellation and show that low BERs can be achieved for medium optical SNRs, while achieving the net coding gain above 11.4 dB.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ivan B. Djordjevic, Lei Xu, Ting Wang, "On the reduced-complexity of LDPC decoders for beyond 400 Gb/s serial optical transmission", Proc. SPIE 7988, Optical Transmission Systems, Switching, and Subsystems VIII, 79881G (18 February 2011); doi: 10.1117/12.888344; https://doi.org/10.1117/12.888344
PROCEEDINGS
6 PAGES


SHARE
KEYWORDS
Transmittance

Computer programming

Signal attenuation

Modulation

Polarization

Signal to noise ratio

Monte Carlo methods

RELATED CONTENT


Back to Top