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.

Reduced complexity decoding strategies for LDPC convolutional codes

På svenska

Author

Summary, in English

While low-density parity-check (LDPC) convolutional codes tend to significantly outperform LDPC block codes with the same processor complexity, large storage requirements and a long initial decoding delay are two issues related to their continuous pipeline decoding architecture [A. Jimenez Feltstrom et al., (1999)]. In this paper, we propose reduced complexity decoding strategies to lessen the storage requirements and the initial decoding delay without significant loss in performance.

Publishing year

2004

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

Conference date

2004-06-27 - 2004-07-02

Conference place

Chicago, IL, United States

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISBN: 0-7803-8280-3