New Codes on Graphs Constructed by Connecting Spatially Coupled Chains

Summary, in English

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: Dmitri Truhachev; David G.M. Mitchell; Michael Lentmaier; Daniel J. Costello Jr.
• Department/s: ELLIIT: the Linköping-Lund initiative on IT and mobile communication
• Publishing year: 2012
• Language: English
• Pages: 392-397
• Publication/Series: 2012 Information Theory and Applications Workshop
• Full text: - 421 kB; Download statistics
• Links: http://dx.doi.org/10.1109/ITA.2012.6181771
• Document type: Conference paper
• Publisher: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Topic: Electrical Engineering, Electronic Engineering, Information Engineering
• Keywords: spatial coupling; LDPC codes; LDPC convolutional codes
• Conference name: Information Theory and Applications Workshop (ITA), 2012
• Conference date: 2012-02-05 - 2012-02-10
• Conference place: San Diego, CA, United States
• Status: Published
• Research group: Telecommunication Theory
• ISBN/ISSN/Other: ISBN: 978-1-4673-1473-2