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.

Efficient Message Passing Scheduling for Terminated LDPC Convolutional Codes

På svenska

Author

Summary, in English

Message passing schedules that reduce the decoding complexity of terminated LDPC convolutional code ensembles are analyzed. Considering the AWGN channel, various schedules are compared by means of density evolution. The results of the analysis together with computer simulations for some (3,6)-regular codes confirm that sliding window decoding is an attractive practical solution for low-latency and low-complexity decoding.

Publishing year

2011

Language

English

Pages

1826-1830

Publication/Series

2011 IEEE International Symposium on Information Theory Proceedings

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
  • window decoding

Conference name

IEEE International Symposium on Information Theory, 2011

Conference date

2011-07-31 - 2011-08-05

Conference place

Saint Petersburg, Russian Federation

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISSN: 2157-8095
  • ISSN: 2157-8117
  • ISBN: 978-1-4577-0596-0