Parallel iterative decoding method for product code

Abstract

This invention relates to a parallel iteration decode method for product codes in a communication field, which selects a method of decoding in all dimension directions simultaneously or alternately decoding in time division at all dimensional directions or partly decoding simultaneously partly decoding alternately in time division according to the proportion of the number of the sub-codes decoders and dimension numbers of the product codes including: N sub-code decoders carry out sub-code decoding at N directions of N dimensional product codes simultaneously, or one decoder decodes at N directions of N dimension product codes alternately in time division, which can start from any dimensional direction of the N dimensions, or when the number of the decoders M is smaller then M, M is smaller than N, they work at the same time or partly work to finish the decode at N directions of N dimension product codes.

Description

technical field

[0001] The invention relates to a decoding method used in the technical field of communication, in particular to a parallel iterative decoding method of a product code. Background technique

[0002] The product code was proposed by Elias in 1954. It is the first error-correcting code that can realize error-free transmission at a non-zero code rate after Shannon's information theory was proposed. Because the hardware level at that time limited its application, its superiority could not be effectively applied for decades. With the application of the iterative decoding algorithm, the product code has once again received attention. In 1994, Pyndiah et al. proposed a soft-input and soft-output decoding algorithm for linear block codes based on the Chase decoding algorithm. Applied to the decoding of subcodes of product codes, a soft-input and soft-output iterative decoding algorithm of product codes similar to Turbo code decoding is given, and they are called Tur...