On the UEP Capabilities of Several LDPC Construction Algorithms

Deetzen, Neele von; Sandberg, Sara

doi:10.1109/tcomm.2010.101210.080614

Cited by 12 publications

(15 citation statements)

References 14 publications

(18 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is widely believed that an irregular variable node degree distribution is the only requirement to provide UEP, see for example [29,30]. Surprisingly, we found that constructing parity-check matrices using these different algorithms, based on the same degree distribution pair, results in codes with very different UEP capabilities: The random and the ACE algorithms result in codes which are UEP-capable, whereas the PEG and the PEG-ACE algorithms result in codes that do not provide any UEP [36].…”

Section: Necessary Degree Distribution Properties Of Uep-ldpc Codesmentioning

confidence: 84%

“…In the case of the ACE code, the number of edges to different protection classes vary much more and there are many different types of check-nodes. Based on this detailed check-node degree distribution, one may perform a detailed mutual information evolution of the messages over the decoding iterations [36]. Figure 7 shows the mutual information of messages going from check-nodes to variable nodes of different protection classes (denoted by I appc ) as a function of the number of iterations for an ACE code and a PEG-ACE code.…”

Section: Necessary Degree Distribution Properties Of Uep-ldpc Codesmentioning

confidence: 99%

“…Furthermore, The authors appreciate funding by the German national research foundation DFG. Some results of this paper have been prepublished at conferences [10,17,41] or will appear in [36]. UEP LDPC codes for higher-order modulation, which were not presented in here, have recently been published in [42]; for results on UEP multilevel codes, the reader is referred to [22].…”

Section: Acknowledgmentsmentioning

confidence: 99%

See 2 more Smart Citations

UEP Concepts in Modulation and Coding

Henkel

Hassan

Deetzen³

et al. 2010

Advances in Multimedia

Self Cite

View full text Add to dashboard Cite

First unequal error protection (UEP) proposals date back to the 1960's (Masnick and Wolf; 1967), but now with the introduction of scalable video, UEP develops to a key concept for the transport of multimedia data. The paper presents an overview of some new approaches realizing UEP properties in physical transport, especially multicarrier modulation, or with LDPC and Turbo codes. For multicarrier modulation, UEP bit-loading together with hierarchical modulation is described allowing for an arbitrary number of classes, arbitrary SNR margins between the classes, and arbitrary number of bits per class. In Turbo coding, pruning, as a counterpart of puncturing is presented for flexible bit-rate adaptations, including tables with optimized pruning patterns. Bit- and/or check-irregular LDPC codes may be designed to provide UEP to its code bits. However, irregular degree distributions alone do not ensure UEP, and other necessary properties of the parity-check matrix for providing UEP are also pointed out. Pruning is also the means for constructing variable-rate LDPC codes for UEP, especially controlling the check-node profile.

show abstract

Section: Necessary Degree Distribution Properties Of Uep-ldpc Codesmentioning

confidence: 84%

Section: Necessary Degree Distribution Properties Of Uep-ldpc Codesmentioning

confidence: 99%

Section: Acknowledgmentsmentioning

confidence: 99%

See 1 more Smart Citation

UEP Concepts in Modulation and Coding

Henkel

Hassan

Deetzen³

et al. 2010

Advances in Multimedia

Self Cite

View full text Add to dashboard Cite

show abstract

“…As in [4], for UEP LDPC codes we divide the codeword bits into three protection classes: the first class (C 1 ) contains k 1 information bits which are the most protected ones against the noise, the second class (C 2 ) contains k 2 = k − k 1 information bits that are less protected against the noise than those in C 1 , and the last class (C 3 ) contains the r redundancy bits. As shown in [4], the UEP capabilities can be increased by reducing the number of edges shared by nodes belonging to different protection classes. Our solution indeed aims at improving the performance over C 1 by reserving some check nodes (i.e., redundancy bits) to its variable nodes (i.e., information bits).…”

Section: Notation and Definitionsmentioning

confidence: 99%

LDPC coded modulation schemes with largely unequal error protection

Ricciutelli

Baldi

Maturo

et al. 2015

2015 IEEE International Black Sea Conference on Communications and Networking (BlackSeaCom)

View full text Add to dashboard Cite

Coding and modulation schemes able to achieve unequal error protection are of interest for many applications in which parts of the payload must be differently protected against the noise. They are also useful for physical layer security of transmissions over the broadcast channel with confidential messages. Classical design approaches aim at optimizing the performance over all the protection classes, independently of the separation between them. We instead propose a solution to improve the performance over the most protected bits, at the expense of performance over the least protected ones. This allows to design coded modulation schemes with largely unequal error protection. We also consider the use of high order modulations, and propose a technique to study the performance over each protection class in the asymptotic regime of infinite code length.

show abstract

“…However, our results show that for a reasonable number of iterations the UEP capability is not affected much by the number of decoder iterations. It has been shown that the choice of code construction algorithm is critical for remaining UEP capability after a reasonable number of iterations, [31]. Figure 8 in Section IV shows the BER as a function of the number of decoder iterations for the code design and code construction algorithm suggested in this paper.…”

Section: A Optimization Of the Degree Distribution For Hocsmentioning

confidence: 99%

Design of bandwidth-efficient unequal error protection LDPC codes

Sandberg

Deetzen

2010

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

Abstract-This paper presents a strategy for the design of bandwidth-efficient LDPC codes with unequal error protection. Bandwidth efficiency is obtained by appropriately designing the codes for higher order constellations, assuming an AWGN channel. The irregularities of the LDPC code are designed, using the Gaussian approximation of the density evolution, to enhance the unequal error protection property of the code as well as account for the different bit error probabilities given by the higher order constellation. The proposed code design algorithm is flexible in terms of the number and proportions of protection classes. It also allows arbitrary modulation schemes. Our 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. The results show that appropriate code design for higher order constellations reduces the overall bit-error rate significantly. Furthermore, the unequal error protection capability of the code is increased, especially for high SNR.Index Terms-LDPC, unequal error protection, higher order constellations, bandwidth efficiency

show abstract

On the UEP Capabilities of Several LDPC Construction Algorithms

Cited by 12 publications

References 14 publications

UEP Concepts in Modulation and Coding

UEP Concepts in Modulation and Coding

LDPC coded modulation schemes with largely unequal error protection

Design of bandwidth-efficient unequal error protection LDPC codes

Contact Info

Product

Resources

About