Unlock instant, AI-driven research and patent intelligence for your innovation.

An Error Correction Method Constructing Full Diversity LDPC Codes Based on Parity Check Matrix Decomposition

A parity check matrix and LDPC code technology, which is applied in the field of error correction based on parity check matrix decomposition to construct full diversity LDPC codes, can solve problems such as increasing system design complexity, and achieve superior error correction capability and low design complexity. Effect

Active Publication Date: 2021-10-12
TIANJIN UNIV
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] Although the above methods all realize the full diversity of LDPC codes, they cannot make good use of the optimization results obtained in the current LDPC code construction because they all need to be specially designed for the structure of LDPC codes. In some application scenarios, such as collaborative Under the framework of communication, the complexity of system design is increased

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • An Error Correction Method Constructing Full Diversity LDPC Codes Based on Parity Check Matrix Decomposition
  • An Error Correction Method Constructing Full Diversity LDPC Codes Based on Parity Check Matrix Decomposition
  • An Error Correction Method Constructing Full Diversity LDPC Codes Based on Parity Check Matrix Decomposition

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0072] In this embodiment, the regular LDPC code with a code length of 504 and a code rate of 1 / 2 constructed by the PEG algorithm is first split, and decomposed into the first sub-matrix corresponding to the information bits by exchanging columns and the second sub-matrix corresponding to the check digit Second, from the first submatrix Extract the unit interleaving matrix π from 252×252 , at this time the third sub-matrix fourth submatrix

[0073] Then, construct or select 2 unit interleaving matrices (π 1 ) 252×252 and (π 2 ) 252×252 , the submatrix corresponding to the information bit and the submatrix of check digits And two unit interleaving matrices are cross-combined to generate an LDPC code check matrix with full diversity characteristics; finally, optimize the unit interleaving matrix (π 1 ) 252×252 and (π 2 ) 252×252 , to generate a full-diversity LDPC code parity check matrix with good ring length characteristics.

[0074] In this embodiment, t...

Embodiment 2

[0077] In this embodiment, the irregular LDPC code with a code length of 504 and a code rate of 1 / 2 constructed by the PEG algorithm is first split, and decomposed into the first sub-matrix corresponding to the information bits by exchanging columns and the second sub-matrix corresponding to the check digit Second, from the first submatrix Extract unit interleaving matrix π 252×252 , at this time the third sub-matrix fourth submatrix

[0078] Then, construct or select 2 unit interleaving matrices (π 1 ) 252×252 and (π 2 ) 252×252 , the submatrix corresponding to the information bit and the submatrix of check digits And two unit interleaving matrices are cross-combined to generate an LDPC code check matrix with full diversity characteristics; finally, optimize the unit interleaving matrix (π 1 ) 252×252 and (π 2 ) 252×252 , to generate a full-diversity LDPC code parity check matrix with good ring length characteristics.

[0079] In this embodiment, the full...

Embodiment 3

[0082] In this embodiment, the irregular LDPC code with a code length of 504 and a code rate of 1 / 2 constructed by the PEG algorithm is first split, and decomposed into the first sub-matrix corresponding to the information bits by exchanging columns and the second sub-matrix corresponding to the check digit; secondly, from the first sub-matrix Extract unit interleaving matrix π 252×252 ,

[0083] At this point the third sub-matrix fourth submatrix

[0084] Then, construct or select 2 unit interleaving matrices (π 1 ) 252×252 and (π 2 ) 252×252 , the submatrix corresponding to the information bit and the submatrix of the check digit And two unit interleaving matrices are cross-combined to generate an LDPC code check matrix with full diversity characteristics; finally, optimize the unit interleaving matrix (π 1 ) 252×252 and (π 2 ) 252×252 , to generate a full-diversity LDPC code parity check matrix with good ring length characteristics.

[0085] In this embo...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses an error correction method for constructing a full-diversity LDPC code based on the decomposition of a parity check matrix, which includes: exchanging the columns of the check matrix of the LDPC code, decomposing it into the first sub-matrix corresponding to the information bit and the corresponding check matrix The second sub-matrix of the check bit; the unit interleaving matrix is ​​extracted from the first sub-matrix, that is, the third sub-matrix corresponding to the information bit after the unit interleaving matrix is ​​decomposed, and the fourth sub-matrix corresponding to the check bit; The third sub-matrix, the fourth sub-matrix of the check digit and the two unit interleaving matrices are cross-combined to generate an LDPC code check matrix with full diversity characteristics: optimize the unit interleaving matrix in the LDPC check matrix to generate a full-diversity LDPC code check matrix check matrix; the full diversity LDPC code check matrix is ​​applied to the wireless communication multi-antenna system to correct codeword errors caused by block fading. The full-diversity LDPC codes constructed by this method have full-diversity characteristics, and the construction complexity is low.

Description

technical field [0001] The invention belongs to the technical field of error correction coding in communication or storage, and in particular relates to an error correction method for constructing a full-diversity LDPC code based on parity-check matrix decomposition. Background technique [0002] In traditional random noise channels, such as Additive White Gaussian Noise (AWGN) channels, error correction codes are the main technical means to ensure reliable information transmission or storage. Coding gain is the main index to measure the performance of error correcting codes. The Low-Density Parity-Check (LDPC) code proposed by the scholar Professor Gallager has a very strong error correction capability in the AWGN channel, and has entered many communication and storage systems one after another to ensure the reliability of data transmission or storage . [0003] However, in some application scenarios, such as: multi-antenna transmission system, retransmission mechanism, c...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): H03M13/11
CPCH03M13/1151
Inventor 陈为刚黄刚韩昌彩彭昱杨晋生
Owner TIANJIN UNIV