# US 10,771,104 B2 · Processing device, network node, client device, and methods thereof

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 10,771,104 B2
- Document ID: US10771104B2
- Status: Granted
- Kind: B2
- Application number: 16/505,911
- Filed: 2019-07-09
- Published: 2019-10-31
- Granted: 2020-09-08
- Earliest claimed: 2017-05-04
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Peng Wang; Fredrik Berggren
- Web page: https://patentgrep.com/patent/US10771104B2

## CPC

- H04B 1/7083: Cell search, e.g. using a three-step approach
- H04B 1/7093: Matched filter type
- H04J 11/0073: {Acquisition of primary synchronisation channel, e.g. detection of cell-ID within cell-ID group}
- H04J 11/0076: {Acquisition of secondary synchronisation channel, e.g. detection of cell-ID group}
- H04J 13/0025: {M-sequences}
- H04J 13/0029: {Gold}
- H04L 27/2607: {Cyclic extensions}
- H04W 72/0466: {the resource being a scrambling code}
- H04B 2001/70935: {using a bank of matched fileters, e.g. Fast Hadamard Transform}
- H04B: TRANSMISSION
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

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 PSS sequence may be generated based on one of the first and the second sequences.

## Claims

### Claim 1

A network node, comprising:
a transceiver; and
a processing device coupled to the transceiver, the processing device being configured to generate a primary synchronization signal (PSS) sequence for a PSS and a secondary synchronization signal (SSS) sequence for an SSS,
wherein the SSS sequence is associated with a first cyclic shift m0 and a second cyclic shift m1, and wherein m0 and m1 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;
NID(1)∈{0, 1, 2, . . . , NID,max(1)−1}; and
NID(2)∈{0, 1, . . . , NID,max(2)−1}; and
the transceiver being configured to transmit the PSS based on the PSS sequence and the SSS based on the SSS sequence.

### Claim 2 (depends on 1)

The network node according to claim 1, wherein the PSS sequence is associated with NID(2).

### Claim 3 (depends on 1)

The network node according to claim 1, wherein the first cyclic shift m0 and the second cyclic shift m1 are associated with a cell ID NID, wherein NID=3 NID(1)+NID(2).

### Claim 4 (depends on 1)

The network node according to claim 1, wherein the processing device is configured to generate the SSS sequence for the SSS based on a first sequence cyclically shifted by the first cyclic shift m0 and a second sequence cyclically shifted by the second cyclic shift m1, the first sequence and the second sequence having the same length.

### Claim 5 (depends on 4)

The network node according to claim 4, wherein the first and the second sequences are m-sequences.

### Claim 6 (depends on 4)

The network node according to claim 4, wherein a generator polynomial of the first sequence is g0(x)=x7+x4+1, and a generator polynomial of the second sequence is g1(x)=x7+x+1.

### Claim 7 (depends on 4)

The network node according to claim 4, wherein a generator polynomials of the PSS sequence is same with one of the generator polynomials of the first and the second sequences.

### Claim 8 (depends on 1)

The network node according to claim 1, wherein the PSS sequence is one of three PSS sequences.

### Claim 9 (depends on 1)

The network node according to claim 1, wherein the Length L of the SSS sequence is 127.

### Claim 10 (depends on 1)

The network node according to claim 1, wherein NID,max(2) is 3, and NID(2)∈{0, 1, 2}.

### Claim 11 (depends on 1)

The network node according to claim 1, wherein NID,max(1) is 336, and NID(1)∈{0, 1, 2, . . . , 335}.

### Claim 12

A processing device for wireless communications, comprising:
at least one processor configured to:
determine a first cyclic shift m0 and a second cyclic shift m1; and
generate a secondary synchronization signal (SSS) sequence for an SSS,
wherein the SSS sequence is associated with the first cyclic shift m0 and the second cyclic shift m1, and wherein m0 and m1 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;
NID(1)∈{0, 1, 2, . . . , NID,max(1)−1}; and
NID(2)∈{0, 1, . . . , NID,max(2)−1}.

