US 2020/0092919 A1Published application

Random access sequence generation method, device, and system

AssigneeHuawei Technologies Co., Ltd.

InventorsYue Zhao, Zhiheng Guo, Qiang Wu

Life of this patent

Estimating the term…

Loading patent…

Abstract

Embodiments of the present application provide a random access sequence generation method, and an apparatus. The method includes: generating, by a base station, notification signaling, where the notification signaling includes indication information, the indication information is used to instruct user equipment UE to select a shift sequence number from a range of 0 to (nshiftRAngroupRA+nshiftRA+nshiftRA+shiftRA−1), the shift sequence number is an integer, nshiftRA is a quantity of UE candidate sequence shifts in a group, ngroupRA is a quantity of groups, nshiftRA is a quantity of UE candidate sequence shifts in the last length that is insufficient for a group, nshiftRA is a quantity of UE candidate sequence shifts in first remaining sequence shifts, and shiftRA is a quantity of UE candidate sequence shifts in second remaining sequence shifts; and sending, by the base station, the notification signaling to the UE, so that the UE generates a random access sequence according to the indication information.

Claims20

Dependent claims

A method for generating a random access sequence in a communication system, comprising:

obtaining, by a communication apparatus, a cyclic shift value Cv according to a shift sequence number v, wherein:
Cv=dstart└v/nshiftRA┘+(v mod nshiftRA)NCS (1),
wherein v is an integer, NCS is a quantity of cyclic shifts for a user equipment,
wherein nshiftRA and dstart satisfy formulas (4) and (5), respectively, or nshiftRA and dstart satisfy formulas (12) and (13), respectively, or nshiftRA and dstart satisfy formulas (20) and (21), respectively, or nshiftRA and dstart satisfy formulas (28) and (29), respectively, wherein
n
shift
RA
=
⌊
4

d
c
-
N
ZC
N
CS
⌋
,
(
4
)
d
start
=
4

d
u
-
N
ZC
+
n
shift
RA
·
N
CS
,
(
5
)
n
shift
RA
=
⌊
N
ZC
-
3

d
u
N
CS
⌋
,
(
12
)
d
start
=
N
ZC
-
3

d
u
+
n
shift
RA
·
N
CS
,
(
13
)
n
shift
RA
=
⌊
3

d
u
-
N
ZC
N
CS
⌋
,
(
20
)
d
start
=
3

d
u
-
N
ZC
+
n
shift
RA
·
N
CS
,
(
21
)
n
shift
RA
=
⌊
N
ZC
-
2

d
u
N
CS
⌋
,
(
28
)
d
start
=
2

