Results 41 to 50 of about 1,107,982 (188)
Exploiting degeneracy in belief propagation decoding of quantum codes
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 +1 more source
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 +1 more source
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 +1 more source
Benefits and pitfalls of belief-propagation-mediated superparamagnetic clustering.
Belief propagation is a candidate for the accelerated evaluation of statistical averages if compared to Monte Carlo approaches. We show that superparamagnetic clustering can be accelerated substantially by means of belief propagation.
Stoop R, Ott T
core +1 more source
Efficient Decoding of Turbo Codes with Nonbinary Belief Propagation
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 +2 more sources
Anytime Exact Belief Propagation
Statistical Relational Models and, more recently, Probabilistic Programming, have been making strides towards an integration of logic and probabilistic reasoning. A natural expectation for this project is that a probabilistic logic reasoning algorithm reduces to a logic reasoning algorithm when provided a model that only involves 0-1 probabilities ...
Gabriel Azevedo Ferreira +3 more
openaire +2 more sources
Dependency parsing by belief propagation [PDF]
We formulate dependency parsing as a graphical model with the novel ingredient of global constraints. We show how to apply loopy belief propagation (BP), a simple and effective tool for approximate learning and inference. As a parsing algorithm, BP is both asymptotically and empirically efficient.
David A. Smith, Jason Eisner
openaire +2 more sources
Propagating belief functions in AND-trees [PDF]
We describe a simple method for propagating belief functions in AND-trees. We exploit the properties of AND-trees to make our method simpler than the general method discussed by Shenoy and Shafer, and Dempster and Kong. We illustrate our method for aggregation of evidence in a financial audit. © 1995 John Wiley & Sons, Inc.
Rajendra P. Srivastava +2 more
openaire +2 more sources
A Novel Variable-Order Threshold Serial Belief Propagation-Based Decoding Algorithm for LT Codes
The belief propagation (BP) algorithm is a widely adopted iterative decoding method for Luby transform (LT) codes. However, the conventional log-likelihood ratio BP (LLR-BP) decoder exhibits inherent limitations in additive white Gaussian noise (AWGN ...
Weibai Sun +3 more
doaj +1 more source

