Journal ArticleDOI
Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
Reads0
Chats0
TLDR
Two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed, which greatly simplifies the decoding complexity of belief propagation.Abstract:
Two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed. Both versions are implemented with real additions only, which greatly simplifies the decoding complexity of belief propagation in which products of probabilities have to be computed. Also, these two algorithms do not require any knowledge about the channel characteristics. Both algorithms yield a good performance-complexity trade-off and can be efficiently implemented in software as well as in hardware, with possibly quantized received values.read more
Citations
More filters
Journal ArticleDOI
Two bit-flipping decoding algorithms for low-density parity-check codes
TL;DR: Improvements are described, namely an extension to soft-decision decoding and a loop detection mechanism for low-density paritycheck (LDPC) codes, which offer excellent performances at smaller complexity.
Journal ArticleDOI
Applicability of n-vicinity method for calculation of free energy of Ising model
TL;DR: In this paper, the authors apply the n -vicinity method of approximate calculation of the partition function to an Ising Model with the nearest neighbor interaction on D-dimensional hypercube lattice.
Journal ArticleDOI
A Split-Decoding Message Passing Algorithm for Low Density Parity Check Decoders
Tinoosh Mohsenin,Bevan M. Baas +1 more
TL;DR: A Split decoding algorithm is proposed which divides each row of the parity check matrix into two or multiple nearly-independent simplified partitions which significantly reduces the wire interconnect and decoder complexity and therefore results in fast, small, and high energy efficiency circuits.
Posted Content
Pruning and Quantizing Neural Belief Propagation Decoders
Andreas Buchberger,Christian Häger,Henry D. Pfister,Laurent Schmalen,Alexandre Graell i Amat +4 more
TL;DR: This work proposes a novel decoding approach based on neural belief propagation (NBP) decoding recently introduced by Nachmani et al. in which a different parity-check matrix is allowed in each iteration of the algorithm.
Proceedings ArticleDOI
LDPC decoder area, timing, and energy models for early quantitative hardware cost estimates
Matthias Korb,Tobias G. Noll +1 more
TL;DR: Generic silicon area, iteration period, and energy cost models of high-throughput LDPC decoders are derived and can be used for a fair benchmarking of the implemented decoder.
References
More filters
Book
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
TL;DR: Probabilistic Reasoning in Intelligent Systems as mentioned in this paper is a complete and accessible account of the theoretical foundations and computational methods that underlie plausible reasoning under uncertainty, and provides a coherent explication of probability as a language for reasoning with partial belief.
Book
Low-Density Parity-Check Codes
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
Journal ArticleDOI
Good error-correcting codes based on very sparse matrices
TL;DR: It is proved that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit, and experimental results for binary-symmetric channels and Gaussian channels demonstrate that practical performance substantially better than that of standard convolutional and concatenated codes can be achieved.
Journal ArticleDOI
A recursive approach to low complexity codes
TL;DR: It is shown that choosing a transmission order for the digits that is appropriate for the graph and the subcodes can give the code excellent burst-error correction abilities.
Journal ArticleDOI
Near Shannon limit performance of low density parity check codes
TL;DR: The authors report the empirical performance of Gallager's low density parity check codes on Gaussian channels, showing that performance substantially better than that of standard convolutional and concatenated codes can be achieved.