(
N
ZC
-
2

d
u
)
+
n
shift
RA
·
N
CS
,
(
29
)
and wherein
NZC is a length of the random access sequence, a root of the random access sequence is u,
d
u
=
{
p
0
≤
p
<
N
ZC
/
2
N
ZC
-
p
another


value
,
and p is a minimum non-negative integer that satisfies (pu)mod NZC=1;
and
generating, by the communication apparatus, the random access sequence according to the cyclic shift value Cv.

192 more elements

An apparatus, comprising:

a memory;
and
a processor coupled to the memory, and configured to execute the instructions included in the memory to:
obtain a cyclic shift value Cv according to a shift sequence number v, wherein
Cv=dstart└v/nshiftRA┘+(v mod nshiftRA)NCS (1),
wherein v is an integer, NCS is a quantity of cyclic shifts for a user equipment,
wherein nshiftRA and dstart satisfy formulas (4) and (5), respectively, or nshiftRA and dstart satisfy formulas (12) and (13), respectively, or nshiftRA and dstart satisfy formulas (20) and (21), respectively, or nshiftRA and dstart satisfy formulas (28) and (29), respectively, wherein
n
shift
RA
=
⌊
4

d
u
-
N
ZC
N
CS
⌋
,
(
4
)
d
start
=
4

d
u
-
N
ZC
+
n
shift
RA

·
N
CS
,
(
5
)
n
shift
RA
=
⌊
N
ZC
-
3

d
u
N
CS
⌋
,
(
12
)
d
start
=
N
ZC
-
3

d
u
+
n
shift
RA

·
N
CS
,
(
13
)
n
shift
RA
=
⌊
3

d
u
-
N
ZC
N
CS
⌋
,
(
20
)
d
start
=
3

d
u
-
N
ZC
+
n
shift
RA

·
N
CS
,
(
21
)
n
shift
RA
=
⌊
N
ZC
-
3

d
u
N
CS
⌋
,
(
28
)
d
start
=
2

(
N
ZC
-
2

d
n
)
+
n
shift
RA

·
N
CS
,
(
29
)
and wherein
NZC is a length of a random access sequence, a root of the random access sequence is u,
d
u
=
{
p
0
≤
p
<
N
ZC
/
2
N
ZC
-
p
another


value
,
and p is a minimum non-negative integer that satisfies (pu)mod NZC=1;
and
generate the random access sequence according to the cyclic shift value Cv.

199 more elements

A non-transitory computer-readable medium storing computer instructions which, when executed by one or more processors, cause the one or more processors to perform the steps of:

obtaining a cyclic shift value Cv according to a shift sequence number v, wherein
Cv=dstart└v/nshiftRA┘+(v mod nshiftRA)NCS (1),
wherein v is an integer, NCS is a quantity of cyclic shifts for a user equipment,
wherein nshiftRA and dstart satisfy formulas (4) and (5), respectively, or nshiftRA and dstart satisfy formulas (12) and (13), respectively, or nshiftRA and dstart satisfy formulas (20) and (21), respectively, or nshiftRA and dstart satisfy formulas (28) and (29), respectively, wherein
n
shift
RA
=
⌊
4

d
u
-
N
ZC
N
CS
⌋
,
(
4
)
d
start
=
4

d
u
-
N
ZC
+
n
shift
RA

·
N
CS
,
(
5
)
n
shift
RA
=
⌊
N
ZC
-
3

d
u
N
CS
⌋
,
(
12
)
d
start
=
N
ZC
-
3

d
u
+
n
shift
RA

·
N
CS
,
(
13
)
n
shift
RA
=
⌊
3

d
u
-
N
ZC
N
CS
⌋
,
(
20
)
d
start
=
3

d
u
-
N
ZC
+
n
shift
RA

·
N
CS
,
(
21
)
n
shift
RA
=
⌊
N
ZC
-
3

d
u
N
CS
⌋
,
(
28
)
d
start
=
2

(
N
ZC
-
2

d
n
)
+
n
shift
RA

·
N
CS
,
(
29
)
and wherein
NZC is a length of a random access sequence, a root of the random access sequence is u,
d
u
=
{
p
0
≤
p
<
N
ZC
/
2
N
ZC
-
p
another


value
,
and p is a minimum non-negative integer that satisfies (pu)mod NZC=1;
and
generating the random access sequence according to the cyclic shift value Cv.

196 more elements

Dependencies are inferred from the claim text.

Facts

Application: 16/688,493Filed 19 Nov 2019
Priority: 25 Sep 2015
Published: 19 Mar 2020
Term ends: Not estimatedThe source records don’t support an estimate.

Classification10 codes

H04W 74/0833
Non-scheduled access, e.g. ALOHA: random access procedures, e.g. with 4-step access
H04L 5/0021
Time-frequency-code: in which codes are applied as a frequency-domain sequences, e.g. MC-CDMA
H04L 5/0053
Arrangements for allocating sub-channels of the transmission path: allocation of signalling, i.e. of overhead other than pilot signals
H04L 27/2613
Details of reference signals: structure of the reference signals

Family

Application15/928,496Continuation · filed 22 Mar 2018
Application16/688,493Continuation
US 10,499,437 B2Related patent
US 11,395,342 B2Related patent
US 2018/0242370 A1Published application
US 2020/0092919 A1This patent

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