Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Globecom

On unequal error protection LDPC codes based on Plotkin-type constructions

Published Jan 1, 2004• 3 citations
Publisher

Abstract

A family of unequal error-protection (UEP) low-density parity-check (LDPC) codes, based on Plotkin-type constructions, is introduced. The codes are decoded in multiple stages in such a manner that the order of decoding determines the level of error protection. The level of UEP among the code bits can be further increased by properly combining structured and random-like LDPC component codes with carefully chosen properties, and by using some new reliability features. The proposed scheme also offers a good trade-off between code performance on the one hand and encoding/decoding and storage complexity on the other. To the best of our knowledge, the proposed approach represents the first iterative UEP method with analytically provable properties.

DOI
10.1109/glocom.2004.1377996

Related papers

Multi-edge type unequal error protecting low-density parity-check codes

H. V. Beltrão Neto, Werner Henkel, Valdemar C. da Rocha

Irregular low-density parity-check (LDPC) codes are particularly well-suited for transmission schemes that require unequal error protection (UEP) of the transmitted data due to the different connection degrees of its variable nodes. However, this UEP capability is strongly dependent on the connection profile among the protection classes. This paper applies a multi-edge type analysis of LDPC codes for optimizing such a connection profile according to the performance requirements of each protection class. This allows the construction of UEP-LDPC codes where the difference between the performance of the protection classes can be adjusted and with an UEP capability that does not vanish as the number of decoding iterations grows.

IEEE Information Theory Workshop (ITW)•Oct 1, 2011•6 citations

Multi-Edge type Unequal Error Protection LDPC codes

H. V. Beltrao Neto, Werner Henkel, Valdemar C. da Rocha

Irregular low-density parity check (LDPC) codes are particularly well-suited for transmission schemes that require unequal error protection (UEP) of the transmitted data due to the different connection degrees of its variable nodes. However, this UEP capability is strongly dependent on the connection profile among the protection classes. This paper applies a multi-edge type analysis of LDPC codes for optimizing such connection profile according to the performance requirements of each protection class. This allows the construction of UEP-LDPC codes where the difference between the performance of the protection classes can be adjusted and with an UEP capability that does not vanish as the number of decoding iterations grows.

arXiv:1101.5985•Jan 31, 2011•2 citations

A new construction of UEP QC-LDPC codes

Chi‐Jen Wu, Chung-Hsuan Wang, Chi-chao Chao

In this paper, a new construction of quasi-cyclic low-density parity-check (QC-LDPC) codes for unequal error protection (UEP) is proposed. We first give a new class of UEP block codes. QC-LDPC codes with binomial-term parity-check matrices which can avoid girths less than 8 and achieve an enlarged upper bound on the minimum distance are also introduced. An effective UEP scheme based on the proposed UEP block codes and QC-LDPC codes which can provide flexible choice of protection levels is then presented. Simulation results show that the new QC-LDPC codes can achieve good performance and low error floors. The bits with different designed protection levels can indeed have unequal bit-error-rate performance.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2010•4 citations

Decoding Scheduling for Unequal Error Protection Quasi-Cyclic Low-Density Parity-Check Codes

Jia-Jyun Wu, Chung-Hsuan Wang, Chi-chao Chao

Algebraic constructions of quasi-cyclic (QC) low-density parity-check (LDPC) codes with unequal error protection (UEP) capabilities have recently been proposed, which can provide different error-correcting capabilities for different parts of the coded bits. However, conventional decoding algorithms are not designed for LDPC codes with UEP. In this paper, we propose three decoding schemes for UEP QC-LDPC codes extended from existing scheduling strategies, tailored to the special structures of the parity-check matrices. Simulation results show that the proposed schemes can provide improved error rate performance especially for coded bits on low protection levels. The decoding convergence can also be accelerated, thereby reducing the computational complexity.

International Workshop on Signal Design and its Applications in Communications•Oct 1, 2019•1 citation

Unequal error protection QC-LDPC codes via Masking

Chi‐Jen Wu, Chung-Hsuan Wang, Chi-chao Chao

In this paper, a generalized construction of quasi-cyclic low-density parity-check (QC-LDPC) codes for unequal error protection (UEP) is proposed based on the masking technique. We can obtain UEP QC-LDPC codes as long as the Tanner graph of the masking matrix satisfies a general condition which can include our previous UEP construction as a special case. A sufficient condition to have flexible choice of protection levels is then presented. Simulation results show that the constructed codes can indeed provide codeword bits with different bit-error-rate performance.

International Symposium on Information Theory and its Applications•Dec 1, 2012•1 citation

UEP Constructions of Quasi-Cyclic Low-Density Parity-Check Codes via Masking

