Method and apparatus for encoding Turbo product code

Abstract

The invention provides a method and apparatus for encoding a Turbo product code, to that the defect of uncorrectable pattern generated at a decoding state of the Turbo product code provided by the prior art can be avoided during the decoding process of the decoder. The method comprises the following steps: encoding an original information matrix to obtain a first codeword matrix; performing interweaving on the original information matrix in the first codeword matrix to obtain a second information matrix block; and encoding the second information matrix block to obtain a first verification matrix block, and placing the first verification matrix block on the right side of a row verification matrix block to obtain a second codeword matrix. The original information matrix in the first codewordmatrix obtained in the encoding mode the same as the traditional 2D Turbo product code is interweaved, so that when a hard decoding algorithm is used for decoding, some uncorrectable patterns are disorganized and broken, so that the bit error rate of the hard decoding algorithm can be greatly reduced, and the decoding performance of the Turbo product code is improved.

Description

technical field [0001] The invention belongs to the field of encoding and decoding, and in particular relates to a method and a device for encoding a Turbo product code. Background technique [0002] The Turbo product code is a block-structured error-correcting code, which can be a two-dimensional Turbo product code composed of two subcodes, or a three-dimensional Turbo product code composed of three subcodes. Usually, the two-dimensional Turbo product code forms an encoding matrix by encoding rows and columns, and its encoding structure is as follows: figure 1 shown. Assume that the subcode encoding rules of rows and columns are C r (n r ,k r , d r ) and C c (n c ,k c , d c ), where n r and n c Indicates the code length, k r and k c Indicates the information bit length, d r and d c Indicates the minimum Hamming distance. The construction steps of the existing two-dimensional Turbo product code are as follows: first k c ×k r The order information bit matrix...

AI Technical Summary

Problems solved by technology

[0003] However, this encoding method is decoded by a hard decoding algorithm, and there will be a permanent error pattern

Images