US 12,519,515 B2Granted

Data processing method and apparatus

AssigneeHuawei Technologies Co., Ltd.

InventorsHuiying Zhu, Pengpeng Dong, Zhiyuan Tan

Life of this patent

Estimating the term…

Loading patent…

Abstract

A data processing method and apparatus are disclosed, which may be applied to communication systems such as 5G systems and 6G systems. The method includes: obtaining an extended first codebook based on a second codebook by increasing a quantity of codewords or lengths of codewords, and performing first network coding or decoding based on the first codebook. Linear independence between codewords in the extended first codebook may be ensured as much as possible, so as to generate more valid redundant packets or check packets, thereby improving system reliability. Alternatively, flexible block lengths are supported, so as to perform efficient network coding or decoding on more original data packets, thereby improving system spectral efficiency. This application may be applied to an extended reality (XR) service or a low-delay service.

Claims9

Dependent claims

A data processing method, comprising:

obtaining a first codebook;
and
performing first network coding or decoding based on the first codebook, wherein
the first codebook comprises a codeword in a third codebook, the third codebook is different from a second codebook, and the second codebook is used to perform second network coding or decoding;
any codeword in the first codebook comprises:
s elements in one codeword in the second codebook, and at least some elements in one codeword in the third codebook or one codeword in the second codebook, wherein s is a length of one codeword in the second codebook, s is a positive integer, and a quantity of all the elements is a length of one codeword in the third codebook or the second codebook;
the third codebook corresponds to a first matrix, the first matrix is a random coefficient full-rank matrix, the second codebook corresponds to a second matrix, and the second matrix is a non-random coefficient full-rank matrix;
or
the third codebook corresponds to the first matrix, the second codebook corresponds to the second matrix,
wherein
the first matrix satisfies
V
1
=
[
b
1
0
b
2
0
…
b
m
0
…
b
q
0
b
1
1
b
2
1
…
b
m
1
…
b
q
1
⋮
⋮
⋱
⋮
⋱
⋮
b
1
l
b
2
l
…
b
m
l
…
b
q
l
⋮
⋮
⋱
⋮
⋱
⋮
b
1
K
-
1
b
2
K
-
1
…
b
m
K
-
1
…
b
q
K
-
1
]
,
and the second matrix satisfies
V
0
=
[
a
1
0
a
2
0
…
a
m
0
…
a
q
0
a
1
1
a
2
1
…
a
m
1
…
a
q
1
⋮
⋮
⋱
⋮
⋱
⋮
a
1
l
a
2
l
…
a
m
l
…
a
q
l
⋮
⋮
⋱
⋮
⋱
⋮
a
1
K
-
1
a
2
K
-
1
…
a
m
K
-
1
…
a
q
K
-
1
]
,
wherein [b1, b2, . . . bm, . . . , bq] and [a1, a2, . . . , am, . . . , aq] are different;
or
the first matrix satisfies
V
1
=
[
b
1
0
b
2
0
…
b
m
0
…
b
q
0
b
1
1
b
2
1
…
b
m
1
…
b
q
1
⋮
⋮
⋱
⋮
⋱
⋮
b
1
l
b
2
l
…
b
m
l
…
b
q
l
⋮
⋮
⋱
⋮
⋱
⋮
b
1
K
-
1
b
2
K
-
1
…
b
m
K
-
1
…
b
q
K
-
1
]
T
,
and the second matrix satisfies
V
0
=
[
a
1
0
a
2
0
…
a
m
0
…
a
q
0
a
1
1
a
2
1
…
a
m
1
…
a
q
1
⋮
⋮
⋱
⋮
⋱
⋮
a
1
l
a
2
l
…
a
m
l
…
a
q
l
⋮
⋮
⋱
⋮
⋱
⋮
a
1
K
-
1
a
2
K
-
1
…
a
m
K
-
1
…
a
q
K
-
1
]
T
,
wherein [b1, b2, . . . , bm, . . . , bq]T and [a1, a2, . . . , am, . . . , aq]T are different, wherein
K is a quantity of original data packets corresponding to the first network coding or decoding, and q is a field size of a finite field minus 1;
am is an element in the finite field, 1≤m≤q, a1, a2, . . . , am, . . . , aq are different elements in the finite field, aml is am raised to the power of l, and 0≤l≤K−1;
and
bm is an element in the finite field, 1≤m≤q, b1, b2, . . . , bm, . . . , bq are different elements in the finite field, bml is bm raised to the power of l, and 0≤l≤K−1.

348 more elements

A data processing method, comprising:

