scispace - formally typeset
Journal ArticleDOI

Low-Latency Reweighted Belief Propagation Decoding for LDPC Codes

Jingjing Liu, +1 more
- 06 Aug 2012 - 
- Vol. 16, Iss: 10, pp 1660-1663
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

Content maybe subject to copyright    Report

Citations
More filters
Posted Content

Iterative Detection and LDPC Decoding Algorithms for MIMO Systems in Block-Fading Channels.

TL;DR: The soft output of the decoder in a block-fading channel with Root-Check LDPC codes has allowed us to create a new strategy to improve the Bit Error Rate (BER) of a MIMO IDD scheme.
Proceedings ArticleDOI

An modified beyond belief propagation algorithm over AWGN channel

TL;DR: It is found that this algorithm can be modified through setting appropriate penalty factor and obtains better performance than BP one over AWGN channel and can obtain more performance gain relative to high one when short frame is used.
Posted Content

Optimizing Reweighted Belief Propagation for Likelihood Consensus Problems.

TL;DR: Through a linear formulation of BP, this work is able to analytically derive convergence conditions for certain types of graphs and optimize the convergence speed, and compares with standard belief consensus and observes significantly faster convergence.
Proceedings ArticleDOI

Comparison of reweighted message passing algorithms for LDPC decoding

TL;DR: Seven distinct LDPC decoders are described and the best performance/latency trade-off is achieved by one version of the reweighted max-product decoder.
Proceedings ArticleDOI

Enhanced EMD-Driven PEG Construction for Structured LDPC Codes

TL;DR: The code constructions provided are flexible in rate and length and demonstrate that the enhanced EMD-driven PEG-based approach proposed may be applied to a number of other structured LDPC code classes, given consideration of correct constraints of the construction.
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)