### Claim 13 (depends on 12)

The processing device according to claim 12, wherein the at least one processor comprises at least one of the following defining operational logic:
an application specific integrated circuitry (ASIC);
a central processing unit (CPU) coupled to retrieve instructions from a memory, and processing logic that may interpret and execute instructions.

### Claim 14 (depends on 12)

The processing device according to claim 12, wherein the at least one processor is configured to generate a primary synchronization signal (PSS) sequence for a PSS, the PSS sequence being associated with NID(2).

### Claim 15 (depends on 12)

The processing device according to claim 12, wherein the first cyclic shift m0 and the second cyclic shift m1 are associated with a cell ID NID, wherein NID=3 NID(1)+NID(2).

### Claim 16 (depends on 12)

The processing device according to claim 12, wherein the at least one processor is configured to generate the SSS sequence for the SSS based on a first sequence cyclically shifted by the first cyclic shift m0 and a second sequence cyclically shifted by the second cyclic shift m1, the first sequence and the second sequence having the same length.

### Claim 17 (depends on 16)

The processing device according to claim 16, wherein the first and the second sequences are m-sequences.

### Claim 18 (depends on 16)

The processing device according to claim 16, wherein a generator polynomial of the first sequence is g0(x)=x7+x4+1, and a generator polynomial of the second sequence is g1(x)=x7+x+1.

### Claim 19 (depends on 16)

The processing device according to claim 16, wherein a generator polynomials of the PSS sequence is same with one of the generator polynomials of the first and the second sequences.

### Claim 20 (depends on 12)

The processing device according to claim 12, wherein the Length L of the SSS sequence is 127.

### Claim 21 (depends on 12)

The processing device according to claim 12, wherein NID,max(2) is 3, and NID(2)∈{0, 1, 2}.

### Claim 22 (depends on 12)

The processing device according to claim 12, wherein NID,max(1) is 336, and NID(1)∈{0, 1, 2, . . . , 335}.

### Claim 23

A non-transitory computer readable medium, comprising computer instructions that, when executed by a processor, cause the processor to
determine a first cyclic shift m0 and a second cyclic shift m1; and
generate a secondary synchronization signal (SSS) sequence for an SSS,
wherein the SSS sequence is associated with the first cyclic shift m0 and the second cyclic shift m1, and wherein m0 and m1 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;
NID(1)∈{0, 1, 2, . . . , NID,max(1)−1}; and
NID(2)∈{0, 1, . . . , NID,max(2)−1}.

### Claim 24 (depends on 23)

The non-transitory computer readable medium according to claim 23, further comprising computer instructions for causing the processor to generate the SSS sequence formed with a first sequence corresponding to the first cyclic shift m0 and a second sequence corresponding to the second cyclic shift m1.

### Claim 25 (depends on 24)

The non-transitory computer readable medium according to claim 24, wherein a generator polynomial of the first sequence is g0(x)=x7+x4+1, and a generator polynomial of the second sequence is g1(x)=x7+x+1.

### Claim 26 (depends on 24)

The non-transitory computer readable medium according to claim 24, further comprising computer instructions for causing the processor to generate a primary synchronization signal (PSS) sequence, wherein a generator polynomials of the PSS sequence is same with one of the generator polynomials of the first and the second sequences.

### Claim 27 (depends on 24)

The non-transitory computer readable medium according to claim 24, wherein the first cyclic shift m0 and the second cyclic shift m1 are associated with a cell ID NID, wherein NID=3 NID(1)+NID(2).

### Claim 28 (depends on 25)

The non-transitory computer readable medium according to claim 25, wherein NID,max(2) is 3, and NID(2)∈{0, 1, 2}.

### Claim 29 (depends on 25)

The non-transitory computer readable medium according to claim 25, wherein NID,max(1) is 336, and NID(1)∈{0, 1, 2, . . . , 335}.

### Claim 30 (depends on 25)

The non-transitory computer readable medium according to claim 25, wherein an SSS sequence for the SSS has a length L of 127.