Journal ArticleDOI
Reduced-complexity decoding of LDPC codes
Reads0
Chats0
TLDR
The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from performance, latency, computational-complexity, and memory-requirement perspectives.Abstract:
Various log-likelihood-ratio-based belief-propagation (LLR-BP) decoding algorithms and their reduced-complexity derivatives for low-density parity-check (LDPC) codes are presented. Numerically accurate representations of the check-node update computation used in LLR-BP decoding are described. Furthermore, approximate representations of the decoding computations are shown to achieve a reduction in complexity by simplifying the check-node update, or symbol-node update, or both. In particular, two main approaches for simplified check-node updates are presented that are based on the so-called min-sum approximation coupled with either a normalization term or an additive offset term. Density evolution is used to analyze the performance of these decoding algorithms, to determine the optimum values of the key parameters, and to evaluate finite quantization effects. Simulation results show that these reduced-complexity decoding algorithms for LDPC codes achieve a performance very close to that of the BP algorithm. The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from performance, latency, computational-complexity, and memory-requirement perspectives.read more
Citations
More filters
Journal ArticleDOI
Decoding Algorithms for Nonbinary LDPC Codes Over GF $(q)$
TL;DR: This letter addresses the problem of decoding nonbinary low-density parity-check (LDPC) codes over finite fields GF(q), with reasonable complexity and good performance, and introduces a simplified decoder which is inspired by the min-sum decoder for binary LDPC codes.
Journal ArticleDOI
Capacity-approaching protograph codes
TL;DR: This paper discusses construction of protograph-based low-density parity-check codes and examines implementation strategies for high throughput decoding derived from first principles of belief propagation on bipartite graphs.
Journal ArticleDOI
Fully Parallel Stochastic LDPC Decoders
TL;DR: A hardware architecture for fully parallel stochastic low-density parity-check (LDPC) decoders that provides decoding performance within 0.5 and 0.25 dB of the floating-point sum-product algorithm with 32 and 16 iterations, respectively, and similar error-floor behavior is presented.
Proceedings ArticleDOI
Multi-Rate Layered Decoder Architecture for Block LDPC Codes of the IEEE 802.11n Wireless Standard
TL;DR: A new multi-rate architecture for decoding block LDPC codes in IEEE 802.11n standard that utilizes the value-reuse property of offset min-sum, block-serial scheduling of computations and turbo decoding message passing algorithm is presented.
Journal ArticleDOI
Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording
Hongxin Song,J.R. Cruz +1 more
TL;DR: This paper reports on the investigation of Q-ary LDPC coded MRCs, both with AWGN and with burst impairments, and presents a new reduced-complexity decoding algorithm for Q-ARY LDPC codes.
References
More filters
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
The capacity of low-density parity-check codes under message-passing decoding
TL;DR: The results are based on the observation that the concentration of the performance of the decoder around its average performance, as observed by Luby et al. in the case of a binary-symmetric channel and a binary message-passing algorithm, is a general phenomenon.
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
Iterative decoding of binary block and convolutional codes
TL;DR: Using log-likelihood algebra, it is shown that any decoder can be used which accepts soft inputs-including a priori values-and delivers soft outputs that can be split into three terms: the soft channel and aPriori inputs, and the extrinsic value.