obtaining a first codebook;
and
performing first network coding or decoding based on the first codebook, wherein
the first codebook comprises a codeword in a third codebook, the third codebook is different from a second codebook, and the second codebook is used to perform second network coding or decoding;
any codeword in the first codebook comprises:
s elements in one codeword in the second codebook, and at least some elements in one codeword in the third codebook or one codeword in the second codebook, wherein s is a length of one codeword in the second codebook, s is a positive integer, and a quantity of all the elements is a length of one codeword in the third codebook or the second codebook;
the third codebook corresponds to a first matrix, the first matrix is a random coefficient full-rank matrix, the second codebook corresponds to a second matrix, and the second matrix is a non-random coefficient full-rank matrix;
or
the third codebook corresponds to the first matrix, the second codebook corresponds to the second matrix, wherein the first matrix is a product of the second matrix and a diagonal matrix corresponding to a non-zero row vector v=[v1, . . . , vK] or [v1, . . . , vq] or a non-zero column wherein K is a quantity of original data packets corresponding to the first network coding or decoding, and q is a field size of a finite field minus 1.

6 more elements

A data processing apparatus, comprising at least one processing circuit and at least one memory storing instructions that, when executed by the at least one processing circuit, cause the data processing apparatus to perform operations comprising:

obtaining a first codebook;
and
configuring to perform first network coding or decoding based on the first codebook, wherein
the first codebook comprises a codeword in a third codebook, the third codebook is different from a second codebook, and the second codebook is used to perform second network coding or decoding;
any codeword in the first codebook comprises:
s elements in one codeword in the second codebook, and at least some elements in one codeword in the third codebook or one codeword in the second codebook, wherein s is a length of one codeword in the second codebook, s is a positive integer, and a quantity of all the elements is a length of one codeword in the third codebook or the second codebook;
the third codebook corresponds to a first matrix, the first matrix is a random coefficient full-rank matrix, the second codebook corresponds to a second matrix, and the second matrix is a non-random coefficient full-rank matrix;
or
the third codebook corresponds to the first matrix, the second codebook corresponds to the second matrix,
wherein
the first matrix satisfies
V
1
=
[
b
1
0
b
2
0
…
b
m
0
…
b
q
0
b
1
1
b
2
1
…
b
m
1
…
b
q
1
⋮
⋮
⋱
⋮
⋱
⋮
b
1
l
b
2
l
…
b
m
l
…
b
q
l
⋮
⋮
⋱
⋮
⋱
…
b
1
K
-
1
b
2
K
-
1
…
b
m
K
-
1
…
b
q
K
-
1
]
,
and the second matrix satisfies
V
0
=
[
a
1
0
a
2
0
…
a
m
0
…
a
q
0
a
1
1
a
2
1
…
a
m
1
…
a
q
1
⋮
⋮
⋱
⋮
⋱
⋮
a
1
l
a
2
l
…
a
m
l
…
a
q
l
⋮
⋮
⋱
⋮
⋱
…
a
1
K
-
1
a
2
K
-
1
…
a
m
K
-
1
…
a
q
K
-
1
]
T
,
wherein [b1, b2, . . . , bm, . . . , bq] and [a1, a2, . . . , am, . . . , aq] are different;
or
the first matrix satisfies
V
1
=
[
b
1
0
b
2
0
…
b
m
0
…
b
q
0
b
1
1
b
2
1
…
b
m
1
…
b
q
1
⋮
⋮
⋱
⋮
⋱
⋮
b
1
l
b
2
l
…
b
m
l
…
b
q
l
⋮
⋮
⋱
⋮
⋱
…
b
1
K
-
1
b
2
K
-
1
…
b
m
K
-
1
…
b
q
K
-
1
]
T
,
and the second matrix satisfies
V
0
=
[
a
1
0
a
2
0
…
a
m
0
…
a
q
0
a
1
1
a
2
1
…
a
m
1
…
a
q
1
⋮
⋮
⋱
⋮
⋱
⋮
a
1
l
a
2
l
…
a
m
l
…
a
q
l
⋮
⋮
⋱
⋮
⋱
…
a
1
K
-
1
a
2
K
-
1
…
a
m
K
-
1
…
a
q
K
-
1
]
T
,
wherein [b1, b2, . . . , bm, . . . , bq]T and [a1, a2, . . . , am, . . . , aq]T are different, wherein
K is a quantity or original data packets corresponding to the first network coding or decoding, and q is a field size of a finite minus 1;
am is an element in the finite field, 1≤m≤q, a1, a2, . . . , am, . . . , aq are different elements in the finite field, aml is am raised to the power of l, and 0≤l≤K−1;
and
bm is an element in the finite field, 1≤m≤q, b1, b2, . . . bm, . . . , bq are different elements in the finite field, bml is bm raised to the power of l, and 0≤l≤K−1.

349 more elements

Dependencies are inferred from the claim text.

Facts

Application: 18/398,385Filed 28 Dec 2023 · continuation
Priority: CN 202110727292.929 Jun 2021
Published: US 2024/0214042 A127 Jun 2024
Granted: 6 Jan 2026
Term ends: Not estimatedThe source records don’t support an estimate.

Classification15 codes

H04B 7/0482
Selection of precoding matrices or codebooks, e.g. using matrices antenna weighting: adaptive codebooks
H04L 1/0076
By using forward error control: distributed coding, e.g. network coding, involving channel coding
H03M 13/27
Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability…:…
H03M 13/2933
Combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes: using a…