Journal ArticleDOI
Low-Latency Reweighted Belief Propagation Decoding for LDPC Codes
Jingjing Liu,R.C. de Lamare +1 more
Reads0
Chats0
TLDR
Simulation results show that the VFAP-BP algorithm outperforms the standard BP algorithm, and requires a significantly smaller number of iterations when decoding either general or commercial LDPC codes.Abstract:
In this paper we propose a novel message passing algorithm which exploits the existence of short cycles to obtain performance gains by reweighting the factor graph. The proposed decoding algorithm is called variable factor appearance probability belief propagation (VFAP-BP) algorithm and is suitable for wireless communications applications with low-latency and short blocks. Simulation results show that the VFAP-BP algorithm outperforms the standard BP algorithm, and requires a significantly smaller number of iterations when decoding either general or commercial LDPC codes.read more
Citations
More filters
Proceedings ArticleDOI
Knowledge-aided informed dynamic scheduling for LDPC decoding
TL;DR: A novel informed dynamic scheduling (IDS) approach for decoding LDPC codes is developed based on the use of the current message reliabilities and the residuals of the potential updates to select the messages passed in the graph during iterative Sum Product decoding.
Proceedings ArticleDOI
Iterative detection and decoding algorithms for block-fading channels using LDPC codes
TL;DR: An IDD receiver with soft information processing that exploits the code structure and the behaviour of the log likelihood ratios (LLR)'s is developed and a new strategy to improve the Bit Error Rate (BER) of a MIMO IDD scheme is created.
Journal ArticleDOI
An exponential factor appearance probability belief propagation algorithm for regular and irregular LDPC codes
TL;DR: A modified version of the belief propagation algorithm for regular and irregular LDPC codes with two new features, one in the strategy for reweighting check nodes in tanner graph and another for exploiting the existence of short cycles with an exponential function for the determination of the factor appearance probability.
Proceedings ArticleDOI
Ultra-Low-Latency LDPC Decoding Architecture using Reweighted Offset Min-Sum Algorithm
TL;DR: A cost-effective algorithm for reducing the processing latency of LDPC decoders by checking the number of short-length cycles in the LDPC code structure and dynamically changes the reweighting factor at the iterative operations, successfully reducing the average number of iterations.
Dissertation
Short-length Low-density Parity-check Codes: Construction and Decoding Algorithms
TL;DR: A knowledge-aided approach is developed based on message reliabilities and residuals to allow fast convergence and significant improvements in error rate performance.
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
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.
Journal ArticleDOI
A new class of upper bounds on the log partition function
TL;DR: A new class of upper bounds on the log partition function of a Markov random field (MRF) is introduced, based on concepts from convex duality and information geometry, and the Legendre mapping between exponential and mean parameters is exploited.
Journal ArticleDOI
Selective avoidance of cycles in irregular LDPC code construction
TL;DR: A Viterbi-like algorithm is proposed that selectively avoids small cycle clusters that are isolated from the rest of the graph and yields codes with error floors that are orders of magnitude below those of random codes with very small degradation in capacity-approaching capability.
Related Papers (5)
Minimum Mean-Squared Error Iterative Successive Parallel Arbitrated Decision Feedback Detectors for DS-CDMA Systems
Multiple Feedback Successive Interference Cancellation Detection for Multiuser MIMO Systems
Peng Li,R.C. de Lamare,Rui Fa +2 more