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
Simplified Method for Log-Likelihood Ratio Approximation in High-Order Modulations Based on the Voronoi Decomposition
TL;DR: A novel simplified scheme is presented that greatly reduces the complexity of the LLR demapper at high-order PSK and APSK modulations compared to the Max-Log-MAP soft-demapper and has a negligible overall system performance loss.
Posted Content
The Potential of Quantum Annealing for Rapid Solution Structure Identification
TL;DR: This work provides new insights into the computation properties of quantum annealing and suggests that this model has an uncanny ability to avoid local minima and quickly identify the structure of high-quality solutions.
Journal Article
High-Performance and Low-Complexity Decoding of High-Weight LDPC Codes
TL;DR: The proposed DAPS (Delay-Aware Packet Scheduling) algorithm is proposed to consider QoS requirements of delays for various traffic classes as well as channel condition and fairness to reflect delay experiences at scheduling instance.
Dissertation
Compound codes based on irregular graphs and their iterative decoding.
TL;DR: A new class of codes called Generalized Irregular Low-Density (GILD) parity-check codes are introduced, which are adapted from the previously known class of Generalized Low- Density (GLD) codes, which have a significant advantage over GLD codes in terms of encoding and decoding complexity.
Journal ArticleDOI
Channel Noise Optimization of Polar Codes Decoding Based on a Convolutional Neural Network
Ming Yan,Xingrui Lou,Yan Wang +2 more
TL;DR: In this article, a channel noise optimized decoding scheme based on a convolutional neural network (CNN) was proposed to suppress the colored channel noise and significantly improve the decoding gain compared with the traditional BP decoding algorithm.
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.