Processing device, network node, client device, and methods thereof
This disclosure relates to techniques for synchronization signals. The synchronization signal comprise a primary synchronization signal (PSS) generated based on a PSS sequence and a secondary synchronization signal (SSS) generated based on an SSS sequence. The SSS sequence may be generated based on a first sequence corresponding to a first cyclic shift and a second sequence corresponding to a second cyclic shift. The first cyclic shift and the second cyclic shift are associated with Cell ID. The Cell ID can be determined from the first cyclic shift and the second cyclic shift.
1. A client device for wireless communication, comprising:
a transceiver configured to receive communication signals that include a primary synchronization signal (PSS) and a secondary synchronization signal (SSS); and
a processing device configured to determine a cell identity (ID) N ID based on a first cyclic shift m 0 and a second cyclic shift m 1 being determined based on the received PSS and SSS;
wherein the first cyclic shift m 0 and the second cyclic shift m 1 satisfy:
m
0
=
g
(
N
ID
,
max
(
2
)
⌊
N
ID
(
1
)
L
′
⌋
+
N
ID
(
2
)
)
m
1
=
N
ID
(
1
)
mod
L
′
wherein:
g is an integer equal to or larger than 1;
L′ is 112;
N ID (1) ∈{0, 1, 2, . . . , N ID,max (1) −1}; and
N ID (2) ∈{0, 1, . . . , N ID,max (2) −1}.
2. The client device according to claim 1 , wherein an SSS sequence for the SSS is formed with a first sequence corresponding to the first cyclic shift m 0 and a second sequence corresponding to the second cyclic shift m 1 , the first sequence and the second sequence having the same length.
3. The client device according to claim 2 , wherein a generator polynomial of the first sequence is g 0 (x)=x 7 +x 4 +1, and a generator polynomial of the second sequence is g 1 (x)=x 7 +x+1.
4. The client device according to claim 1 , wherein the processing device is configured to determine the first cyclic shift m 0 and the second cyclic shift m 1 associated with the cell ID N ID , and to determine the cell ID N ID from the first cyclic shift m 0 and a second cyclic shift m 1 , wherein N ID =3N ID (1) +N ID (2) .
5. The client device according to claim 1 , wherein a PSS sequence for PSS is associated with N ID (2) .
6. The client device according to claim 1 , wherein the PSS is generated based on one of three PSS sequences for synchronization.
7. The client device according to claim 1 , wherein the processing device is configured to obtain an SSS sequence for synchronization by descrambling and fast Walsh-Hadamard transform (FWHT) operation based on the SSS.
8. The client device according to claim 1 , wherein the processing device is configured to generate an SSS sequence based on the first cyclic shift m 0 and the second cyclic shift m 1 .
9. The client device according to claim 1 , wherein N ID,max (2) is 3, and N ID (2) ∈{0, 1, 2}.
10. The client device according to claim 1 , wherein N ID,max (1) is 336, and N ID (1) ∈{0, 1, 2, . . . , 335}.
11. The client device according to claim 1 , wherein an SSS sequence for the SSS has a length L of 127.
12. A processing device for wireless communication, comprising:
a processor configured to obtain a primary synchronization signal (PSS) generated based on a PSS sequence and a secondary synchronization signal (SSS) generated based on an SSS sequence; and
to determine a cell identity (ID) N ID based on a first cyclic shift m 0 and a second cyclic shift m 1 being determined based on the received PSS and SSS;
wherein the first cyclic shift m 0 and the second cyclic shift m 1 satisfy:
m
0
=
g
(
N
ID
,
max
(
2
)
⌊
N
ID
(
1
)
L
′
⌋
+
N
ID
(
2
)
)
m
1
=
(
N
ID
(
1
)
mod
L
′
)
wherein:
g is an integer equal to or larger than 1;
L′ is 112;
N ID (1) ∈{0, 1, 2, . . . , N ID,max (1) −1}; and
N ID (2) ∈{0, 1, . . . , N ID,max (2) −1}.
13. The processing device according to claim 12 , wherein an SSS sequence for the SSS is formed with a first sequence corresponding to the first cyclic shift m0 and a second sequence corresponding to the second cyclic shift m1, the first sequence and the second sequence having the same length.
14. The processing device according to claim 13 , wherein a generator polynomial of the first sequence is g 0 (x)=x 7 +x 4 +1, and a generator polynomial of the second sequence is g 1 (x) =x 7 +x+1.
15. The processing device according to claim 12 , wherein the processor is configured to determine the first cyclic shift m 0 and the second cyclic shift m 1 , and to determine the cell ID N ID from the first cyclic shift m 0 and a second cyclic shift m 1 , wherein N ID =3N ID (1) +N ID (2) .
16. The processing device according to claim 12 , wherein a PSS sequence for PSS is associated with N ID (2) .
17. The processing device according to claim 12 , wherein the PSS is generated based on one of three PSS sequences for synchronization.
18. The processing device according to claim 12 , wherein the processor is configured to obtain an SSS sequence for synchronization by descrambling and fast Walsh-Hadamard transform (FWHT) operation based on the SSS.
19. The processing device according to claim 12 , wherein the processor is configured to generate an SSS sequence based on the first cyclic shift m 0 and the second cyclic shift m 1 .
20. The processing device according to claim 12 , wherein N ID,max (2) is 3, and N ID (2) ∈{0, 1, 2}.
21. The processing device according to claim 12 , wherein N ID,max (1) is 336, and N ID (1) ∈{0, 1, 2, . . . , 335}.
22. The processing device according to claim 12 , wherein an SSS sequence for the SSS has a length L of 127.
23. A non-transitory computer readable medium, comprising code for causing a processor to obtain a primary synchronization signal (PSS) generated based on a PSS sequence and a secondary synchronization signal (SSS) generated based on an SSS sequence; and
to determine a cell identity (ID) N ID based on a first cyclic shift m 0 and a second cyclic shift m 1 being determined based on the received PSS and SSS;
wherein the first cyclic shift m 0 and the second cyclic shift m 1 satisfy:
m
0
=
g
(
N
ID
,
max
(
2
)
⌊
N
ID
(
1
)
L
′
⌋
+
N
ID
(
2
)
)
m
1
=
(
N
ID
(
1
)
mod
L
′
)
wherein:
g is an integer equal to or larger than 1;
L′ is 112;
N ID (1) ∈{0, 1, 2, . . . , N ID,max (1) −1}; and
N ID (2) ∈{0, 1, . . . , N ID,max (2) −1}.
24. The non-transitory computer readable medium according to claim 23 , further comprising code for causing a processor to determine the first cyclic shift m 0 and the second cyclic shift m 1 , and to determine the cell ID N ID from the first cyclic shift m 0 and a second cyclic shift m 1 , wherein N ID =3N ID (1) +N ID (2) .
25. The non-transitory computer readable medium according to claim 23 , further comprising code for causing a processor to obtain an SSS sequence for synchronization by descrambling and fast Walsh-Hadamard transform (FWHT) operation based on the SSS.
26. The non-transitory computer readable medium according to claim 23 , further comprising code for causing the processor to generate an SSS sequence formed with a first sequence corresponding to the first cyclic shift m 0 and a second sequence corresponding to the second cyclic shift m 1 .
27. The non-transitory computer readable medium according to claim 23 , wherein a generator polynomial of the first sequence is g 0 (x)=x 7 +x 4 +1, and a generator polynomial of the second sequence is g 1 (x)=x 7 +x+1.
28. The non-transitory computer readable medium according to claim 23 , wherein N ID,max (2) is 3, and N ID (2) ∈{0, 1, 2}.
29. The non-transitory computer readable medium according to claim 23 , wherein N ID,max (1) is 336, and N ID (1) ∈{0, 1, 2, . . . , 335}.
30. The non-transitory computer readable medium according to claim 23 , wherein an SSS sequence for the SSS has a length L of 127.