The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

An analysis of the block error probability performance of iterative decoding

På svenska

Author

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.

Publishing year

2005

Language

English

Pages

3834-3855

Publication/Series

IEEE Transactions on Information Theory

Volume

51

Issue

11

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

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

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISSN: 0018-9448