Multiple-Bases Belief-Propagation Decoding of High-Density Cyclic Codes
arXiv:0905.0079 · doi:10.1109/TCOMM.2010.01.070468
Abstract
We introduce a new method for decoding short and moderate length linear block codes with dense parity-check matrix representations of cyclic form, termed multiple-bases belief-propagation (MBBP). The proposed iterative scheme makes use of the fact that a code has many structurally diverse parity-check matrices, capable of detecting different error patterns. We show that this inherent code property leads to decoding algorithms with significantly better performance when compared to standard BP decoding. Furthermore, we describe how to choose sets of parity-check matrices of cyclic form amenable for multiple-bases decoding, based on analytical studies performed for the binary erasure channel. For several cyclic and extended cyclic codes, the MBBP decoding performance can be shown to closely follow that of maximum-likelihood decoders.
This full paper accompanies a letter submitted to "IEEE Transactions on Communications". It is intended to provide detailed information for interested readers of the letter. 24 pages, 6 figures
Cited by in corpus (10)
- Code Design for Short Blocks: A Survey
- Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries
- Decoding Short LDPC Codes via BP-RNN Diversity and Reliability-Based Post-Processing
- Moderate-Density Parity-Check Codes
- Low-complexity Near-optimum Symbol Detection Based on Neural Enhancement of Factor Graphs
- Efficient Error-Correcting Codes in the Short Blocklength Regime
- MBBP for improved iterative channel decoding in 802.16e WiMAX systems
- What Can Machine Learning Teach Us about Communications?
- New Two-Stage Automorphism Group Decoders for Cyclic Codes in the Erasure Channel
- Structured sublinear compressive sensing via belief propagation