Construction of Quasi‐Cyclic LDPC Codes Based on Fundamental Theorem of Arithmetic
Open Access
- 1 January 2018
- journal article
- research article
- Published by Wiley in Wireless Communications and Mobile Computing
- Vol. 2018 (1)
Abstract
Quasi‐cyclic (QC) LDPC codes play an important role in 5G communications and have been chosen as the standard codes for 5Genhanced 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.Keywords
Funding Information
- National Natural Science Foundation of China (61103143, U1504601, 162102310589, 172102310124, 182102310867, 18B510022, ZKNUB2201705)
This publication has 30 references indexed in Scilit:
- New Classes of Partial Geometries and Their Associated LDPC CodesIEEE Transactions on Information Theory, 2015
- Construction of High-Performance Array-Based Non-Binary LDPC Codes With Moderate RatesIEEE Communications Letters, 2015
- Quasi-Cyclic Representation and Vector Representation of RS-LDPC CodesIEEE Transactions on Communications, 2015
- Quasi-Cyclic LDPC Codes Based on Pre-Lifted ProtographsIEEE Transactions on Information Theory, 2014
- Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding SchemeIEEE Transactions on Communications, 2014
- Low-Complexity Encoding of Quasi-Cyclic Codes Based on Galois Fourier TransformIEEE Transactions on Communications, 2014
- Finite Alphabet Iterative Decoders for LDPC Codes: Optimization, Architecture and AnalysisIEEE Transactions on Circuits and Systems I: Regular Papers, 2014
- Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation MatricesIEEE Transactions on Information Theory, 2004
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962