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
Proceedings ArticleDOI
Enhanced min-sum decoding for DVB-T2 LDPC codes
TL;DR: An enhanced min-sum decoding algorithm for DVB-T2 LDPC codes is proposed by two step approximation of the function ln cosh(x) on the sum-product algorithm, which shows better performance than conventional min-Sum algorithm and its modifications.
Proceedings ArticleDOI
An adaptive weighted multibit-flipping algorithm for decoding LDPC codes
Tso-Cho Chen,Kuan-Liang Lin +1 more
TL;DR: An adaptive weighted multibit-flipping (AWMBF) decoding algorithm which flips multiple bits in each iteration is proposed for low-density parity-check (LDPC) codes and achieves a good tradeoff between performance and complexity.
Proceedings Article
Intensity reflection coefficient based Min-Sum decoding for Low Density Parity Check Codes
Md. Moshiur Rahman Farazi,Mohammad Rakibul Islam,Khandaker Sultan Mahmood,Md. Farhan Tasnim Oshim +3 more
TL;DR: In this article, a modified version of the standard Min-Sum (MS) algorithm for decoding LDPC codes is presented, which is done by introducing a factor, intensity reflection coefficient (IRC) in the check to bit node updating process.
Dissertation
Iterative Decoding Beyond Belief Propagation of Low-Density Parity-Check Codes
TL;DR: Dans cette these nous introduisons un nouveau paradigme pour ledecodage iteratif a precision finie des codes LDPC sur le canalbinaire symetrique, sontcapables de surpasser l'algorithme BP dans the region du plancherd'erreur.
Proceedings ArticleDOI
A Low-Complexity Layered Decoding Algorithm for LDPC Codes
Wang Zhongxun,Mu Qing +1 more
TL;DR: A Low-complexity Layered Decoding Algorithm for LDPC Codes is proposed that reduces the number of operations in variable nodes to lower LDPC decoder power consumption and comparison results show that comparing with SPA and MSA, the algorithm reducing theNumber of operations nearly to 60% with little performance loss.
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.