A Construction Method of Quasi-random ldpc Convolutional Code and Encoder Design

Abstract

The invention provides a construction method of quasi-random LDPC convolutional codes and encoder design. The construction method comprises the steps as follows: obtaining a check matrix of LDPC block codes according to a Gallager random construction rule, performing random exchange of rows and lines to eliminate adverse factors, and obtaining a matrix Hg; successively substituting even number lines and odd number lines from left to right; performing number substitution and four-ring detection; shearing the check matrix with the slope of 1 / 2; performing horizontal and vertical integration to obtain a novel (1, 3, 6) LDPC convolutional code construction scheme; and performing cyclic-dynamic-based coding on the convolutional codes. The construction method of the quasi-random LDPC convolutional codes is concise in process, good error correction performance can be guaranteed, a large number of optional code sources are provided, the construction method has stronger competitiveness power in encoding complexity compared with the LDPC block codes, and the designed encoder based on cyclic dynamic indexes has strong popularity and transportability.

Description

technical field [0001] The invention relates to a construction method of a convolutional code and an encoder design in the field of error-correcting codes, in particular to a construction method of a quasi-random LDPC convolutional code and an encoder design thereof. Background technique [0002] Jimenez proposed that the LDPC convolutional code is an error-correcting code class defined by a semi-infinite-length sparse check matrix, which has a high cost performance. Bates S2005 stated that it can complete the coding and decoding of continuous data without dividing blocks, which is especially suitable for The communication system with variable frame length mainly includes two types, one is the random LDPC convolutional code, which can obtain a semi-infinite sparse parity check matrix through a series of processing on the parity check matrix of the random LDPC block code; One is the quasi-cyclic LDPC convolutional code. In the 1970s, some scholars proposed a method of constru...

AI Technical Summary

Problems solved by technology

However, when the method proposed by Jimenez cuts the parity check matrix, it must first interleave and then insert fixed sequences on both sides, and the process is more cumbersome.

[0003] At present, LDPC convolutional codes are a research hotspot in the field of error correction codes. There are many related achievements in IEEE literature, but their share is far less than that of LDPC block codes, especially random LDPC convolutional codes, which shows that the research efforts are obviously insufficient. Moreover, the existing construction process is not concise enough, the error correction performance needs to be further improved, and the design method of the encoder needs to be further improved

Images