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.

Terminated LDPC convolutional codes with thresholds close to capacity

På svenska

Author

Summary, in English

An ensemble of LDPC convolutional codes with parity-check matrices composed of permutation matrices is considered. The convergence of the iterative belief propagation based decoder for terminated convolutional codes in the ensemble is analyzed for binary-input output-symmetric memoryless channels using density evolution techniques. We observe that the structured irregularity in the Tanner graph of the codes leads to significantly better thresholds when compared to corresponding LDPC block codes

Publishing year

2005

Language

English

Pages

1372-1376

Publication/Series

[Host publication title missing]

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • spatial coupling
  • LDPC codes
  • LDPC convolutional codes

Conference name

IEEE International Symposium on Information Theory (ISIT), 2005

Conference date

2005-09-04 - 2005-09-09

Conference place

Adelaide, Australia

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISBN: 0-7803-9151-9