Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

Rate-Compatible Spatially-Coupled LDPC Code Ensembles With Nearly-Regular Degree Distributions

Nitzold, Walter ; Lentmaier, Michael LU and Fettweis, Gerhard (2015) IEEE International Symposium on Information Theory (ISIT), 2015 p.41-45
Abstract
Spatially-coupled regular LDPC code ensembles have outstanding performance with belief propagation decoding and can perform arbitrarily close to the Shannon limit without requiring irregular graph structures. In this paper, we are concerned with the performance and complexity of spatially-coupled ensembles with a rate-compatibility constraint. Spatially-coupled regular ensembles that support rate-compatibility through extension have been proposed before and show very good performance if the node degrees and the coupling width are chosen appropriately. But due to the strict constraint of maintaining a regular degree, there exist certain unfavorable rates that exhibit bad performance and high decoding complexity. We introduce an altered LDPC... (More)
Spatially-coupled regular LDPC code ensembles have outstanding performance with belief propagation decoding and can perform arbitrarily close to the Shannon limit without requiring irregular graph structures. In this paper, we are concerned with the performance and complexity of spatially-coupled ensembles with a rate-compatibility constraint. Spatially-coupled regular ensembles that support rate-compatibility through extension have been proposed before and show very good performance if the node degrees and the coupling width are chosen appropriately. But due to the strict constraint of maintaining a regular degree, there exist certain unfavorable rates that exhibit bad performance and high decoding complexity. We introduce an altered LDPC ensemble construction that changes the evolution of degrees over subsequent incremental redundancy steps in such a way, that the degrees can be kept low to achieve outstanding performance close to Shannon limit for all rates. These ensembles always outperform their regular counterparts at small coupling width. (Less)
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
incremental redundancy, spatially coupled codes, spatial coupling, LDPC codes, rate-compatible
host publication
2015 IEEE International Symposium on Information Theory (ISIT)
pages
5 pages
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE International Symposium on Information Theory (ISIT), 2015
conference location
Hong Kong, China
conference dates
2015-06-14 - 2015-06-19
external identifiers
  • scopus:84969771749
ISBN
978-1-4673-7704-1
DOI
10.1109/ISIT.2015.7282413
language
English
LU publication?
yes
id
3ec9e859-cac9-42b4-83a0-27ae84dda4fe (old id 7442603)
date added to LUP
2016-04-04 11:06:26
date last changed
2022-01-29 21:20:12
@inproceedings{3ec9e859-cac9-42b4-83a0-27ae84dda4fe,
  abstract     = {{Spatially-coupled regular LDPC code ensembles have outstanding performance with belief propagation decoding and can perform arbitrarily close to the Shannon limit without requiring irregular graph structures. In this paper, we are concerned with the performance and complexity of spatially-coupled ensembles with a rate-compatibility constraint. Spatially-coupled regular ensembles that support rate-compatibility through extension have been proposed before and show very good performance if the node degrees and the coupling width are chosen appropriately. But due to the strict constraint of maintaining a regular degree, there exist certain unfavorable rates that exhibit bad performance and high decoding complexity. We introduce an altered LDPC ensemble construction that changes the evolution of degrees over subsequent incremental redundancy steps in such a way, that the degrees can be kept low to achieve outstanding performance close to Shannon limit for all rates. These ensembles always outperform their regular counterparts at small coupling width.}},
  author       = {{Nitzold, Walter and Lentmaier, Michael and Fettweis, Gerhard}},
  booktitle    = {{2015 IEEE International Symposium on Information Theory (ISIT)}},
  isbn         = {{978-1-4673-7704-1}},
  keywords     = {{incremental redundancy; spatially coupled codes; spatial coupling; LDPC codes; rate-compatible}},
  language     = {{eng}},
  pages        = {{41--45}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{Rate-Compatible Spatially-Coupled LDPC Code Ensembles With Nearly-Regular Degree Distributions}},
  url          = {{https://lup.lub.lu.se/search/files/5695971/7442609.pdf}},
  doi          = {{10.1109/ISIT.2015.7282413}},
  year         = {{2015}},
}