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.

An analysis of the block error probability performance of iterative decoding

Författare

Summary, in English

Asymptotic iterative decoding performance is analyzed for several classes of iteratively decodable codes when the block length of the codes N and the number of iterations I go to infinity. Three classes of codes are considered. These are Gallager's regular low-density parity-check (LDPC) codes, Tanner's generalized LDPC (GLDPC) codes, and the turbo codes due to Berrou et al. It is proved that there exist codes in these classes and iterative decoding algorithms for these codes for which not only the bit error probability Pb, but also the block (frame) error probability PB, goes to zero as N and I go to infinity.

Publiceringsår

2005

Språk

Engelska

Sidor

3834-3855

Publikation/Tidskrift/Serie

IEEE Transactions on Information Theory

Volym

51

Issue

11

Dokumenttyp

Artikel i tidskrift

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • block error probability
  • LDPC codes
  • generalized LDPC codes
  • GLDPC codes
  • turbo codes
  • iterative decoding

Status

Published

Forskningsgrupp

  • Telecommunication Theory

ISBN/ISSN/Övrigt

  • ISSN: 0018-9448