Analysis and Design of Binary Message Passing Decoders
- 29 December 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 60 (3) , 601-607
Abstract
Binary message passing decoders for low-density parity-check codes are studied by using extrinsic information transfer charts. The channel delivers hard or soft decisions and the variable node decoder performs all computations in the log-likelihood ratio (L-value) domain. A hard decision results in the Gallager B algorithm and examples show that increasing the channel output alphabet to two bits gains more than 1.0 dB in signal to noise ratio when using optimized codes. Finally, it is shown that errors on cycles consisting only of degree two and three variable nodes cannot be corrected and a necessary and sufficient condition for the existence of a cycle-free subgraph is derived.Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC CodesIEEE Transactions on Information Theory, 2009
- Modern Coding Theory2008
- EXIT Chart Analysis of Binary Message-Passing Decoders2007
- Extrinsic information transfer functions: model and erasure channel propertiesIEEE Transactions on Information Theory, 2004
- Designing irregular LPDC codes using EXIT charts based on message error rate2003
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Efficient erasure correcting codesIEEE Transactions on Information Theory, 2001
- Which codes have cycle-free Tanner graphs?IEEE Transactions on Information Theory, 1999
- Convergence of iterative decodingElectronics Letters, 1999
- Precise structural information for transient enzyme-substrate complexes by a combined x-ray crystallographic-resonance Raman spectroscopic approachBiochemistry, 1982