Improving Asymptotic Properties of Loop Construction of SC-LDPC Chains Over the BEC.

Saved in:
Bibliographic Details
Title: Improving Asymptotic Properties of Loop Construction of SC-LDPC Chains Over the BEC.
Authors: Dehaghani, Alireza Eshraghi, Sadeghi, Mohammad-Reza, Amirzade, Farzane
Source: IEEE Communications Letters; Mar2022, Vol. 26 Issue 3, p495-499, 5p
Abstract: Single SC-LDPC chains are known to provide protographs of SC-LDPC codes. These chains can be connected together and create new constructions which provide multi-dimensional (MD) SC-LDPC codes. The loop is one of the most important constructions that has been introduced so far. We propose a new method to construct code ensembles that are based on a combination of the small single chains and the loop construction. The numerical results show that our new ensembles have better iterative decoding thresholds and lower decoding complexity required to achieve a specific bit erasure probability than the single chain ensembles and the loop ensembles in a wide range of rates over the BEC. Moreover, similar to the single chain and the loop ensembles, the new ensembles are asymptotically good in terms of minimum distance. [ABSTRACT FROM AUTHOR]
Copyright of IEEE Communications Letters 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
Description
Abstract:Single SC-LDPC chains are known to provide protographs of SC-LDPC codes. These chains can be connected together and create new constructions which provide multi-dimensional (MD) SC-LDPC codes. The loop is one of the most important constructions that has been introduced so far. We propose a new method to construct code ensembles that are based on a combination of the small single chains and the loop construction. The numerical results show that our new ensembles have better iterative decoding thresholds and lower decoding complexity required to achieve a specific bit erasure probability than the single chain ensembles and the loop ensembles in a wide range of rates over the BEC. Moreover, similar to the single chain and the loop ensembles, the new ensembles are asymptotically good in terms of minimum distance. [ABSTRACT FROM AUTHOR]
ISSN:10897798
DOI:10.1109/LCOMM.2021.3138613