Method for constructing multi-system LDPC code check matrix of orderly arranged non-zero elements

Abstract

The invention discloses a method for constructing a multi-system LDPC (Low-Density Parity Check) code check matrix of orderly arranged non-zero elements. In the LDPC code check matrix, ordered arrangement is proposed for the element distribution in the positions of the non-zero elements so that each row is composed of the same non-zero elements; a basic operation step of distributing the non-zero position elements in each row runs through the entire check matrix construction process, the positions of the non-zero elements in each row are found out by virtue of the obtained optimal distribution, ordered distribution of the non-zero elements is realized by use of iteration, and finally, the check matrix of the orderly arranged non-zero elements is obtained. The method is used for solving the problems of relatively large storage capacity and complex encoding of the check matrix in the prior art, and effectively reducing the complexity of calculation. The method has the effect that any element in one row can be known if a header element in the row is known.

Description

Technical field: [0001] The invention belongs to the communication field, and relates to a check matrix error correction code encoding method used in mobile communication channel encoding and decoding, in particular to a method for constructing a multi-ary LDPC code check matrix in which non-zero elements are arranged in an orderly manner. Background technique: [0002] To ensure the quality of wireless communication, the channel coding method is very important. Multi-ary LDPC codes are a hot topic in the field of communication channel coding and decoding. The purpose of research on multi-ary LDPC codes is to achieve a compromise between lower decoding complexity and better bit error performance. The error correction performance of multi-ary LDPC codes is determined by the constructed check matrix. [0003] The multi-ary LDPC code is mainly characterized by a sparse check matrix H, in which there are only a few non-zero elements, and most of the elements are zero. The cur...

AI Technical Summary

Problems solved by technology

The check matrix H construction methods of the existing common multi-ary LDPC codes, whether it is the Gallager construction method, the Mackay and Davey construction method, the finite geometry construction method, or the combination design method, all focus on determining the non-zero elements of the check matrix H The positions of these non-zero elements are constructed without considering the influence of the rationality of the position distribution of these non-zero elements on the performance of the check matrix H

The shortcomings of the check matrix H constructed without reasonable optimization of the position distribution of non-zero elements are: large hardware resource requirements, often requiring larger storage units and computing units; more complex encoding, and greater encoding delay

This not only causes a lot of waste of hardware and time, but also affects the communication quality to a certain extent.

Images