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
Posted Content
AI for 5G: Research Directions and Paradigms
TL;DR: This study focuses on providing design paradigms including 5G network optimization, optimal resource allocation, 5G physical layer unified acceleration, end-to-end physical layer joint optimization, and so on based on an understanding of the key technologies in 5G.
Patent
DSL modem utilizing low density parity check codes
TL;DR: A DSL modem with a receiver (40) and a transmitter (30) includes an LPDC (54) encoder which utilizes a generation matrix G which is derived from a substantially deterministic H matrix in order to generate redundant parity bits for a block of bits as discussed by the authors.
Journal ArticleDOI
Two-dimensional correction for min-sum decoding of irregular LDPC codes
TL;DR: Two-dimensional (2-D) correction schemes are proposed to improve the performance of conventional min-sum (MS) decoding of irregular low density parity check codes and the proposed method provides a comparable performance as belief propagation (BP) decoding while requiring less complexity.
Lambda-Min Decoding Algorithm of Regular and Irregular LDPC Codes
TL;DR: A new algorithm, named λ−Min algorithm, for updating extrinsic information is proposed, which offers different trade-off performance versus complexity between the belief propagation algorithm and the universal most powerful BP-based algorithm.
Journal ArticleDOI
Reduced-complexity decoding algorithm for low-density parity-check codes
TL;DR: A new reduced-complexity decoding algorithm for low-density parity-check codes that operates entirely in the log-likelihood domain is presented.
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.