Improved Generalized Automorphism Belief Propagation Decoding [PDF]
With the increasing demands on future wireless systems, new design objectives become eminent. Low-density parity-check codes together with belief propagation (BP) decoding have outstanding performance for large block lengths. Yet, for future wireless systems, good decoding performance for short block lengths is mandatory, a regime in which BP decoding ...
Mandelbaum, Jonathan +4 more
semanticscholar +8 more sources
Bounds on the performance of belief propagation decoding [PDF]
Summary: We consider Gallager's (1963) soft-decoding (belief propagation) algorithm for decoding low-density parity-check (LDPC) codes, when applied to an arbitrary binary-input symmetric-output channel. By considering the expected values of the messages, we derive both lower and upper bounds on the performance of the algorithm.
David Burshtein, Gadi Miller
openaire +4 more sources
Improved Belief Propagation Decoding Algorithms for Surface Codes [PDF]
Quantum error correction is crucial for universal fault-tolerant quantum computing. Highly accurate and low-time-complexity decoding algorithms play an indispensable role in ensuring quantum error correction works effectively.
Jiahan Chen +3 more
doaj +2 more sources
Low Complexity Early Stopping Belief Propagation Decoder for Polar Codes
Belief propagation is one of low latency decoding algorithms for polar codes but it requires relatively high decoding complexity due to its inherent iterative decoding nature.
Chungsu Lee +3 more
doaj +2 more sources
Residual-Decaying-Based Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
Belief-propagation (BP) algorithm and its variants are well-established methods for iterative decoding of LDPC codes. Among them, residual belief-propagation (RBP), which is the most primitive and representative informed dynamic scheduling (IDS) strategy,
Huilian Zhang, Shaoping Chen
doaj +2 more sources
Low‐complexity bound on irregular LDPC belief‐propagation decoding thresholds using a Gaussian approximation [PDF]
Since irregular low-density parity-check (LDPC) codes are known to perform better than regular ones, and to exhibit, like them, the so-called ‘threshold phenomenon’, this Letter investigates a low-complexity upper bound on belief-propagation decoding ...
F. Vatta, A. Soranzo, F. Babich
semanticscholar +2 more sources
Quantum-enhanced belief propagation for LDPC decoding
Decoding low-density parity-check codes is critical in many current technologies, such as fifth-generation (5G) wireless networks and satellite communications. The belief propagation algorithm allows for fast decoding due to the low density of these codes. However, there is scope for improvement to this algorithm both in terms of its computational cost
Sheila M. Perez-Garcia, Ashley Montanaro
openaire +4 more sources
Derived dynamic scheduling for belief propagation decoding of LDPC codes
Among numerous dynamic scheduling strategies for low‐density parity‐check codes, many of them are of high complexity due to repetitive computation and ordering of belief residuals.
Xiaotian Xu, Hua Zhou, Jiayi Zhao
doaj +2 more sources
Factor Graph Optimization of Error-Correcting Codes for Belief Propagation Decoding
The design of optimal linear block codes capable of being efficiently decoded is of major concern, especially for short block lengths. As near capacity-approaching codes, Low-Density Parity-Check (LDPC) codes possess several advantages over other ...
Yoni Choukroun, Lior Wolf
semanticscholar +2 more sources
Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation [PDF]
Quantum low-density parity-check (QLDPC) codes have emerged as a promising technique for quantum error correction. A variety of decoders have been proposed for QLDPC codes and many utilize belief propagation (BP) decoding in some fashion.
Hanwen Yao +4 more
semanticscholar +1 more source

