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
Book ChapterDOI
Reliability Issues in Flash-Memory-Based Solid-State Drives: Experimental Analysis, Mitigation, Recovery
TL;DR: This chapter describes several mitigation and recovery techniques, including cell-to-cell interference mitigation; optimal multi-level cell sensing; error correction using state-of-the-art algorithms and methods; and data recovery when error correction fails.
Journal ArticleDOI
Edge-Based Dynamic Scheduling for Belief-Propagation Decoding of LDPC and RS Codes
TL;DR: This paper presents two low-complexity edge-based scheduling schemes, referred to as the e-Flooding and e-Shuffled schedules, for the belief-propagation (BP) decoding of low-density parity-check and Reed–Solomon codes, and shows that these schemes reduce the BP decoding complexity by more than 90% compared with the prior-art BP schedules.
Proceedings ArticleDOI
GPU accelerated scalable parallel decoding of LDPC codes
TL;DR: A flexible low-density parity-check (LDPC) decoder which leverages graphic processor units (GPU) to provide high decoding throughput and a scalable multi-codeword decoding scheme to fully utilize the computation resources of GPU is proposed.
Proceedings ArticleDOI
Low complexity decoding of finite geometry LDPC codes
Zhenyu Liu,Dimitris A. Pados +1 more
TL;DR: In this paper, a low complexity algorithm for decoding low-density parity-check (LDPC) codes was proposed for finite geometry LDPC codes, where the decoding procedure updates the hard-decision received vector iteratively in search of a valid codeword in the vector space.
Proceedings ArticleDOI
On the Addition of an Input Buffer to an Iterative Decoder for LDPC Codes
M. Rovini,Alfonso Martinez +1 more
TL;DR: Analysis and simulations are presented using the decoder for the next generation satellite digital video broadcasting (DVB-S2) as a case study, to show that the throughput may be doubled with only two extra buffer locations, at almost no cost in chip area.
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.