Bibliographische Detailangaben
| Titel: |
Improving spatially coupled LDPC codes by connecting chains. |
| Autoren: |
Truhachev, Dmitri, Mitchell, David G. M., Lentmaier, Michael, Costello, Daniel J. |
| Quelle: |
2012 IEEE International Symposium on Information Theory Proceedings; 1/ 1/2012, p468-472, 5p |
| Abstract: |
In this paper, we study ensembles of connected spatially coupled low-density parity-check codes (SC-LDPCCs), i.e., ensembles described by graphs in which regular SC-LDPCC chains of various lengths serve as edges. We show that, by carefully connecting individual SC-LDPCC chains, we obtain LDPC code ensembles with 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. Moreover, we show that, like the component SC-LDPCC chains, the proposed constructions have a typical minimum distance that grows linearly with block length. [ABSTRACT FROM PUBLISHER] |
|
Copyright of 2012 IEEE International Symposium on Information Theory Proceedings 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.) |
| Datenbank: |
Complementary Index |
Full Text Finder