Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

In English

Författare

Summary, in English

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.

Publiceringsår

2013

Språk

Engelska

Sidor

3005-3009

Publikation/Tidskrift/Serie

IEEE International Symposium on Information Theory (ISIT)

Dokumenttyp

Konferensbidrag

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

IEEE International Symposium on Information Theory, 2013

Conference date

2013-07-07 - 2013-07-12

Conference place

Istanbul, Turkey

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 2157-8095
  • ISSN: 2157-8117