Bibliographic Details
| Title: |
New codes on graphs constructed by connecting spatially coupled chains. |
| Authors: |
Truhachev, Dmitri, Mitchell, David G. M., Lentmaier, Michael, Costello, Daniel J. |
| Source: |
2012 Information Theory & Applications Workshop; 1/ 1/2012, p392-397, 6p |
| 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. [ABSTRACT FROM PUBLISHER] |
|
Copyright of 2012 Information Theory & Applications Workshop is the property of IEEE and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Complementary Index |
Full Text Finder