Enhancement of unequal error protection properties of LDPC codes
TLDR
In this article, a hierarchical optimization of the bit node irregularity profile for each sensitivity class within the codeword was proposed to maximize the average bit node degree while guaranteeing a minimum degree as high as possible.Abstract:
It has been widely recognized in the literature that irregular low-density parity-check (LDPC) codes exhibit naturally an unequal error protection (UEP) behavior. In this paper, we propose a general method to emphasize and control the UEP properties of LDPC codes. The method is based on a hierarchical optimization of the bit node irregularity profile for each sensitivity class within the codeword by maximizing the average bit node degree while guaranteeing a minimum degree as high as possible. We show that this optimization strategy is efficient, since the codes that we optimize show better UEP capabilities than the codes optimized for the additive white Gaussian noise channel.read more
Citations
More filters
Journal ArticleDOI
Unequal Error Protection: An Information-Theoretic Perspective
TL;DR: In this paper, an information-theoretic framework for unequal error protection in terms of the exponential error bounds is developed in which the fundamental difference between bit-wise and message-wise UEP is demonstrated, for fixed-length block codes on DMCs without feedback.
Journal ArticleDOI
Design of bandwidth-efficient unequal error protection LDPC codes
Sara Sandberg,N. von Deetzen +1 more
TL;DR: This method combines the design of unequal error protection LDPC codes for the binary input AWGN channel with the code design for higher order constellations by dividing the variable node degree distribution into sub-degree distributions for each protection class and each level of protection from the modulation.
Journal ArticleDOI
Structured Bit-Interleaved LDPC Codes for MLC Flash Memory
TL;DR: This work analyzes binary regular LDPC codes in the standard bit-interleaved coded modulation implementation to determine what ratio of each type of bit should be connected at the check nodes to improve the decoding threshold, and proposes a construction of nonbinaryLDPC codes using their binary images, resulting in check node types that come close to these optimal ratios.
Journal ArticleDOI
UEP concepts in modulation and coding
Werner Henkel,Khaled Hassan,Neele von Deetzen,Sara Sandberg,Lucile Sassatelli,David Declercq +5 more
TL;DR: An overview of some new approaches realizing UEP properties in physical transport, especially multicarrier modulation, or with LDPC and Turbo codes is presented.
Journal ArticleDOI
On the UEP Capabilities of Several LDPC Construction Algorithms
N. von Deetzen,Sara Sandberg +1 more
TL;DR: It is shown that the choice of code construction algorithm highly affects the performance and UEP properties of LDPC codes with identical degree distributions, which provides an explanation to disagreements in earlier research.
References
More filters
Journal ArticleDOI
Design of capacity-approaching irregular low-density parity-check codes
TL;DR: This work designs low-density parity-check codes that perform at rates extremely close to the Shannon capacity and proves a stability condition which implies an upper bound on the fraction of errors that a belief-propagation decoder can correct when applied to a code induced from a bipartite graph with a given degree distribution.
Journal ArticleDOI
The capacity of low-density parity-check codes under message-passing decoding
TL;DR: The results are based on the observation that the concentration of the performance of the decoder around its average performance, as observed by Luby et al. in the case of a binary-symmetric channel and a binary message-passing algorithm, is a general phenomenon.
MonographDOI
Modern Coding Theory
TL;DR: This summary of the state-of-the-art in iterative coding makes this decision more straightforward, with emphasis on the underlying theory, techniques to analyse and design practical iterative codes systems.
Journal ArticleDOI
Rate-compatible punctured convolutional codes (RCPC codes) and their applications
TL;DR: In this article, the concept of punctured convolutional codes is extended by punctuating a low-rate 1/N code periodically with period P to obtain a family of codes with rate P/(P+l), where l can be varied between 1 and (N-1)P. This allows transmission of incremental redundancy in ARQ/FEC (automatic repeat request/forward error correction) schemes and continuous rate variation to change from low to high error protection within a data frame.
Journal ArticleDOI
Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation
TL;DR: By using the Gaussian approximation for message densities under density evolution, the sum-product decoding algorithm can be visualize and the optimization of degree distributions can be understood and done graphically using the visualization.