Detecting Cycles of Length 10 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis

We complete the description of the procedure of topological expansion of a bipartite graph without parallel branches on the plane of changing the structure of cycles of length up to 10 inclusive. Based on previous papers, we have extended a set of theorems specifying transformation rules for cycles...

Full description

Saved in:
Bibliographic Details
Published in:Problems of information transmission 2020-12, Vol.56 (4), p.317-331
Main Authors: Kharin, A. V., Zavertkin, K. N., Ovinnikov, A. A.
Format: Article
Language:English
Subjects:
639/301/1034/1035
639/925/357/995
Coding Theory
Communications Engineering
Control
Electrical Engineering
Engineering
Graph theory
Information Storage and Retrieval
Networks
Systems Theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We complete the description of the procedure of topological expansion of a bipartite graph without parallel branches on the plane of changing the structure of cycles of length up to 10 inclusive. Based on previous papers, we have extended a set of theorems specifying transformation rules for cycles and paths when passing from a protograph to the Tanner graph. We propose a procedure for detecting the existence of a cycle of length 10 in the expanded graph by analyzing the protograph.
ISSN:0032-9460
1608-3253
DOI:10.1134/S0032946020040031