US2023396381A1PendingUtilityA1
System and Method for Transmitting a Sub-Space Selection
Est. expiryNov 4, 2036(~10.3 yrs left)· nominal 20-yr term from priority
H04B 7/06952H04L 5/0048H04B 7/0695H04B 7/063H04B 7/066H04B 7/0639H04L 5/0057H04W 72/046H04L 25/0226H04W 16/28H04L 27/00H04L 25/02H04L 27/26
74
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
Embodiments of this disclosure provide techniques for receiving reference signals by a user equipment (UE) from a base station in a downlink channel, as well as transmitting a linear combination index from the UE to the base station. In particular, the linear combination index identifies a combination of beams selected from a set of beams in accordance with the RS.
Claims
exact text as granted — not AI-modified1 . A method, comprising:
selecting, by a user equipment (UE), a first group of beams from a codebook of beams, the first group of beams having a predefined sequence; and transmitting, by the UE to a base station, a first group index, the first group index uniquely identifying the first group of beams from the codebook of beams, a first number of bits representing the first group of beams being equal to ceiling
(
log
2
(
N
M
)
)
,
N being a number of codewords in the codebook of beams, and M being a number of beams in the first group of beams.
2 . The method of claim 1 , wherein the first group index is determined in accordance with:
∑
n
=
1
x
0
(
N
-
n
M
-
1
)
+
[
∑
i
=
0
M
-
3
∑
n
=
x
(
i
)
+
2
x
(
i
+
1
)
(
N
-
n
M
-
2
-
i
)
]
+
x
M
-
1
-
x
M
-
2
-
1
where the first group of beams comprises a number of M different beams each having a respective index value x 0 , x 1 , . . . , x M-1 , and M is an integer greater than one and less than N.
3 . The method of claim 1 , wherein the predefined sequence is an increasing sequential list of beam indices.
4 . The method of claim 1 , wherein each beam in the first group of beams is represented by a corresponding vector or a corresponding matrix.
5 . The method of claim 1 , wherein each beam in the codebook of beams is represented by a corresponding vector or a corresponding matrix.
6 . The method of claim 1 , wherein the first number of bits is a number of bits before potential encoding.
7 . The method of claim 1 , further comprising:
receiving the predefined sequence in a signaling message.
8 . The method of claim 1 , wherein the first group of beams is adjacent to a second group of beams in response to the first group index being adjacent to a second group index, the first group of beams being mapped to the first group index, and the second group of beams being mapped to the second group index.
9 . The method of claim 1 , wherein the first group index is determined in accordance with:
i
1
,
2
=
∑
i
=
0
M
-
1
(
N
-
1
-
n
(
i
)
M
-
1
)
where n (i) ∈{0, 1, . . . , N−1} represents beam indices,
wherein N=N1N2, N1 is an N-ary representation of a first subgroup of beams in the first group of beams, N2 is an N-ary representation of a second subgroup of beams in the first group of beams, and wherein n (i) =N 1 n 2 (i) +n 1 (i) , n 1 (i) ∈{0, 1, . . . , N 1 −1}, n 2 (i) ∈{0, 1, . . . , N 2 −1}.
10 . A method, comprising:
receiving, by a base station from a user equipment (UE), a first group index uniquely identifying a first group of beams selected from a codebook of beams, a first number of bits representing the first group of beams being equal to ceiling
(
log
2
(
N
M
)
)
,
N being a number of codewords in the codebook of beams, and M being a number of beams in the first group of beams; and
mapping, by the base station, the first group index to the first group of beams selected from the codebook of beams, the first group of beams having a predefined sequence.
11 . The method of claim 10 , wherein the first group index is determined in accordance with:
∑
n
=
1
x
0
(
N
-
n
M
-
1
)
+
[
∑
i
=
0
M
-
3
∑
n
=
x
(
i
)
+
2
x
(
i
+
1
)
(
N
-
n
M
-
2
-
i
)
]
+
x
M
-
1
-
x
M
-
2
-
1
where the first group of beams comprises a number of M different beams each having a respective index value x 0 , x 1 , . . . , x M-1 , and M is an integer greater than one and less than N.
12 . The method of claim 10 , wherein the predefined sequence is an increasing sequential list of beam indices.
13 . The method of claim 10 , wherein each beam in the first group of beams is represented by a corresponding vector or a corresponding matrix.
14 . The method of claim 10 , wherein each beam in the codebook of beams is represented by a corresponding vector or a corresponding matrix.
15 . The method of claim 10 , wherein the first number of bits is a number of bits before potential encoding.
16 . The method of claim 10 , further comprising:
transmitting the predefined sequence in a signaling message.
17 . The method of claim 10 , wherein the first group of beams is adjacent to a second group of beams in response to the first group index being adjacent to a second group index, the first group of beams being mapped to the first group index, and the second group of beams being mapped to the second group index.
18 . The method of claim 10 , wherein the first group index is determined in accordance with:
i
1
,
2
=
∑
i
=
0
M
-
1
(
N
-
1
-
n
(
i
)
M
-
i
)
where n (i) ∈{0, 1, . . . , N−1} represents beam indices,
wherein N=N1N2, N1 is an N-ary representation of a first subgroup of beams in the first group of beams, N2 is an N-ary representation of a second subgroup of beams in the first group of beams, and wherein n (i) =N 1 n 2 (i) +n 1 (i) , n 1 (i) ∈{0, 1, . . . , N 1 −1}, n 2 (i) ∈{0, 1, . . . , N 2 −1}.
19 . A user equipment (UE), comprising:
one or more processors; and a non-transitory computer-readable medium storing instructions for execution by the one or more processors to cause the UE to perform operations including: selecting a first group of beams from a codebook of beams, the first group of beams having a predefined sequence; and transmitting, to a base station, a first group index, the first group index uniquely identifying the first group of beams from the codebook of beams, a first number of bits representing the first group of beams being equal to ceiling
(
log
2
(
N
M
)
)
,
N being a number or codewords in the codebook of beams, and M being a number of beams in the first group of beams.
20 . The UE of claim 19 , wherein the first group index is determined in accordance with:
∑
n
=
1
x
0
(
N
-
n
M
-
1
)
+
[
∑
i
=
0
M
-
3
∑
n
=
x
(
i
)
+
2
x
(
i
+
1
)
(
N
-
n
M
-
2
-
i
)
]
+
x
M
-
1
-
x
M
-
2
-
1
where the first group of beams comprises a number of M different beams each having a respective index value x 0 , x 1 , . . . , x M-1 , and M is an integer greater than one and less than N.
21 . The UE of claim 19 , wherein the first group index is determined in accordance with:
i
1
,
2
=
∑
i
=
0
M
-
1
(
N
-
1
-
n
(
i
)
M
-
i
)
where n (i) ∈{0, 1, . . . , N−1} represents beam indices,
wherein N=N1N2, N1 is an N-ary representation of a first subgroup of beams in the first group of beams, N2 is an N-ary representation of a second subgroup of beams in the first group of beams, and wherein n (i) =N 1 n 2 (i) +n 1 (i) , n 1 (i) ∈{0, 1, . . . , N 1 −1}, n 2 (i) ∈{0, 1, . . . , N 2 −1}.
22 . A base station, comprising:
one or more processors; and a non-transitory computer-readable medium storing instructions for execution by the one or more processors to cause the base station to perform operations including: receiving, from a user equipment (UE), a first group index uniquely identifying a first group of beams selected from a codebook of beams, a first number of bits representing the first group of beams being equal to ceiling
(
log
2
(
N
M
)
)
,
N being a number or codewords in the codebook of beams, and M being a number of beams in the first group of beams; and
mapping the first group index to the first group of beams selected from the codebook of beams, the first group of beams having a predefined sequence.
23 . The base station of claim 22 , wherein the first group index is determined in accordance with:
∑
n
=
1
x
0
(
N
-
n
M
-
1
)
+
[
∑
i
=
0
M
-
3
∑
n
=
x
(
i
)
+
2
x
(
i
+
1
)
(
N
-
n
M
-
2
-
i
)
]
+
x
M
-
1
-
x
M
-
2
-
1
where the first group of beams comprises a number of M different beams each having a respective index value x 0 , x 1 , . . . , x M-1 , and M is an integer greater than one and less than N.
24 . The base station of claim 22 , wherein the first group index is determined in accordance with:
i
1
,
2
=
∑
i
=
0
M
-
1
(
N
-
1
-
n
(
i
)
M
-
i
)
where n (i) ∈{0, 1, . . . , N−1} represents beam indices,
wherein N=N1N2, N1 is an N-ary representation of a first subgroup of beams in the first group of beams, N2 is an N-ary representation of a second subgroup of beams in the first group of beams, and wherein n (i) =N 1 n 2 (i) +n 1 (i) , n 1 (i) ∈{0, 1, . . . , N 1 −1}, n 2 (i) ∈{0, 1, . . . , N 2 −1}.Join the waitlist — get patent alerts
Track US2023396381A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.