Construction of Quasi-Cyclic LDPC Codes Based on Fundamental Theorem of Arithmetic

Quasi-cyclic (QC) LDPC codes play an important role in 5G communications and have been chosen as the standard codes for 5G enhanced mobile broadband (eMBB) data channel. In this paper, we study the construction of QC LDPC codes based on an arbitrary given expansion factor (or lifting degree). First,...

Full description

Saved in:
Bibliographic Details
Published in:Wireless communications and mobile computing 2018-01, Vol.2018 (2018), p.1-9
Main Authors: Zhang, Bo, Xu, Hengzhou, Pu, Liqun, Zhu, Hai
Format: Article
Language:English
Subjects:
Algorithms
Arithmetic
Binary system
Broadband
Codes
Coding theory
Communication
Design
Existence theorems
Graphs
Iterative algorithms
Iterative methods
Low density parity check codes
Mobile computing
Number 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:Quasi-cyclic (QC) LDPC codes play an important role in 5G communications and have been chosen as the standard codes for 5G enhanced mobile broadband (eMBB) data channel. In this paper, we study the construction of QC LDPC codes based on an arbitrary given expansion factor (or lifting degree). First, we analyze the cycle structure of QC LDPC codes and give the necessary and sufficient condition for the existence of short cycles. Based on the fundamental theorem of arithmetic in number theory, we divide the integer factorization into three cases and present three classes of QC LDPC codes accordingly. Furthermore, a general construction method of QC LDPC codes with girth of at least 6 is proposed. Numerical results show that the constructed QC LDPC codes perform well over the AWGN channel when decoded with the iterative algorithms.
ISSN:1530-8669
1530-8677
DOI:10.1155/2018/5264724