A method for constructing check matrix of multi-ary ldpc code with orderly arranged non-zero elements

Abstract

The invention discloses a method for constructing a multi-ary system LDPC code inspection matrix in which non-zero elements are arranged in order. In the check matrix of the LDPC code, an orderly arrangement is proposed for the element distribution of the position of the non-zero element, so that each row is the same non-zero element; the basic operation step is the allocation of the non-zero position element in each row, throughout the entire check In the process of matrix construction, the obtained optimal degree distribution finds the position of non-zero elements in each row, and through iteration, the orderly distribution of non-zero elements is realized, and the check matrix with orderly arranged non-zero elements is obtained. The invention solves the problems of large storage capacity and complex encoding of the check matrix in the prior art, and effectively reduces the computational complexity. To achieve the following effect: know the first element in the same line, you can know any element in the line.

Description

[0001] Technical field: [0002] 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. [0003] Background technique: [0004] 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. [0005] 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...

AI Technical Summary

Problems solved by technology

The check matrix H construction methods of the existing common multi-ary L DPC 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 value of the check matrix H. The position of the element is constructed without considering the impact 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