Results 1 to 10 of about 1,239,425 (219)
Check-Belief Propagation Decoding of LDPC Codes [PDF]
Variant belief propagation (BP) algorithms are applied to low-density parity-check (LDPC) codes. However, conventional decoders suffer from a large resource consumption due to gathering messages from all the neighbour variable-nodes and/or check-nodes through cumulative calculations. In this paper, a check-belief propagation (CBP) decoding algorithm is
Wu Guan, Liping Liang
exaly +5 more sources
Exploiting degeneracy in belief propagation decoding of quantum codes [PDF]
Quantum information needs to be protected by quantum error-correcting codes due to imperfect physical devices and operations. One would like to have an efficient and high-performance decoding procedure for the class of quantum stabilizer codes.
Kao-Yueh Kuo, Ching-Yi Lai
doaj +4 more sources
Efficient Decoding of Turbo Codes with Nonbinary Belief Propagation [PDF]
This paper presents a new approach to decode turbo codes using a nonbinary belief propagation decoder. The proposed approach can be decomposed into two main steps.
Thierry Lestable +2 more
doaj +8 more sources
Adaptive Learned Belief Propagation for Decoding Error-Correcting Codes [PDF]
Weighted belief propagation (WBP) for the decoding of linear block codes is considered. In WBP, the Tanner graph of the code is unrolled with respect to the iterations of the belief propagation decoder.
Alireza Tasdighi, Mansoor Yousefi
doaj +3 more sources
Topological codes, a kind of quantum error correction code, have been used for current quantum computers due to their local qubit layout and high threshold.
Tzu-Hsuan Huang +2 more
doaj +2 more sources
Belief Propagation List Decoding of Polar Codes [PDF]
We propose a belief propagation list (BPL) decoder with comparable performance to the successive cancellation list (SCL) decoder of polar codes, which already achieves the maximum likelihood (ML) bound of polar codes for sufficiently large list size $L$.
Sebastian Cammerer +2 more
exaly +3 more sources
An Efficient Two-Stage Decoding Scheme for LDPC-CRC Concatenated Codes [PDF]
In modern communication systems, the concatenation of a low-density parity-check (LDPC) code with a cyclic redundancy check (CRC) code is commonly used for error correction.
Lingjun Kong +3 more
doaj +2 more sources
Reduced-Complexity Belief Propagation Decoding for LDPC Codes
Two methods are proposed to reduce the complexity of the belief propagation (BP) decoding for low-density parity-check (LDPC) codes, with the focus on the layered decoding for quasi-cyclic LDPC (QC-LDPC) codes.
Heping Wan +3 more
doaj +3 more sources
Pruning Neural Belief Propagation Decoders [PDF]
This work was presented at the IEEE International Symposium on Information Theory (ISIT ...
Andreas Buchberger +4 more
openaire +3 more sources
Generalized Belief Propagation Algorithms for Decoding of Surface Codes [PDF]
Belief propagation (BP) is well-known as a low complexity decoding algorithm with a strong performance for important classes of quantum error correcting codes, e.g.
Josias Old, Manuel Rispler
doaj +1 more source

