High speed LDPC decoder implementing method based on matrix block

Abstract

The invention relates to a matrix partitioning-based realizing method of a high-speed LDPC encoder, which pertains to the technical field of channel coding. The method of the invention comprises the following specific steps that: (1) an LDPC code provided with a partitioning check matrix is constructed; firstly, a check matrix is constructed by using an algebraic approach; the check matrix has no circlet so as to guarantee the performance of the constructed code word; and then the rows of the check matrix are rearranged according to a certain rule to lead the rearranged check matrix to have the partition structure; (2) under a state that the check matrix of the LDPC code has the partition structure, the high-speed parallel decoding of the LDPC code is realized. The realizing method of the invention can realize the high-speed parallel decoding of the LDPC code in engineering; the complexity of the decoding is very low and the constructed code word has no circlet but good performance which is comparable to that of the code word which is constructed randomly.

Description

technical field [0001] The invention relates to an LDPC decoding method, in particular to a method for realizing a high-speed LDPC decoder based on matrix partitioning, and belongs to the technical field of channel coding. Background technique [0002] In satellite communication, deep space communication and various wireless communication systems, in order to improve the anti-noise ability of the system, channel coding is essential. Among all current channel codes, LDPC codes are the closest good codes to the Shannon limit, and their performance is better than Turbo codes. The decoding of LDPC codes adopts BP (Belief Propagation) iterative decoding algorithm, which not only has good decoding performance, but also has linear decoding complexity. More importantly, this is a parallel decoding algorithm, which can be extremely Greatly improve decoding speed. However, in engineering implementation, for completely randomly constructed codewords, the reading and writing speed of ...

AI Technical Summary

Problems solved by technology

At this time, although multiple CNU units and VNU units can work at the same time, since L(q ij ) or L(r ji ) The speed of reading and writing numbers is slow, most of the time it is in a waiting state, cannot work effectively, and parallel operations cannot be realized

[0027] One solution is to put L(q ij ) and L(r ji Each data in ) is stored in a register, then L(q ij ) and L(r ji ) to read and write any data, at this time, the CNU unit and the VNU unit can work completely in parallel, and the decoder can reach a very high speed, but this method will consume a lot of resources, and when the code length is long is impossible to achieve, and is not practical in the usual medium-speed systems

Images