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 ArticleDOI

A Low-Complexity RS-SPC Product Coding Scheme for Optical Systems

TL;DR: In this paper , a product coding scheme based on binary images of Reed-Solomon (RS) codes and single-parity-check (SPC) codes was proposed for high-speed communications.

of single mode and Multimode QC-LDPC decoder using modified Belief Propagation Algorithm

M. V. Mankar
TL;DR: Partially parallel architecture for single mode and multi-mode quasi-cyclic low density parity check (QC-LDPC) decoders have been designed using modified belief propagation algorithm.
Posted Content

Generalized reliability-based syndrome decoding for LDPC codes

TL;DR: Simulation results demonstrate that the cascade connection of enhanced min-sum and OSD decodings outperforms the BP alone significantly, in terms of either performance or complexity.
Journal ArticleDOI

An analysis of optimal design conditions of LDPC decoder for IEEE 802.11n Wireless LAN Standard

TL;DR: The effects of LLR(Log-Likelihood Ratio) approximation on the performance of MSA(Min-Sum Algorithm)-based LDPC decoder are analyzed, and some optimal design conditions are derived.
Patent

Encoder, transmission device, and encoding method

村上 豊, +1 more
TL;DR: In this article, an encoder, a transmission device, and an encoding method with which the transmission amount is reduced and a deterioration in transmission efficiency is suppressed while improving reception quality when QC-LDPC or a like block encoding is used.
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)