US 11,240,796 B2Granted

Wireless communication block interleaving

AssigneeTelefonaktiebolaget LM Ericsson (publ)

InventorsXingqin Lin, Jung-Fu Cheng, Stefan Parkvall, Havish Koorapaty

Life of this patent

Estimating the term…

Loading patent…

Abstract

Apparatuses and methods are disclosed for block interleaving. In one embodiment, a method includes generating an interleaver sequence for a control resource set, CORESET, configuration for a physical downlink control channel, the interleaver sequence associated with an interleaving matrix; optionally, for each one of an allowed value of number of rows for the interleaving matrix, determining a number of null entries to be added to the interleaving matrix; and selecting a number of rows, R, for the interleaving matrix such that the number of null entries to be added to the interleaving matrix is: no more than a number of columns, C, of the interleaving matrix; and optionally, the smallest among the numbers of null entries determined for each of the allowed values of number of rows for the interleaving matrix. In another embodiment, a method includes decomposing the interleaver sequence.

Claims24

Dependent claims

A network node configured to communicate with a wireless device (WD), the network node comprising processing circuitry configured to:

generate an interleaver sequence for a control resource set (CORESET) configuration for a physical downlink control channel, the interleaver sequence associated with an interleaving matrix, generating the interleaver sequence includes computing a final sequence selected from a group consisting of at least a first final sequence f(j) being expressed as:
⁢
f
⁡
(
j
)
=
g
⁡
(
(
j
+
n
shift
)
⁢
mod
⁢
(
N
REG
CORESET
/
L
)
)
⁢
g
⁡
(
k
)
=
r
⁢
C
+
c
-
D
k
=
{
c
⁢
R
+
r
-
c
-
1
if
⁢
⁢
c
=
0
,
1
,
…
⁢
,
⁢
D
-
1
,
and
⁢
⁢
r
=
1
,
2
⁢
⁢
…
⁢
,
⁢
R
-
1
c
⁢
R
+
r
-
D
if
⁢
⁢
c
=
D
,
D
+
1
,
…
⁢
,
⁢
C
-
1
,
and
⁢
⁢
r
=
0
,
1
⁢
⁢
…
⁢
,
R
-
1
⁢
⁢
⁢
C
=
⌈
N
REG
CORESET
/
(
L
⁢
R
)
⌉
⁢
⁢
⁢
D
=
CR
-
N
REG
CORESET
/
L
where g(k) is an intermediate sequence, nshift is a cyclic shift of CORESET-interleaver-size, D equals the number of null entries preceding a 0, . . . , NREGCORESET/L−1, NREGCORESET is a number of resource element groups, REGs, in the CORESET, and L is a REG bundle size;
for each one of an allowed value of number of rows for the interleaving matrix, determine a number of null entries to be added to the interleaving matrix;
and
select a number of rows (R) for the interleaving matrix such that the number of null entries to be added to the interleaving matrix is:
no more than a number of columns (C) of the interleaving matrix.

160 more elements

A method for a network node configured to communicate with a wireless device (WD) the method comprising:

generating an interleaver sequence for a control resource set (CORESET) configuration for a physical downlink control channel, the interleaver sequence associated with an interleaving matrix, generating the interleaver sequence includes computing a final sequence selected from a group consisting of at least a first final sequence f(j) being expressed as:
f
⁡
(
j
)
=
g
⁡
(
(
j
+
n
shift
)
⁢
mod
⁡
(
N
R
⁢
E
⁢
G
C
⁢
O
⁢
R
⁢
E
⁢
S
⁢
E
⁢
T
/
L
)
)
g
⁡
(
k
)
=
r
⁢
C
+
c
-
D
k
=
{
c
⁢
R
+
r
-
c
-
1
if
⁢
⁢
c
=
0
,
1
,
…
⁢
,
D
-
1
,
and
⁢
⁢
r
=
1
,
2
⁢
⁢
…
⁢
,
R
-
1
c
⁢
R
+
r
-
D
if
⁢
⁢
c
=
D
,
D
+
1
,
…
⁢
,
C
-
1
,
and
⁢
⁢
r
=
0
,
1
⁢
⁢
…
⁢
,
R
-
1
⁢
⁢
C
=
⌈
N
R
⁢
E
⁢
G
C
⁢
O
⁢
R
⁢
E
⁢
S
⁢
E
⁢
T
/
(
L
⁢
R
)
⌉
⁢
⁢
D
=
CR
-
N
R
⁢
E
⁢
G
C
⁢
O
⁢
R
⁢
E
⁢
S
⁢
E
⁢
T
/
L
where q(k) is an intermediate sequence, nshift is a cyclic shift of CORESET-interleaver-size, D equals the number of null entries preceding a 0, . . . , NREGCORESET/L−1, NREGCORESET is a number of resource element groups, REGs, in the CORESET, and L is a REG bundle size;
for each one of an allowed value of number of rows for the interleaving matrix, determining a number of null entries to be added to the interleaving matrix;
and
selecting a number of rows (R) for the interleaving matrix such that the number of null entries to be added to the interleaving matrix is:
no more than a number of columns (C) of the interleaving matrix.

201 more elements

A wireless device (WD) comprising processing circuitry configured to:

decompose an interleaver sequence for a control resource set (CORESET) configuration for a physical downlink control channel, the interleaver sequence associated with an interleaving matrix, decomposing the interleaver sequence includes computing a final sequence selected from a group consisting of at least a first final sequence f(j) being expressed as:
f
⁡
(
j
)
=
g
⁡
(
(
j
+
n
shift
)
⁢
mod
⁡
(
N
R
⁢
E
⁢
G
C
⁢
O
⁢
R
⁢
E
⁢
S
⁢
E
⁢
T
/
L
)
)
g
⁡
(
k
)
=
r
⁢
C
+
c
-
D
k
=
{
c
⁢
R
+
r
-
c
-
1
if
⁢
⁢
c
=
0
,
1
,
…
⁢
,
D
-
1
,
and
⁢
⁢
r
=
1
,
2
⁢
⁢
…
⁢
,
R
-
1
c
⁢
R
+
r
-
D
if
⁢
⁢
c
=
D
,
D
+
1
,
…
⁢
,
C
-
1
,
and
⁢
⁢
r
=
0
,
1
⁢
⁢
…
⁢
,
R
-
1
⁢
⁢
C
=
⌈
N
R
⁢
E
⁢
G
C
⁢
O
⁢
R
⁢
E
⁢
S
⁢
E
⁢
T
/
(
L
⁢
R
)
⌉
⁢
⁢
D
=
CR
-
N
R
⁢
E
⁢
G
C
⁢
O
⁢
R
⁢
E
⁢
S
⁢
E
⁢
T
/
L
where q(k) is an intermediate sequence, nshift is a cyclic shift of CORESET-interleaver-size, D equals the number of null entries preceding a 0, . . . , NREGCORESET/L−1, NREGCORESET is a number of resource element groups, REGs, in the CORESET, and L is a REG bundle size;
the interleaving matrix having a number of rows (R) selected such that a number of null entries to be added to the interleaving matrix is:
no more than a number of columns (C) of the interleaving matrix.

199 more elements

A method for a wireless device (WD) configured to communicate with a network node, the method comprising:

decomposing an interleaver sequence for a control resource set (CORESET) configuration for a physical downlink control channel, the interleaver sequence associated with an interleaving matrix, decomposing the interleaver sequence includes computing a final sequence selected from a group consisting of at least a first final sequence f(j) being expressed as:
f
⁡
(
j
)
=
g
⁡
(
(
j
+
n
shift
)
⁢
mod
⁡
(
N
R
⁢
E
⁢
G
C
⁢
O
⁢
R
⁢
E
⁢
S
⁢
E
⁢
T
/
L
)
)
g
⁡
(
k
)
=
r
⁢
C
+
c
-
D
k
=
{
c
⁢
R
+
r
-
c
-
1
if
⁢
⁢
c
=
0
,
1
,
…
⁢
,
D
-
1
,
and
⁢
⁢
r
=
1
,
2
⁢
⁢
…
⁢
,
R
-
1
c
⁢
R
+
r
-
D
if
⁢
⁢
c
=
D
,
D
+
1
,
…
⁢
,
C
-
1
,
and
⁢
⁢
r
=
0
,
1
⁢
⁢
…
⁢
,
R
-
1
⁢
⁢
C
=
⌈
N
R
⁢
E
⁢
G
C
⁢
O
⁢
R
⁢
E
⁢
S
⁢
E
⁢
T
/
(
L
⁢
R
)
⌉
⁢
⁢
D
=
CR
-
N
R
⁢
E
⁢
G
C
⁢
O
⁢
R
⁢
E
⁢
S
⁢
E
⁢
T
/
L
where q(k) is an intermediate sequence, nshift is a cyclic shift of CORESET-interleaver-size, D equals the number of null entries preceding a 0, . . . , NREGCORESET/L−1, NREGCORESET is a number of resource element groups, REGs, in the CORESET, and L is a REG bundle size;
the interleaving matrix having a number of rows (R) selected such that a number of null entries to be added to the interleaving matrix is:
no more than a number of columns (C) of the interleaving matrix.

199 more elements

Dependencies are inferred from the claim text.

Facts

Application: 16/960,203Filed 10 Jan 2019 · us provisional application
Priority: 12 Jan 2018
Published: US 2021/0058908 A125 Feb 2021
Granted: 1 Feb 2022
Term ends: Not estimatedThe source records don’t support an estimate.

Classification10 codes

H04L 1/0071
Systems characterized by the type of code used: use of interleaving
H04W 72/23
Control channels or signalling for resource management: in the downlink direction of a wireless link, i.e. towards a terminal
H04L 1/0041
By using forward error control: arrangements at the transmitter end
H04L 5/0053
Arrangements for allocating sub-channels of the transmission path: allocation of signalling, i.e. of overhead other than pilot signals