Method for improving preprocessing part in low density check code encode realization

Abstract

Disclosed a method for improving the pre-processing part of the coding realization of low-density check code belongs to the coding technique field. First, try to row-deleted of check matrix of said low-density check code to reach the maximum lower triangular submatrix; the row-delete is operated on partial row vectors of first layer of layered check matrix with the diagonalization operation; secondly, if the number of deleted rows in first layer is wrong, the line whose weight is one can not be find in left matrix formed by the rows and lines without diagonalization after the first diagonalization operation, and the diagonalization operation will be stopped. So the row-delete is needed to delete more row vectors in the first layer until the avalanche effect, which means the left matrix reaches the full diagonalization. Actually, it is a kind of adephagia method, which can control the key parameter at least to reduce the consumption of hardware source of relative layered low-density check code coder.

Description

technical field [0001] The invention relates to a method in the technical field of encoding, in particular to a method for improving the preprocessing part in the realization of low density check code encoding. Background technique [0002] Low Density Check Code (LDPC code for short) is one of the research hotspots in the field of digital communication technology today. Compared with the traditional coding methods, LDPC codes show its superior performance, but the coding complexity of LDPC codes is still a bottleneck problem restricting its further development. In a communication system using LDPC codes, LDPC codes are equivalent to traditional linear block codes, which can be described by generator matrix G and check matrix H. At the originating end (encoder) of the system, traditional encoding algorithms can be used to directly multiply the source bit sequence s by the generator matrix G to obtain encoded codewords. In the actual encoding process, the generator matrix G...

AI Technical Summary

Problems solved by technology

[0008] However, the above method is only applicable to LDPC codes with general random construction. For some specially constructed codewords, especially LDPC codes constructed through layers, the obtained g is relatively large