Method for constructing a communication LDPC (Low Density Parity Check) code capable of eliminating 6/8/10 surrounding line and having column weight of 3 and product thereof

Abstract

The invention discloses a method for constructing a communication LDPC (Low Density Parity Check) code capable of eliminating 6 / 8 / 10 surrounding lines and having a column weight of 3 and a product thereof, and belongs to the technical field of communication transmission channel coding. The method comprises the following steps: firstly, designing a framework and constraint conditions of a number pair array P, and designing a parameter v in the number pair array P by utilizing BIBD (Balance Incomplete Group Design); then, according to a surrounding line generation method in the number pair arrayP, enumerating all 6 / 8 / 10 surrounding lines; taking the enumerated 6 / 8 / 10 girth as a constraint condition of the parameter u, and searching the parameter u; substituting the obtained parameter v andparameter u into the number pair array P; finally, obtaining a basis matrix B according to element design in the number pair array P; vertically expanding the basis matrix B into an extraction matrixHb; and subjecting the extraction matrix Hb to horizontal expansion to form an H matrix; and uniquely determining the LDPC code by the H matrix. Compared with QC-LDPC code, under the constraint conditions of the code rate, the perimeter line and the code length, the regular LDPC code with the column weight of 3 and the 6 / 8 / 10 perimeter line eliminated has a better performance.

Description

technical field

[0001] The invention belongs to the technical field of communication transmission channel coding, and more specifically relates to a communication LDPC code construction method and a product thereof that eliminates 6 / 8 / 10 perimeters and has a column weight of 3. Background technique

[0002] Gallager first proposed the Low Density Check Code (LDPC) code in his doctoral dissertation in 1963, but it did not receive enough attention at that time. Until 1996, Mackey and Neal rediscovered that LDPC codes are a good class of codes approaching Shannon's capacity limit on additive white Gaussian noise (AWGN) channels. In 2001, Hui Jin proposed regular repeat accumulation (RA) codes and irregular repeat accumulation (IRA) codes in his doctoral dissertation, and theoretically proved that RA codes approached the Shannon limit on AWGN channels, and IRA codes in erasure The remaining channels are approaching the Shannon limit.

[0003] A low-density parity-check (LDPC) ...

Images