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

Design of base parity-check matrices for LDPC codes that have subsets of orthogonal rows

An extended matrix and data encoding technology, applied in the direction of encoding, code conversion, encoding components, etc., can solve the problems of parity check matrix destruction, high encoding complexity, etc.

Active Publication Date: 2020-08-04
HUAWEI TECH CO LTD
View PDF15 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the structural part of the parity-check matrix may be corrupted by uncontrollable extensions, making the coding complexity more

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
  • Design of base parity-check matrices for LDPC codes that have subsets of orthogonal rows
  • Design of base parity-check matrices for LDPC codes that have subsets of orthogonal rows
  • Design of base parity-check matrices for LDPC codes that have subsets of orthogonal rows

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0046] In the present invention, the z-row orthogonal basis matrix with the size of mb×nb can be defined as a basis matrix composed of a group of sub-matrices. All submatrices or all submatrices except one are of size z×nb, where z>1; at most one submatrix is ​​of size z′×nb, where z′<z. z, z', mb, and nb are positive natural numbers, and mb and nb also represent the number of rows and columns, respectively.

[0047] A z-row orthogonal basis matrix can be used to describe or represent an LDPC code, and has the advantage that higher row decoder parallelization can be achieved for the obtained LDPC code when expanding said z-row orthogonal basis matrix by a factor q , that is, realize the parallelization of the row decoder with a factor of q×z.

[0048] It should be noted that a submatrix does not necessarily consist of consecutive rows, so a submatrix may, for example, not contain the first and second rows of the associated z-row orthogonal basis matrix, but contain the first ...

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 present invention relates to a type of protograph-based LDPC codes, which are obtained from z-row-orthogonal base matrices with some additional structure constraints, such as a diagonal and / or double-diagonal structure, in order to allow a high parallelization that is a multiple of z, while having an efficient encoding or decoding. In particular, in an embodiment, a 'big' base matrix is constructed from a structured square submatrix in order to have a WiMAX-like structure and a z-row-orthogonality. In another embodiment starting from a 'smaller' base matrix having a part arranged in a double-diagonal shape with tail-biting one, an expansion by a factor equal to z is performed, followed by an addition of a single one-entry into the last column at a specific location, thereby obtaining athree-degree column, and followed by a row and / or column permutation in order to obtain a base matrix in a WiMAX-like structure.

Description

technical field [0001] The present invention relates to the field of information coding and decoding, in particular to the field of low-density parity-check (low-density parity-check, LDPC) codes based on original model graphs. Background technique [0002] Modern LDPC codes are based on protographs. The protograph is a small two-part graph that serves as a template for a larger code and is represented by a so-called basis matrix. Larger encodings are obtained by extending or lifting the protograph, ie by duplicating said protograph q times and interconnecting these copies according to certain constraints. Said factor q is also called expansion factor or boosting factor, the two names are interchangeable. A base matrix with only 1 and 0 elements is usually extended by replacing element 1s with a cyclic permutation matrix (also known as a cyclic permutation matrix). The choice of the cyclic permutation matrix determines the connections between the nodes of the copy of the ...

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 Applications(China)
IPC IPC(8): H03M13/11H03M13/03
CPCH03M13/036H03M13/116H03M13/1185H03M13/1188H03M13/616H03M13/6544
Inventor 巴拉兹·马图兹吉安路易吉·利瓦欧纽尔凯·伊斯坎罗纳尔多·伯恩克许文
Owner HUAWEI TECH CO LTD