2026· IEEE Transactions on Communications· Vol 74, pp. 12320-12335· 1 citation· 57 references
Computer Science
TL;DR
Simulation results demonstrate that the proposed GE-free BP-LCGCD significantly outperforms standard BP, achieves FER closely approaching that of GE-based BP-OSD, and approaches the finite-length bound across multiple code rates for 5G LDPC codes, while requiring a significantly smaller number of re-encodings and eliminating the need for online GE.
Abstract
In this paper, we propose a two-stage belief-propagation ordered statistics decoding (BP-OSD)-like algorithm, hereafter referred to as BP-LCGCD, tailored to 5G low-density parity-check (LDPC) codes. When standard BP decoding fails, a modified BP (mBP) with an iteration limit determined by the code’s girth and a normalization factor $\alpha $ is performed to generate reliable posterior log-likelihood ratios (LLRs) in the pre-processing stage. In the post-processing stage, a locally constrained guessing codeword decoding (LC-GCD) module uses these posterior LLRs from the mBP to efficiently produce candidate codewords without any online Gaussian elimination (GE), where numerous invalid test error patterns are skipped by the introduced local constraints. To predict the decoding performance, we derive an upper bound on FER and employ a saddlepoint method to approximate its dominant tail-probability term, resulting in a semi-analytical FER prediction. Furthermore, we propose to design the second-stage LC-GCD to match the non-uniform posterior reliability profile induced by the BP-like preprocessing stage. To this end, an offline quasi-reliable re-encoding basis is constructed for 5G LDPC codes, where protograph EXIT-chart analysis is used to identify highly reliable variable-node positions. Simulation results demonstrate that the proposed GE-free BP-LCGCD significantly outperforms standard BP, achieves FER closely approaching that of GE-based BP-OSD, and approaches the finite-length bound across multiple code rates for 5G LDPC codes, while requiring a significantly smaller number of re-encodings and eliminating the need for online GE.
In this paper, we propose a novel design method for the lookup tables (LUTs) of the minimum reconstruction, computation, and quantization (min-RCQ) LDPC code decoding algorithm. The proposed design method uses Bayesian optimization and samples from a subspace of the design space. The novel design method does not requir...
Alexander von Bank, Oliver Griebel, Eike-Manuel Edelmann et al.· 0 citations
This work casts decoding as a search over an absorbing-state discrete diffusion model, whose sequential commitment of coordinates turns generation into a tree, and runs a probability beam search over it, and builds a decoder that does both.
A parallel decoder for quantum low-density parity-check codes based on probabilistic bits (p-bits), tunable stochastic binary units controlled by local fields, which establishes constraint-annealed p-bit dynamics as a competitive stochastic alternative for QLDPC decoding and motivate further study of hardware-native im...
Mert Gökduman, Cyril Guyot, H. Pfister· 0 citations
We introduce a diffusion framework for neural decoding of error-correcting codes (ECCs). We interpret decoding as a conditional diffusion process that progressively predicts codeword bits while treating the physical channel observation as fixed side information. At each stage, a neural model estimates bitwise posterior...
The number of Tesseract search nodes expanded is reduced by up to more than two orders of magnitude at low physical error rates, while the logical error rate remains close to that of Tesseract.
Sana Javed, F. García-Herrero, B. Vasic et al.· 0 citations
We propose two new decoding algorithms for low-density parity-check (LDPC) codes. The Consensus and Return residual belief propagation (C&R-RBP) algorithm reduces the number of iterations required to achieve a target decoding error rate over an AWGN channel by exploiting the availability of updated information, thereby...
A. E. Feitosa, R. D. de Lamare· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.