Hybrid of check matrix construction algorithm based on iteration coding algorithm

Jiahui Meng, Zhao Danfeng, Liang Zhang

Published Sep 1, 2018• 0 citations

Abstract

In order to ensure the reliability, stability and high transmission rate of fifth-generation mobile communication technology(5G), this paper proposes a hybrid check matrix construction algorithm based on iterative coding algorithm with linear coding complexity. Firstly, this paper improves the traditional iterative coding algorithm and makes it suitable for non-binary low density parity check(NB-LDPC) codes. Then it adopts backward iterative method to change the coding scheme and the structure of the check matrix so that the progressive edge growth(PEG) algorithm has a lower triangular structure and uses it as the base matrix. Finally, a QC-LDPC algorithm with a lower triangular structure is used to generate a cyclic shift matrix and a finite field coefficient matrix. At the same time, the effect of the short loop is eliminated, and an optimal check matrix is selected from the algorithm. Simulation results show that the non-binary LDPC code constructed by the hybrid construction algorithm not only has linear coding and storage complexity, but also has strong error correction capability.

DOI: 10.16157/j.issn.0258-7998.181410

Related papers

Construction of LDPC Code with Big Girth and Linear-encoding Complexity

Xiaoming Liu

Based on cycle search algorithm and Progressive Edge Growth(PEG) algorithm,this paper proposes a method to construct quasi-cyclic Low-density Parity Check(LDPC) codes with big girth and linear-encoding complexity.A parity-check matrix with a form of approximate lower triangle structure is designed to achieve iterative encoding with linear-encoding complexity.PEG algorithm is used to construct the base matrix and the cycle search algorithm is used to optimize the cycle distribution.And a fast encoding method is proposed.Experimental results show that the LDPC codes constructed with the proposed method can avoid error floor and achieve better BER performance than Tanner-QC-LDPC codes and equivalent BER performance to the ones of random codes.

Jisuanji gongchengJan 1, 20110 citations

An Improved Construction Method of QC-LDPC Codes Based on the PEG Algorithm

Liqun Huang, Yuliang Wang, Ping Gong

Due to quasi-cyclic structure of parity-check matrices, Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes reduce hardware requirements, and thus they have a higher practical value than random LDPC codes. This paper proposes an improved construction method of QC-LDPC based on PEG Algorithm, and the girth of the QC-LDPC codes has an increase of 2. Firstly, a base matrix is generated by the PEG algorithm, and then the base matrix is expanded using the unit circle permutation matrix, at the same time, the short loop of the base matrix is eliminated. This approach has the advantages of the PEG algorithm and the QC-LDPC codes, and simulation results show that bit error rate (BER) performance of the QC-LDPC codes presented in this paper is the same as or exceeds the one of randomly constructed LDPC codes.

Pacific-Asia Conference on Circuits, Communications and SystemsJul 1, 20114 citations

Novel construction and cycle analysis of Quasi-Cyclic Low-Density Parity-Check codes

Wenwen Li, Mao Ai, Jie Qiu +1 more

Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes have practical significance in the field of engineering, thus their construction algorithm is a hot issue in the field of LDPC codes. Based on existing construction methods, particularly the method based on Progressive Edge-Growth (PEG) algorithm, a new construction method of shift matrix is proposed. It can effectively avoid the copy of cycle structures, especially short cycles in base matrix after extension. Besides, it also relieves the time cost caused by random search, and greatly improves the length of cycles when compared with algorithms based on methods such as quadratic congruence and arithmetic sequence. Those algorithms can only eliminate short cycles with length 4, while our method can provide QC-LDPC codes without length 6 at least. Cycle analysis and simulation results show that the newly constructed QC-LDPC codes have good cycle structure and error correction performance.

IEEE International Conference on Progress in Informatics and ComputingDec 1, 20152 citations

The design of structured LDPC codes with algorithmic graph construction

Wojciech Sułek

Low-Density Parity-Check (LDPC) codes are among the most effective modern error-correcting codes due to their excellent correction performance and highly parallel decoding scheme. Moreover, the nonbinary extension of such codes further increases performance in the short-block regime. In this paper, we review the key elements for the construction of implementation-oriented binary and nonbinary codes. These Quasi-Cyclic LDPC (QC-LDPC) codes additionally feature efficient encoder and decoder implementation frameworks. We then present a versatile algorithm for the construction of both binary and nonbinary QC-LDPC codes that have low encoding complexity and an optimized corresponding graph structure. Our algorithm uses a progressive edge growth algorithm, modified for QC-LDPC graph construction, and then performs an iterative global search for optimized cyclic shift values within the QC-LDPC circulants. Strong error correction performance is achieved by minimizing the number of short cycles, and cycles with low external connectivity, within the code graph. We validate this approach via error rate simulations of a transmission system model featuring an LDPC coder-decoder, digital modulation, and additive white Gaussian noise channels. The obtained numerical results validate the effectiveness of the proposed construction algorithm, with a number of constructed codes exhibiting either similar or superior performance to industry standard binary codes and selected nonbinary codes from the literature.

Bulletin of the Polish Academy of Sciences Technical SciencesMay 30, 20220 citations

A novel construction method of quasi-cyclic non-binary LDPC codes in optical communication

Huang Shen

This paper presents a construction method of quasi-cyclic non-binary low density parity-check(NB-LDPC)code based on the finite field three-dimensional construction.After construction of base matrix based on the finite field,a cyclic matrix is constructed with the method of three-dimensional extension.Finally,non-binary parity check matrix with quasi-cyclic feature is constructed.Compared with the GF(29)-based RS(511,305)and NB-LDPC code constructed by the three-dimensional construction can increase 3.3dB net code gain(NCG)at the bit error rate(BER)of 10-7.Compared with the binary QC-LDPC codes constructed by the traditional way,the binary LDPC codes randomly constructed,the32-ary QC-LDPC codes constructed based on finite fields and the 64-ary cyclic LDPC codes constructed based on Euclidean geometry,the NB-LDPC code constructed by the three-dimensional construction can increase 0.56dB,0.56dB,0.03dB and 0.83dB NCGrespectively at the BERof 10-7.Through performance simulation of the NB-LDPC code constructed based on this three-dimensional construction,it shows that such an NB-LDPC code not only has quasi-cyclic feature,conducive to hardware implementation,but also shows better error correction performance in the short code length.

Journal of Optoelectronics·laserJan 1, 20140 citations

Optimized Puncturing of the Check Matrix for Rate-Compatible LDPC Codes

Liang Zhang, Jiahui Meng, Danfeng Zhao

In the wireless communication system, it is necessary to change the transmitted code word or code rate in real time according to the channel environment, designing and implementing rate compatible codes is of great practical significance. In allusion to the defects of algebraically constructed QC-LDPC codes algorithm and the time-varying characteristics of wireless channel, we propose an algorithm based on check matrix optimization puncturing technique to construct QC-LDPC codes in this paper. The algorithm selects a high rate matrix with excellent performance as the parent matrix, and then uses the backward node puncturing method to puncture the information bits in the code word from the last column of the check matrix by a multiple of the number of rows to obtain a low rate matrix. The simulation results show that the rate-compatible non-binary LDPC codes constructed by this algorithm not only reduces the complexity of hardware implementation, but also improves the error correction performance of the non-binary LDPC codes, realizes the rate-compatible coding at the same time, and improves the average effectiveness and reliability of the communication system.

MATEC Web of ConferencesJan 1, 20180 citations