Chi‐Jen Wu, Chung-Hsuan Wang, Chi-chao Chao

In this paper, the algebraic constructions of quasi-cyclic low-density parity-check (QC-LDPC) codes with the unequal error protection (UEP) property are considered. A criterion for constructing such codes via the masking technique is proposed, based on which explicit conditions on the base parity-check matrices and masking matrices to achieve UEP are provided. We also give three specific constructions of UEP QC-LDPC codes. Furthermore, a sufficient condition to ensure strict UEP is presented. Simulation results demonstrate the superiority of our constructed codes over time-sharing schemes. The constructed codes also have competitive error performance against randomly constructed equal-error-protection LDPC codes and irregular UEP LDPC codes designed based on the degree distribution.

IEEE Transactions on Information Theory•Aug 17, 2017•10 citations
A family of unequal error-protection (UEP) low-density parity-check (LDPC) codes, based on Plotkin-type constructions, is introduced. The codes are decoded in multiple stages in such a manner that the order of decoding determines the level of error protection. The level of UEP among the code bits can be further increased by properly combining structured and random-like LDPC component codes with carefully chosen properties, and by using some new reliability features. The proposed scheme also offers a good trade-off between code performance on the one hand and encoding/decoding and storage complexity on the other. To the best of our knowledge, the proposed approach represents the first iterative UEP method with analytically provable properties.
Irregular low-density parity-check (LDPC) codes are particularly well-suited for transmission schemes that require unequal error protection (UEP) of the transmitted data due to the different connection degrees of its variable nodes. However, this UEP capability is strongly dependent on the connection profile among the protection classes. This paper applies a multi-edge type analysis of LDPC codes for optimizing such a connection profile according to the performance requirements of each protection class. This allows the construction of UEP-LDPC codes where the difference between the performance of the protection classes can be adjusted and with an UEP capability that does not vanish as the number of decoding iterations grows.
Irregular low-density parity check (LDPC) codes are particularly well-suited for transmission schemes that require unequal error protection (UEP) of the transmitted data due to the different connection degrees of its variable nodes. However, this UEP capability is strongly dependent on the connection profile among the protection classes. This paper applies a multi-edge type analysis of LDPC codes for optimizing such connection profile according to the performance requirements of each protection class. This allows the construction of UEP-LDPC codes where the difference between the performance of the protection classes can be adjusted and with an UEP capability that does not vanish as the number of decoding iterations grows.
In this paper, a new construction of quasi-cyclic low-density parity-check (QC-LDPC) codes for unequal error protection (UEP) is proposed. We first give a new class of UEP block codes. QC-LDPC codes with binomial-term parity-check matrices which can avoid girths less than 8 and achieve an enlarged upper bound on the minimum distance are also introduced. An effective UEP scheme based on the proposed UEP block codes and QC-LDPC codes which can provide flexible choice of protection levels is then presented. Simulation results show that the new QC-LDPC codes can achieve good performance and low error floors. The bits with different designed protection levels can indeed have unequal bit-error-rate performance.
Algebraic constructions of quasi-cyclic (QC) low-density parity-check (LDPC) codes with unequal error protection (UEP) capabilities have recently been proposed, which can provide different error-correcting capabilities for different parts of the coded bits. However, conventional decoding algorithms are not designed for LDPC codes with UEP. In this paper, we propose three decoding schemes for UEP QC-LDPC codes extended from existing scheduling strategies, tailored to the special structures of the parity-check matrices. Simulation results show that the proposed schemes can provide improved error rate performance especially for coded bits on low protection levels. The decoding convergence can also be accelerated, thereby reducing the computational complexity.
In this paper, a generalized construction of quasi-cyclic low-density parity-check (QC-LDPC) codes for unequal error protection (UEP) is proposed based on the masking technique. We can obtain UEP QC-LDPC codes as long as the Tanner graph of the masking matrix satisfies a general condition which can include our previous UEP construction as a special case. A sufficient condition to have flexible choice of protection levels is then presented. Simulation results show that the constructed codes can indeed provide codeword bits with different bit-error-rate performance.
In this paper, the algebraic constructions of quasi-cyclic low-density parity-check (QC-LDPC) codes with the unequal error protection (UEP) property are considered. A criterion for constructing such codes via the masking technique is proposed, based on which explicit conditions on the base parity-check matrices and masking matrices to achieve UEP are provided. We also give three specific constructions of UEP QC-LDPC codes. Furthermore, a sufficient condition to ensure strict UEP is presented. Simulation results demonstrate the superiority of our constructed codes over time-sharing schemes. The constructed codes also have competitive error performance against randomly constructed equal-error-protection LDPC codes and irregular UEP LDPC codes designed based on the degree distribution.