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.

Distance bounds for an ensemble of LDPC convolutional codes

På svenska

Author

  • Arvind Sridharan
  • Dmitri Truhachev
  • Michael Lentmaier
  • Daniel J. Costello Jr.
  • Kamil Zigangirov

Summary, in English

An ensemble of (J, K) -regular low-density parity-check (LDPC) convolutional codes is introduced and existence-type lower bounds on the minimum distance dL, of code segments of finite length L and on the free distance dfree are derived. For sufficiently large constraint lengths v, the distances are shown to grow linearly with v and the ratio dL/v approaches the ratio dfee/v for large L. Moreover, the ratio of free distance to constraint length is several times larger than the ratio of minimum distance to block length for Gallager's ensemble of (J, K) -regular LDPC block codes.

Publishing year

2007

Language

English

Pages

4537-4555

Publication/Series

IEEE Transactions on Information Theory

Volume

53

Issue

12

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • spatial coupling
  • LDPC codes
  • LDPC convolutional codes

Status

Published

Research group

  • Telecommunication Theory

ISBN/ISSN/Other

  • ISSN: 0018-9448