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
Posted Content
Decoding of Polar Codes Based on Q-Learning-Driven Belief Propagation.
TL;DR: In this article, an enhanced belief propagation (BP) decoding algorithm and a reinforcement learning-based BP decoding algorithm for polar codes are presented. But the proposed decoding strategy relies on reweighting the messages and consists of two steps: first weight each PE input based on their signals and Euclidean distances using a heuristic metric, then a Q-learning algorithm (QLBP) is employed to figure out the best correction factor for successful decoding.
Journal ArticleDOI
Generalization Bounds for Neural Belief Propagation Decoders
TL;DR: In this paper , the generalization gap of a decoder is defined as the difference between empirical and expected bit-error-rate (BER) of the decoder, and theoretical results on generalization performance of neural belief propagation (NBP) based decoders are presented.
Posted Content
Study of Efficient Robust Adaptive Beamforming Algorithms Based on Shrinkage Techniques
Hang Ruan,R.C. de Lamare +1 more
TL;DR: This paper develops low complexity adaptive robust version of the conjugate gradient (CG) algorithm to both estimate the steering vector mismatch and update the beamforming weights.
Posted Content
Switched Max-Link Relay Selection Algorithms for Buffer-Aided Relay Systems.
TL;DR: A novel relay selection technique based on switching and the selection of the best link, that is named Switched Max-Link is presented and a novel relayselection criterion based on the Maximum Likelihood (ML) principle and the Pairwise Error Probability (PEP) denoted Maximum Minimum Distance (MMD) is introduced.
Journal Article
Joint Channel Estimation, Activity Detection and Decoding using Dynamic Message-Scheduling for Machine-Type Communications
TL;DR: Numerical results show that BiMSGAMP outperforms state-of-the-art algorithms, highlighting the gains achieved by using the dynamic scheduling strategies and the effects of the channel decoding part in the system.
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