scispace - formally typeset
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

Content maybe subject to copyright    Report

Citations
More filters
Journal Article

Error Correcting Codes in Wireless Sensor Networks: An Energy Perspective

TL;DR: A survey paper to provide reference of existing work on ECCs in WSN and help scholars find a standard ECC for WSNs, which can identify the code that would be suitable for a particular implementation strategy.
Proceedings ArticleDOI

A parallel-routing network for reliability inferences of single-parity-check decoder

TL;DR: A parallel-routing network has been developed, which is compared to the state-of-art structure, exploring the best of its parallel nature for an improved timing performance and assures that the proposed structure has no degradation in neither computation accuracy nor hardware complexity.
Patent

Transmission method, transmission apparatus, reception method and reception apparatus

TL;DR: In this paper, all data symbols used in data transmission of a modulated signal are precoded by hopping between precoding matrices so that the precoding matrix used to precode each data symbol and the prec coding matrix that are adjacent to the data symbol in the frequency domain and the time domain all differ.
Patent

Coding method, decoding method, coder, and decoder

TL;DR: In this article, the first parity check matrix corresponds to a low density parity check (LDPC) convolutional code that uses a plurality of parity check polynomials, and the second matrix is generated by performing at least one of row permutation and column permutation on the first matrix.
Proceedings ArticleDOI

An efficient early stopping scheme for LDPC decoding based on check-node messages

TL;DR: An efficient early stopping method to reduce the average number of iterations for low density parity check (LDPC) decoders based on the estimation of the log-likelihood ratio (LLR) messages of the check nodes.
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.
Related Papers (5)