US 2020/0313696 A1 · DESIGN OF BASE PARITY-CHECK MATRICES FOR LDPC CODES THAT HAVE SUBSETS OF ORTHOGONAL ROWS

Abstract

Protograph-based LDPC codes 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. A “big” base matrix is constructed from a structured square submatrix in order to have a WiMAX-like structure and a z-row-orthogonality. Also, 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 can be performed, followed by an addition of a single one-entry into the last column at a specific location, thereby obtaining a three-degree column, and followed by a row and/or column permutation in order to obtain a base matrix in a WiMAX-like structure.

Claims15

Dependent claims

A device for providing a matrix for data processing within a communication system the device comprising a processor, and a memory storing program instructions for execution by the processor, wherein when the program instructions are executed by the processor, the processor is configured to:

construct a first matrix, wherein all entries of the first matrix are either zero or one;
expand the first matrix by a factor equal to z into an expanded matrix of size mb×nb in such a manner that the expanded matrix is z-row-orthogonal;
and
modify the expanded matrix into a second matrix of size mb×nb in such a manner that the second matrix is z-row-orthogonal.

1 more element

A device for providing a matrix, for data processing within a communication system, the device comprising a processor, and a memory storing program instructions for execution by the processor wherein when the program instructions are executed by the processor, the processor is configured to:

construct a first matrix of size mb/z×nb/z, wherein a rightmost part of the first matrix is in a double-diagonal shape with tail-biting one and forms a first submatrix;
expand the first matrix by a factor equal to z to obtain a second matrix in such a manner that the second matrix is z-row-orthogonal;
add, at a respective location of the second matrix, a single entry equal to one into the second matrix to obtain a third matrix in such a manner that the third matrix is z-row-orthogonal;
and
permute at least one column or at least one row of the third matrix in order to obtain a fourth matrix in a diagonal form with tail-biting one.

2 more elements

Dependencies are inferred from the claim text.

Facts

Application

16/901,934Filed 15 Jun 2020

Priority

15 Dec 2017

Published

1 Oct 2020

Term ends

Not estimatedThe source records don’t support an estimate.

Classification7 codes

H03M 13/036
Theoretical methods to calculate these checking codes: heuristic code construction methods, i.e. code construction or code search based on using…
H03M 13/1185
Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure: wherein the…
H03M 13/116
Structural properties of the code parity-check or generator matrix: quasi-cyclic LDPC [QC-LDPC] codes, i.e. the parity-check matrix being composed…
H03M 13/1188
Wherein the parity-check matrix comprises a part with a double-diagonal: wherein in the part with the double-diagonal at least one column has an…

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

Life of this patent

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

Life of this patent

Abstract

Claims15