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
Iterative detection and decoding for MIMO systems with knowledge-aided belief propagation algorithms
TL;DR: Simulation results show that when used to perform IDD for multi-antenna systems both proposed BP decoding algorithms can consistently outperform existing BP techniques with a small number of decoding iterations.
Proceedings ArticleDOI
Uniformly reweighted APP decoder for memory efficient decoding of LDPC Codes
TL;DR: A memory efficient implementation of the APP decoder that requires memory that is linear only in the codeword length is proposed and it is shown that it improves the BER performance of theAPP decoder compared to its non-corrected version.
Posted Content
Study of Tomlinson-Harashima Precoding Strategies for Physical-Layer Security in Wireless Networks.
TL;DR: Novel non-linear precoders for the downlink of a multi-user MIMO system with the existence of multiple eavesdroppers are proposed to improve the physical-layer secrecy rate.
Posted Content
Coding Techniques for Future Wi-Fi.
TL;DR: This article discusses coding schemes and, in particular, the use of Low-Density Parity-Check codes as Forward Error Correction (FEC) in future Wi-Fi standards, and considers advanced design strategies such as root-check LDPC structures, computer-aided design for short blocks and high-performance decoding algorithms with low latency.
Posted Content
Study of Buffer-Aided Space-Time Coding for Multiple-Antenna Cooperative Wireless Networks
Tong Peng,R.C. de Lamare +1 more
TL;DR: In this article, an adaptive buffer-aided space-time coding scheme for cooperative wireless networks is proposed, where each multiple-antenna relay is equipped with a buffer and is capable of storing the received symbols before forwarding them to the destination.
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