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.

On the Minimum Distance of Generalized Spatially Coupled LDPC Codes

In English

Författare

Summary, in English

Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of GSC-LDPC codes constructed from a protograph have better iterative decoding thresholds than their block code counterparts, and that, for large termination lengths, their thresholds coincide with the maximum a-posteriori (MAP) decoding threshold of the underlying generalized LDPC block code ensemble. Here we show that, in addition to their excellent iterative decoding thresholds, ensembles of GSC-LDPC codes are asymptotically good and have large minimum distance growth rates.

Publiceringsår

2013

Språk

Engelska

Sidor

1874-1878

Publikation/Tidskrift/Serie

IEEE International Symposium on Information Theory Proceedings (ISIT), 2013

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • LDPC codes
  • generalized LDPC codes
  • GLDPC codes
  • GLDPC convolutional codes
  • spatial coupling

Conference name

IEEE International Symposium on Information Theory, 2013

Conference date

2013-07-07 - 2013-07-12

Conference place

Istanbul, Turkey

Status

Published

Forskningsgrupp

  • Telecommunication Theory

ISBN/ISSN/Övrigt

  • ISSN: 2157-8095
  • ISSN: 2157-8117
  • ISBN: 9781479904440