Journal ArticleDOI
Low-Latency Reweighted Belief Propagation Decoding for LDPC Codes
Jingjing Liu,R.C. de Lamare +1 more
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
Journal Article
Study of Robust Adaptive Power allocation for the Downlink of Multiple-Antenna Systems
TL;DR: Two adaptive power allocation algorithms are proposed, which are more robust against CSIT imperfections than conventional techniques and employ the mean square error as the objective function.
Posted Content
Study of Switched Max-Link Buffer-Aided Relay Selection for Cooperative MIMO Systems.
TL;DR: A novel relay selection technique based on switching and the Max-Link protocol that is named Switched Max-link is presented and a novel relayselection criterion based on the maximum likelihood (ML) principle denoted maximum minimum distance that is incorporated into the protocol.
Posted Content
Study of Compressed Randomized UTV Decompositions for Low-Rank Matrix Approximations in Data Science
TL;DR: In this article, a rank-revealing matrix decomposition algorithm termed Compressed Randomized UTV (CoR-UTV) decomposition along with a CoR-UTV variant aided by the power method technique is proposed.
Posted Content
Effective Optimization Criteria and Relay Selection Algorithms for Physical-Layer Security in Multiple-Antenna Relay Networks.
Xiaotao Lu,Rodrigo C. de Lamare +1 more
TL;DR: This work presents alternative optimization criteria based on the signal-to-interference and the secrecy rate criteria that can be used for resource allocation and that do not require knowledge of the channels of the eavesdroppers and the interference.
Proceedings ArticleDOI
Novel method for improving performances of normalized MS decoder using WIMAX code
TL;DR: An improved version of the Normalized Min-Sum (NMS) decoding algorithm named “Girth-Aware NMS” is proposed, to determine “offline” the optimal normalisation factor of the extrinsic message using the structure property of the Tanner Graph associated to the LDPC matrix.
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