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

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 metho...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE communications letters Vol. 26; no. 3; pp. 495 - 499
Main Authors:	Dehaghani, Alireza Eshraghi, Sadeghi, Mohammad-Reza, Amirzade, Farzane
Format:	Journal Article
Language:	English
Published:	New York IEEE 01-03-2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Asymptotic properties Chains Codes Complexity theory connecting SC-LDPC chains Couplings Decoding Error probability Iterative decoding Iterative methods Low density parity check codes multi-dimensional codes Periodic structures protographs Reliability SC-LDPC codes spatial graph coupling Upper bound
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	1089-7798 1558-2558
DOI:	10.1109/LCOMM.2021.3138613