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 Adaptive Normalized Min-Sum Algorithm for Layered Scheduling of 5G-NR LDPC codes
Ziqi Zhou,Kewu Peng,Aleksei Krylov,Andrey Rashich,Dmitry Tkachenko,Fengshuang Li,Chao Zhang,Jian Song +7 more
TL;DR: In this article, a new simplification method where the sub-groups with similar fitting functions of normalization factors are incorporated into the same type, and enhanced adaptive normalized min-sum algorithm (enhanced ANMSA) for layered scheduling is further proposed for the implementation of 5G-NR LDPC codes.
Proceedings ArticleDOI
Scaling design parameters on the overall performance of Spatially-Coupled LDPC codes
Codes on Graphs and Analysis of Iterative Algorithms for Reconstructing Sparse Signals and Decoding of Check-Hybrid GLDPC Codes
TL;DR: The Interval-Passing Algorithm: Reconstruction Analysis and Numerical Results and An Introduction to Compressed Sensing are presented.
Design exploration of faster than Nyquist equalizer system
TL;DR: This thesis proposes a hardware architecture that implement an FTN decoder system that consists of a Maximum A-posteriori (MAP) equalizer and low-density parity (LDPC) decoder that work together iteratively to mitigate ISI noise and channel noise.
Patent
Construction and Use of Shortened Eg-Idpc Codes
TL;DR: In this paper, code shortening techniques are used to achieve a variety of code lengths and code rates for Euclidean geometry low density parity check (EG-LDPC) codes, and the code rates of these codes are analyzed.
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.