Connecting Spatially Coupled LDPC Code Chains
(2012) IEEE International Conference on Communications, 2012 p.2176-2180- Abstract
- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3731124
- author
- Truhachev, Dmitri ; Mitchell, David G.M. ; Lentmaier, Michael LU and Costello Jr., Daniel J.
- organization
- publishing date
- 2012
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- spatial coupling, LDPC codes
- host publication
- 2012 IEEE International Conference on Communications (ICC)
- pages
- 2176 - 2180
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- IEEE International Conference on Communications, 2012
- conference location
- Ottawa, Canada
- conference dates
- 2012-06-10 - 2012-06-15
- external identifiers
-
- scopus:84871944591
- ISSN
- 1550-3607
- ISBN
- 978-1-4577-2052-9
- DOI
- 10.1109/ICC.2012.6364482
- language
- English
- LU publication?
- no
- id
- c2d94cbf-16e7-4971-8d08-3406bb516ae0 (old id 3731124)
- date added to LUP
- 2016-04-01 13:07:56
- date last changed
- 2022-04-13 23:24:01
@inproceedings{c2d94cbf-16e7-4971-8d08-3406bb516ae0, abstract = {{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.}}, author = {{Truhachev, Dmitri and Mitchell, David G.M. and Lentmaier, Michael and Costello Jr., Daniel J.}}, booktitle = {{2012 IEEE International Conference on Communications (ICC)}}, isbn = {{978-1-4577-2052-9}}, issn = {{1550-3607}}, keywords = {{spatial coupling; LDPC codes}}, language = {{eng}}, pages = {{2176--2180}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{Connecting Spatially Coupled LDPC Code Chains}}, url = {{https://lup.lub.lu.se/search/files/3179873/3731125.pdf}}, doi = {{10.1109/ICC.2012.6364482}}, year = {{2012}}, }