Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Approaching Capacity with Asymptotically Regular LDPC Codes

Författare

Summary, in English

We present a family of protograph based LDPC codes that can be derived from permutation matrix based regular (J,K) LDPC convolutional codes by termination. In the terminated protograph, all variable nodes still have degree J but some check nodes at the start and end of the protograph have degrees smaller than K. Since the fraction of these stronger nodes vanishes as the termination length L increases, we call the codes asymptotically regular. The density evolution thresholds of these protographs are better than those of regular (J, K) block codes. Interestingly, this threshold improvement gets stronger with increasing node degrees (at a fixed rate) and it does not decay as L increases. Terminated convolutional protographs can also be derived from standard irregular protographs and may exhibit a significant threshold improvement.

Publiceringsår

2009

Språk

Engelska

Sidor

173-177

Publikation/Tidskrift/Serie

2009 Information Theory and Applications Workshop

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • spatial coupling
  • LDPC codes
  • LDPC convolutional codes

Conference name

Information Theory and Applications Workshop (ITA), 2009

Conference date

2009-02-08 - 2009-02-13

Conference place

San Diego, CA, United Kingdom

Status

Published

Forskningsgrupp

  • Telecommunication Theory

ISBN/ISSN/Övrigt

  • ISBN: 978-1-4244-3990-4