Reduced-Complexity Decoding Algorithm for LDPC Codes for Practical Circuit Implementation in Optical Communications
- 1 March 2007
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Recent progress in forward error correction and its interplay with transmission impairmentsIEEE Journal of Selected Topics in Quantum Electronics, 2006
- Iteratively decodable codes from orthogonal arrays for optical communication systemsIEEE Communications Letters, 2005
- Generalized low-density parity-check codes for optical communication systemsJournal of Lightwave Technology, 2005
- Shuffled Iterative DecodingIEEE Transactions on Communications, 2005
- Irregular Low-Density Parity-Check Codes for Long-Haul Optical CommunicationsIEEE Photonics Technology Letters, 2004
- Low-density parity check codes for long-haul optical communication systemsIEEE Photonics Technology Letters, 2002