On the reduced-complexity of LDPC decoders for ultra-high-speed optical transmission | Zendy

Ivan B. Djordjević | Zendy; Lei Xu | Zendy; Ting Wang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On the reduced-complexity of LDPC decoders for ultra-high-speed optical transmission

Author(s) -

Ivan B. Djordjević,

Lei Xu,

Ting Wang

Publication year - 2010

Publication title -

optics express

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.394

H-Index - 271

ISSN - 1094-4087

DOI - 10.1364/oe.18.023371

Subject(s) - low density parity check code , decoding methods , computer science , algorithm , coding (social sciences) , transmission (telecommunications) , computational complexity theory , modulation (music) , forward error correction , mathematics , physics , telecommunications , statistics , acoustics

We propose two reduced-complexity (RC) LDPC decoders, which can be used in combination with large-girth LDPC codes to enable ultra-high-speed serial optical transmission. We show that optimally attenuated RC min-sum sum algorithm performs only 0.46 dB (at BER of 10(-9)) worse than conventional sum-product algorithm, while having lower storage memory requirements and much lower latency. We further study the use of RC LDPC decoding algorithms in multilevel coded modulation with coherent detection and show that with RC decoding algorithms we can achieve the net coding gain larger than 11 dB at BERs below 10(-9).

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research