Abstract

The applications of rate-compatible low-density parity-check (RC-LDPC) codes are investigated for a 16 quadrature amplitude modulation (16QAM) signal and coherent detection system. With rate-compatible signals, we can provide the flexible net data rate between 135.5 Gb/s and 169.7 Gb/s in a passive optical network (PON) link. Based on the LDPC codes defined in the IEEE 802.3ca standard, we construct two sets of RC-LDPC codes with a fixed and variable information bit length. Since the puncturing operation may degrade the performance of LDPC codes, we apply the protograph-based extrinsic information transfer (PEXIT) technique to optimize the puncturing positions to mitigate the degradation. Additionally, we explore four low-complexity LDPC decoding algorithms (min sum, offset min sum, variable weight min sum, and relaxed min sum with 2 nd min emulation) to investigate the relationship between the computational complexity and decoding performance. Simulation results indicate that the constructed codewords exhibit good performance in the waterfall region across a range of code rates. Finally, we conduct an experimental setup in a dual-polarization 25 GBaud 16QAM coherent PON to verify the effectiveness of the constructed LDPC codes with four decoding algorithms. The experimental results show maximal 4.8 dB receiver sensitivity differences, which demonstrate the feasibility of the method for constructing RC-LDPC codes in future high-speed flexible coherent PON.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.