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.

Connecting Spatially Coupled LDPC Code Chains

Författare

Summary, in English

Codes constructed from connected spatially coupled low-density parity-check code (SC-LDPCC) chains are proposed and analyzed. It is demonstrated that connecting coupled chains results in improved iterative decoding performance. The constructed protograph ensembles have better iterative decoding thresholds compared to an individual SC-LDPCC chain and require less computational complexity per bit when operating in the near-threshold region. In addition, it is shown that the proposed constructions are asymptotically good in terms of minimum distance.

Publiceringsår

2012

Språk

Engelska

Sidor

2176-2180

Publikation/Tidskrift/Serie

2012 IEEE International Conference on Communications (ICC)

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • spatial coupling
  • LDPC codes

Conference name

IEEE International Conference on Communications, 2012

Conference date

2012-06-10 - 2012-06-15

Conference place

Ottawa, Canada

Status

Published

Forskningsgrupp

  • Telecommunication Theory

ISBN/ISSN/Övrigt

  • ISSN: 1550-3607
  • ISBN: 978-1-4577-2052-9