Work

A cyclic‐shift based method for counting cycles of quasi‐cyclic LDPC codes

Year: 2024

Type: article

Abstract: M. Fossorier proposed how to determine the necessary and sufficient conditions for the existence of cycles in the Tanner graph of quasi‐cyclic LDPC (QC‐LDPC) codes, which has been widely investigated in the study of LDPC codes. This paper presents some new necessary and sufficient conditions for the existence of cycles with arbitrary lengths and proposes a simple and novel method for counting cycles of QC‐LDPC codes based on the improved conditions. Numerical results show that, compared with the existing methods, the presented method is effective and feasible and can enumerate cycles of QC‐LDPC codes in a cyclic‐shift way.

Source: Electronics Letters

DOI: 10.1049/ell2.13085

Authors: Hengzhou Xu, Xiao‐Dong Zhang, Huaan Li, Hai Zhu, Bo Zhang, Hui Liu

Institutions: Zhoukou Normal University, Shanghai Jiao Tong University, Henan University of Engineering, Zhengzhou Railway Vocational & Technical College

Language: English

Topic: Error Correcting Code Techniques

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $2,540

Funders: National Natural Science Foundation of China, Science and Technology Department of Henan Province