Reduced-Complexity Decoding Algorithm for LDPC Codes for Practical Circuit Implementation in Optical Communications

For superior, practical decoding of LDPC based FEC, a cyclic approximated delta-minimum algorithm is proposed. Simulation shows that 3-bit soft-decision decoding provides a required Q of 6.2 dB at 10-6 BER with only 16 iterations.

[1]  Bane V. Vasic,et al.  Iteratively decodable codes from orthogonal arrays for optical communication systems , 2005, IEEE Communications Letters.

[2]  Marc P. C. Fossorier,et al.  Shuffled iterative decoding , 2005, IEEE Transactions on Communications.

[3]  I.B. Djordjevic,et al.  Low-density parity check codes for long-haul optical communication systems , 2002, IEEE Photonics Technology Letters.

[4]  Matsumoto Wataru,et al.  Cyclic Approximated Min Algorithm , 2005 .

[5]  I.B. Djordjevic,et al.  Irregular low-density parity-check codes for long-haul optical communications , 2004, IEEE Photonics Technology Letters.

[6]  I. Djordjevic,et al.  Generalized low-density parity-check codes for optical communication systems , 2005, Journal of Lightwave Technology.

[7]  T. Mizuochi,et al.  Recent progress in forward error correction and its interplay with transmission impairments , 2006, IEEE Journal of Selected Topics in Quantum Electronics.