New Codes on Graphs Constructed by Connecting Spatially Coupled Chains
(2012) Information Theory and Applications Workshop (ITA), 2012 p.392-397- Abstract
- A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) code chains is presented. The proposed code ensembles are described by graphs in which individual SC-LDPC code chains of various lengths serve as edges. We demonstrate that connecting several appropriately chosen SC-LDPC code chains results in improved iterative decoding thresholds compared to those of a single coupled chain in addition to reducing the decoding complexity required to achieve a specific bit error probability.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3731591
- 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, LDPC convolutional codes
- host publication
- 2012 Information Theory and Applications Workshop
- pages
- 392 - 397
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- Information Theory and Applications Workshop (ITA), 2012
- conference location
- San Diego, CA, United States
- conference dates
- 2012-02-05 - 2012-02-10
- external identifiers
-
- scopus:84860455198
- ISBN
- 978-1-4673-1473-2
- DOI
- 10.1109/ITA.2012.6181771
- language
- English
- LU publication?
- no
- id
- c094f69e-1224-4f0f-a36a-7b215ee88a12 (old id 3731591)
- date added to LUP
- 2016-04-04 10:05:25
- date last changed
- 2022-05-01 19:19:15
@inproceedings{c094f69e-1224-4f0f-a36a-7b215ee88a12, abstract = {{A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) code chains is presented. The proposed code ensembles are described by graphs in which individual SC-LDPC code chains of various lengths serve as edges. We demonstrate that connecting several appropriately chosen SC-LDPC code chains results in improved iterative decoding thresholds compared to those of a single coupled chain in addition to reducing the decoding complexity required to achieve a specific bit error probability.}}, author = {{Truhachev, Dmitri and Mitchell, David G.M. and Lentmaier, Michael and Costello Jr., Daniel J.}}, booktitle = {{2012 Information Theory and Applications Workshop}}, isbn = {{978-1-4673-1473-2}}, keywords = {{spatial coupling; LDPC codes; LDPC convolutional codes}}, language = {{eng}}, pages = {{392--397}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, title = {{New Codes on Graphs Constructed by Connecting Spatially Coupled Chains}}, url = {{https://lup.lub.lu.se/search/files/5458222/3731595.pdf}}, doi = {{10.1109/ITA.2012.6181771}}, year = {{2012}}, }