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.

Analytical approach to low-density convolutional codes

På svenska

Author

Summary, in English

A statistical analysis of low-density convolutional (LDC) codes is performed. This analysis is based on the consideration of a special statistical ensemble of Markov scramblers and the solution to a system of recurrent equations describing this ensemble. The results of the analysis are lower bounds for the free distance of the codes and upper bounds for the maximum likelihood decoding error probability. For the case where the size of the scrambler tends to infinity some asymptotic bounds for the free distance and the error probability are derived. Simulation results for iterative decoding of LDC codes are also presented.

Publishing year

2000

Language

English

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), 2000

Conference date

2000-06-25 - 2000-06-30

Conference place

Sorrento, Italy

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISBN: 0-7803-5857-0