Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

On the Minimum Distance of Generalized Spatially Coupled LDPC Codes

Mitchell, David G.M. ; Lentmaier, Michael LU and Costello Jr., Daniel J. (2013) IEEE International Symposium on Information Theory, 2013 p.1874-1878
Abstract
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.
Please use this url to cite or link to this publication:
author
; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
LDPC codes, generalized LDPC codes, GLDPC codes, GLDPC convolutional codes, spatial coupling
host publication
IEEE International Symposium on Information Theory Proceedings (ISIT), 2013
pages
1874 - 1878
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE International Symposium on Information Theory, 2013
conference location
Istanbul, Turkey
conference dates
2013-07-07 - 2013-07-12
external identifiers
  • scopus:84890411232
ISSN
2157-8117
2157-8095
ISBN
9781479904440
DOI
10.1109/ISIT.2013.6620551
language
English
LU publication?
yes
id
59227d8e-a0fe-43ac-966f-98240187a4db (old id 3731737)
date added to LUP
2016-04-01 10:45:01
date last changed
2025-01-14 22:22:46
@inproceedings{59227d8e-a0fe-43ac-966f-98240187a4db,
  abstract     = {{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.}},
  author       = {{Mitchell, David G.M. and Lentmaier, Michael and Costello Jr., Daniel J.}},
  booktitle    = {{IEEE International Symposium on Information Theory Proceedings (ISIT), 2013}},
  isbn         = {{9781479904440}},
  issn         = {{2157-8117}},
  keywords     = {{LDPC codes; generalized LDPC codes; GLDPC codes; GLDPC convolutional codes; spatial coupling}},
  language     = {{eng}},
  pages        = {{1874--1878}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{On the Minimum Distance of Generalized Spatially Coupled LDPC Codes}},
  url          = {{https://lup.lub.lu.se/search/files/2101159/3954395.pdf}},
  doi          = {{10.1109/ISIT.2013.6620551}},
  year         = {{2013}},
}