Near maximum-likelihood decoding of Generalized LDPC and Woven graph codes

Irina Bocharova; Boris Kudryashov; Nikolay Makarov; Rolf Johannesson

doi:10.1109/ISIT.2013.6620777

Near maximum-likelihood decoding of Generalized LDPC and Woven graph codes

Irina Bocharova, Boris Kudryashov, Nikolay Makarov, Rolf Johannesson

Department of Electrical and Information Technology

Research output: Chapter in Book/Report/Conference proceeding › Paper in conference proceeding › peer-review

Abstract

Relations between Generalized LDPC codes, nonbinary LDPC codes, and woven graph codes are considered. Focus is on rather short codes suitable, for example, for coding control signaling information in mobile communications. In particular, codes of lengths less than 200 bits are studied. Low-complexity near maximum-likelihood (ML) decoding for these classes of codes is introduced and analyzed. Frame error rate (FER) performance of the new decoding procedure is compared with the same performance of ML and belief propagation (BP) decoding. It is shown that unlike BP decoding whose performances are mainly governed by the girth of the Tanner graph the new decoding procedure has performances which significantly depend on the minimum distance and spectrum of the woven code. Short woven graph codes with large minimum distances are tabulated.

Original language	English
Title of host publication	IEEE International Symposium on Information Theory (ISIT)
Pages	3005-3009
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2013.6620777
Publication status	Published - 2013
Event	IEEE International Symposium on Information Theory, 2013 - Istanbul, Turkey Duration: 2013 Jul 7 → 2013 Jul 12

Publication series

Name
ISSN (Print)	2157-8095
ISSN (Electronic)	2157-8117

Conference

Conference	IEEE International Symposium on Information Theory, 2013
Abbreviated title	ISIT13
Country/Territory	Turkey
City	Istanbul
Period	2013/07/07 → 2013/07/12

Subject classification (UKÄ)

Electrical Engineering, Electronic Engineering, Information Engineering

Access to Document

10.1109/ISIT.2013.6620777

Cite this

@inproceedings{ba9b394e8e9949e2a08c2d9ab7e27e33,

title = "Near maximum-likelihood decoding of Generalized LDPC and Woven graph codes",

abstract = "Relations between Generalized LDPC codes, nonbinary LDPC codes, and woven graph codes are considered. Focus is on rather short codes suitable, for example, for coding control signaling information in mobile communications. In particular, codes of lengths less than 200 bits are studied. Low-complexity near maximum-likelihood (ML) decoding for these classes of codes is introduced and analyzed. Frame error rate (FER) performance of the new decoding procedure is compared with the same performance of ML and belief propagation (BP) decoding. It is shown that unlike BP decoding whose performances are mainly governed by the girth of the Tanner graph the new decoding procedure has performances which significantly depend on the minimum distance and spectrum of the woven code. Short woven graph codes with large minimum distances are tabulated.",

author = "Irina Bocharova and Boris Kudryashov and Nikolay Makarov and Rolf Johannesson",

year = "2013",

doi = "10.1109/ISIT.2013.6620777",

language = "English",

pages = "3005--3009",

booktitle = "IEEE International Symposium on Information Theory (ISIT)",

note = "IEEE International Symposium on Information Theory, 2013, ISIT13 ; Conference date: 07-07-2013 Through 12-07-2013",

}

TY - GEN

T1 - Near maximum-likelihood decoding of Generalized LDPC and Woven graph codes

AU - Bocharova, Irina

AU - Kudryashov, Boris

AU - Makarov, Nikolay

AU - Johannesson, Rolf

PY - 2013

Y1 - 2013

N2 - Relations between Generalized LDPC codes, nonbinary LDPC codes, and woven graph codes are considered. Focus is on rather short codes suitable, for example, for coding control signaling information in mobile communications. In particular, codes of lengths less than 200 bits are studied. Low-complexity near maximum-likelihood (ML) decoding for these classes of codes is introduced and analyzed. Frame error rate (FER) performance of the new decoding procedure is compared with the same performance of ML and belief propagation (BP) decoding. It is shown that unlike BP decoding whose performances are mainly governed by the girth of the Tanner graph the new decoding procedure has performances which significantly depend on the minimum distance and spectrum of the woven code. Short woven graph codes with large minimum distances are tabulated.

AB - Relations between Generalized LDPC codes, nonbinary LDPC codes, and woven graph codes are considered. Focus is on rather short codes suitable, for example, for coding control signaling information in mobile communications. In particular, codes of lengths less than 200 bits are studied. Low-complexity near maximum-likelihood (ML) decoding for these classes of codes is introduced and analyzed. Frame error rate (FER) performance of the new decoding procedure is compared with the same performance of ML and belief propagation (BP) decoding. It is shown that unlike BP decoding whose performances are mainly governed by the girth of the Tanner graph the new decoding procedure has performances which significantly depend on the minimum distance and spectrum of the woven code. Short woven graph codes with large minimum distances are tabulated.

U2 - 10.1109/ISIT.2013.6620777

DO - 10.1109/ISIT.2013.6620777

M3 - Paper in conference proceeding

SP - 3005

EP - 3009

BT - IEEE International Symposium on Information Theory (ISIT)

T2 - IEEE International Symposium on Information Theory, 2013

Y2 - 7 July 2013 through 12 July 2013

ER -

Near maximum-likelihood decoding of Generalized LDPC and Woven graph codes

Abstract

Publication series

Conference

Subject classification (UKÄ)

Access to Document

Fingerprint

Cite this