4.7 Article

Perturbed Adaptive Belief Propagation Decoding for High-Density Parity-Check Codes

Journal

IEEE TRANSACTIONS ON COMMUNICATIONS
Volume 69, Issue 4, Pages 2065-2079

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCOMM.2020.3047085

Keywords

Decoding; Dynamic scheduling; Iterative decoding; Reliability; Ultra reliable low latency communication; Heuristic algorithms; Product codes; Adaptive belief propagation (ABP); high-density prity-check (HDPC) codes; Reed-Solomon (RS) codes; Bose-Chaudhuri-Hocquenghem (BCH) codes; product codes; ultra-reliable low-latency communications (URLLC)

Funding

  1. Natural Science Foundation of China [61671128]
  2. Sichuan Key Research and Development Project [2019YFG0105]
  3. Guangxi Natural Science Foundation [2018GXNSFAA281161]
  4. Guangxi Education Department Youth Science Foundation [2019KY0796]
  5. Temasek Laboratories@NTU Signal Research Programme [DSOCL17187]

Ask authors/readers for more resources

This article introduces enhancements to traditional adaptive belief propagation (ABP) decoding technique for high-density parity-check (HDPC) algebraic codes, aiming to improve performance by incorporating unstable bits with large LLRs and applying partial layered scheduling or hybrid dynamic scheduling. Simulation results demonstrate that the proposed Perturbed ABP (P-ABP) decoding algorithms lead to improved error correction performances and faster convergence rates compared to prior-art ABP variants.
Algebraic codes such as BCH code are receiving renewed interest as their short block lengths and low/no error floors make them attractive for ultra-reliable low-latency communications (URLLC) in 5G wireless networks. This article aims at enhancing the traditional adaptive belief propagation (ABP) decoding, which is a soft-in-soft-out (SISO) decoding for high-density parity-check (HDPC) algebraic codes, such as Reed-Solomon (RS) codes, Bose-Chaudhuri-Hocquenghem (BCH) codes, and product codes. The key idea of traditional ABP is to sparsify certain columns of the parity-check matrix corresponding to the least reliable bits with small log-likelihood-ratio (LLR) values. This sparsification strategy may not be optimal when some bits have large LLR magnitudes but wrong signs. Motivated by this observation, we propose a Perturbed ABP (P-ABP) to incorporate a small number of unstable bits with large LLRs into the sparsification operation of the parity-check matrix. In addition, we propose to apply partial layered scheduling or hybrid dynamic scheduling to further enhance the performance of P-ABP. Simulation results show that our proposed decoding algorithms lead to improved error correction performances and faster convergence rates than the prior-art ABP variants.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available