Hidden Markov Model Decoding for LDPC Codes
Preprint
Abstract
The paper proposes an iterative Hidden Markov Model (HMM) for decoding a Low Density Parity Check (LDPC) code. It is demonstrated that a first-order HMM provides a natural framework for the decoder. The HMM is time-homogeneous with a fixed transition matrix and is based on a random walk through the encoded frame bits. Each hidden state contains a pair of two encoded bits, and parity checks are naturally incorporated into the observation model. The paper shows that by implementing a forward-backward smoothing estimator for the hidden states, decoding is efficient and requires only a small number of iterations in most cases. The results show that the LDPC decoding threshold is significantly improved compared to belief propagation (BP) on a Tanner graph. Numerical results are presented showing that LDPC codes under the proposed decoder yield a frame error rate (FER) and decoding threshold comparable to that of a Polar code where Successive Cancellation List (SCL) - Cyclic Redundancy Check (CRC) decoding is deployed. This is shown to be achieved even if the frame length is short (on the order of $512$ bits or less) and a regular LDPC code is used. 1
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Scalable Polar Code Construction for Successive Cancellation List Decoding: A Graph Neural Network-Based ApproachIEEE Transactions on Communications, 2023
- Construction of Polar Codes With Reinforcement LearningIEEE Transactions on Communications, 2021
- Threshold Saturation via Spatial Coupling: Why Convolutional LDPC Ensembles Perform So Well over the BECIEEE Transactions on Information Theory, 2011
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless ChannelsIEEE Transactions on Information Theory, 2009
- Modern Coding Theory2008
- Good error-correcting codes based on very sparse matricesIEEE Transactions on Information Theory, 1999
- Time-varying periodic convolutional codes with low-density parity-check matrixIEEE Transactions on Information Theory, 1999
- Turbo decoding as an instance of Pearl's "belief propagation" algorithmIEEE Journal on Selected Areas in Communications, 1998
- Unveiling turbo codes: some results on parallel concatenated coding schemesIEEE Transactions on Information Theory, 1996