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
Density Evolution and Functional Threshold for the Noisy Min-Sum Decoder
TL;DR: It is shown that, in some particular cases, the noise introduced by the device can help the min-sum decoder to escape from fixed points attractors and may actually result in an increased correction capacity with respect to the noiseless decoder.
Patent
Encoding method, decoding method
TL;DR: In this paper, the first parity check matrix corresponds to a low-density parity check (LDPC) convolutional code using a plurality of parity check polynomials.
Journal ArticleDOI
Wireless Cooperative Video Coding Using a Hybrid Digital–Analog Scheme
Lei Yu,Houqiang Li,Weiping Li +2 more
TL;DR: A cooperative joint source-channel coding scheme that is based on hybrid digital-analog coding and integrates the advantages of digital coding and analog coding that is very suitable for wireless cooperative/noncooperative video broadcast/multicast transmission and cooperative/ noncooperative mobile video applications.
Proceedings ArticleDOI
Area, throughput, and energy-efficiency trade-offs in the VLSI implementation of LDPC decoders
TL;DR: An overview of the state-of-the-art in the design of LDPC decoders using digital integrated circuits is provided and the different architectures and their connection to different codes and requirements are analyzed.
Patent
ASIP architecture for executing at least two decoding methods
TL;DR: In this paper, a system for execution of a decoding method is disclosed, which is capable of executing at least two data decoding methods which are different in underlying coding principle, wherein at least one data decoding method requires data shuffling operations on the data.
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.