Data processing method, device and terminal based on ldpc encoder

Abstract

Embodiments of the present application provide an LDPC encoder-based data processing method, device, terminal, and storage medium. The method includes: obtaining the source bit stream to be processed, and determining the pre-edited configuration information; based on the configuration information, determining the target code table in a plurality of pre-stored code tables; grouping the source bit stream according to the configuration information, And construct the target code table into a corresponding parity check matrix according to the grouping result; determine the respective index addresses for the check bits in the parity check matrix corresponding to each group; The address determines the parity bits corresponding to each information bit of the source bit stream, and performs encoding processing to obtain an LDPC code. In the embodiment of the present application, the check matrix is ​​constructed by grouping to determine the index address matrix for the check matrix, which solves the calculation overhead caused by the continuous access code in the prior art, and improves the efficiency of the LDPC encoder.

Description

technical field [0001] The present application relates to the technical field of wireless communication, and in particular to a data processing method, device, terminal and storage medium based on an LDPC encoder. Background technique [0002] The DVB-S2 standard is the most widely used second-generation digital TV broadcast satellite standard in the world. It mainly uses BCH and LDPC concatenated codes for channel coding, that is, the output of BCH is the input of LDPC. Among them, the general implementation of LDPC coding is the RU and LU coding algorithms, which convert the check code matrix of the LDPC code into a lower triangular or approximate lower triangular form, and use an iterative algorithm to reduce the complexity of coding when calculating the check bit information , but its encoding complexity is proportional to the square of the code length, the complexity is high, and the storage G matrix is ​​also very large, so it cannot meet the needs of different encodin...

AI Technical Summary

Problems solved by technology

Among them, the general implementation of LDPC coding is the RU and LU coding algorithms, which convert the check code matrix of the LDPC code into a lower triangular or approximate lower triangular form, and use an iterative algorithm to reduce the complexity of coding when calculating the check bit information , but its encoding complexity is proportional to the square of the code length, the complexity is high, and the storage G matrix is ​​also huge, so it cannot adapt to the needs of different encoding rates

In addition, in the related art, the codeword parameters of the LDPC codes generally constructed by the random method are flexible, but there is no certain code structure, the coding complexity is too high, and it is not easy to realize in engineering, such as using FPGA, DSP, etc.

The LDPC code realized by a certain coding structure has a cyclic or quasi-cyclic structure. The coding is very simple and shows good performance. However, the parameter selection of code length and code rate is greatly restricted.

Images