Code Design Based on Connecting Spatially Coupled Graph Chains.
Saved in:
| Title: | Code Design Based on Connecting Spatially Coupled Graph Chains. |
|---|---|
| Authors: | Truhachev, Dmitri, Mitchell, David G. M., Lentmaier, Michael, Costello, Daniel J., Karami, Alireza |
| Source: | IEEE Transactions on Information Theory; Sep2019, Vol. 65 Issue 9, p5604-5617, 14p |
| Subject Terms: | ITERATIVE decoding, ERROR probability, CIPHERS |
| Abstract: | A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are comprised of several protograph-based chains characterizing individual SC-LDPC codes. We demonstrate that the code ensembles obtained by connecting appropriately chosen individual SC-LDPC code chains at specific points have improved iterative decoding thresholds. In addition, the connected chain ensembles have a smaller decoding complexity required to achieve a specific bit error probability compared to the individual code chains. Moreover, we demonstrate that, like the individual component chains, the proposed constructions have a typical minimum distance that grows linearly with block length. Finally, we show that the improved asymptotic properties of the connected chain ensembles also translate into improved finite length performance. [ABSTRACT FROM AUTHOR] |
| Copyright of IEEE Transactions on Information Theory 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 |
Be the first to leave a comment!
Full Text Finder
Nájsť tento článok vo Web of Science