US 2019/0268021 A1Published application

Method and apparatus for encoding and decoding of variable length quasi-cyclic low-density parity-check, qc-ldpc, codes

AssigneeHuawei Technologies Co., Ltd.

InventorsVasily Stanislavovich USATYUK, ILYA Viktorovich VOROBYEV, Nikita Andreevich POLIANSKII, German Viktorovich SVISTUNOV

Life of this patent

Estimating the term…

patentgrep

Loading patent…

Abstract

A method for quasi-cyclic low-density parity-check (QC-LDPC) encoding and decoding of a data packet by a lifted matrix is provided, the method comprising: lifting the QC-LDPC code for maximal code length Nmax and maximal circulant size Zupper of the base matrix; generating a plurality of optimal values ri for a plurality of circulants Z1, Z2, . . . , Zupper based on the QC-LDPC code lifted for maximal length Nmax, 0≤ri≤Zupper−1; saving the generated plurality of optimal values ri corresponding to the plurality of circulants Z1, Z2, . . . , Zupper and a matrix for the QC-LDPC code lifted for maximal length Nmax in the memory; receiving a current circulant Zcurrent from the plurality of circulants Z1, Z2, . . . , Zupper; selecting a current optimal value rcurrent from the plurality of optimal values ri stored in the memory corresponding to the current circulant Zcurrent; and lifting the base matrix based on the current optimal value rcurrent.

Claims9

Dependent claims

A method for quasi-cyclic low-density parity-check, QC-LDPC, encoding and decoding of a data packet by a lifted matrix, obtained by floor scale modular lifting of a base matrix of a QC-LDPC code,

the method comprising:
lifting the QC-LDPC code for a maximal code length Nmax and a maximal circulant size Zupper of the base matrix, Nmax=Zupper*L, wherein L is the number of columns of the base matrix;
generating a plurality of optimal values ri for a plurality of circulants Z1, Z2, . . . , Zupper based on the QC-LDPC code lifted for maximal length Nmax, 0≤ri≤Zupper−1;
saving the generated plurality of optimal values ri corresponding to the plurality of circulants Z1, Z2, . . . , Zupper and a matrix for the QC-LDPC code lifted for maximal length Nmax in a memory;
and
receiving a current circulant Zcurrent from the plurality of circulants Z1, Z2, . . . , Zupper;
selecting a current optimal value rcurrent from the plurality of optimal values ri stored in the memory corresponding to the current circulant Zcurrent;
and
lifting (106) the base matrix based on the current optimal value rcurrent, wherein a floor lifting of the base matrix is calculated as:
E

(
H
current
)
=
⌊
Z
current
Z
upper

(
(
E

(
H
upper
)
*
r
current
)

mod


Z
upper
)
⌋
,
where E(Hupper) is a value of circulant shift in the base matrix for maximal circulant size;
wherein 0≤rcurrent≤Zupper−1 and rcurrent=1 is excluded.

42 more elements

An apparatus for quasi-cyclic low-density parity-check, QC-LDPC, encoding and decoding of a data packet by a lifted matrix, obtained by floor scale modular lifting of a base matrix of QC-LDPC code,

the apparatus comprising a processor and a memory,
the memory storing:
a maximal length Nmax and a maximal circulant size Zupper of the base matrix,
a matrix for the QC-LDPC code lifted for maximal length Nmax;
and
a plurality of optimal values ri corresponding to a plurality of circulants Z1, Z2, . . . , Zupper, the plurality of optimal values ri is generated based on the QC-LDPC code lifted for maximal length Nmax and maximal circulant size Zupper of the base matrix,
wherein Nmax=Zupper*L, L is a column in the base matrix and 0≤ri≤Zupper−1;
the processor configured to:
receive a current circulant Zcurrent from the plurality of circulants Z1, Z2, . . . , Zupper;
select a current optimal value rcurrent from the plurality of optimal values ri stored in the memory corresponding to the current circulant Zcurrent;
and
lift the base matrix based on the current optimal value rcurrent, wherein a floor lifting of the base matrix is calculated as:
E

(
H
current
)
=
⌊
Z
current
Z
upper

(
(
E

(
H
upper
)
*
r
current
)

mod


Z
upper
)
⌋
,
where E(Hupper) is a value of circulant shift in the base matrix for maximal circulant size;
wherein 0≤rcurrent≤Zupper−1 and rcurrent=1 is excluded.

45 more elements

Dependencies are inferred from the claim text.

Facts

Application: 16/411,268Filed 14 May 2019
Priority: 14 Nov 2016
Published: 29 Aug 2019
Term ends: Not estimatedThe source records don’t support an estimate.

Classification8 codes

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/036
Theoretical methods to calculate these checking codes: heuristic code construction methods, i.e. code construction or code search based on using…
H03M 13/1117
Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms: using approximations for check node processing, e.g. an…
H03M 13/1182
Parity check matrix structured for simplifying encoding, e.g. by having a triangular or an approximate triangular structure: wherein the structure…

Family

Application16/411,268Continuation
US 10,931,310 B2Related patent
US 2019/0268021 A1This patent

From the US filing history. Foreign family members aren’t listed.

Timeline

Citations

Open elsewhere

Building an agent or pulling many patents? Use the API or MCP server instead of scraping pages. Get an API key