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

Irina Bocharova, Boris Kudryashov, Nikolay Makarov, Rolf Johannesson

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceedingPeer review


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.
Titel på värdpublikationIEEE International Symposium on Information Theory (ISIT)
Antal sidor5
StatusPublished - 2013
EvenemangIEEE International Symposium on Information Theory, 2013 - Istanbul, Turkiet
Varaktighet: 2013 juli 72013 juli 12


ISSN (tryckt)2157-8095
ISSN (elektroniskt)2157-8117


KonferensIEEE International Symposium on Information Theory, 2013
Förkortad titelISIT13

Ämnesklassifikation (UKÄ)

  • Elektroteknik och elektronik


Utforska forskningsämnen för ”Near maximum-likelihood decoding of Generalized LDPC and Woven graph codes”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här