Check-Irregular LDPC Codes for Unequal Error Protection under Iterative Decoding

Konferenz: TURBO - CODING - 2006 - 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding
03.04.2006 - 07.04.2006 in Munich, Germany

Tagungsband: TURBO - CODING - 2006

Seiten: 6Sprache: EnglischTyp: PDF

Persönliche VDE-Mitglieder erhalten auf diesen Artikel 10% Rabatt

Sassatelli, Lucile; Henkel, Werner (International University Bremen, Campus Ring 1 28759 Bremen, Germany)
Sassatelli, Lucile; Declercq, David (ETIS ENSEA/UCP/CNRS UMR-8051, 6 avenue du Ponceau 95014 Cergy, France)

In many optimization techniques of LDPC codes, the check node irregularity is usually considered as being fixed because the profile must contain only two consecutive degrees in order to maximize the overall convergence speed of the code. We show in this paper that it is possible to construct bit-regular codes with more than two different degrees at check nodes side to speed up the convergence of some parts of the codeword, even if we may decrease a little the global convergence. Then, we take advantage of the check irregularity to create unequal error protection (UEP) codes, and present a very flexible method to achieve it. This method is based on pruning a mother code, thereby creating different subcodes with different UEP properties, but decoded with the same decoder.