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
On the use of ordered statistics decoders for low-density parity-check codes in space telecommand links
TL;DR: Despite its complexity may appear prohibitive in space applications, the MRB algorithm is shown to actually represent a realistic option for short LDPC codes, enabling significant gains over more conventional iterative algorithms.
Proceedings ArticleDOI
FPGA design of high throughput LDPC decoder based on imprecise Offset Min-Sum decoding
Truong Nguyen-Ly,Khoa Le,Fakhreddine Ghaffari,Alexandru Amaricai,Oana Boncalo,Valentin Savin,David Declercq +6 more
TL;DR: Two new LDPC decoding algorithms that may be seen as imprecise versions of the Offset Min-Sum (OMS) decoding are proposed: the Partially OMS, which performs only partially the offset correction, and the Imprecise Partially EMM decoding, which introduces a further level of impreciseness in the check-node processing unit.
Journal ArticleDOI
High-throughput and low-cost LDPC reconciliation for quantum key distribution
TL;DR: In this paper, an alternative high-throughput and high-efficiency solution implemented in low-cost CPU is proposed, where the main contribution is the design of a quantized LDPC decoder including improved RCBP-based check node processing and saturation-oriented variable node processing.
Journal ArticleDOI
A 3.0 Gb/s Throughput Hardware-Efficient Decoder for Cyclically-Coupled QC-LDPC Codes
TL;DR: A new class of quasi-cyclic low-density parity-check (QC-LDPC) codes, namely cyclically-coupled QC-LD PCs, and their RAM-based decoder architecture, which can achieve throughput and error performance as excellent as LDPC convolutional codes, but with much lower hardware requirements are proposed.
Journal ArticleDOI
An improved decoding algorithm for finite-geometry LDPC codes
TL;DR: An improved bit-flipping decoding algorithm for high-rate finite-geometry low-density parity-check (FG-LDPC) codes is proposed and shows improvement in performance and reduction in decoding delay.
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.