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
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

Content maybe subject to copyright    Report

Citations
More filters
Posted Content

Study of Non-Uniform Channel Polarization and Design of Polar Codes with Arbitrary Rates

TL;DR: The concept of non-uniform channel polarization and a scheme for rate-compatible polar code construction for any codeword length using additive white Gaussian noise channels and the successive cancellation decoder are presented.
Posted Content

Study of Joint Activity Detection and Channel Estimation Based on Message Passing with RBP Scheduling for MTC

TL;DR: In this article, a message-scheduling generalized approximate message passing (MSGAMP) algorithm is proposed to address the problem of joint active device detection and channel estimation in an uplink grant-free massive MIMO system scenario.
Posted Content

Repeat Accumulate Based Designs for LDPC Codes on Fading Channels

TL;DR: Numerical results show that the IRAALDPC codes constructed by the proposed algorithm outperform by about 1dB the existing IRA Root-Check LDPC codes under fast-fading channels.
Posted Content

Study of Design of Rate-Compatible Polar Codes Based on Non-Uniform Channel Polarization.

TL;DR: In this paper, a non-uniform channel polarization based on Gaussian approximation (NUPGA) was proposed to construct rate-compatible arbitrary-length polar codes for AWGN channels.
Posted Content

A survey on active noise control techniques -- Part II: Nonlinear systems

TL;DR: In this paper, the authors reviewed the development of the linear active noise control (ANC) technique in the past decade and highlighted recent advances of NLANC algorithms, such as spline ANC algorithms, kernel adaptive filters, and nonlinear distributed ANC algorithms.
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)