Method and device for constructing low-density parity code check matrix

Abstract

The invention relates to a method and device for constructing low-density parity check-code checking matrix. The constructing method is easy and flexible to implement, because the combination of semirandom constructing mode and structured constructing mode is adopted; besides, the arrays in the basis matrix are arranged in a special manner, the characteristics of irregular codes are achieved and the regularity is ensured. Therefore, the invention not only ensures excellent performance of low-density parity check-code, but also facilitates realization of coding hardware. In addition, short-loop is avoided in the basis matrix during the constructing process, and equal circular shift factors occur in the model matrix; thereby, the checking matrix has no short loop after expansion, and the decoding effect is improved. The invention also provides a group of selected model matrixes that can be expanded into multi-code length. The low-density parity check-code checking matrix with multi-code rate has an extensive application scope and excellent performance.

Description

technical field [0001] The present invention relates to the technical field of communication channel coding, in particular to a method and device for constructing a check matrix of a low-density parity-check code Background technique [0002] In recent years, Low Density Parity Check Codes (LDPC: Low Density Parity Check Codes) have attracted widespread attention due to their performance close to the Shannon limit and relatively simple decoding structure. [0003] LDPC code is developed based on the idea of ​​Belief Propagation (Belief Propagation) iterative decoding. It belongs to a kind of linear block code and can be represented by generator matrix and parity check matrix. It is applicable to the channel coding technology of wireless communication system in applications such as mobile TV and data broadcasting. [0004] The unique characteristic of LDPC code is that the number of "1" in its parity check matrix is ​​much smaller than the number of "0". This particularity i...

AI Technical Summary

Problems solved by technology

A unique property of LDPC codes is that the longer the code length, the better the performance, so the applicable range of the code length of 2304 is too small.

Moreover, different services have different requirements on the coding rate. Obviously, the four code rates of 1 / 2, 2 / 3, 3 / 4, and 5 / 6 in the prior art are too selectable.

[0013] At present, there is no simple and feasible construction method that can construct LDPC code parity check matrix with a wide range of flexible code lengths and a wider range of code rates.

Images