CN121001163A

CN121001163A - A communication method and apparatus

Info

Publication number: CN121001163A
Application number: CN202411134550.2A
Authority: CN
Inventors: 邹通; 张旭; 甘霖霄
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2024-05-21
Filing date: 2024-08-16
Publication date: 2025-11-21
Also published as: WO2025241987A1

Abstract

A communication method and apparatus includes a network device generating a synchronization signal, transmitting the synchronization signal, the synchronization signal being a signal obtained based on a first sequence. Wherein the initial values of the first sequence belong to an initial value set, any two initial values within the initial value set being different. The method can avoid the sequences which are mutually circularly shifted in a plurality of sequences generated by the initial values in the initial value set to a certain extent, and the sequences obtained by the initial value set are used as the sequences for generating the synchronous signals, so that the cell identification is ensured not to be confused.

Description

Communication method and device

Cross Reference to Related Applications

The present application claims priority from the chinese patent application filed at 2024, 5 and 21, with application number 202410634588.X, application name "a communication method and apparatus", the entire contents of which are incorporated herein by reference.

Technical Field

The present application relates to the field of communications technologies, and in particular, to a communications method and apparatus.

Background

In a wireless communication system, a network device transmits a synchronization signal generated based on a specific sequence to a terminal device, and the terminal device receives the synchronization signal and detects the specific sequence to realize time synchronization and frequency synchronization between the terminal device and the network device.

The synchronization signals sent by the network device to the terminal device include a primary synchronization signal (primary synchronization signal, PSS) and a secondary synchronization signal (secondary synchronization signal, SSS). The PSS may be used for the terminal device to obtain preliminary timing, frequency synchronization, and a part of cell Identity (ID). The SSS may be used for further time synchronization, frequency synchronization and remaining cell IDs at the end device. The PSS and SSS carry part of the cell ID information, respectively, that is, the terminal device acquires the cell ID by detecting the PSS and SSS.

At present, a gold sequence is generally adopted to generate SSS, but as the cell ID increases, not only the detection complexity increases, but also the synchronous detection performance decreases.

Disclosure of Invention

The embodiment of the application provides a communication method and a communication device, which are used for reducing the detection complexity of a synchronous signal and improving the synchronous detection performance.

In order to achieve the above purpose, the embodiment of the application adopts the following technical scheme:

In a first aspect, the application provides a communication method applied to a network side, for example, to a network device or a component in a network device (e.g., a circuit, chip or chip system, etc.), or to a module or unit that performs part of the functionality of a network device, for example, a Centralized Unit (CU), a Distributed Unit (DU) or a Radio Unit (RU), or to a larger device including a network device. For convenience of description, the method is hereinafter exemplified as applied to a network device.

The communication method includes that the network equipment transmits a synchronous signal, wherein the synchronous signal is obtained based on a first sequence. Wherein the initial values of the first sequence belong to an initial value set, any two initial values within the initial value set being different. Optionally, the network device may also generate the synchronization signal before transmitting the synchronization signal.

The initial value may also be understood as a base sequence, also referred to as initial sequence, which generates the first sequence. For example, the first sequence is obtained by processing an initial value. A plurality of sequences may be obtained by traversing all of the initial values in the initial value set, any one of the plurality of sequences being a first sequence. In this scheme, any two initial values in the initial value set for generating the first sequence are different, and thus, it is possible to avoid to some extent that there are sequences that are cyclic shifts from each other among the plurality of sequences generated from the initial values in the initial value set. Because the sequences which are circularly shifted with each other do not exist in the sequences generated by the initial values in the initial value set, the sequences generated based on the initial values in the initial value set bear the cell identifications, and the cell identifications can be ensured not to be confused, namely the situation that the cell identifications are confused when the synchronous signals are detected can be ensured not to occur.

In a possible implementation manner, the elements in the first sequence satisfy a recurrence relation, where the recurrence relation corresponds to the primitive polynomial one by one, and the primitive polynomial f (x) satisfies: a _i ∈ {0,1,2, M-1}, M is a positive integer greater than 3, r is a positive integer, and the length of the first sequence is n= ^r -1.

In a possible implementation, the first sequence is a Z ₄ sequence. Or the first sequence is a sequence A with the length of 2 ^r -1, the period of a binary sequence obtained by projecting the sequence A into a binary domain is 2 ^r -1, and the binary sequence is an m sequence generated by a primitive polynomial obtained by projecting a primitive polynomial of the sequence A into the binary domain.

In a possible implementation, the network device generates the synchronization signal includes the network device generating the synchronization signal according to the second sequence. Wherein the lengths of the first sequence and the second sequence are L, and the element d (n) of the second sequence and the element x (m) of the first sequence satisfy the following conditions: m= (n+c) mod L, a is complex, a is a constant, c is an integer, c is a cyclic shift value, 0≤n < L, 0≤m < L, x (m) =0, 1,2 or 3.

The second sequence may be obtained from the first sequence, for example, the first sequence may be cyclically shifted, and elements in the cyclically shifted sequence may be mapped to other values to obtain the second sequence. For example, the first sequence is cyclically shifted according to c, element 0 in the cyclically shifted first sequence may be mapped to a, element 1 may be mapped to a×j, element 2 may be mapped to-a, and element 3 may be mapped to a×j, i.e., element d (n) =a, a×j, -a, a×j in the second sequence. The network device may store a second sequence or the protocol predefines the second sequence, and when the network device needs to generate the synchronization signal, the network device obtains the second sequence and generates the synchronization signal according to the second sequence.

In a possible implementation, the network device generating the synchronization signal according to the second sequence includes the network device generating the second sequence according to the first sequence, mapping the second sequence onto the L subcarriers, and generating the synchronization signal according to the second sequence mapped onto the L subcarriers.

The network device may store a first sequence or a protocol predefines the first sequence, and when the network device needs to generate the synchronization signal, the network device may acquire the first sequence, generate a second sequence based on the first sequence, and generate the synchronization signal according to the second sequence.

In a possible implementation, c is determined from a first cell identity and/or the second sequence is associated with a first cell identity, which belongs to the first set of cell identities.

C, i.e. cyclic shift values, by which the cell identity may be carried, different cyclic shift values corresponding to different cell identities, whereby c, which generates the first sequence, may be determined based on the first cell identity. Since the second sequence is obtained from the first sequence, the second sequence can also be considered to be associated with the first cell identity.

In a possible implementation, c belongs to a set of cyclic shift values, and the number of elements in the first set of cell identities is equal to the product of the number of elements in the initial set of values and the number of elements in the set of cyclic shift values.

The cell identities may also be carried by initial values, and different cell identities may be carried by different initial values and/or cyclic shift values c, for example, the number of cell identities that may be carried by the initial value set and the cyclic shift value set is the product of the number of elements in the initial value set and the number of elements in the cyclic shift value set, so that the requirement of allocating more cell identities may be satisfied.

In a possible implementation, any two initial values within the initial value set are modulo-2 identical.

It can be understood that, when any two initial values in the initial value set are equal after modulo 2 is specified, the binary sequence set obtained after modulo 2 is ensured to be the same, that is, the cyclic shift set used by each initial value is ensured to be the same. Therefore, for different initial values, the cyclic shift value of the synchronous signal can be detected based on the same set of detection mechanism, and the implementation complexity is low.

In a possible implementation, the length of the first sequence is 127, and the recurrence relation of the first sequence is x (i+7) =mod (2·x (i+4) +3·x (i+1) +x (i), 4), or the recurrence relation of the first sequence is x (i+7) =mod (x (i+4) +2·x (i+2) +x (i), 4), where "·" refers to multiplication. The initial values of the first sequence [ x (6), x (5), x (4), x (3), x (2), x (1), x (0) ] belong to a set of initial values comprising one or more of the sequences ：[1,0,0,0,0,0,0],[3,0,0,0,0,0,0],[1,0,0,0,2,2,2],[3,2,0,0,0,0,0],[1,2,2,2,0,0,0],[1,0,0,0,0,0,2],[3,0,0,0,0,0,2],[3,2,2,2,0,0,0],[1,2,0,0,0,0,0],[3,0,0,0,2,2,2],[1,2,0,2,0,2,0],[3,2,2,0,0,0,0],[1,2,2,2,2,2,2],[1,2,2,0,0,2,2],[3,0,2,2,0,0,0],[1,2,0,2,0,0,0],[1,0,2,0,0,0,0],[1,0,2,0,2,0,2],[1,0,0,0,2,0,2],[3,2,0,0,2,2,2],[1,0,2,2,2,2,0],[1,0,0,0,0,2,0],[3,0,0,0,0,2,0],[3,2,2,2,0,0,2],[3,2,0,0,0,0,2],[3,0,0,0,2,2,0],[1,0,0,0,0,2,2],[3,0,0,0,0,2,2],[1,0,0,0,2,2,0],[1,2,0,0,0,0,2],[1,2,2,2,0,0,2],[3,2,2,2,2,2,2],[1,2,2,0,0,0,0],[3,2,0,2,0,2,0],[3,0,2,2,2,2,0],[1,2,0,0,2,2,2],[3,0,0,0,2,0,2],[3,0,2,0,2,0,2],[3,0,2,0,0,0,0],[3,2,0,2,0,0,0],[1,0,2,2,0,0,0],[3,2,2,0,0,2,2],[1,0,0,2,0,2,2],[1,0,0,2,0,0,0],[1,2,0,2,2,0,2],[1,0,2,2,0,0,2],[3,2,2,0,2,0,2],[3,2,0,0,2,2,0],[3,0,2,0,2,2,2],[3,2,2,2,2,2,0],[3,2,2,0,2,2,2],[3,2,0,0,2,0,2],[3,0,0,2,0,2,2],[1,2,0,2,2,2,2],[1,2,0,0,2,2,0],[3,0,0,2,0,2,0],[1,0,2,2,2,2,2],[1,2,2,2,0,2,0],[1,2,2,2,2,0,2],[1,2,2,0,2,0,0],[3,0,2,2,2,2,2],[3,0,2,0,2,0,0],[3,2,2,0,0,0,2],[1,0,2,0,2,2,2],[3,0,0,2,0,0,0],[1,0,2,0,0,2,0],[3,2,0,0,0,2,2],[1,0,0,0,2,0,0],[3,0,2,0,0,2,2],[3,2,2,0,2,0,0],[3,0,0,0,2,0,0],[3,2,2,2,0,2,2],[3,2,0,0,0,2,0],[1,2,0,0,0,2,0],[1,2,2,2,0,2,2],[1,0,2,0,2,0,0],[3,2,0,2,0,0,2],[3,2,2,0,0,2,0],[1,2,0,2,0,2,2],[1,0,2,0,0,0,2],[1,2,2,2,2,2,0],[3,2,2,2,0,2,0],[1,2,0,0,0,2,2],[1,2,2,0,0,0,2],[3,0,2,2,0,0,2],[3,0,2,0,0,0,2],[3,2,0,2,0,2,2],[1,2,2,0,0,2,0],[1,2,0,2,0,0,2],[1,2,2,0,2,0,2],[3,2,0,2,2,0,2],[1,0,0,2,0,2,0],[1,0,2,0,0,2,2],[3,0,2,0,0,2,0],[3,2,0,2,2,2,2],[3,2,2,2,2,0,2],[1,2,0,0,2,0,2],[1,2,2,0,2,2,2],[3,0,0,2,2,2,2],[3,2,2,2,2,0,0],[1,2,2,2,2,0,0],[3,0,2,2,0,2,0],[1,2,2,0,2,2,0],[3,2,0,0,2,0,0],[3,0,2,2,2,0,2],[1,0,0,2,2,0,0],[1,2,0,2,2,2,0],[3,0,0,2,2,0,2],[3,0,0,2,0,0,2],[1,0,0,2,2,2,2],[3,2,0,2,2,0,0],[1,0,0,2,2,2,0],[3,0,0,2,2,0,0],[1,0,2,2,2,0,0],[1,0,2,2,0,2,2],[3,0,2,2,2,0,0],[3,0,2,2,0,2,2],[3,2,0,2,2,2,0],[3,2,2,0,2,2,0],[1,0,0,2,0,0,2],[1,2,0,0,2,0,0],[1,0,2,2,2,0,2],[3,0,2,0,2,2,0],[1,2,0,2,2,0,0],[1,0,2,0,2,2,0],[1,0,0,2,2,0,2],[3,0,0,2,2,2,0], or [1,0,2,2,0,2,0].

In a possible implementation, the length of the first sequence is 127, and the recurrence relation of the first sequence is x (i+7) =mod (2·x (i+4) +3·x (i+1) +x (i), 4), or the recurrence relation of the first sequence is x (i+7) =mod (x (i+4) +2·x (i) +2) +x (i), 4), where "·" refers to multiplication. The initial values of the first sequence [ x (0), x (1), x (2), x (3), x (4), x (5), x (6) ] belong to a set of initial values comprising one or more of the sequences ：[1,0,0,0,0,0,0],[3,0,0,0,0,0,0],[1,0,0,0,2,2,2],[3,2,0,0,0,0,0],[1,2,2,2,0,0,0],[1,0,0,0,0,0,2],[3,0,0,0,0,0,2],[3,2,2,2,0,0,0],[1,2,0,0,0,0,0],[3,0,0,0,2,2,2],[1,2,0,2,0,2,0],[3,2,2,0,0,0,0],[1,2,2,2,2,2,2],[1,2,2,0,0,2,2],[3,0,2,2,0,0,0],[1,2,0,2,0,0,0],[1,0,2,0,0,0,0],[1,0,2,0,2,0,2],[1,0,0,0,2,0,2],[3,2,0,0,2,2,2],[1,0,2,2,2,2,0],[1,0,0,0,0,2,0],[3,0,0,0,0,2,0],[3,2,2,2,0,0,2],[3,2,0,0,0,0,2],[3,0,0,0,2,2,0],[1,0,0,0,0,2,2],[3,0,0,0,0,2,2],[1,0,0,0,2,2,0],[1,2,0,0,0,0,2],[1,2,2,2,0,0,2],[3,2,2,2,2,2,2],[1,2,2,0,0,0,0],[3,2,0,2,0,2,0],[3,0,2,2,2,2,0],[1,2,0,0,2,2,2],[3,0,0,0,2,0,2],[3,0,2,0,2,0,2],[3,0,2,0,0,0,0],[3,2,0,2,0,0,0],[1,0,2,2,0,0,0],[3,2,2,0,0,2,2],[1,0,0,2,0,2,2],[1,0,0,2,0,0,0],[1,2,0,2,2,0,2],[1,0,2,2,0,0,2],[3,2,2,0,2,0,2],[3,2,0,0,2,2,0],[3,0,2,0,2,2,2],[3,2,2,2,2,2,0],[3,2,2,0,2,2,2],[3,2,0,0,2,0,2],[3,0,0,2,0,2,2],[1,2,0,2,2,2,2],[1,2,0,0,2,2,0],[3,0,0,2,0,2,0],[1,0,2,2,2,2,2],[1,2,2,2,0,2,0],[1,2,2,2,2,0,2],[1,2,2,0,2,0,0],[3,0,2,2,2,2,2],[3,0,2,0,2,0,0],[3,2,2,0,0,0,2],[1,0,2,0,2,2,2],[3,0,0,2,0,0,0],[1,0,2,0,0,2,0],[3,2,0,0,0,2,2],[1,0,0,0,2,0,0],[3,0,2,0,0,2,2],[3,2,2,0,2,0,0],[3,0,0,0,2,0,0],[3,2,2,2,0,2,2],[3,2,0,0,0,2,0],[1,2,0,0,0,2,0],[1,2,2,2,0,2,2],[1,0,2,0,2,0,0],[3,2,0,2,0,0,2],[3,2,2,0,0,2,0],[1,2,0,2,0,2,2],[1,0,2,0,0,0,2],[1,2,2,2,2,2,0],[3,2,2,2,0,2,0],[1,2,0,0,0,2,2],[1,2,2,0,0,0,2],[3,0,2,2,0,0,2],[3,0,2,0,0,0,2],[3,2,0,2,0,2,2],[1,2,2,0,0,2,0],[1,2,0,2,0,0,2],[1,2,2,0,2,0,2],[3,2,0,2,2,0,2],[1,0,0,2,0,2,0],[1,0,2,0,0,2,2],[3,0,2,0,0,2,0],[3,2,0,2,2,2,2],[3,2,2,2,2,0,2],[1,2,0,0,2,0,2],[1,2,2,0,2,2,2],[3,0,0,2,2,2,2],[3,2,2,2,2,0,0],[1,2,2,2,2,0,0],[3,0,2,2,0,2,0],[1,2,2,0,2,2,0],[3,2,0,0,2,0,0],[3,0,2,2,2,0,2],[1,0,0,2,2,0,0],[1,2,0,2,2,2,0],[3,0,0,2,2,0,2],[3,0,0,2,0,0,2],[1,0,0,2,2,2,2],[3,2,0,2,2,0,0],[1,0,0,2,2,2,0],[3,0,0,2,2,0,0],[1,0,2,2,2,0,0],[1,0,2,2,0,2,2],[3,0,2,2,2,0,0],[3,0,2,2,0,2,2],[3,2,0,2,2,2,0],[3,2,2,0,2,2,0],[1,0,0,2,0,0,2],[1,2,0,0,2,0,0],[1,0,2,2,2,0,2],[3,0,2,0,2,2,0],[1,2,0,2,2,0,0],[1,0,2,0,2,2,0],[1,0,0,2,2,0,2],[3,0,0,2,2,2,0], or [1,0,2,2,0,2,0].

In a possible implementation, the length of the first sequence is 127, and the primitive polynomial of the first sequence is x ⁷+2x⁴ +x+3 or x ⁷+3x⁴+2x² +3. When the length of the first sequence is 127, the tap number of the primitive polynomial provided by the scheme is less, and the implementation complexity is lower.

In a possible implementation, the first sequence has a length of 255, and the recurrence relation of the first sequence is x (i+8) =mod (3·x (i+5) +x (i+3) +3·x (i+2) +2·x (i+1) +3·x (i), 4), whose initial values [ x (7), x (6), x (5), x (4), x (3), x (2), x (1), x (0) ] belong to an initial value set comprising one or more of the sequences ：[3,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0],[3,2,2,0,2,0,2,2],[3,2,0,0,0,0,0,0],[3,0,0,2,0,2,0,0],[3,0,0,0,0,0,0,2],[1,0,0,0,0,0,0,2],[1,0,0,2,0,2,0,0],[1,2,0,0,0,0,0,0],[1,2,2,0,2,0,2,2],[3,2,0,2,0,2,0,2],[1,0,2,0,0,0,0,0],[3,2,2,2,2,2,2,2],[3,0,2,0,2,2,0,0],[3,2,0,2,0,2,0,0],[1,2,0,0,0,0,0,2],[1,2,2,0,0,0,0,0],[3,0,2,0,2,0,2,0],[1,2,2,2,0,2,2,2],[3,0,2,0,2,0,2,2],[3,0,0,2,2,0,2,0],[3,0,0,0,0,0,2,0],[1,0,0,0,0,0,2,0],[1,0,0,2,0,2,0,2],3,2,0,0,0,0,0,2],[1,2,2,0,2,0,2,0],[3,0,0,0,0,0,2,2],[1,0,0,0,0,0,2,2],[3,2,2,0,2,0,2,0],[3,0,0,2,0,2,0,2],[1,2,2,2,2,2,2,2],[3,0,2,0,0,0,0,0],[1,2,0,2,0,2,0,2],[1,0,0,2,2,0,2,0],[1,0,2,0,2,0,2,2],[3,2,2,2,0,2,2,2],[1,0,2,0,2,0,2,0],[3,2,2,0,0,0,0,0],[1,2,0,2,0,2,0,0],[1,0,2,0,2,2,0,0],[1,0,0,2,2,2,0,0],[1,2,0,2,0,0,0,0],[3,0,2,2,2,0,0,0],[1,2,0,2,0,2,2,2],[3,0,2,0,0,2,0,2],[3,2,2,2,0,0,0,0],[3,2,2,2,0,0,0,2],[3,0,2,2,0,0,2,0],[1,2,0,0,2,2,2,2],[1,2,2,2,0,2,0,0],[1,2,0,2,0,0,2,0],[3,0,2,2,2,2,2,0],[3,2,0,2,2,0,2,0],[3,0,2,0,0,2,2,2],[1,2,2,2,0,2,0,2],[1,2,0,0,2,0,2,2],[1,2,2,0,2,0,0,0],[3,0,0,0,2,2,0,2],[1,0,2,2,0,2,2,2],[3,0,0,0,2,2,2,0],[1,0,0,2,0,0,0,0],[3,0,0,2,2,2,0,0],[1,2,2,0,2,2,2,0],[3,2,0,0,0,2,2,2],[3,0,2,2,0,0,0,0],[1,2,2,0,0,0,2,2],[1,2,2,2,2,0,0,2],[3,0,2,2,2,2,2,2],[3,0,0,0,2,0,2,2],[1,0,2,2,2,0,2,2],[1,0,0,0,2,0,2,2],[1,0,2,0,0,2,2,0],[3,2,0,2,2,0,0,0],[1,0,2,2,0,2,0,0],[3,2,2,0,2,2,0,0],[3,2,2,2,0,0,2,0],[1,0,0,0,0,2,0,0],[3,0,0,0,0,2,0,0],[3,2,0,0,0,0,2,0],[1,0,0,2,0,2,2,2],[1,0,0,0,0,2,0,2],[3,0,0,0,0,2,0,2],[1,2,0,0,0,0,2,0],[3,0,0,2,0,2,2,2],[3,2,2,0,2,0,0,0],[1,0,2,0,0,0,0,2],[1,0,2,0,2,2,0,2],[1,2,2,0,0,0,0,2],[3,2,2,2,2,2,2,0],[3,2,2,2,0,2,2,0],[1,0,0,2,2,0,2,2],[1,0,0,0,0,2,2,0],[3,0,0,0,0,2,2,0],[3,2,0,0,0,0,2,2],[3,0,0,2,0,2,2,0],[3,2,2,0,2,0,0,2],[1,0,0,0,0,2,2,2],[3,0,0,0,0,2,2,2],[1,2,0,0,0,0,2,2],[1,2,2,0,2,0,0,2],[1,0,0,2,0,2,2,0],[3,0,2,0,0,0,0,2],[3,0,0,2,2,0,2,2],[1,2,2,2,0,2,2,0],[3,2,2,0,0,0,0,2],[1,2,2,2,2,2,2,0],[3,0,2,0,2,2,0,2],[1,0,2,2,2,0,0,0],[3,2,0,2,0,0,0,0],[1,0,2,2,0,0,2,0],[1,2,2,2,0,0,0,2],[1,2,2,2,0,0,0,0],[3,2,0,2,0,2,2,2],[1,0,2,0,0,2,0,2],[3,0,2,2,2,0,2,2],[3,0,2,0,0,2,2,0],[1,2,2,2,0,0,2,0],[1,2,2,0,2,2,0,0],[3,0,2,2,0,2,0,0],[1,2,0,2,2,0,0,0],[1,0,0,0,2,2,2,0],[3,0,0,2,0,0,0,0],[3,2,2,2,2,0,0,2],[1,0,2,2,2,2,2,2],[1,2,0,0,0,2,2,2],[3,2,2,0,0,0,2,2],[1,0,2,2,0,0,0,0],[3,2,2,0,2,2,2,0],[3,2,0,0,2,2,2,2],[3,2,0,2,0,0,2,0],[3,2,2,2,0,2,0,0],[1,0,0,0,2,2,0,2],[3,0,2,2,0,2,2,2],[3,2,2,2,0,2,0,2],[3,2,0,0,2,0,2,2],[1,0,2,2,2,2,2,0],[1,0,2,0,0,2,2,2],[1,2,0,2,2,0,2,0],[3,2,0,0,2,2,2,0],[1,0,2,2,0,0,0,2],[3,0,2,2,0,0,2,2],[1,2,0,0,0,2,0,0],[1,0,0,2,2,2,2,0],[1,2,0,2,2,2,0,2],[1,2,2,2,2,2,0,0],[1,0,2,0,2,2,2,0],[3,0,2,0,2,0,0,0],[1,2,0,0,2,0,2,0],[1,2,0,2,0,0,0,2],[3,2,0,2,2,2,0,0],[1,2,0,2,2,0,2,2],[1,2,0,2,2,2,2,2],[3,0,2,0,0,0,2,0],[1,0,0,2,2,0,0,0],[3,0,0,2,2,0,0,2],[1,0,2,0,0,0,2,2],[1,2,2,0,2,2,2,2],[3,2,0,0,2,0,0,0],[3,0,2,2,0,2,2,0],[1,2,0,0,0,2,2,0],[1,0,2,2,2,0,0,2],[1,2,0,0,2,2,0,2],[3,0,2,2,2,2,0,0],[1,2,0,0,0,2,0,2],[1,2,0,2,2,2,0,0],[3,2,0,2,0,0,2,2],[3,0,2,0,0,2,0,0],[1,0,2,2,2,2,0,0],[1,2,2,0,2,2,0,2],[3,0,2,0,2,2,2,0],[3,0,0,2,2,2,2,2],[1,2,2,2,2,0,2,2],[3,2,0,0,0,2,2,0],[1,2,2,0,0,2,2,0],[3,2,2,0,0,2,0,2],[3,2,2,0,0,2,0,0],[1,2,2,2,2,0,2,0],[1,0,0,0,2,2,0,0],[1,0,2,0,0,0,2,0],[3,0,0,2,2,0,0,0],[3,2,0,2,2,0,0,2],[3,0,0,0,2,0,0,0],[3,2,2,0,0,2,2,0],[3,2,2,2,2,2,0,0],[3,2,2,2,2,0,0,0],[1,0,0,0,2,0,0,0],[3,2,0,0,2,0,0,2],[1,0,2,0,2,0,0,0],[1,0,0,2,0,0,0,2],[1,0,2,0,2,2,2,2],[1,0,2,0,0,2,0,0],[1,0,0,2,2,2,2,2],[3,0,0,2,2,2,2,0],[1,2,2,0,0,2,2,2],[1,0,0,0,2,0,2,0],[3,0,2,2,0,0,0,2],[3,2,0,0,2,2,0,0],[1,0,2,2,0,2,0,2],[3,0,0,0,2,0,2,0],[1,2,2,2,0,0,2,2],[3,2,0,2,2,0,2,2],[3,0,0,2,0,0,2,2],[1,0,2,2,2,0,2,0],[3,2,0,0,2,2,0,2],[1,0,0,2,0,0,2,0],[1,2,0,0,2,2,0,0],[1,0,0,0,2,2,2,2],[1,2,0,0,2,0,0,2],[3,2,2,0,0,2,2,2],[3,0,0,0,2,0,0,2],[1,0,0,0,2,0,0,2],[1,0,0,2,0,0,2,2],[3,2,0,0,0,2,0,0],[1,2,2,0,0,0,2,0],[3,0,2,0,2,2,2,2],[1,2,2,2,2,2,0,2],[3,2,2,0,2,2,0,2],[3,2,0,0,0,2,0,2],[3,0,0,2,0,0,2,0],[3,2,2,0,0,0,2,0],[1,0,0,2,2,0,0,2],[3,2,2,2,2,2,0,2],[1,0,0,2,2,2,0,2],[3,0,2,2,2,0,0,2],[3,0,0,2,2,2,0,2],[1,2,2,2,2,0,0,0],[3,0,2,2,0,2,0,2],[3,0,2,2,2,0,2,0],[3,0,0,0,2,2,2,2],[1,2,0,2,0,2,2,0],[3,2,0,0,2,0,2,0],[1,2,0,2,2,0,0,2],[3,0,0,0,2,2,0,0],[3,2,2,0,2,2,2,2],[3,0,2,0,2,0,0,2],[1,0,2,0,2,0,0,2],[3,2,0,2,0,2,2,0],[3,0,0,2,0,0,0,2],[3,0,2,0,0,0,2,2],[3,2,0,2,0,0,0,2],[1,2,0,2,0,0,2,2],[1,2,0,0,2,2,2,0],[3,2,2,2,0,0,2,2],[1,0,2,2,0,0,2,2],[1,0,2,2,0,2,2,0],[3,2,0,2,2,2,0,2],[1,2,0,0,2,0,0,0],[3,2,0,2,2,2,2,2],[1,2,2,0,0,2,0,2],[1,2,2,0,0,2,0,0],[3,2,2,2,2,0,2,2],[3,2,2,2,2,0,2,0],[3,2,0,2,2,2,2,0],[3,0,2,2,2,2,0,2],[1,2,0,2,2,2,2,0],[1,0,2,2,2,2,0,2],[3,2,0,2,0,2,0,0], or [1,2,2,0,2,0,0,2].

In a possible implementation, the first sequence has a length of 255, and the recurrence relation of the first sequence is x (i+8) =mod (3·x (i+5) +x (i+3) +3·x (i+2) +2·x (i+1) +3·x (i), 4), whose initial values [ x (0), x (1), x (2), x (3), x (4), x (5), x (6), x (7) ] belong to an initial value set comprising one or more of the sequences ：[3,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0],[3,2,2,0,2,0,2,2],[3,2,0,0,0,0,0,0],[3,0,0,2,0,2,0,0],[3,0,0,0,0,0,0,2],[1,0,0,0,0,0,0,2],[1,0,0,2,0,2,0,0],[1,2,0,0,0,0,0,0],[1,2,2,0,2,0,2,2],[3,2,0,2,0,2,0,2],[1,0,2,0,0,0,0,0],[3,2,2,2,2,2,2,2],[3,0,2,0,2,2,0,0],[3,2,0,2,0,2,0,0],[1,2,0,0,0,0,0,2],[1,2,2,0,0,0,0,0],[3,0,2,0,2,0,2,0],[1,2,2,2,0,2,2,2],[3,0,2,0,2,0,2,2],[3,0,0,2,2,0,2,0],[3,0,0,0,0,0,2,0],[1,0,0,0,0,0,2,0],[1,0,0,2,0,2,0,2],[3,2,0,0,0,0,0,2],[1,2,2,0,2,0,2,0],[3,0,0,0,0,0,2,2],[1,0,0,0,0,0,2,2],[3,2,2,0,2,0,2,0],[3,0,0,2,0,2,0,2],[1,2,2,2,2,2,2,2],[3,0,2,0,0,0,0,0],[1,2,0,2,0,2,0,2],[1,0,0,2,2,0,2,0],[1,0,2,0,2,0,2,2],[3,2,2,2,0,2,2,2],[1,0,2,0,2,0,2,0],[3,2,2,0,0,0,0,0],[1,2,0,2,0,2,0,0],[1,0,2,0,2,2,0,0],[1,0,0,2,2,2,0,0],[1,2,0,2,0,0,0,0],[3,0,2,2,2,0,0,0],[1,2,0,2,0,2,2,2],[3,0,2,0,0,2,0,2],[3,2,2,2,0,0,0,0],[3,2,2,2,0,0,0,2],[3,0,2,2,0,0,2,0],[1,2,0,0,2,2,2,2],[1,2,2,2,0,2,0,0],[1,2,0,2,0,0,2,0],[3,0,2,2,2,2,2,0],[3,2,0,2,2,0,2,0],[3,0,2,0,0,2,2,2],[1,2,2,2,0,2,0,2],[1,2,0,0,2,0,2,2],[1,2,2,0,2,0,0,0],[3,0,0,0,2,2,0,2],[1,0,2,2,0,2,2,2],[3,0,0,0,2,2,2,0],[1,0,0,2,0,0,0,0],[3,0,0,2,2,2,0,0],[1,2,2,0,2,2,2,0],[3,2,0,0,0,2,2,2],[3,0,2,2,0,0,0,0],[1,2,2,0,0,0,2,2],[1,2,2,2,2,0,0,2],[3,0,2,2,2,2,2,2],[3,0,0,0,2,0,2,2],[1,0,2,2,2,0,2,2],[1,0,0,0,2,0,2,2],[1,0,2,0,0,2,2,0],[3,2,0,2,2,0,0,0],[1,0,2,2,0,2,0,0],[3,2,2,0,2,2,0,0],[3,2,2,2,0,0,2,0],[1,0,0,0,0,2,0,0],[3,0,0,0,0,2,0,0],[3,2,0,0,0,0,2,0],[1,0,0,2,0,2,2,2],[1,0,0,0,0,2,0,2],[3,0,0,0,0,2,0,2],[1,2,0,0,0,0,2,0],[3,0,0,2,0,2,2,2],[3,2,2,0,2,0,0,0],[1,0,2,0,0,0,0,2],[1,0,2,0,2,2,0,2],[1,2,2,0,0,0,0,2],[3,2,2,2,2,2,2,0],[3,2,2,2,0,2,2,0],[1,0,0,2,2,0,2,2],[1,0,0,0,0,2,2,0],[3,0,0,0,0,2,2,0],[3,2,0,0,0,0,2,2],[3,0,0,2,0,2,2,0],[3,2,2,0,2,0,0,2],[1,0,0,0,0,2,2,2],[3,0,0,0,0,2,2,2],[1,2,0,0,0,0,2,2],[1,2,2,0,2,0,0,2],[1,0,0,2,0,2,2,0],[3,0,2,0,2,2,0,2],[1,0,2,2,2,0,0,0],[3,2,0,2,0,0,0,0],[1,0,2,2,0,0,2,0],[1,2,2,2,0,0,0,2],[1,2,2,2,0,0,0,0],[3,2,0,2,0,2,2,2],[1,0,2,0,0,2,0,2],[3,0,2,2,2,0,2,2],[3,0,2,0,0,2,2,0],[1,2,2,2,0,0,2,0],[1,2,2,0,2,2,0,0],[3,0,2,2,0,2,0,0],[1,2,0,2,2,0,0,0],[1,0,0,0,2,2,2,0],[3,0,0,2,0,0,0,0],[3,2,2,2,2,0,0,2],[1,0,2,2,2,2,2,2],[1,2,0,0,0,2,2,2],[3,2,2,0,0,0,2,2],[1,0,2,2,0,0,0,0],[3,2,2,0,2,2,2,0],[3,2,0,0,2,2,2,2],[3,2,0,2,0,0,2,0],[3,2,2,2,0,2,0,0],[1,0,0,0,2,2,0,2],[3,0,2,2,0,2,2,2],[3,2,2,2,0,2,0,2],[3,2,0,0,2,0,2,2],[1,0,2,2,2,2,2,0],[1,0,2,0,0,2,2,2],[1,2,0,2,2,0,2,0],[3,2,0,0,2,2,2,0],[1,0,2,2,0,0,0,2],[3,0,2,2,0,0,2,2],[1,2,0,0,0,2,0,0],[1,0,0,2,2,2,2,0],[1,2,0,2,2,2,0,2],[1,2,2,2,2,2,0,0],[1,0,2,0,2,2,2,0],[3,0,2,0,2,0,0,0],[1,2,0,0,2,0,2,0],[1,2,0,2,0,0,0,2],[3,2,0,2,2,2,0,0],[1,2,0,2,2,0,2,2],[1,2,0,2,2,2,2,2],[3,0,2,0,0,0,2,0],[1,0,0,2,2,0,0,0],[3,0,0,2,2,0,0,2],[1,0,2,0,0,0,2,2],[1,2,2,0,2,2,2,2],[3,2,0,0,2,0,0,0],[3,0,2,2,0,2,2,0],[1,2,0,0,0,2,2,0],[1,0,2,2,2,0,0,2],[1,2,0,0,2,2,0,2],[3,0,2,2,2,2,0,0],[1,2,0,0,0,2,0,2],[1,2,0,2,2,2,0,0],[3,2,0,2,0,0,2,2],[3,0,2,0,0,2,0,0],[1,0,2,2,2,2,0,0],[1,2,2,0,2,2,0,2],[3,0,2,0,2,2,2,0],[3,0,0,2,2,2,2,2],[1,2,2,2,2,0,2,2],[3,2,0,0,0,2,2,0],[1,2,2,0,0,2,2,0],[3,2,2,0,0,2,0,2],[3,2,2,0,0,2,0,0],[1,2,2,2,2,0,2,0],[1,0,0,0,2,2,0,0],[1,0,2,0,0,0,2,0],[3,0,0,2,2,0,0,0],[3,2,0,2,2,0,0,2],[3,0,0,0,2,0,0,0],[3,2,2,0,0,2,2,0],[3,2,2,2,2,2,0,0],[3,2,2,2,2,0,0,0],[1,0,0,0,2,0,0,0],[3,2,0,0,2,0,0,2],[1,0,2,0,2,0,0,0],[1,0,0,2,0,0,0,2],[1,0,2,0,2,2,2,2],[1,0,2,0,0,2,0,0],[1,0,0,2,2,2,2,2],[3,0,0,2,2,2,2,0],[1,2,2,0,0,2,2,2],[1,0,0,0,2,0,2,0],[3,0,2,2,0,0,0,2],[3,2,0,0,2,2,0,0],[1,0,2,2,0,2,0,2],[3,0,0,0,2,0,2,0],[1,2,2,2,0,0,2,2],[3,2,0,2,2,0,2,2],[3,0,0,2,0,0,2,2],[1,0,2,2,2,0,2,0],[3,2,0,0,2,2,0,2],[1,0,0,2,0,0,2,0],[1,2,0,0,2,2,0,0],[1,0,0,0,2,2,2,2],[1,2,0,0,2,0,0,2],[3,2,2,0,0,2,2,2],[3,0,0,0,2,0,0,2],[1,0,0,0,2,0,0,2],[1,0,0,2,0,0,2,2],[3,2,0,0,0,2,0,0],[1,2,2,0,0,0,2,0],[3,0,2,0,2,2,2,2],[1,2,2,2,2,2,0,2],[3,2,2,0,2,2,0,2],[3,2,0,0,0,2,0,2],[3,0,0,2,0,0,2,0],[3,2,2,0,0,0,2,0],[1,0,0,2,2,0,0,2],[3,2,2,2,2,2,0,2],[1,0,0,2,2,2,0,2],[3,0,2,2,2,0,0,2],[3,0,0,2,2,2,0,2],[1,2,2,2,2,0,0,0],[3,0,2,2,0,2,0,2],[3,0,2,2,2,0,2,0],[3,0,0,0,2,2,2,2],[1,2,0,2,0,2,2,0],[3,2,0,0,2,0,2,0],[1,2,0,2,2,0,0,2],[3,0,0,0,2,2,0,0],[3,2,2,0,2,2,2,2],[3,0,2,0,2,0,0,2],[1,0,2,0,2,0,0,2],[3,2,0,2,0,2,2,0],[3,0,0,2,0,0,0,2],[3,0,2,0,0,0,2,2],[3,2,0,2,0,0,0,2],[1,2,0,2,0,0,2,2],[1,2,0,0,2,2,2,0],[3,2,2,2,0,0,2,2],[1,0,2,2,0,0,2,2],[1,0,2,2,0,2,2,0],[3,2,0,2,2,2,0,2],[1,2,0,0,2,0,0,0],[3,2,0,2,2,2,2,2],[1,2,2,0,0,2,0,2],[1,2,2,0,0,2,0,0],[3,2,2,2,2,0,2,2],[3,2,2,2,2,0,2,0],[3,2,0,2,2,2,2,0],[3,0,2,2,2,2,0,2],[1,2,0,2,2,2,2,0], or [1,0,2,2,2,2,0,2].

In a possible implementation, the first length is 255 and the primitive polynomial of the first sequence is x ⁸+x⁵+3x³+x² +2x+1. When the length of the first sequence is 255, the tap number of the primitive polynomial provided by the scheme is less, and the implementation complexity is lower.

In a possible implementation, the length of the first sequence is L, c is p×id, the value range of ID is [0, K-1], K is a positive integer, p satisfies that p=floor (L/K), floor is rounded down, or p=ceil (L/K), ceil is rounded up, or p=round (L/K), round is rounded up to the nearest integer. Alternatively, K is 63 or 127.

In this scheme, c is p×id, that is, the cyclic shift is equally spaced, or the cyclic shift values are uniformly distributed. In this way, the minimum value of the interval between any two cyclic shift values is maximum, and lower cross-correlation between sequences can be ensured. In addition, the better frequency offset resistance effect can be achieved by maximizing the interval between adjacent cyclic shifts.

In a possible implementation, the synchronization signal is SSS, and data corresponding to the synchronization signal is transmitted using an orthogonal frequency division multiplexing (orthogonal frequency division multiplexing, OFDM) waveform.

In a second aspect, the present application provides a communication method applied to a terminal side, for example, to a terminal device or a component (e.g., a circuit, a chip or a chip system, etc.) in a terminal device, or to a larger device including a terminal device. For convenience of description, the method is hereinafter applied to a terminal device as an example.

The communication method comprises the steps that a terminal device detects a synchronous signal, wherein the synchronous signal is a signal obtained based on a first sequence, initial values of the first sequence belong to an initial value set, and any two initial values in the initial value set are different.

In a possible implementation, the terminal device detecting the synchronization signal includes the terminal device detecting the synchronization signal in a first mode, a second mode, a third mode or a fourth mode.

The first mode includes that the terminal equipment acquires a first sequence, and processes the received signal according to the first sequence to detect a synchronous signal.

In a first aspect, the first sequence may be stored at the terminal device, or the first sequence may be generated by the terminal device. For example, the terminal device may store an initial value, and the terminal device may acquire the stored initial value to generate the first sequence. Processing the received signal according to the first sequence includes generating a second sequence according to the first sequence, correlating the received signal according to the second sequence, e.g., correlating the second sequence with the received signal to detect the synchronization signal.

The second mode includes that the terminal equipment obtains a first sequence, generates a second sequence according to the first sequence, and processes the received signal according to the second sequence to detect a synchronous signal.

In the second mode, the first sequence may be stored in the terminal device, or the first sequence may be generated by the terminal device. For example, the terminal device may store an initial value, and the terminal device may acquire the stored initial value to generate the first sequence. A second sequence is generated from the first sequence, and the received signal is correlated according to the second sequence, e.g., the second sequence and the received signal are correlated to detect the synchronization signal.

The third mode comprises that the terminal equipment acquires a second sequence, and processes the received signal according to the second sequence to detect the synchronous signal, wherein the second sequence is generated based on the first sequence.

In the third mode, the second sequence may be stored in the terminal device, or the second sequence may be generated by the terminal device. For example, the terminal device may store an initial value, the terminal device may obtain the stored initial value to generate a first sequence, and generate a second sequence according to the first sequence. For another example, the terminal device may store the first sequence, and the terminal device may acquire the stored first sequence to generate the second sequence. Processing the received signal according to the second sequence includes correlating the received signal according to the second sequence, e.g., correlating the second sequence with the received signal to detect the synchronization signal.

The fourth mode comprises that the terminal equipment processes the received signals according to sequences in the synchronous sequence set to detect synchronous signals, wherein the sequences in the synchronous sequence set comprise a second sequence, and the second sequence is obtained based on the first sequence.

In the fourth aspect, the synchronization sequence set may be stored in the terminal device, or the synchronization sequence set may be generated by the terminal device. For example, the terminal device may store an initial value, the terminal device may obtain the stored initial value to generate a first sequence, generate a second sequence according to the first sequence, and so on, to obtain the set of synchronization sequences. For another example, the terminal device may store the first sequence, the terminal device may acquire the stored first sequence to generate the second sequence, and so on, to obtain the set of synchronization sequences. Processing the received signal according to sequences in the set of synchronization sequences includes correlating the received signal according to a second sequence, e.g., correlating the second sequence with the received signal to detect the synchronization signal.

A possible implementation manner of detecting the synchronous signal comprises the steps of sequentially carrying out inner product on all sequences in a synchronous sequence set and a received signal to obtain a related value set, wherein the sequences in the synchronous sequence set comprise a second sequence, the second sequence is a sequence obtained based on the first sequence, determining the synchronous signal according to the maximum related value in the related value set or determining a first cell identification according to the maximum related value in the related value set.

A possible implementation way of processing the received signal according to the second sequence comprises projecting the received synchronization signal, determining a first cyclic shift (i.e. c) according to the projected synchronization signal, generating a first sequence set according to the first cyclic shift and an initial value set, determining a first initial value according to the second sequence set and the synchronization signal, and determining a first cell identity according to the first initial value and the first cyclic shift. Wherein the second set of sequences comprises the first set of sequences.

In a possible implementation manner, the elements in the first sequence satisfy a recurrence relation, the recurrence relation corresponds to a primitive polynomial one by one, and the primitive polynomial f (x) satisfies: a _i ∈ {0,1,2, M-1}, M is a positive integer greater than 3, r is a positive integer, and the length of the first sequence is n= ^r -1.

In a possible implementation, the first sequence is a Z ₄ sequence.

In a possible implementation, the lengths of the first sequence and the second sequence are both L, and the element d (n) of the second sequence and the element x (m) of the first sequence satisfy: m= (n+c) mod L, a is a complex number, c is an integer, 0≤n < L, 0≤m < L, x (m) =0, 1,2 or 3.

In a possible implementation, the length of the first sequence is 127, the recurrence relation of the first sequence is x (i+7) =mod (2·x (i+4) +3·x (i+1) +x (i), 4), or the recurrence relation of the first sequence is x (i+7) =mod (x (i+4) +2·x (i+2) +x (i), 4), the initial value of the first sequence [ x (6), x (5), x (4), x (3), x (2), x (1), x (0) ] belongs to an initial value set comprising one or more of the following sequences ：[1,0,0,0,0,0,0],[3,0,0,0,0,0,0],[1,0,0,0,2,2,2],[3,2,0,0,0,0,0],[1,2,2,2,0,0,0],[1,0,0,0,0,0,2],[3,0,0,0,0,0,2],[3,2,2,2,0,0,0],[1,2,0,0,0,0,0],[3,0,0,0,2,2,2],[1,2,0,2,0,2,0],[3,2,2,0,0,0,0],[1,2,2,2,2,2,2],[1,2,2,0,0,2,2],[3,0,2,2,0,0,0],[1,2,0,2,0,0,0],[1,0,2,0,0,0,0],[1,0,2,0,2,0,2],[1,0,0,0,2,0,2],[3,2,0,0,2,2,2],[1,0,2,2,2,2,0],[1,0,0,0,0,2,0],[3,0,0,0,0,2,0],[3,2,2,2,0,0,2],[3,2,0,0,0,0,2],[3,0,0,0,2,2,0],[1,0,0,0,0,2,2],[3,0,0,0,0,2,2],[1,0,0,0,2,2,0],[1,2,0,0,0,0,2],[1,2,2,2,0,0,2],[3,2,2,2,2,2,2],[1,2,2,0,0,0,0],[3,2,0,2,0,2,0],[3,0,2,2,2,2,0],[1,2,0,0,2,2,2],[3,0,0,0,2,0,2],[3,0,2,0,2,0,2],[3,0,2,0,0,0,0],[3,2,0,2,0,0,0],[1,0,2,2,0,0,0],[3,2,2,0,0,2,2],[1,0,0,2,0,2,2],[1,0,0,2,0,0,0],[1,2,0,2,2,0,2],[1,0,2,2,0,0,2],[3,2,2,0,2,0,2],[3,2,0,0,2,2,0],[3,0,2,0,2,2,2],[3,2,2,2,2,2,0],[3,2,2,0,2,2,2],[3,2,0,0,2,0,2],[3,0,0,2,0,2,2],[1,2,0,2,2,2,2],[1,2,0,0,2,2,0],[3,0,0,2,0,2,0],[1,0,2,2,2,2,2],[1,2,2,2,0,2,0],[1,2,2,2,2,0,2],[1,2,2,0,2,0,0],[3,0,2,2,2,2,2],[3,0,2,0,2,0,0],[3,2,2,0,0,0,2],[1,0,2,0,2,2,2],[3,0,0,2,0,0,0],[1,0,2,0,0,2,0],[3,2,0,0,0,2,2],[1,0,0,0,2,0,0],[3,0,2,0,0,2,2],[3,2,2,0,2,0,0],[3,0,0,0,2,0,0],[3,2,2,2,0,2,2],[3,2,0,0,0,2,0],[1,2,0,0,0,2,0],[1,2,2,2,0,2,2],[1,0,2,0,2,0,0],[3,2,0,2,0,0,2],[3,2,2,0,0,2,0],[1,2,0,2,0,2,2],[1,0,2,0,0,0,2],[1,2,2,2,2,2,0],[3,2,2,2,0,2,0],[1,2,0,0,0,2,2],[1,2,2,0,0,0,2],[3,0,2,2,0,0,2],[3,0,2,0,0,0,2],[3,2,0,2,0,2,2],[1,2,2,0,0,2,0],[1,2,0,2,0,0,2],[1,2,2,0,2,0,2],[3,2,0,2,2,0,2],[1,0,0,2,0,2,0],[1,0,2,0,0,2,2],[3,0,2,0,0,2,0],[3,2,0,2,2,2,2],[3,2,2,2,2,0,2],[1,2,0,0,2,0,2],[1,2,2,0,2,2,2],[3,0,0,2,2,2,2],[3,2,2,2,2,0,0],[1,2,2,2,2,0,0],[3,0,2,2,0,2,0],[1,2,2,0,2,2,0],[3,2,0,0,2,0,0],[3,0,2,2,2,0,2],[1,0,0,2,2,0,0],[1,2,0,2,2,2,0],[3,0,0,2,2,0,2],[3,0,0,2,0,0,2],[1,0,0,2,2,2,2],[3,2,0,2,2,0,0],[1,0,0,2,2,2,0],[3,0,0,2,2,0,0],[1,0,2,2,2,0,0],[1,0,2,2,0,2,2],[3,0,2,2,2,0,0],[3,0,2,2,0,2,2],[3,2,0,2,2,2,0],[3,2,2,0,2,2,0],[1,0,0,2,0,0,2],[1,2,0,0,2,0,0],[1,0,2,2,2,0,2],[3,0,2,0,2,2,0],[1,2,0,2,2,0,0],[1,0,2,0,2,2,0],[1,0,0,2,2,0,2],[3,0,0,2,2,2,0], or [1,0,2,2,0,2,0].

In a possible implementation, the length of the first sequence is 127, and the recurrence relation of the first sequence is x (i+7) =mod (2·x (i+4) +3·x (i+1) +x (i), 4), or the recurrence relation of the first sequence is x (i+7) =mod (x (i+4) +2·x (i+2) +x (i), 4), where "·" refers to multiplication. The initial values of the first sequence [ x (0), x (1), x (2), x (3), x (4), x (5), x (6) ] belong to a set of initial values comprising one or more of the sequences ：[1,0,0,0,0,0,0],[3,0,0,0,0,0,0],[1,0,0,0,2,2,2],[3,2,0,0,0,0,0],[1,2,2,2,0,0,0],[1,0,0,0,0,0,2],[3,0,0,0,0,0,2],[3,2,2,2,0,0,0],[1,2,0,0,0,0,0],[3,0,0,0,2,2,2],[1,2,0,2,0,2,0],[3,2,2,0,0,0,0],[1,2,2,2,2,2,2],[1,2,2,0,0,2,2],[3,0,2,2,0,0,0],[1,2,0,2,0,0,0],[1,0,2,0,0,0,0],[1,0,2,0,2,0,2],[1,0,0,0,2,0,2],[3,2,0,0,2,2,2],[1,0,2,2,2,2,0],[1,0,0,0,0,2,0],[3,0,0,0,0,2,0],[3,2,2,2,0,0,2],[3,2,0,0,0,0,2],[3,0,0,0,2,2,0],[1,0,0,0,0,2,2],[3,0,0,0,0,2,2],[1,0,0,0,2,2,0],[1,2,0,0,0,0,2],[1,2,2,2,0,0,2],[3,2,2,2,2,2,2],[1,2,2,0,0,0,0],[3,2,0,2,0,2,0],[3,0,2,2,2,2,0],[1,2,0,0,2,2,2],[3,0,0,0,2,0,2],[3,0,2,0,2,0,2],[3,0,2,0,0,0,0],[3,2,0,2,0,0,0],[1,0,2,2,0,0,0],[3,2,2,0,0,2,2],[1,0,0,2,0,2,2],[1,0,0,2,0,0,0],[1,2,0,2,2,0,2],[1,0,2,2,0,0,2],[3,2,2,0,2,0,2],[3,2,0,0,2,2,0],[3,0,2,0,2,2,2],[3,2,2,2,2,2,0],[3,2,2,0,2,2,2],[3,2,0,0,2,0,2],[3,0,0,2,0,2,2],[1,2,0,2,2,2,2],[1,2,0,0,2,2,0],[3,0,0,2,0,2,0],[1,0,2,2,2,2,2],[1,2,2,2,0,2,0],[1,2,2,2,2,0,2],[1,2,2,0,2,0,0],[3,0,2,2,2,2,2],[3,0,2,0,2,0,0],[3,2,2,0,0,0,2],[1,0,2,0,2,2,2],[3,0,0,2,0,0,0],[1,0,2,0,0,2,0],[3,2,0,0,0,2,2],[1,0,0,0,2,0,0],[3,0,2,0,0,2,2],[3,2,2,0,2,0,0],[3,0,0,0,2,0,0],[3,2,2,2,0,2,2],[3,2,0,0,0,2,0],[1,2,0,0,0,2,0],[1,2,2,2,0,2,2],[1,0,2,0,2,0,0],[3,2,0,2,0,0,2],[3,2,2,0,0,2,0],[1,2,0,2,0,2,2],[1,0,2,0,0,0,2],[1,2,2,2,2,2,0],[3,2,2,2,0,2,0],[1,2,0,0,0,2,2],[1,2,2,0,0,0,2],[3,0,2,2,0,0,2],[3,0,2,0,0,0,2],[3,2,0,2,0,2,2],[1,2,2,0,0,2,0],[1,2,0,2,0,0,2],[1,2,2,0,2,0,2],[3,2,0,2,2,0,2],[1,0,0,2,0,2,0],[1,0,2,0,0,2,2],[3,0,2,0,0,2,0],[3,2,0,2,2,2,2],[3,2,2,2,2,0,2],[1,2,0,0,2,0,2],[1,2,2,0,2,2,2],[3,0,0,2,2,2,2],[3,2,2,2,2,0,0],[1,2,2,2,2,0,0],[3,0,2,2,0,2,0],[1,2,2,0,2,2,0],[3,2,0,0,2,0,0],[3,0,2,2,2,0,2],[1,0,0,2,2,0,0],[1,2,0,2,2,2,0],[3,0,0,2,2,0,2],[3,0,0,2,0,0,2],[1,0,0,2,2,2,2],[3,2,0,2,2,0,0],[1,0,0,2,2,2,0],[3,0,0,2,2,0,0],[1,0,2,2,2,0,0],[1,0,2,2,0,2,2],[3,0,2,2,2,0,0],[3,0,2,2,0,2,2],[3,2,0,2,2,2,0],[3,2,2,0,2,2,0],[1,0,0,2,0,0,2],[1,2,0,0,2,0,0],[1,0,2,2,2,0,2],[3,0,2,0,2,2,0],[1,2,0,2,2,0,0],[1,0,2,0,2,2,0],[1,0,0,2,2,0,2],[3,0,0,2,2,2,0], or [1,0,2,2,0,2,0].

In a possible implementation, the length of the first sequence is 127, and the primitive polynomial of the first sequence is x ⁷+2x⁴ +x+3 or x ⁷+3x⁴+2x² +3.

In a possible implementation, the first sequence has a length of 255, and the recurrence relation of the first sequence is x (i+8) =mod (3·x (i+5) +x (i+3) +3·x (i+2) +2·x (i) +1) +3·x (i), 4), whose initial values [ x (0), x (1), x (2), x (3), x (4), x (5), x (6), x (7) ] belong to an initial value set comprising one or more of the sequences ：[3,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0],[3,2,2,0,2,0,2,2],[3,2,0,0,0,0,0,0],[3,0,0,2,0,2,0,0],[3,0,0,0,0,0,0,2],[1,0,0,0,0,0,0,2],[1,0,0,2,0,2,0,0],[1,2,0,0,0,0,0,0],[1,2,2,0,2,0,2,2],[3,2,0,2,0,2,0,2],[1,0,2,0,0,0,0,0],[3,2,2,2,2,2,2,2],[3,0,2,0,2,2,0,0],[3,2,0,2,0,2,0,0],[1,2,0,0,0,0,0,2],[1,2,2,0,0,0,0,0],[3,0,2,0,2,0,2,0],[1,2,2,2,0,2,2,2],[3,0,2,0,2,0,2,2],[3,0,0,2,2,0,2,0],[3,0,0,0,0,0,2,0],[1,0,0,0,0,0,2,0],[1,0,0,2,0,2,0,2],[3,2,0,0,0,0,0,2],[1,2,2,0,2,0,2,0],[3,0,0,0,0,0,2,2],[1,0,0,0,0,0,2,2],[3,2,2,0,2,0,2,0],[3,0,0,2,0,2,0,2],[1,2,2,2,2,2,2,2],[3,0,2,0,0,0,0,0],[1,2,0,2,0,2,0,2],[1,0,0,2,2,0,2,0],[1,0,2,0,2,0,2,2],[3,2,2,2,0,2,2,2],[1,0,2,0,2,0,2,0],[3,2,2,0,0,0,0,0],[1,2,0,2,0,2,0,0],[1,0,2,0,2,2,0,0],[1,0,0,2,2,2,0,0],[1,2,0,2,0,0,0,0],[3,0,2,2,2,0,0,0],[1,2,0,2,0,2,2,2],[3,0,2,0,0,2,0,2],[3,2,2,2,0,0,0,0],[3,2,2,2,0,0,0,2],[3,0,2,2,0,0,2,0],[1,2,0,0,2,2,2,2],[1,2,2,2,0,2,0,0],[1,2,0,2,0,0,2,0],[3,0,2,2,2,2,2,0],[3,2,0,2,2,0,2,0],[3,0,2,0,0,2,2,2],[1,2,2,2,0,2,0,2],[1,2,0,0,2,0,2,2],[1,2,2,0,2,0,0,0],[3,0,0,0,2,2,0,2],[1,0,2,2,0,2,2,2],[3,0,0,0,2,2,2,0],[1,0,0,2,0,0,0,0],[3,0,0,2,2,2,0,0],[1,2,2,0,2,2,2,0],[3,2,0,0,0,2,2,2],[3,0,2,2,0,0,0,0],[1,2,2,0,0,0,2,2],[1,2,2,2,2,0,0,2],[3,0,2,2,2,2,2,2],[3,0,0,0,2,0,2,2],[1,0,2,2,2,0,2,2],[1,0,0,0,2,0,2,2],[1,0,2,0,0,2,2,0],[3,2,0,2,2,0,0,0],[1,0,2,2,0,2,0,0],[3,2,2,0,2,2,0,0],[3,2,2,2,0,0,2,0],[1,0,0,0,0,2,0,0],[3,0,0,0,0,2,0,0],[3,2,0,0,0,0,2,0],[1,0,0,2,0,2,2,2],[1,0,0,0,0,2,0,2],[3,0,0,0,0,2,0,2],[1,2,0,0,0,0,2,0],[3,0,0,2,0,2,2,2],[3,2,2,0,2,0,0,0],[1,0,2,0,0,0,0,2],[1,0,2,0,2,2,0,2],[1,2,2,0,0,0,0,2],[3,2,2,2,2,2,2,0],[3,2,2,2,0,2,2,0],[1,0,0,2,2,0,2,2],[1,0,0,0,0,2,2,0],[3,0,0,0,0,2,2,0],[3,2,0,0,0,0,2,2],[3,0,0,2,0,2,2,0],[3,2,2,0,2,0,0,2],[1,0,0,0,0,2,2,2],[3,0,0,0,0,2,2,2],[1,2,0,0,0,0,2,2],[1,2,2,0,2,0,0,2],[1,0,0,2,0,2,2,0],[3,0,2,0,2,2,0,2],[1,0,2,2,2,0,0,0],[3,2,0,2,0,0,0,0],[1,0,2,2,0,0,2,0],[1,2,2,2,0,0,0,2],[1,2,2,2,0,0,0,0],[3,2,0,2,0,2,2,2],[1,0,2,0,0,2,0,2],[3,0,2,2,2,0,2,2],[3,0,2,0,0,2,2,0],[1,2,2,2,0,0,2,0],[1,2,2,0,2,2,0,0],[3,0,2,2,0,2,0,0],[1,2,0,2,2,0,0,0],[1,0,0,0,2,2,2,0],[3,0,0,2,0,0,0,0],[3,2,2,2,2,0,0,2],[1,0,2,2,2,2,2,2],[1,2,0,0,0,2,2,2],[3,2,2,0,0,0,2,2],[1,0,2,2,0,0,0,0],[3,2,2,0,2,2,2,0],[3,2,0,0,2,2,2,2],[3,2,0,2,0,0,2,0],[3,2,2,2,0,2,0,0],[1,0,0,0,2,2,0,2],[3,0,2,2,0,2,2,2],[3,2,2,2,0,2,0,2],[3,2,0,0,2,0,2,2],[1,0,2,2,2,2,2,0],[1,0,2,0,0,2,2,2],[1,2,0,2,2,0,2,0],[3,2,0,0,2,2,2,0],[1,0,2,2,0,0,0,2],[3,0,2,2,0,0,2,2],[1,2,0,0,0,2,0,0],[1,0,0,2,2,2,2,0],[1,2,0,2,2,2,0,2],[1,2,2,2,2,2,0,0],[1,0,2,0,2,2,2,0],[3,0,2,0,2,0,0,0],[1,2,0,0,2,0,2,0],[1,2,0,2,0,0,0,2],[3,2,0,2,2,2,0,0],[1,2,0,2,2,0,2,2],[1,2,0,2,2,2,2,2],[3,0,2,0,0,0,2,0],[1,0,0,2,2,0,0,0],[3,0,0,2,2,0,0,2],[1,0,2,0,0,0,2,2],[1,2,2,0,2,2,2,2],[3,2,0,0,2,0,0,0],[3,0,2,2,0,2,2,0],[1,2,0,0,0,2,2,0],[1,0,2,2,2,0,0,2],[1,2,0,0,2,2,0,2],[3,0,2,2,2,2,0,0],[1,2,0,0,0,2,0,2],[1,2,0,2,2,2,0,0],[3,2,0,2,0,0,2,2],[3,0,2,0,0,2,0,0],[1,0,2,2,2,2,0,0],[1,2,2,0,2,2,0,2],[3,0,2,0,2,2,2,0],[3,0,0,2,2,2,2,2],[1,2,2,2,2,0,2,2],[3,2,0,0,0,2,2,0],[1,2,2,0,0,2,2,0],[3,2,2,0,0,2,0,2],[3,2,2,0,0,2,0,0],[1,2,2,2,2,0,2,0],[1,0,0,0,2,2,0,0],[1,0,2,0,0,0,2,0],[3,0,0,2,2,0,0,0],[3,2,0,2,2,0,0,2],[3,0,0,0,2,0,0,0],[3,2,2,0,0,2,2,0],[3,2,2,2,2,2,0,0],[3,2,2,2,2,0,0,0],[1,0,0,0,2,0,0,0],[3,2,0,0,2,0,0,2],[1,0,2,0,2,0,0,0],[1,0,0,2,0,0,0,2],[1,0,2,0,2,2,2,2],[1,0,2,0,0,2,0,0],[1,0,0,2,2,2,2,2],[3,0,0,2,2,2,2,0],[1,2,2,0,0,2,2,2],[1,0,0,0,2,0,2,0],[3,0,2,2,0,0,0,2],[3,2,0,0,2,2,0,0],[1,0,2,2,0,2,0,2],[3,0,0,0,2,0,2,0],[1,2,2,2,0,0,2,2],[3,2,0,2,2,0,2,2],[3,0,0,2,0,0,2,2],[1,0,2,2,2,0,2,0],[3,2,0,0,2,2,0,2],[1,0,0,2,0,0,2,0],[1,2,0,0,2,2,0,0],[1,0,0,0,2,2,2,2],[1,2,0,0,2,0,0,2],[3,2,2,0,0,2,2,2],[3,0,0,0,2,0,0,2],[1,0,0,0,2,0,0,2],[1,0,0,2,0,0,2,2],[3,2,0,0,0,2,0,0],[1,2,2,0,0,0,2,0],[3,0,2,0,2,2,2,2],[1,2,2,2,2,2,0,2],[3,2,2,0,2,2,0,2],[3,2,0,0,0,2,0,2],[3,0,0,2,0,0,2,0],[3,2,2,0,0,0,2,0],[1,0,0,2,2,0,0,2],[3,2,2,2,2,2,0,2],[1,0,0,2,2,2,0,2],[3,0,2,2,2,0,0,2],[3,0,0,2,2,2,0,2],[1,2,2,2,2,0,0,0],[3,0,2,2,0,2,0,2],[3,0,2,2,2,0,2,0],[3,0,0,0,2,2,2,2],[1,2,0,2,0,2,2,0],[3,2,0,0,2,0,2,0],[1,2,0,2,2,0,0,2],[3,0,0,0,2,2,0,0],[3,2,2,0,2,2,2,2],[3,0,2,0,2,0,0,2],[1,0,2,0,2,0,0,2],[3,2,0,2,0,2,2,0],[3,0,0,2,0,0,0,2],[3,0,2,0,0,0,2,2],[3,2,0,2,0,0,0,2],[1,2,0,2,0,0,2,2],[1,2,0,0,2,2,2,0],[3,2,2,2,0,0,2,2],[1,0,2,2,0,0,2,2],[1,0,2,2,0,2,2,0],[3,2,0,2,2,2,0,2],[1,2,0,0,2,0,0,0],[3,2,0,2,2,2,2,2],[1,2,2,0,0,2,0,2],[1,2,2,0,0,2,0,0],[3,2,2,2,2,0,2,2],[3,2,2,2,2,0,2,0],[3,2,0,2,2,2,2,0],[3,0,2,2,2,2,0,2],[1,2,0,2,2,2,2,0], or [1,0,2,2,2,2,0,2].

In a possible implementation, the length of the first sequence is 255, and its primitive polynomial is x ⁸+x⁵+3x³+x² +2x+1.

In a possible implementation, the length of the first sequence is L, c is p×id, the value range of ID is [0, K-1], K is a positive integer, p satisfies that p=floor (L/K), floor is rounded down, or p=ceil (L/K), ceil is rounded up, or p=round (L/K), round is rounded up to the nearest integer.

In a possible implementation, K is 63 or 127.

In a possible implementation manner, the synchronization signal is SSS, and data corresponding to the synchronization signal is transmitted by using an OFDM waveform.

With respect to the advantages of the second aspect and the respective implementation manners thereof, reference may be made to the advantages of the first aspect and the respective implementation manners thereof, and the description thereof will not be repeated here.

In a third aspect, an embodiment of the present application provides a communication method executable by a first communication device and a second communication device. The first communication device has functionality to implement the actions in the method examples of the first aspect described above. For example, the first communication means comprises corresponding means (means) or modules or units for performing the method of the first aspect, which may be implemented by software and/or hardware. The second communication device has the functionality to implement the actions in the examples of the method of any of the second aspects described above, e.g. the second communication device comprises corresponding means or modules or units for performing the method of the second aspect, which may be implemented by software and/or hardware. In the following, the first communication apparatus is taken as a network device, and the second communication apparatus is taken as a terminal device as an example.

The communication method comprises the steps that the network equipment generates a synchronous signal and sends the synchronous signal, wherein the synchronous signal is obtained based on a first sequence, initial values of the first sequence belong to an initial value set, any two initial values in the initial value set are different, and the terminal equipment detects the synchronous signal.

With respect to the advantages of the third aspect, reference may be made to the advantages of the first aspect and the respective implementation manners thereof, which are not described here again.

In a fourth aspect, embodiments of the present application provide a communication device having a function of implementing the actions in the method examples of any of the first aspect or the second aspect, and the beneficial effects may be referred to in the related description of the first aspect or the second aspect and are not repeated herein. For example, the communication apparatus may be a network device in the first aspect, or the communication apparatus may be an apparatus capable of supporting the functions required by the network device to implement the method provided in the first aspect, for example, the communication apparatus may be a chip or a chip system in the network device. As another example, the communication apparatus may be the terminal device in the second aspect, or the communication apparatus may be an apparatus capable of supporting the functions required for the terminal device to implement the method provided in the second aspect, for example, the communication apparatus may be a chip or a chip system in the terminal device.

In one possible design, the communication device includes a baseband device and a radio frequency device.

In one possible design, the communication device comprises respective means or modules or units for performing the method of the first or second aspect, said modules or units or means being in particular realized by software or by hardware, or by a combination of software and hardware. For example, the communication device includes a processing unit (sometimes also referred to as a processing module or processor) and/or a transceiver unit (sometimes also referred to as a transceiver module or transceiver). The transceiver unit can realize a transmission function and a reception function, and may be referred to as a transmission unit (sometimes referred to as a transmission module) when the transceiver unit realizes the transmission function, and may be referred to as a reception unit (sometimes referred to as a reception module) when the transceiver unit realizes the reception function. The transmitting unit and the receiving unit may be the same functional unit, which is called a transceiver unit, which can implement the transmitting function and the receiving function, or the transmitting unit and the receiving unit may be different functional units, and the transceiver unit is a generic term for these functional units. These units (modules) may perform the corresponding functions in the method examples of the first aspect or the second aspect, and are specifically referred to in the detailed description of the method examples, which are not described herein.

In a fifth aspect, an embodiment of the present application provides a communication device, which may be the communication device in the fourth aspect of the above embodiment, or a chip system provided in the communication device in the fourth aspect. The communication device comprises a communication interface and a processor, and optionally a memory. Wherein the memory is used for storing computer programs or instructions or data, and the processor is coupled with the memory and the communication interface. When the processor reads the computer program or the instructions or the data, the communication device is caused to perform the method performed by the terminal device in the above-mentioned method embodiment, and the communication device may be the terminal device or a functional module in the terminal device, such as a baseband chip and a radio frequency chip, for example. Or when the processor reads the computer program or the instructions or the data, causes the communication means to perform the method performed by the network device in the above-mentioned method embodiment, for example, the communication means may be the network device or a functional module in the network device, such as a baseband chip and a radio frequency chip.

In a sixth aspect, an embodiment of the present application provides a chip system, where the chip system includes a processor and may further include a communication interface, to implement the method in the first aspect or the second aspect. Optionally, the system on a chip further comprises a memory. The memory is used to store a computer program (which may also be referred to as code, or instructions). The processor is configured to call and run a computer program from the memory, such that the device on which the chip system is installed performs the method of the first or second aspect and any one of its possible implementations. The chip system may be formed of a chip or may include a chip and other discrete devices.

In a seventh aspect, an embodiment of the present application provides a communication apparatus including an input-output interface and a logic circuit. The input-output interface is used for inputting and/or outputting information. The input-output interface may be an interface circuit, an output circuit, an input circuit, a pin, or related circuitry, etc. Logic circuitry is to perform the method of the first or second aspect.

In a specific implementation process, the communication device may be a chip, the input circuit may be an input pin, the output circuit may be an output pin, and the logic circuit may be a transistor, a gate circuit, a flip-flop, various logic circuits, and the like. The input signal received by the input circuit may be received and input by, for example and without limitation, a receiver, the output signal may be output by, for example and without limitation, a transmitter and transmitted by a transmitter, and the input circuit and the output circuit may be the same circuit, which functions as the input circuit and the output circuit, respectively, at different times. The application does not limit the specific implementation modes of the input/output interface and the logic circuit.

In one implementation, when the communication apparatus is a wireless communication device, the wireless communication device may be a terminal device such as a cell phone, or the wireless communication device may be a network device such as a base station. The interface circuit may be a radio frequency processing chip in the wireless communication device, and the processing circuit may be a baseband processing chip in the wireless communication device.

In an eighth aspect, an embodiment of the present application provides a communication system, where the communication system includes a terminal device and a network device, where the network device is configured to implement the functions of the method described in the first aspect, and the terminal device is configured to implement the functions of the method described in the second aspect.

In a ninth aspect, embodiments of the present application provide a computer readable storage medium for storing a computer program or instructions which, when executed, cause the method described in the first or second aspect and any implementation manner thereof to be implemented.

In a tenth aspect, embodiments of the present application also provide a computer program product comprising instructions which, when run on a computer, cause the method described in the first or second aspect and any implementation thereof to be carried out.

Advantageous effects of the fourth to tenth aspects and implementations thereof described above may be referred to advantageous effects of the first aspect and any implementations thereof.

Drawings

Fig. 1 is a schematic diagram of an architecture of a communication system according to an embodiment of the present application;

Fig. 2 is a schematic diagram of two exemplary protocol stacks of a base station according to an embodiment of the present application;

fig. 3 is a schematic diagram of a communication method according to an embodiment of the present application;

fig. 4 is a schematic structural diagram of a communication device according to an embodiment of the present application;

Fig. 5 is a schematic structural diagram of another communication device according to an embodiment of the present application.

Detailed Description

Embodiments of the present application provide a novel sequence that can be used to generate SSSs. Compared with gold sequences, SSS generated by using the sequences can reduce the detection complexity of the synchronous signals and improve the synchronous detection performance. The following further describes the scheme provided by the embodiment of the application with reference to the attached drawings.

The technical solutions provided by the embodiments of the present application may be applied to a third generation partnership project (the 3rd generation partnership project,3GPP) related communication system, for example, a long term evolution (long term evolution, LTE) communication system, a 5 th generation (the sixth generation, 5G) mobile communication system, or may also be applied to other next generation mobile communication systems, for example, a6 th generation (6G) communication system, or other similar communication systems. Other similar communication systems may include wireless fidelity (WIRELESS FIDELITY, WIFI), internet of vehicles (vehicle to everything, V2X), internet of things (internet ofthings, ioT) systems, and so forth.

Referring to fig. 1, a communication system to which an embodiment of the present application is applicable is shown. The communication system comprises a radio access network 100 and a core network 200. Optionally, the communication system may also include the internet (fig. 1 illustrates this as an example).

Wherein the radio access network 100 may comprise at least one network device and at least one terminal device. For example, the radio access network 100 includes two network devices 110a and 110b and terminal devices 120a to 120 j. The network architecture shown in fig. 1 is merely illustrative and the number of terminal devices and/or network devices may be fewer or greater. The communication system described in the embodiment of the present application is for more clearly describing the technical solution of the embodiment of the present application, and does not constitute a limitation of the communication system applicable to the embodiment of the present application. For example, the communication system may also include other devices, including, for example, wireless relay devices and wireless backhaul devices, etc., not shown in fig. 1. As one of ordinary skill in the art can know, along with the evolution of the network architecture, the technical solution provided by the embodiment of the present application is also applicable to similar technical problems. When the technical solution of the embodiment of the present application is applied to other communication systems, the devices, components, modules and the like in the embodiment may be replaced by corresponding devices, components, modules in other communication systems, which are not limited.

In the embodiment of the application, the network device refers to radio access network (radio access network, RAN) equipment. The RAN may be a 3GPP related cellular system, e.g., a 5G/New Radio (NR) mobile communication system, or a future-oriented evolution system (e.g., a 6G mobile communication system). The RAN may also be an open RAN, O-RAN or ORAN, a cloud radio access network (cloudradio access network, CRAN), or a virtual radio access network (virtualizedRAN, vRAN), among others. The RAN may also be a communication system in which two or more of the above systems are converged. RAN equipment may also be referred to as a RAN node, RAN entity, or access node, among others.

In one possible scenario, the RAN node may be a base station (base station), an evolved base station (evolvedNodeB, eNodeB), an Access Point (AP), a transmission-reception point (transmission reception point, TRP), a next generation base station (gNB), a next generation base station in a 6G mobile communication system, a base station in a future mobile communication system, and so on. The RAN node may be a macro base station, a micro base station, an indoor station, a relay node, a donor node/home node, or a radio controller, etc. The RAN node may also be a server, a wearable device, a vehicle or an in-vehicle device, etc. For example, the RAN node in the V2X technology may be a Road Side Unit (RSU).

In another possible scenario, the RAN node may be a module or unit that performs part of the function of the base station, or multiple RAN nodes cooperate to assist the terminal device in implementing radio access, where different RAN nodes implement part of the function of the base station, respectively. For example, the RAN node may be a centralized unit CU, a distributed unit DU, or a radio unit RU, etc. The functionality of a CU may be implemented by one entity or by a different entity. For example, the functionality of a CU may be further divided, i.e. the control plane and the user plane are separated and implemented by different entities, namely a control plane CU entity (i.e. a CU-Control Plane (CP) entity) and a user plane CU entity (i.e. a CU-user plane (userplane, UP) entity). The CU-CP entity and the CU-UP entity may be coupled to DUs, together performing the function of the RAN node. The CUs and DUs may be provided separately or may be comprised in the same network element, e.g. in a baseband unit (basebandunit, BBU). Any unit of CU (or CU-CP, CU-UP), DU and RU in the present application may be implemented by a software module, a hardware module, or a combination of software and hardware modules.

In different systems, CUs (or CU-CP and CU-UP), DUs or RUs may also have different names, but the meaning will be understood by those skilled in the art. For example, in ORAN systems, a CU may also be referred to as an O-CU (open CU), a DU may also be referred to as an O-DU, a CU-CP may also be referred to as an O-CU-CP, a CU-UP may also be referred to as an O-CU-UP, and a RU may also be referred to as an O-RU. For convenience of description, the present application is described by taking CU, CU-CP, CU-UP, DU and RU as examples.

The CUs and DUs may be configured according to the protocol layer functions of the wireless network they implement, e.g., the CUs are configured to implement the functions of a packet data convergence layer protocol (PACKET DATA convergence protocol, PDCP) layer and above protocol layers, e.g., a radio resource control (radio resource control, RRC) layer and/or a traffic data adaptation protocol (SERVICE DATA adaptation protocol, SDAP) layer, etc., and the DUs are configured to implement the functions of a protocol layer below the PDCP layer, e.g., a radio link control (radio link control, RLC), a medium access control (MEDIA ACCESS control, MAC) layer, and/or a Physical (PHY) layer, etc. For a specific description of the above respective protocol layers, reference may be made to the relevant technical specifications of 3GPP or to the technical specifications of other applicable communication protocols.

For example, please refer to fig. 2, which is a schematic diagram of two exemplary protocol stacks of a base station according to an embodiment of the present application. Wherein, in the base station (1), the base station is divided into CU and DU, CU is configured to realize the functions of PDCP layer and above protocol layer (such as RRC layer and/or SDAP layer, etc.), DU is configured to realize the functions of protocol layer below PDCP layer (such as RLC layer, MAC layer, and/or PHY layer, etc.). Communication is performed between the CU and the DU based on the F1 interface. In the base station (2), the base station is divided into CU and DU, wherein the CU comprises CU-CP and CU-UP, the CU-CP is used for realizing the control surface function of the CU, and the CU-UP is used for realizing the user surface function of the CU. CU-CP and CU-UP can communicate based on E1 interface, CU-CP and DU communicate based on F1 interface (also called F1-C) supporting control plane, CU-UP and DU communicate based on F1 interface (also called F1-U) supporting user plane. The CU-CP is configured to implement a control plane function and an RRC layer function of the PDCP layer, and the CU-UP is configured to implement a user plane function and a function of the SDAP layer of the PDCP layer. The DUs are configured to implement the functionality of protocol layers (e.g., RLC layer, MAC layer, and/or PHY layer, etc.) below the PDCP layer.

The above-mentioned partitioning of CU and DU processing functions by protocol layers is only an example, and may be performed in other manners, which is not a limitation of the present application. For example, in one design, a CU or DU may also be partitioned into partial processing functions with protocol layers. In one design, part of the functions of the RLC layer and the functions of the protocol layers above the RLC layer are set at CU, and the remaining functions of the RLC layer and the functions of the protocol layers below the RLC layer are set at DU.

In another possible design, the functions of the PHY layer are implemented jointly by the DU and RU cooperatively, or described as moving a portion of the PHY layer functions of the DU to the RU. One DU may be connected to one or more RUs. The functions possessed by DUs and RUs may be configured in a variety of ways depending on the design. For example, a DU is configured to implement baseband functionality and an RU is configured to implement medium radio frequency functionality. As another example, the DU is configured to implement higher layer functions in the PHY layer, and the RU is configured to implement lower layer functions in the PHY layer or to implement the lower layer functions and the radio frequency functions. The higher layer functions in the physical layer may include a portion of the functions of the physical layer that are closer to the MAC layer, and the lower layer functions in the physical layer may include another portion of the functions of the physical layer that are closer to the medium radio frequency side. The application is not limited to the specific functions of DU and RU. The interface between the DU and RU may be referred to as a preamble interface.

The RAN may also have artificial intelligence (ARTIFICIAL INTELLIGENCE, AI) functionality when it is an O-RAN, e.g., the O-RAN includes an intelligent controller (INTELLIGENT CONTROLLER). The intelligent controller may be a non-real-time RAN intelligent controller (non-REAL TIME RAN INTELLIGENT controller, non-real-time RIC/non-RT RIC/NRT RIC) or a near-real-time RAN intelligent controller (near-REAL TIME RAN INTELLIGENT controller, near-real-time RIC/near-RT RIC/nRT RIC). The non-real-time RIC can be used to implement non-real-time intelligent management of RAN functions, enable workflows including model training and model updating, and instruct applications/functions in the nRT RIC based on policies. Near real-time RIC may be used to implement near real-time intelligent management of the RAN. And near real-time control and optimization of the modules and resources of the O-RAN are realized through data collection and related operations on an E2 interface.

In the embodiment of the present application, the means for implementing the function of the network device may be the network device itself, or may be a means capable of supporting the network device to implement the function, for example, a chip system or a combination device or a component capable of implementing the function of the network device, where the means may be installed in the network device. The embodiment of the application does not limit the specific technology and the specific equipment form adopted by the network equipment.

In the embodiment of the application, all the data communication with the base station can be regarded as terminal equipment. A terminal device is also called a terminal, a terminal apparatus, a User Equipment (UE), a user equipment, a mobile station, a mobile terminal, or the like. The terminal device can be widely applied to various scenes, for example, the terminal device can be a mobile phone, a computer, a mobile internet device (mobile INTERNET DEVICE, MID), a wearable device, a Virtual Reality (VR) device, an augmented reality (augmented reality, AR) device, a Station (STA), a mechanical arm, a camera, a robot, a vehicle, an unmanned plane, a helicopter, an airplane, a ship, or a smart home device (e.g., a television, an air conditioner, a floor sweeping machine, a sound box, a set-top box), a relay (relay), a client terminal device (customerpremise equipment, CPE), etc.

Furthermore, in the embodiment of the present application, the terminal device may also be a terminal device in an IoT system, for example, a water meter, an electricity meter, and the like. IoT is an important component of future information technology development, and its main technical feature is to connect an item with a network through a communication technology, so as to implement man-machine interconnection and an intelligent network for object interconnection.

When the terminal device is applied to V2X, the terminal device may also be referred to as V2X device, for example, smart car (smart car or INTELLIGENT CAR), digital car (DIGITAL CAR), unmanned car (unmanned car or DRIVERLESS CAR or pilotless car or automobile), automatic car (self-DRIVING CAR or auto car), pure EV or Battery EV, hybrid ELECTRIC VEHICLE, HEV, range extended EV, REEV, plug-in HEV, new energy car (NEW ENERGY VEHICLE), road Side Unit (RSU).

The various terminal devices described above, if located on a vehicle (e.g., placed/installed in a vehicle), can be considered as in-vehicle terminal devices. The in-vehicle terminal device may be built in an in-vehicle module, an in-vehicle part, an in-vehicle chip, or an in-vehicle unit of the vehicle as one or more parts or units, through which the vehicle may implement the method of the present application. The vehicle-mounted terminal device may be a whole vehicle device, a vehicle-mounted module, a vehicle-mounted unit (onboardunit, OBU), a roadside unit (RSU), a vehicle-mounted system (or vehicle-mounted transmitting unit) (TELEMATICS BOX, T-box), a chip or a System On Chip (SOC), etc., and the chip or the SOC may be mounted in the vehicle, the OBU, the RSU, or the T-box.

In the embodiment of the present application, the device for implementing the function of the terminal device may be the terminal device itself, or may be a device capable of supporting the terminal device to implement the function, for example, a chip system or a combination device or a component capable of implementing the function of the terminal device, and the device may be installed in the terminal device. The embodiment of the application does not limit the specific technology and the specific equipment form adopted by the terminal equipment.

Taking the network device as a base station and the terminal device as a UE as an example, the base station and the UE may be fixed in position or movable. The base station and the UE may be deployed on land, including indoor or outdoor, hand-held or vehicle-mounted, on water, on aircraft, balloon and satellite. The embodiment of the application does not limit the application scenes of the base station and the UE.

The roles of base station and UE may be relative, e.g., helicopter or drone 120i in fig. 1 may be configured as a mobile base station, with UE 120i being the base station for those UEs 120j accessing radio access network 100 through 120i, but 120i being the UE for base station 110a, i.e., communication between 110a and 120i being via a wireless air interface protocol. Of course, communication between 110a and 120i may be performed via an interface protocol between base stations, and in this case, 120i is also a base station with respect to 110 a. Thus, both the base station and the UE may be collectively referred to as a communication device, 110a and 110b in fig. 1 may be referred to as a communication device with base station functionality, and 120a-120j in fig. 1 may be referred to as a communication device with UE functionality.

In the embodiments of the present application, "at least one" means one or more, and "a plurality" means two or more. "and/or" describes an association of associated objects, meaning that there may be three relationships, e.g., A and/or B, and that there may be A alone, while A and B are present, and B alone, where A, B may be singular or plural. The character "/" generally indicates that the context-dependent object is an "or" relationship. "at least one item(s)" or the like below refers to any combination of these ten or more items, including any combination of single item(s) or plural items(s). For example, at least one (a, b, or c) of a, b, c, a-b, a-c, b-c, or a-b-c may be represented, wherein a, b, c may be single or plural.

And, unless specified to the contrary, references to "first," "second," etc. ordinal words of embodiments of the present application are used for distinguishing between multiple objects and are not used for limiting the order, timing, priority, or importance of the multiple objects. For example, the first TBS and the second TBS are only for distinguishing between different sizes, and are not indicative of the difference in priority or importance of the two sizes.

In the embodiments of the present application, "transmit" and "receive" refer to the trend of signal transmission. For example, "sending information to XX" may be understood as the destination of the information being XX, and may include sending directly over the air, as well as sending indirectly over the air by other units or modules. "receiving information from YY" is understood to mean that the source of the information is YY, and may include receiving directly from YY over an air interface, or may include receiving indirectly from YY over an air interface from another unit or module. "send" may also be understood as "output" of the chip interface and "receive" may also be understood as "input" of the chip interface. In other words, the transmission and reception may be performed between devices, for example, between a network device and a terminal device, or may be performed within a device, for example, between components within a device, between modules, between chips, between software modules or between hardware modules through a bus, wiring or interface. It will be appreciated that the information may be subjected to the necessary processing, such as encoding, modulation, etc., between the source and destination of the information transmission, but the destination may understand the valid information from the source. Similar expressions in the present application can be understood similarly, and will not be described again.

In the embodiments of the present application, "when.," if "and" if "all mean that the device will perform the corresponding process under some objective condition, and are not limited in time, nor do they require that the device be implemented with a judgment action, nor are they meant to be limited. Unless specifically stated otherwise, "if" and "if" are interchangeable, "when. "when..A" and "if"/"if" are interchangeable. The "x" in the embodiments of the present application may be used to represent "multiplication".

The ordinal terms such as "first," "second," and the like in the embodiments of the present application are used for distinguishing a plurality of objects, and are not used for limiting the size, content, sequence, timing, priority, importance, and the like of the plurality of objects. For example, the first sequence and the second sequence refer to two different sequences, and are not indicative of the difference in content, priority, importance, or the like of the two sequences. The word "exemplary" or "such as" is used to mean serving as an example, instance, or illustration. Any embodiment or design described herein as "exemplary" or "for example" should not be construed as preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "such as" is intended to present related concepts in a concrete fashion.

Having described the network architecture to which the present application is applicable, some of the details of the embodiments of the present application are described below, for example, physical cell identity (PHYSICAL CELL IDENTITY, PCI), synchronization signal detection procedure, and the like.

1)PCI

PCI is used to identify cells at the physical layer and may also be referred to as cell identification. The terminal device may determine the PCI through a network identifier one (network identity1, NID 1) and a network identifier two (network identity2, NID 2). For example, NID2 may be obtained from PSS and NID1 may be obtained from SSS.

PSS may be generated from gold sequences, which may be seen as sequences obtained by element-wise exclusive-or of two primitive polynomials with different m-sequences. Assuming that the length n of PSS is 127, the sequence d _PSS (n) corresponding to PSS may satisfy that d _PSS (n) =1-2 x (m),N <127, mod is a remainder operation,I.e., NID2.

SSS may be generated from gold sequences. Assuming that the length n of the SSS is 127, the sequence d _SSS (n) corresponding to the SSS can satisfy d _SSS(n)＝[1-2x₀((n+m₀)mod127)][1-2x₁((n+m₁) mod 127),N <127, mod is a remainder operation,I.e., NID1. Wherein ,x₀(i+7)＝(x₀(i+4)+x₀(i))mod2;x₁(i+7)＝(x₁(i+1)+x₁(i))mod2, has ：[x₀(6) x₀(5) x₀(4) x₀(3) x₀(2) x₀(1) x₀(0)]＝[0 0 0 0 0 0 1];[x₁(6) x₁(5) x₁(4) x₁(3) x₁(2) x₁(1) x₁(0)]＝[0 0 0 0 0 0 1],, see in particular the description in standard 38.211.

PCI i.e. PCIWherein, the The value set of (1) is {0,1,2},The value set of (1, 2, 335) is {0,1,2, and accordingly, there are 1008 PCIs in total.

2) Synchronization signal detection process

Taking UE detection of synchronization signals as an example, the UE blindly detects PSS on a standard defined synchronization grid (synchronization raster) defining a set of frequencies with a certain interval within the 5G frequency band for dividing the 5G frequency band into several synchronization signals and frequency domain locations of physical broadcast channel blocks (SSBs). The synchronization grid may also be considered to include one or more center frequency points where cells may exist, on which the UE may detect PSS. After detecting the PSS signal on a certain synchronization grid, the UE performs frequency correction and then performs time slot synchronization. After slot synchronization, the UE detects SSS. Due to PSS bearerThe UE detectsAfter that, willDetection of substitution into SSS, i.eSubstituted into d _SSS (n). The SSS sequences are 336 possible, and the UE needs to use 336 different SSS sequences to perform cross-correlation detection on SSS, where the SSS sequence corresponding to the maximum cross-correlation value is the SSS sequence sent by the base station.

3) Rapid Hadamard transform detection (sasthadamardtransform, FHT)

FHT is a correlation detection method, which performs Hadamard transform detection on the sequence to calculate the correlation value faster. Taking SSS sequence detection as an example, from 1), it is known that the number of cyclic shifts of m ₀ and m ₁ is different, where m ₀ has 9 cyclic shifts in total, i.e., [0,1,2,3,4,5,6,7,8], the range of values of m ₀ is 5× [0,1,2,3,4,5,6,7,8], and m ₁ has 112 cyclic shifts in total, and the range of values of m ₁ is [0,1, 2. ], 111. When the UE detects SSS, the m sequence corresponding to m ₀ can be used as a scrambling code, and the m sequence corresponding to m ₁ can be subjected to fast Hadamard transformation detection.

Taking the primitive polynomial of the m sequence as f (x) =x ³+x² +1 as an example, 8 sequences can be generated, namely {[0,0,0,0,0,0,0],[0,0,1,0,1,1,1],[0,1,0,1,1,1,0],[1,0,1,1,1,0,0],[0,1,1,1,0,0,1],[1,1,1,0,0,1,0],[1,1,0,0,1,0,1],[1,0,0,1,0,1,1]}. can find that other m sequences are cyclic shifts of a certain sequence except for all 0 sequences. For example, the third sequence is obtained by circularly shifting the second sequence by 1 bit to the left. All cyclic shifts of M-sequences can form a matrix M, and all 0 vectors are added to the first row and the first column of the matrix M to obtain the matrix

Matrix M: Matrix array

Matrix arrayCan be obtained from a Hadamard matrix H by column-row transformation, e.g. matrixAnd Hadamard matrix H satisfies the following relationship:

Where P _L and P _S are permutation matrices (i.e., only one position in each row and column is 1), assuming that the Hadamard matrix H has dimensions of 2 ⁿ*2ⁿ, then both dimensions P _L and P _S are 2 ⁿ*2ⁿ, and n is the order of the primitive polynomial.

Correlation detection is performed based on FHT, the number of additions by multiplying any matrix by the Hadamard matrix is 2 ⁿ*log₂(2ⁿ -1), instead of correlation detection based on FHT, for example, the received sequence is directly correlated with matrix M, the number of required additions is 2 ⁿ*(2ⁿ -1, so that correlation detection based on FHT can reduce the complexity of inspection. For example, the received sequence r= [0,1,0,1,1,1,0], converting R into binary phase signals to [1, -1, -1, -1,1], converting the elements in the matrix M into binary phase signals as well, and supplementing the first row with all 0 elements The transmitted m-sequence is determined to be the 3 rd sequence [0,1,0,1,1,1,0] based on the maximum correlation value, and the number of required additions is 2 ⁿ*(2ⁿ -1).

4) Cross-correlation between PSS and SSS

Since the downlink timing is not obtained when detecting the PSS, all time domain cyclic shifts need to be considered when calculating the cross-correlation value between the PSS and SSS. The calculation formula of the cross-correlation value between PSS and SSS is as follows:

The cross-correlation value c _max(s₁,s₂) between the time domain sequences s ₁ and s ₂,s₁ and s ₂ for length L satisfies:

Wherein, the value range of tau is [ -L, L ].

After normalization, c _max(s₁,s₂) satisfies:

5) Cross-correlation between SSS and SSS

The cross-correlation value c _max(S₁,S₂) between the frequency domain sequences S ₁ and S ₂) satisfies:

After normalization, c _max(S₁,S₂) satisfies:

Currently, gold sequences are often used to generate SSSs, i.e., gold sequences are one sequence used to generate SSSs. Future frequency points may rise, path loss becomes large, and a large number of small base stations may be deployed. If the cell ID is limited, it is unavoidable that neighboring cells share the same PCI, so that the cells cannot be distinguished according to the PCI. Therefore, the cell is extended, that is, the cell ID is increased, and as the cell ID increases, the complexity of detecting SSS generated based on gold sequences increases accordingly. If the number of sequences is increased, the synchronization detection performance is also decreased as the number of sequences is increased.

In order to solve the technical problems, the scheme of the embodiment of the application is provided. The embodiment of the application provides a sequence for generating SSS. The sequences provided by embodiments of the present application may be considered a new sequence compared to gold sequences. Embodiments of the present application are not limited by the specific names of such sequences. For example, in embodiments of the present application, this new sequence is referred to as the Z ₄ sequence. The Z ₄ sequence refers to a sequence A with the length of 2 ^r -1, the period of a binary sequence obtained by projecting the sequence A into a binary domain is 2 ^r -1, and the binary sequence is an m sequence generated by a primitive polynomial obtained by projecting a primitive polynomial of the sequence A into the binary domain. In a possible implementation, the Z ₄ sequence may be a quaternary sequence, i.e. the Z ₄ sequence includes elements with a value of 4. It should be noted that, in the embodiment of the present application, the number of the values of the elements included in the Z ₄ sequence is not limited. For example, the Z ₄ sequence may be a six-membered sequence or an eight-membered sequence. It should be understood that a Q-ary sequence refers to the values of the elements comprised by the sequence as Q.

The maximum cross-correlation value of the Z ₄ sequence is the maximum value of the cross-correlation of the binary sequenceThe cross-correlation performance is better, so that the larger capacity requirement of the SSS can be met. In addition, the Z ₄ sequence is used as a sequence for generating SSS, and can also reduce the detection complexity of the SSS. For the convenience of understanding, first, the principle that the Z ₄ sequence provided by the embodiment of the present application can reduce the detection complexity compared with the m sequence is described. In the following description, the first sequence is taken as an example, and the first sequence may be the aforementioned Z ₄ sequence.

Assuming that the length of the first sequence is 2 ^r -1, the period of the binary sequence obtained by projecting the first sequence into the binary domain is 2 ^r -1, and the binary sequence is an m-sequence generated from the primitive polynomial obtained by projecting the primitive polynomial of the first sequence into the binary domain. The difference from the m-sequence is that the initial value of the first sequence of length 2 ^r -1 is 4 ^r cases, and the sequences generated at the different initial values are mostly cyclic shifts of each other. For example, r=6, a first sequence of length 2 ^r -1=63, and traversing all initial values yields 4095 sequences, where a plurality of the 4095 sequences are cyclically shifted from each other, for example 4030 sequences are cyclically shifted from each other. If the remaining 65 sequences are used to generate SSS after the sequences that are cyclic shifted from each other are removed, fewer sequences are used to generate SSS, which can reduce the complexity of SSS detection. The "sequences with cyclic shift removed" refers to two sequences, and one of the two sequences is cyclic shift of the other sequence, and then one of the two sequences is reserved. Because the sequences which are cyclically shifted with each other do not exist in the sequences generated by the initial values in the initial value set, the sequences generated by the initial values in the initial value set bear the cell identifications, and different sequences correspond to different cell identifications, the cell identifications can be ensured not to be confused, that is, the situation that the cell identifications are confused when the synchronous signals are detected can be ensured not to occur.

It should be noted that, the cyclic shift of the first sequence and the m sequence corresponds to each other one by one, so that the situation that the initial values of the first sequence are all even needs to be removed, so as to avoid that the first sequence is projected to the binary field to obtain the all 0 sequence.

The following describes the technical scheme provided by the embodiment of the application with reference to the accompanying drawings.

In the following description, taking an example that the communication method provided by the embodiment of the present application is applied to the network architecture shown in fig. 1 as an example, the communication method provided by the embodiment of the present application may be executed by the first communication device and the second communication device. The steps performed by the first communication device may be implemented by the first communication device itself, by a component in the first communication device (such as a baseband chip, or other processing unit or module such as a processor), or by a larger device including the first communication device. The steps performed by the second communication device may be performed by the second communication device itself, by a component in the second communication device (e.g., a baseband chip, or other processing unit or module such as a processor), or by a larger device comprising the second communication device. The specific forms of the first communication apparatus and the second communication apparatus are not limited, and for example, the first communication apparatus may be a chip, the second communication apparatus may be a device, or the first communication apparatus and the second communication apparatus may both be chips or devices. In a possible scenario, the first communication device may be the terminal device 120a shown in fig. 1, or may also be a chip (system) in the terminal device 120a in fig. 1, and the second communication device may be the network device 110a in fig. 1, or may also be a chip (system) in the network device 110a in fig. 1, or may be a module or unit (such as CU, DU, RU, etc.) that performs part of the functions of the network device 110 a. For the purpose of the description, the first communication device is taken as a terminal device, the second communication device is taken as a network device, that is, the method provided by the embodiment of the application is taken as an example by the terminal device and the network device. The "·" of the formulas hereinafter all refer to multiplication.

Referring to fig. 3, fig. 3 is a flow chart of a communication method according to an embodiment of the present application. Fig. 3 illustrates the method in terms of terminal device and network device interactions. As shown in fig. 3, the flow of the communication method provided by the embodiment of the application includes the following steps.

S301, the network equipment sends a synchronizing signal to the terminal equipment, and correspondingly, the terminal equipment receives the synchronizing signal from the network equipment.

The synchronization signal may be obtained based on the first sequence, or alternatively, the synchronization signal may be generated based on the first sequence. The elements of the first sequence meet a recurrence relation, and the recurrence relation corresponds to the primitive polynomial one by one. For example, the recurrence relation of the first sequence satisfies: The primitive polynomial f (x) of the first sequence satisfies: a _i ε {0,1,2, M-1}, M is a positive integer greater than 3, and r is a positive integer. When m=4, then the first sequence comprises 4 values (i.e. 0,1,2, 3), correspondingly the first sequence is also called a quaternary series, when m=6, then the first sequence comprises 6 values (i.e. 0,1,2,3,4, 5), correspondingly the first sequence is also called a hexagram series, and so on.

For example, the primitive polynomial f (x) of the first sequence satisfies f (x) =x ⁷ +x+1, and the recurrence relation of the first sequence satisfies s (t) +s (t-6) +s (t-7) =0. It will be appreciated that if the first sequence is a quaternary sequence, i.e. the values of the elements in the first sequence are 0,1, 2 and 3), the addition requires modulo 4, i.e. -1=3, -2=2, -3=1, so s (t) +s (t-6) +s (t-7) =0 can also be converted into s (t) =s (t-6) +s (t-7).

Taking 127 as an example, the first sequence has a primitive polynomial of x ⁷+2x⁴ +x+3 or the first sequence has a primitive polynomial of x ⁷+3x⁴+2x² +3, and the recurrence relation of the first sequence can satisfy x (i+7) =mod (2·x (i+4) +3·x (i+1) +x (i), 4) or the recurrence relation of the first sequence can satisfy x (i+7) =mod (x (i+4) +2·x (i+2) +x (i), 4). Taking 255 as an example of the length of the first sequence, the primitive polynomial of the first sequence is x ⁸+x⁵+3x³+x² +2x+1, and the recurrence relation of the first sequence is x (i+8) =mod (3·x (i+5) +x (i+3) +3·x (i+2) +2·x (i+1) +3·x (i), 4).

In generating the synchronization signal, an initial value of the first sequence needs to be determined, and the first sequence can be obtained based on the initial value through processing. For example, the initial value is subjected to a recurrence process according to a recurrence relation, and a first sequence can be obtained. The set of all possible initial values of the first sequence is referred to as an initial value set, and the first sequence may be generated based on any initial value within the initial value set, and the synchronization signal is generated based on the first sequence.

In a possible implementation, the initial set of values is predefined by a protocol, or the initial set of values is agreed upon by the network device and the terminal device, or the initial set of values is configured by the network device to the terminal device. The initial value set may be stored in the network device in advance, or may be stored in the terminal device in advance. Embodiments of the present application are not limited with respect to a specific implementation form of the initial value set. For example, the initial value set may be represented by a table, one for each row in the table, so that the corresponding initial value is determined from the row index.

In a possible implementation, the sequence set of all sequences available for the initial value set is predefined by the protocol, the sequence set comprising the first sequence. Or the sequence set is agreed by the network device and the terminal device, or the sequence set is configured to the terminal device by the network device. The sequence set may be stored in the network device in advance, or may be stored in the terminal device in advance. Embodiments of the present application are not limited with respect to a particular implementation of the sequence set. For example, a set of sequences may be represented by a table, one for each row in the table, so that the corresponding sequence may be determined from the row index.

It is considered that a sequence in which cyclic shifts mutually exist among a plurality of sequences obtained by traversing all initial values in the initial value set inevitably occurs. In the embodiment of the application, any two initial values in the initial value set are different, so that cyclic shift of sequences generated based on the initial values in the initial value set relative to each other can be avoided to a certain extent. Therefore, any two initial values in the initial value set are different, and the sequence generated based on the initial value in the initial value set bears the cell identification, so that the cell identification is ensured not to be confused, namely the cell identification is ensured not to be confused when the synchronous signal is detected.

Considering that binary sequence sets obtained after the module 2 of different initial values may be different, the cyclic shift value sets used by the initial values are different, and for different initial values, the cyclic shift values of the synchronous signals cannot be detected based on the same set of detection mechanisms. Therefore, any two initial value sets in the initial value set are identical after being subjected to the mode 2, so that the binary sequence sets obtained after being subjected to the mode 2 are identical, namely, the cyclic shift value set used by each initial value is identical, and therefore, for different initial values, the cyclic shift values of the synchronous signals can be detected based on the same set of detection mechanisms, and the implementation complexity is low.

The initial value set corresponding to the first sequence is different according to the difference of the lengths of the first sequences and the difference of the recurrence relation/primitive polynomials of the first sequences. Several possible initial value sets are shown below with specific examples.

Example 1, the first sequence has a length of 127, and the recurrence relation of the first sequence satisfies x (i+7) =mod (2·x (i+4) +3·x (i) +1) +x (i), 4) or x (i+7) =mod (x (i+4) +2·x (i+2) +x (i), 4), or the first sequence has a length of 127, and the primitive polynomial of the first sequence is x ⁷+2x⁴ ₊ x+3 or x ⁷+3x⁴ ₊2x² ₊ 3.

In example 1, the initial value of the first sequence may be [ x (6), x (5), x (4), x (3), x (2), x (1), x (0) ], and the initial value set 1 to which the initial value belongs includes one or more sequences ：[1,0,0,0,0,0,0],[3,0,0,0,0,0,0],[1,0,0,0,2,2,2],[3,2,0,0,0,0,0],[1,2,2,2,0,0,0],[1,0,0,0,0,0,2],[3,0,0,0,0,0,2],[3,2,2,2,0,0,0],[1,2,0,0,0,0,0],[3,0,0,0,2,2,2],[1,2,0,2,0,2,0],[3,2,2,0,0,0,0],[1,2,2,2,2,2,2],[1,2,2,0,0,2,2],[3,0,2,2,0,0,0],[1,2,0,2,0,0,0],[1,0,2,0,0,0,0],[1,0,2,0,2,0,2],[1,0,0,0,2,0,2],[3,2,0,0,2,2,2],[1,0,2,2,2,2,0],[1,0,0,0,0,2,0],[3,0,0,0,0,2,0],[3,2,2,2,0,0,2],[3,2,0,0,0,0,2],[3,0,0,0,2,2,0],[1,0,0,0,0,2,2],[3,0,0,0,0,2,2],[1,0,0,0,2,2,0],[1,2,0,0,0,0,2],[1,2,2,2,0,0,2],[3,2,2,2,2,2,2],[1,2,2,0,0,0,0],[3,2,0,2,0,2,0],[3,0,2,2,2,2,0],[1,2,0,0,2,2,2],[3,0,0,0,2,0,2],[3,0,2,0,2,0,2],[3,0,2,0,0,0,0],[3,2,0,2,0,0,0],[1,0,2,2,0,0,0],[3,2,2,0,0,2,2],[1,0,0,2,0,2,2],[1,0,0,2,0,0,0],[1,2,0,2,2,0,2],[1,0,2,2,0,0,2],[3,2,2,0,2,0,2],[3,2,0,0,2,2,0],[3,0,2,0,2,2,2],[3,2,2,2,2,2,0],[3,2,2,0,2,2,2],[3,2,0,0,2,0,2],[3,0,0,2,0,2,2],[1,2,0,2,2,2,2],[1,2,0,0,2,2,0],[3,0,0,2,0,2,0],[1,0,2,2,2,2,2],[1,2,2,2,0,2,0],[1,2,2,2,2,0,2],[1,2,2,0,2,0,0],[3,0,2,2,2,2,2],[3,0,2,0,2,0,0],[3,2,2,0,0,0,2],[1,0,2,0,2,2,2],[3,0,0,2,0,0,0],[1,0,2,0,0,2,0],[3,2,0,0,0,2,2],[1,0,0,0,2,0,0],[3,0,2,0,0,2,2],[3,2,2,0,2,0,0],[3,0,0,0,2,0,0],[3,2,2,2,0,2,2],[3,2,0,0,0,2,0],[1,2,0,0,0,2,0],[1,2,2,2,0,2,2],[1,0,2,0,2,0,0],[3,2,0,2,0,0,2],[3,2,2,0,0,2,0],[1,2,0,2,0,2,2],[1,0,2,0,0,0,2],[1,2,2,2,2,2,0],[3,2,2,2,0,2,0],[1,2,0,0,0,2,2],[1,2,2,0,0,0,2],[3,0,2,2,0,0,2],[3,0,2,0,0,0,2],[3,2,0,2,0,2,2],[1,2,2,0,0,2,0],[1,2,0,2,0,0,2],[1,2,2,0,2,0,2],[3,2,0,2,2,0,2],[1,0,0,2,0,2,0],[1,0,2,0,0,2,2],[3,0,2,0,0,2,0],[3,2,0,2,2,2,2],[3,2,2,2,2,0,2],[1,2,0,0,2,0,2],[1,2,2,0,2,2,2],[3,0,0,2,2,2,2],[3,2,2,2,2,0,0],[1,2,2,2,2,0,0],[3,0,2,2,0,2,0],[1,2,2,0,2,2,0],[3,2,0,0,2,0,0],[3,0,2,2,2,0,2],[1,0,0,2,2,0,0],[1,2,0,2,2,2,0],[3,0,0,2,2,0,2],[3,0,0,2,0,0,2],[1,0,0,2,2,2,2],[3,2,0,2,2,0,0],[1,0,0,2,2,2,0],[3,0,0,2,2,0,0],[1,0,2,2,2,0,0],[1,0,2,2,0,2,2],[3,0,2,2,2,0,0],[3,0,2,2,0,2,2],[3,2,0,2,2,2,0],[3,2,2,0,2,2,0],[1,0,0,2,0,0,2],[1,2,0,0,2,0,0],[1,0,2,2,2,0,2],[3,0,2,0,2,2,0],[1,2,0,2,2,0,0],[1,0,2,0,2,2,0],[1,0,0,2,2,0,2],[3,0,0,2,2,2,0], or [1,0,2,2,0,2,0] as follows.

Or the initial value of the first sequence may be [ x (0), x (1), x (2), x (3), x (4), x (5), x (6) ], the initial value belonging to a set of initial values comprising one or more sequences ：[1,0,0,0,0,0,0],[3,0,0,0,0,0,0],[1,0,0,0,2,2,2],[3,2,0,0,0,0,0],[1,2,2,2,0,0,0],[1,0,0,0,0,0,2],[3,0,0,0,0,0,2],[3,2,2,2,0,0,0],[1,2,0,0,0,0,0],[3,0,0,0,2,2,2],[1,2,0,2,0,2,0],[3,2,2,0,0,0,0],[1,2,2,2,2,2,2],[1,2,2,0,0,2,2],[3,0,2,2,0,0,0],[1,2,0,2,0,0,0],[1,0,2,0,0,0,0],[1,0,2,0,2,0,2],[1,0,0,0,2,0,2],[3,2,0,0,2,2,2],[1,0,2,2,2,2,0],[1,0,0,0,0,2,0],[3,0,0,0,0,2,0],[3,2,2,2,0,0,2],[3,2,0,0,0,0,2],[3,0,0,0,2,2,0],[1,0,0,0,0,2,2],[3,0,0,0,0,2,2],[1,0,0,0,2,2,0],[1,2,0,0,0,0,2],[1,2,2,2,0,0,2],[3,2,2,2,2,2,2],[1,2,2,0,0,0,0],[3,2,0,2,0,2,0],[3,0,2,2,2,2,0],[1,2,0,0,2,2,2],[3,0,0,0,2,0,2],[3,0,2,0,2,0,2],[3,0,2,0,0,0,0],[3,2,0,2,0,0,0],[1,0,2,2,0,0,0],[3,2,2,0,0,2,2],[1,0,0,2,0,2,2],[1,0,0,2,0,0,0],[1,2,0,2,2,0,2],[1,0,2,2,0,0,2],[3,2,2,0,2,0,2],[3,2,0,0,2,2,0],[3,0,2,0,2,2,2],[3,2,2,2,2,2,0],[3,2,2,0,2,2,2],[3,2,0,0,2,0,2],[3,0,0,2,0,2,2],[1,2,0,2,2,2,2],[1,2,0,0,2,2,0],[3,0,0,2,0,2,0],[1,0,2,2,2,2,2],[1,2,2,2,0,2,0],[1,2,2,2,2,0,2],[1,2,2,0,2,0,0],[3,0,2,2,2,2,2],[3,0,2,0,2,0,0],[3,2,2,0,0,0,2],[1,0,2,0,2,2,2],[3,0,0,2,0,0,0],[1,0,2,0,0,2,0],[3,2,0,0,0,2,2],[1,0,0,0,2,0,0],[3,0,2,0,0,2,2],[3,2,2,0,2,0,0],[3,0,0,0,2,0,0],[3,2,2,2,0,2,2],[3,2,0,0,0,2,0],[1,2,0,0,0,2,0],[1,2,2,2,0,2,2],[1,0,2,0,2,0,0],[3,2,0,2,0,0,2],[3,2,2,0,0,2,0],[1,2,0,2,0,2,2],[1,0,2,0,0,0,2],[1,2,2,2,2,2,0],[3,2,2,2,0,2,0],[1,2,0,0,0,2,2],[1,2,2,0,0,0,2],[3,0,2,2,0,0,2],[3,0,2,0,0,0,2],[3,2,0,2,0,2,2],[1,2,2,0,0,2,0],[1,2,0,2,0,0,2],[1,2,2,0,2,0,2],[3,2,0,2,2,0,2],[1,0,0,2,0,2,0],[1,0,2,0,0,2,2],[3,0,2,0,0,2,0],[3,2,0,2,2,2,2],[3,2,2,2,2,0,2],[1,2,0,0,2,0,2],[1,2,2,0,2,2,2],[3,0,0,2,2,2,2],[3,2,2,2,2,0,0],[1,2,2,2,2,0,0],[3,0,2,2,0,2,0],[1,2,2,0,2,2,0],[3,2,0,0,2,0,0],[3,0,2,2,2,0,2],[1,0,0,2,2,0,0],[1,2,0,2,2,2,0],[3,0,0,2,2,0,2],[3,0,0,2,0,0,2],[1,0,0,2,2,2,2],[3,2,0,2,2,0,0],[1,0,0,2,2,2,0],[3,0,0,2,2,0,0],[1,0,2,2,2,0,0],[1,0,2,2,0,2,2],[3,0,2,2,2,0,0],[3,0,2,2,0,2,2],[3,2,0,2,2,2,0],[3,2,2,0,2,2,0],[1,0,0,2,0,0,2],[1,2,0,0,2,0,0],[1,0,2,2,2,0,2],[3,0,2,0,2,2,0],[1,2,0,2,2,0,0],[1,0,2,0,2,2,0],[1,0,0,2,2,0,2],[3,0,0,2,2,2,0], or [1,0,2,2,0,2,0].

Example 2, the first sequence has a length of 255, the recurrence of the first sequence is x (i+8) =mod (3·x (i+5) +x (i+3) +3·x (i+2) +2·x (i+1) +3·x (i), 4), or the first sequence has a length of 255, and the primitive polynomial of the first sequence is x ⁸+x⁵+3x³+x² +2x+1.

In example 2, the initial value of the first sequence may be [ x (7), x (6), x (5), x (4), x (3), x (2), x (1), x (0) ], and the initial value set 2 to which the initial value belongs includes one or more sequences ：[3,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0],[3,2,2,0,2,0,2,2],[3,2,0,0,0,0,0,0],[3,0,0,2,0,2,0,0],[3,0,0,0,0,0,0,2],[1,0,0,0,0,0,0,2],[1,0,0,2,0,2,0,0],[1,2,0,0,0,0,0,0],[1,2,2,0,2,0,2,2],[3,2,0,2,0,2,0,2],[1,0,2,0,0,0,0,0],[3,2,2,2,2,2,2,2],[3,0,2,0,2,2,0,0],[3,2,0,2,0,2,0,0],[1,2,0,0,0,0,0,2],[1,2,2,0,0,0,0,0],[3,0,2,0,2,0,2,0],[1,2,2,2,0,2,2,2],[3,0,2,0,2,0,2,2],[3,0,0,2,2,0,2,0],[3,0,0,0,0,0,2,0],[1,0,0,0,0,0,2,0],[1,0,0,2,0,2,0,2],3,2,0,0,0,0,0,2],[1,2,2,0,2,0,2,0],[3,0,0,0,0,0,2,2],[1,0,0,0,0,0,2,2],[3,2,2,0,2,0,2,0],[3,0,0,2,0,2,0,2],[1,2,2,2,2,2,2,2],[3,0,2,0,0,0,0,0],[1,2,0,2,0,2,0,2],[1,0,0,2,2,0,2,0],[1,0,2,0,2,0,2,2],[3,2,2,2,0,2,2,2],[1,0,2,0,2,0,2,0],[3,2,2,0,0,0,0,0],[1,2,0,2,0,2,0,0],[1,0,2,0,2,2,0,0],[1,0,0,2,2,2,0,0],[1,2,0,2,0,0,0,0],[3,0,2,2,2,0,0,0],[1,2,0,2,0,2,2,2],[3,0,2,0,0,2,0,2],[3,2,2,2,0,0,0,0],[3,2,2,2,0,0,0,2],[3,0,2,2,0,0,2,0],[1,2,0,0,2,2,2,2],[1,2,2,2,0,2,0,0],[1,2,0,2,0,0,2,0],[3,0,2,2,2,2,2,0],[3,2,0,2,2,0,2,0],[3,0,2,0,0,2,2,2],[1,2,2,2,0,2,0,2],[1,2,0,0,2,0,2,2],[1,2,2,0,2,0,0,0],[3,0,0,0,2,2,0,2],[1,0,2,2,0,2,2,2],[3,0,0,0,2,2,2,0],[1,0,0,2,0,0,0,0],[3,0,0,2,2,2,0,0],[1,2,2,0,2,2,2,0],[3,2,0,0,0,2,2,2],[3,0,2,2,0,0,0,0],[1,2,2,0,0,0,2,2],[1,2,2,2,2,0,0,2],[3,0,2,2,2,2,2,2],[3,0,0,0,2,0,2,2],[1,0,2,2,2,0,2,2],[1,0,0,0,2,0,2,2],[1,0,2,0,0,2,2,0],[3,2,0,2,2,0,0,0],[1,0,2,2,0,2,0,0],[3,2,2,0,2,2,0,0],[3,2,2,2,0,0,2,0],[1,0,0,0,0,2,0,0],[3,0,0,0,0,2,0,0],[3,2,0,0,0,0,2,0],[1,0,0,2,0,2,2,2],[1,0,0,0,0,2,0,2],[3,0,0,0,0,2,0,2],[1,2,0,0,0,0,2,0],[3,0,0,2,0,2,2,2],[3,2,2,0,2,0,0,0],[1,0,2,0,0,0,0,2],[1,0,2,0,2,2,0,2],[1,2,2,0,0,0,0,2],[3,2,2,2,2,2,2,0],[3,2,2,2,0,2,2,0],[1,0,0,2,2,0,2,2],[1,0,0,0,0,2,2,0],[3,0,0,0,0,2,2,0],[3,2,0,0,0,0,2,2],[3,0,0,2,0,2,2,0],[3,2,2,0,2,0,0,2],[1,0,0,0,0,2,2,2],[3,0,0,0,0,2,2,2],[1,2,0,0,0,0,2,2],[1,2,2,0,2,0,0,2],[1,0,0,2,0,2,2,0],[3,0,2,0,0,0,0,2],[3,0,0,2,2,0,2,2],[1,2,2,2,0,2,2,0],[3,2,2,0,0,0,0,2],[1,2,2,2,2,2,2,0],[3,0,2,0,2,2,0,2],[1,0,2,2,2,0,0,0],[3,2,0,2,0,0,0,0],[1,0,2,2,0,0,2,0],[1,2,2,2,0,0,0,2],[1,2,2,2,0,0,0,0],[3,2,0,2,0,2,2,2],[1,0,2,0,0,2,0,2],[3,0,2,2,2,0,2,2],[3,0,2,0,0,2,2,0],[1,2,2,2,0,0,2,0],[1,2,2,0,2,2,0,0],[3,0,2,2,0,2,0,0],[1,2,0,2,2,0,0,0],[1,0,0,0,2,2,2,0],[3,0,0,2,0,0,0,0],[3,2,2,2,2,0,0,2],[1,0,2,2,2,2,2,2],[1,2,0,0,0,2,2,2],[3,2,2,0,0,0,2,2],[1,0,2,2,0,0,0,0],[3,2,2,0,2,2,2,0],[3,2,0,0,2,2,2,2],[3,2,0,2,0,0,2,0],[3,2,2,2,0,2,0,0],[1,0,0,0,2,2,0,2],[3,0,2,2,0,2,2,2],[3,2,2,2,0,2,0,2],[3,2,0,0,2,0,2,2],[1,0,2,2,2,2,2,0],[1,0,2,0,0,2,2,2],[1,2,0,2,2,0,2,0],[3,2,0,0,2,2,2,0],[1,0,2,2,0,0,0,2],[3,0,2,2,0,0,2,2],[1,2,0,0,0,2,0,0],[1,0,0,2,2,2,2,0],[1,2,0,2,2,2,0,2],[1,2,2,2,2,2,0,0],[1,0,2,0,2,2,2,0],[3,0,2,0,2,0,0,0],[1,2,0,0,2,0,2,0],[1,2,0,2,0,0,0,2],[3,2,0,2,2,2,0,0],[1,2,0,2,2,0,2,2],[1,2,0,2,2,2,2,2],[3,0,2,0,0,0,2,0],[1,0,0,2,2,0,0,0],[3,0,0,2,2,0,0,2],[1,0,2,0,0,0,2,2],[1,2,2,0,2,2,2,2],[3,2,0,0,2,0,0,0],[3,0,2,2,0,2,2,0],[1,2,0,0,0,2,2,0],[1,0,2,2,2,0,0,2],[1,2,0,0,2,2,0,2],[3,0,2,2,2,2,0,0],[1,2,0,0,0,2,0,2],[1,2,0,2,2,2,0,0],[3,2,0,2,0,0,2,2],[3,0,2,0,0,2,0,0],[1,0,2,2,2,2,0,0],[1,2,2,0,2,2,0,2],[3,0,2,0,2,2,2,0],[3,0,0,2,2,2,2,2],[1,2,2,2,2,0,2,2],[3,2,0,0,0,2,2,0],[1,2,2,0,0,2,2,0],[3,2,2,0,0,2,0,2],[3,2,2,0,0,2,0,0],[1,2,2,2,2,0,2,0],[1,0,0,0,2,2,0,0],[1,0,2,0,0,0,2,0],[3,0,0,2,2,0,0,0],[3,2,0,2,2,0,0,2],[3,0,0,0,2,0,0,0],[3,2,2,0,0,2,2,0],[3,2,2,2,2,2,0,0],[3,2,2,2,2,0,0,0],[1,0,0,0,2,0,0,0],[3,2,0,0,2,0,0,2],[1,0,2,0,2,0,0,0],[1,0,0,2,0,0,0,2],[1,0,2,0,2,2,2,2],[1,0,2,0,0,2,0,0],[1,0,0,2,2,2,2,2],[3,0,0,2,2,2,2,0],[1,2,2,0,0,2,2,2],[1,0,0,0,2,0,2,0],[3,0,2,2,0,0,0,2],[3,2,0,0,2,2,0,0],[1,0,2,2,0,2,0,2],[3,0,0,0,2,0,2,0],[1,2,2,2,0,0,2,2],[3,2,0,2,2,0,2,2],[3,0,0,2,0,0,2,2],[1,0,2,2,2,0,2,0],[3,2,0,0,2,2,0,2],[1,0,0,2,0,0,2,0],[1,2,0,0,2,2,0,0],[1,0,0,0,2,2,2,2],[1,2,0,0,2,0,0,2],[3,2,2,0,0,2,2,2],[3,0,0,0,2,0,0,2],[1,0,0,0,2,0,0,2],[1,0,0,2,0,0,2,2],[3,2,0,0,0,2,0,0],[1,2,2,0,0,0,2,0],[3,0,2,0,2,2,2,2],[1,2,2,2,2,2,0,2],[3,2,2,0,2,2,0,2],[3,2,0,0,0,2,0,2],[3,0,0,2,0,0,2,0],[3,2,2,0,0,0,2,0],[1,0,0,2,2,0,0,2],[3,2,2,2,2,2,0,2],[1,0,0,2,2,2,0,2],[3,0,2,2,2,0,0,2],[3,0,0,2,2,2,0,2],[1,2,2,2,2,0,0,0],[3,0,2,2,0,2,0,2],[3,0,2,2,2,0,2,0],[3,0,0,0,2,2,2,2],[1,2,0,2,0,2,2,0],[3,2,0,0,2,0,2,0],[1,2,0,2,2,0,0,2],[3,0,0,0,2,2,0,0],[3,2,2,0,2,2,2,2],[3,0,2,0,2,0,0,2],[1,0,2,0,2,0,0,2],[3,2,0,2,0,2,2,0],[3,0,0,2,0,0,0,2],[3,0,2,0,0,0,2,2],[3,2,0,2,0,0,0,2],[1,2,0,2,0,0,2,2],[1,2,0,0,2,2,2,0],[3,2,2,2,0,0,2,2],[1,0,2,2,0,0,2,2],[1,0,2,2,0,2,2,0],[3,2,0,2,2,2,0,2],[1,2,0,0,2,0,0,0],[3,2,0,2,2,2,2,2],[1,2,2,0,0,2,0,2],[1,2,2,0,0,2,0,0],[3,2,2,2,2,0,2,2],[3,2,2,2,2,0,2,0],[3,2,0,2,2,2,2,0],[3,0,2,2,2,2,0,2],[1,2,0,2,2,2,2,0],[1,0,2,2,2,2,0,2],[3,2,0,2,0,2,0,0], or [1,2,2,0,2,0,0,2] as follows.

Or the initial value of the first sequence may be [ x (0), x (1), x (2), x (3), x (4), x (5), x (6), x (7) ], which belongs to a set of initial values comprising one or more of the sequences ：[3,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0],[3,2,2,0,2,0,2,2],[3,2,0,0,0,0,0,0],[3,0,0,2,0,2,0,0],[3,0,0,0,0,0,0,2],[1,0,0,0,0,0,0,2],[1,0,0,2,0,2,0,0],[1,2,0,0,0,0,0,0],[1,2,2,0,2,0,2,2],[3,2,0,2,0,2,0,2],[1,0,2,0,0,0,0,0],[3,2,2,2,2,2,2,2],[3,0,2,0,2,2,0,0],[3,2,0,2,0,2,0,0],[1,2,0,0,0,0,0,2],[1,2,2,0,0,0,0,0],[3,0,2,0,2,0,2,0],[1,2,2,2,0,2,2,2],[3,0,2,0,2,0,2,2],[3,0,0,2,2,0,2,0],[3,0,0,0,0,0,2,0],[1,0,0,0,0,0,2,0],[1,0,0,2,0,2,0,2],[3,2,0,0,0,0,0,2],[1,2,2,0,2,0,2,0],[3,0,0,0,0,0,2,2],[1,0,0,0,0,0,2,2],[3,2,2,0,2,0,2,0],[3,0,0,2,0,2,0,2],[1,2,2,2,2,2,2,2],[3,0,2,0,0,0,0,0],[1,2,0,2,0,2,0,2],[1,0,0,2,2,0,2,0],[1,0,2,0,2,0,2,2],[3,2,2,2,0,2,2,2],[1,0,2,0,2,0,2,0],[3,2,2,0,0,0,0,0],[1,2,0,2,0,2,0,0],[1,0,2,0,2,2,0,0],[1,0,0,2,2,2,0,0],[1,2,0,2,0,0,0,0],[3,0,2,2,2,0,0,0],[1,2,0,2,0,2,2,2],[3,0,2,0,0,2,0,2],[3,2,2,2,0,0,0,0],[3,2,2,2,0,0,0,2],[3,0,2,2,0,0,2,0],[1,2,0,0,2,2,2,2],[1,2,2,2,0,2,0,0],[1,2,0,2,0,0,2,0],[3,0,2,2,2,2,2,0],[3,2,0,2,2,0,2,0],[3,0,2,0,0,2,2,2],[1,2,2,2,0,2,0,2],[1,2,0,0,2,0,2,2],[1,2,2,0,2,0,0,0],[3,0,0,0,2,2,0,2],[1,0,2,2,0,2,2,2],[3,0,0,0,2,2,2,0],[1,0,0,2,0,0,0,0],[3,0,0,2,2,2,0,0],[1,2,2,0,2,2,2,0],[3,2,0,0,0,2,2,2],[3,0,2,2,0,0,0,0],[1,2,2,0,0,0,2,2],[1,2,2,2,2,0,0,2],[3,0,2,2,2,2,2,2],[3,0,0,0,2,0,2,2],[1,0,2,2,2,0,2,2],[1,0,0,0,2,0,2,2],[1,0,2,0,0,2,2,0],[3,2,0,2,2,0,0,0],[1,0,2,2,0,2,0,0],[3,2,2,0,2,2,0,0],[3,2,2,2,0,0,2,0],[1,0,0,0,0,2,0,0],[3,0,0,0,0,2,0,0],[3,2,0,0,0,0,2,0],[1,0,0,2,0,2,2,2],[1,0,0,0,0,2,0,2],[3,0,0,0,0,2,0,2],[1,2,0,0,0,0,2,0],[3,0,0,2,0,2,2,2],[3,2,2,0,2,0,0,0],[1,0,2,0,0,0,0,2],[1,0,2,0,2,2,0,2],[1,2,2,0,0,0,0,2],[3,2,2,2,2,2,2,0],[3,2,2,2,0,2,2,0],[1,0,0,2,2,0,2,2],[1,0,0,0,0,2,2,0],[3,0,0,0,0,2,2,0],[3,2,0,0,0,0,2,2],[3,0,0,2,0,2,2,0],[3,2,2,0,2,0,0,2],[1,0,0,0,0,2,2,2],[3,0,0,0,0,2,2,2],[1,2,0,0,0,0,2,2],[1,2,2,0,2,0,0,2],[1,0,0,2,0,2,2,0],[3,0,2,0,2,2,0,2],[1,0,2,2,2,0,0,0],[3,2,0,2,0,0,0,0],[1,0,2,2,0,0,2,0],[1,2,2,2,0,0,0,2],[1,2,2,2,0,0,0,0],[3,2,0,2,0,2,2,2],[1,0,2,0,0,2,0,2],[3,0,2,2,2,0,2,2],[3,0,2,0,0,2,2,0],[1,2,2,2,0,0,2,0],[1,2,2,0,2,2,0,0],[3,0,2,2,0,2,0,0],[1,2,0,2,2,0,0,0],[1,0,0,0,2,2,2,0],[3,0,0,2,0,0,0,0],[3,2,2,2,2,0,0,2],[1,0,2,2,2,2,2,2],[1,2,0,0,0,2,2,2],[3,2,2,0,0,0,2,2],[1,0,2,2,0,0,0,0],[3,2,2,0,2,2,2,0],[3,2,0,0,2,2,2,2],[3,2,0,2,0,0,2,0],[3,2,2,2,0,2,0,0],[1,0,0,0,2,2,0,2],[3,0,2,2,0,2,2,2],[3,2,2,2,0,2,0,2],[3,2,0,0,2,0,2,2],[1,0,2,2,2,2,2,0],[1,0,2,0,0,2,2,2],[1,2,0,2,2,0,2,0],[3,2,0,0,2,2,2,0],[1,0,2,2,0,0,0,2],[3,0,2,2,0,0,2,2],[1,2,0,0,0,2,0,0],[1,0,0,2,2,2,2,0],[1,2,0,2,2,2,0,2],[1,2,2,2,2,2,0,0],[1,0,2,0,2,2,2,0],[3,0,2,0,2,0,0,0],[1,2,0,0,2,0,2,0],[1,2,0,2,0,0,0,2],[3,2,0,2,2,2,0,0],[1,2,0,2,2,0,2,2],[1,2,0,2,2,2,2,2],[3,0,2,0,0,0,2,0],[1,0,0,2,2,0,0,0],[3,0,0,2,2,0,0,2],[1,0,2,0,0,0,2,2],[1,2,2,0,2,2,2,2],[3,2,0,0,2,0,0,0],[3,0,2,2,0,2,2,0],[1,2,0,0,0,2,2,0],[1,0,2,2,2,0,0,2],[1,2,0,0,2,2,0,2],[3,0,2,2,2,2,0,0],[1,2,0,0,0,2,0,2],[1,2,0,2,2,2,0,0],[3,2,0,2,0,0,2,2],[3,0,2,0,0,2,0,0],[1,0,2,2,2,2,0,0],[1,2,2,0,2,2,0,2],[3,0,2,0,2,2,2,0],[3,0,0,2,2,2,2,2],[1,2,2,2,2,0,2,2],[3,2,0,0,0,2,2,0],[1,2,2,0,0,2,2,0],[3,2,2,0,0,2,0,2],[3,2,2,0,0,2,0,0],[1,2,2,2,2,0,2,0],[1,0,0,0,2,2,0,0],[1,0,2,0,0,0,2,0],[3,0,0,2,2,0,0,0],[3,2,0,2,2,0,0,2],[3,0,0,0,2,0,0,0],[3,2,2,0,0,2,2,0],[3,2,2,2,2,2,0,0],[3,2,2,2,2,0,0,0],[1,0,0,0,2,0,0,0],[3,2,0,0,2,0,0,2],[1,0,2,0,2,0,0,0],[1,0,0,2,0,0,0,2],[1,0,2,0,2,2,2,2],[1,0,2,0,0,2,0,0],[1,0,0,2,2,2,2,2],[3,0,0,2,2,2,2,0],[1,2,2,0,0,2,2,2],[1,0,0,0,2,0,2,0],[3,0,2,2,0,0,0,2],[3,2,0,0,2,2,0,0],[1,0,2,2,0,2,0,2],[3,0,0,0,2,0,2,0],[1,2,2,2,0,0,2,2],[3,2,0,2,2,0,2,2],[3,0,0,2,0,0,2,2],[1,0,2,2,2,0,2,0],[3,2,0,0,2,2,0,2],[1,0,0,2,0,0,2,0],[1,2,0,0,2,2,0,0],[1,0,0,0,2,2,2,2],[1,2,0,0,2,0,0,2],[3,2,2,0,0,2,2,2],[3,0,0,0,2,0,0,2],[1,0,0,0,2,0,0,2],[1,0,0,2,0,0,2,2],[3,2,0,0,0,2,0,0],[1,2,2,0,0,0,2,0],[3,0,2,0,2,2,2,2],[1,2,2,2,2,2,0,2],[3,2,2,0,2,2,0,2],[3,2,0,0,0,2,0,2],[3,0,0,2,0,0,2,0],[3,2,2,0,0,0,2,0],[1,0,0,2,2,0,0,2],[3,2,2,2,2,2,0,2],[1,0,0,2,2,2,0,2],[3,0,2,2,2,0,0,2],[3,0,0,2,2,2,0,2],[1,2,2,2,2,0,0,0],[3,0,2,2,0,2,0,2],[3,0,2,2,2,0,2,0],[3,0,0,0,2,2,2,2],[1,2,0,2,0,2,2,0],[3,2,0,0,2,0,2,0],[1,2,0,2,2,0,0,2],[3,0,0,0,2,2,0,0],[3,2,2,0,2,2,2,2],[3,0,2,0,2,0,0,2],[1,0,2,0,2,0,0,2],[3,2,0,2,0,2,2,0],[3,0,0,2,0,0,0,2],[3,0,2,0,0,0,2,2],[3,2,0,2,0,0,0,2],[1,2,0,2,0,0,2,2],[1,2,0,0,2,2,2,0],[3,2,2,2,0,0,2,2],[1,0,2,2,0,0,2,2],[1,0,2,2,0,2,2,0],[3,2,0,2,2,2,0,2],[1,2,0,0,2,0,0,0],[3,2,0,2,2,2,2,2],[1,2,2,0,0,2,0,2],[1,2,2,0,0,2,0,0],[3,2,2,2,2,0,2,2],[3,2,2,2,2,0,2,0],[3,2,0,2,2,2,2,0],[3,0,2,2,2,2,0,2],[1,2,0,2,2,2,2,0], or [1,0,2,2,2,2,0,2].

Since the cross-correlation values of the sequences corresponding to any two initial values in the initial value sets in example 1/example 2 are close, one initial value can be arbitrarily selected from the initial value sets as the initial value of the first sequence. For example, the length of the first sequence is 127, and one initial value may be arbitrarily selected from the initial value set 1 as the initial value of the first sequence. When the length of the first sequence is 255, one initial value may be arbitrarily selected from the initial value set 2 as the initial value of the first sequence.

It should be noted that, in examples 1 and 2, the initial value set is merely an example, and the embodiment of the present application does not limit the primitive polynomial of the first sequence, and does not limit the recurrence relation of the first sequence. For example, the primitive polynomial with the smallest tap number may be selected, thereby reducing implementation complexity.

The first sequence may be obtained from the initial value through a cyclic shift. For example, the sequence [ a, b, c, d ] is cyclically shifted by the cyclic shift value c, and if c=1, the sequence [ a, b, c, d ] becomes [ d, b, c, a ] after cyclic shift. In the embodiment of the application, different cyclic shift values c can bear different cell IDs, so that the cell IDs are distinguished through cyclic shift. There are a number of cyclic shift values c, all possible c constituting a cyclic shift value set. In generating the synchronization signal, the cyclic shift value of the first sequence may be determined according to the cell that needs to be identified. For example, c may be determined from a first cell identity, which may be one identity of a first set of cell identities. For example, for SSS, the first cell is identified asThe first set of cell identities may be possibleThe set of constituent, e.g., first set of cell identities is {0,1,2,., 335}.

In a specific implementation, the cyclic shift values may be obtained from equal intervals in the set of cyclic shift values, that is, the cyclic shift values are equally spaced. In this way, the minimum value of the interval between any two cyclic shift values is maximum, and lower cross-correlation between sequences can be ensured. Additionally, it is contemplated that frequency offset may result in confusion of different cyclic shift values. In the embodiment of the application, the cyclic shift is equally spaced, and a better frequency offset resistance effect can be achieved by maximizing the spacing between adjacent cyclic shift values.

For example, the first sequence has a length L, c is p _× ID, the ID has a value in the range of [0, K-1], and K is a positive integer. p satisfies that p=floor (L/K), floor is rounded down, or p=ceil (L/K), ceil is rounded up, or p=round (L/K), round is rounded up to the nearest integer.

Alternatively, K is 63, i.e., the length of the first sequence is 127, or K is 127, i.e., the length of the first sequence is 255.

Wherein the number of elements in the first set of cell identities is equal to the product of the number of elements in the initial set of values and the number of elements in the set of cyclic shift values. In this way, the number of initial values in the initial value set and the number of cyclic shift value sets can be determined according to the elements (i.e. the number of cell IDs) in the first cell identity set, and all the identities in the first cell identity set can be distinguished through different initial values and/or cyclic shift values, i.e. the situation that the cell identities are confused does not occur.

For example, when the SSS has a length of 127, the first set of cell identities includes 378 cell identities, the initial set of values may include 6 initial values, and the set of cyclic shift values corresponding to each initial value includes 63 cyclic shift values. When the SSS has a length of 127, the first set of cell identities includes 672 cell identities, the initial set of values may include 32 initial values, and the set of cyclic shift values corresponding to each initial value includes 21 cyclic shift values. When the SSS has a length of 127, the first set of cell identities includes 1386 cell identities, the initial set may include 22 initial values, and the set of cyclic shift values corresponding to each initial value includes 63 cyclic shift values. In a possible implementation manner, a correspondence relationship between the first cell identifier set, the initial value set, and the cyclic shift value set corresponding to each initial value may be defined in advance.

The synchronization signal may be generated from the cell ID, e.g., the PSS and SSS may be generated from the cell ID, which together carry the cell ID. The number of cell IDs carried by PSS is different depending on the number of cell IDs, and the number of cell IDs carried by SSS is also different. The following is a specific example.

Example a, the number of cell IDs 1134, the sss length 127, the first set of cell identities comprising 378 cell identities, the initial set of values comprising 6 initial values, the set of cyclic shift values corresponding to each initial value comprising 63 cyclic shift values. Wherein any two of the 6 initial values in the initial value set are different. In this case, PSS may carry 3 cell IDs and SSS 378 cell IDs.

Any two initial values of the 6 initial values in the initial set are different, so that a plurality of sequences obtained by traversing all the initial values do not have sequences which are mutually circularly shifted. In addition, a certain interval is arranged between the cyclic shifts corresponding to the sequences, so that a good frequency offset resisting effect can be achieved.

Example B, the number of cell IDs 2016, the length of sss 127, the first set of cell identities comprising 672 cell identities, the initial set of values comprising 32 initial values, the set of cyclic shift values corresponding to each initial value comprising 21 cyclic shift values. In this case, PSS may carry 3 cell IDs and SSS 672 cell IDs. Wherein any two of the 32 initial values in the initial value set are different.

Example B has more cell IDs than example a, in which case the initial value may be increased to distinguish more cells. For example, the initial value is increased to 32, so that more sequences are available, which can carry more cell IDs.

Example C, the number of cell IDs 1386, the sss length 127, the first set of cell identities comprising 672 cell identities, the initial set of values comprising 22 initial values, the set of cyclic shift values corresponding to each initial value comprising 63 cyclic shift values. In this case, PSS may carry 1 cell ID and SSS 1386 cell IDs. Wherein any two of the 22 initial values in the initial value set are different.

Example C has more cell IDs than example a, in which case the initial value may be increased to distinguish more cells. For example, the initial value is increased to 22, so that more sequences are available, which can carry more cell IDs. Example D, the number of cell IDs is 2016, the length of sss is 127, the first set of cell identities includes 2016 cell identities, the initial set of values may include 32 initial values, and the set of cyclic shift values corresponding to each initial value includes 63 cyclic shift values. Any two of the 32 initial values in the initial value set are different. In this case, PSS may carry 1 cell ID and SSS 2016 cell ID.

Example D has more cell IDs than example C, in which case the initial value may be increased to distinguish more cells. For example, the initial value is increased to 32, and the cyclic shift value included in each initial value set is increased, for example, the cyclic shift value included in the cyclic shift value set corresponding to each initial value is increased to 63 cyclic shift values.

Before transmitting the synchronization signal, a second sequence may be generated according to the first sequence carrying the cell ID, and the synchronization signal may be generated according to the second sequence. For example, a first sequence may be obtained, the first sequence may be cyclically shifted and modulated to generate a second sequence, and then a synchronization signal may be generated according to the second sequence. Wherein a set of sequences in which the first sequence is located may be stored or predefined, and accordingly the first sequence may be obtained from the predefined or stored set of sequences. Or a set of initial values for generating the first sequence may be stored or predefined, and accordingly, an initial value may be obtained from the predefined or stored set of initial values from which the first sequence is generated.

Or before transmitting the synchronization signal, the second sequence may be generated according to the cell ID, and then the synchronization sequence may be generated according to the second sequence. In this case, a set of sequences in which the second sequence is located may be stored or predefined, so that the second sequence may be obtained from the set of sequences. Wherein the second sequence is a sequence generated from the first sequence.

Or the network device may also directly generate the synchronization signal based on the cell ID and the synchronization sequence. Wherein a set of synchronization sequences may be stored or predefined such that a synchronization sequence may be obtained from the set of synchronization sequences. The synchronization sequence is a sequence generated from the second sequence.

Wherein modulating the first sequence actually maps the elements in the first sequence to other values. With the synchronization signal being SSS, the network device may modulate the first sequence with quadrature phase shift keying (quadraturephase shiftkeying, QPSK) to obtain a second sequence.

For example, element d (n) of the second sequence and element x (m) of the first sequence satisfy: Where m= (n+c) mod L, a is a constant, c is an integer/cyclic shift value, 0≤n < L, 0≤m < L, x (m) =0, 1,2 or 3, L is the length of the first sequence/the second sequence. Or the element d (n) of the second sequence and the element x (m) of the first sequence satisfy table 1. I.e. element 0 in the first sequence may be mapped to a, element 1 in the first sequence may be mapped to a x j, element 2 in the first sequence may be mapped to-a, and element 3 in the first sequence may be mapped to-a x j.

TABLE 1

Element(s)	Mapped values
		0	A
1	Aj
		2	-A
3	-Aj

For another example, element d (n) of the second sequence and element x (m) of the first sequence satisfy table 2, i.e., element 0 of the first sequence may be mapped to 1+1j, element 1 of the first sequence may be mapped to-1+1j, element 3 of the first sequence may be mapped to 1-1j, and element 3 of the first sequence may be mapped to-1-1 j.

TABLE 2

Element(s)	Mapped values
		0	1+1j
1	-1+1j
		2	1-1j
3	-1-1j

When transmitting the synchronization signal, the second sequence may be mapped to L subcarriers, and the synchronization signal, for example, SSS may be generated according to the second sequence mapped to the L subcarriers. The synchronization signal may be transmitted using an OFDM waveform. It will be appreciated that the second sequence may carry a cell identity, and that since the second sequence is obtained from the first sequence, c of the first sequence is determined from the first cell identity, the second sequence is associated with the first cell identity.

S302, the terminal equipment detects the synchronous signal.

The network device sends a synchronization signal, and the terminal device receives the synchronization signal accordingly. The process of receiving the synchronization signal by the terminal device, that is, the process of detecting the synchronization signal by the terminal device. The detection of the synchronization signal by the terminal device will actually perform sliding correlation calculation on the received sequence and the specific sequence, and if the obtained correlation peak value is higher, the received sequence can be determined to be the specific sequence. The specific sequence may be stored in the terminal device in advance or may be generated by the terminal device. The terminal device may store a plurality of specific sequences, and when detecting the synchronization signal, perform autocorrelation calculation on the received sequence and each specific sequence, and determine the specific sequence with the largest autocorrelation value as the received sequence.

In the embodiment of the present application, the specific sequence has various implementation manners, and the detection manners of the synchronization signals are different according to the implementation manners of the specific sequence, including but not limited to the following four manners.

In mode 1, the specific sequence is a first sequence, and the received signal is processed based on the first sequence to detect the synchronization signal.

The first sequence may be obtained by cyclic shifting an initial value and may be stored locally. At least one first sequence may be stored, and upon detection of the synchronization signal, the first sequence may be acquired from the stored at least one first sequence. Or the initial value set can be stored locally, and when the synchronous signal is detected, one initial value from the initial value set is selected to generate the first sequence through cyclic shift.

The terminal device processing the received signal according to the first sequence includes the terminal device performing a correlation process (correlation processing) on the received signal according to the first sequence to detect a synchronization signal. For example, for each acquired first sequence, the terminal device may generate a second sequence, obtain a plurality of second sequences, traverse the plurality of second sequences, and perform correlation processing with the received signal, to obtain a plurality of correlation values. The correlation processing comprises correlation calculation, and the second sequence with the largest correlation value is the synchronization sequence corresponding to the received signal.

In mode 2, the specific sequence is a first sequence, and the terminal device processes the received signal based on the second sequence to detect the synchronization signal. Wherein the second sequence is generated based on the first sequence.

For example, the first sequence may be obtained by cyclic shifting an initial value, and may be stored locally. At least one first sequence may be stored, and upon detection of the synchronization signal, the first sequence may be acquired from the stored at least one first sequence. Or the initial value set can be stored locally, and when the synchronous signal is detected, one initial value from the initial value set is selected to generate the first sequence through cyclic shift.

The terminal device processing the received signal according to the second sequence includes the terminal device generating the second sequence according to the first sequence, and performing correlation processing on the received signal based on the second sequence. For example, for each acquired first sequence, the terminal device may generate a second sequence, obtain a plurality of second sequences, traverse the plurality of second sequences, and perform correlation processing with the received signal, to obtain a plurality of correlation values. The second sequence with the largest correlation value is the synchronization sequence corresponding to the received signal.

In mode 3, the specific sequence is a second sequence, and the terminal device processes the received signal based on the second sequence to detect the synchronization signal.

The second sequence is generated based on the first sequence and may be stored locally. At least one second sequence may be stored, and the second sequence may be acquired from the stored at least one second sequence when the synchronization signal is detected. Or at least one first sequence may be stored, and when the synchronization signal is detected, the first sequence may be selected from the stored at least one first sequence, and the second sequence may be generated according to the selected first sequence. Or an initial value set may be stored, and when the synchronization signal is detected, one initial value from the initial value set may be selected to generate a first sequence through cyclic shift, and then a second sequence may be generated according to the first sequence.

And traversing the acquired second sequence by the terminal equipment to perform correlation processing on the acquired second sequence and the received signal, and determining the second sequence with the largest correlation value as a synchronous sequence corresponding to the received signal.

In mode 4, the specific sequence is a synchronization sequence, and the terminal device processes the received signal based on the set of synchronization sequences to detect a synchronization signal.

The set of synchronization sequences includes a second sequence that is a sequence derived based on the first sequence. At least one set of synchronization sequences may be stored, and upon detection of a synchronization signal, a sequence may be selected from the stored set of synchronization sequences to process the received signal to detect the synchronization signal. Or at least one first sequence may be stored, and when the synchronization signal is detected, the first sequence may be selected from the stored at least one first sequence, and the second sequence may be generated according to the selected first sequence. In this manner, traversing the stored first sequences may generate at least one second sequence, obtaining a set of synchronization sequences. Or an initial value set may be stored, and when the synchronization signal is detected, one initial value from the initial value set may be selected to generate a first sequence through cyclic shift, and then a second sequence may be generated according to the first sequence. In this manner, traversing the stored initial values may generate at least one second sequence, obtaining a set of synchronization sequences.

When the terminal equipment detects the synchronous signal, all sequences in the synchronous sequence set can be sequentially subjected to inner product with the received signal to obtain a related value set, and the synchronous signal is determined according to the maximum related value in the related value set. For example, the terminal device may determine the synchronization sequence corresponding to the maximum correlation value in the correlation value set as the synchronization sequence sent by the network device.

The terminal device may also determine the first cell identity according to a maximum correlation value in the set of correlation values. For example, when the terminal device processes the received synchronization signal according to the second sequence, the synchronization signal may be projected to a binary domain, a cyclic shift value (for example, referred to as a first cyclic shift value, i.e. the foregoing c) of a first sequence carried by the signal is determined according to the projected synchronization signal, a first sequence set is generated according to the first cyclic shift value and an initial value set, a first initial value is determined according to the second sequence set and the synchronization signal, and a first cell identifier is determined according to the first initial value and the first cyclic shift value. The second sequence set includes the first sequence set, and the sequences in the second sequence set may be sequences after modulation or sequences without modulation.

For example, the projection of the received synchronization signal by the terminal device into the binary domain is actually the acquisition of the absolute value of the real part (simply called real part absolute value) or the absolute value of the imaginary part (simply called imaginary part absolute value) of the received synchronization signal. For example, if the first sequence of generated synchronization signals is modulated according to table 1, the terminal device projects the synchronization signals to the binary domain, i.e. the terminal device obtains the imaginary absolute value of the received synchronization signals. If the first sequence of generated synchronization signals is modulated according to table 2, the terminal device projects the synchronization signals to the binary domain, i.e. the terminal device acquires the real part of the received synchronization signals.

In the embodiment of the application, the synchronization signals generated by any different sequences in a plurality of sequences obtained based on the initial values in the initial value set are projected to be identical in the binary domain. The cyclic shift value of the first sequence carried by the synchronization signal can be quickly determined based on the FHT. For example, after the terminal device acquires the real part absolute value or the imaginary part absolute value of the synchronization signal, the terminal device performs correlation calculation on the acquired real part absolute value or the imaginary part absolute value and the local sequence based on the FHT to determine the first cyclic shift value. After determining the first cyclic shift value, the terminal device may obtain a first sequence set according to the first cyclic shift value and each initial value in the initial value set. Wherein, one sequence in the first sequence set is that one initial value in the initial value set is obtained through the first cyclic shift value. A first initial value corresponding to the synchronization signal may be determined based on a maximum likelihood criterion (maximum likelihood, ML) criterion from the first set of sequences and the synchronization signal, and a first cell identity carried by the synchronization signal may be determined based on the first initial value and the first cyclic shift value.

The sequence obtained based on the initial value in the initial value set provided by the embodiment of the application generates the synchronous signal, and the detection complexity of the synchronous signal can be reduced. When the number of cell IDs is larger, the PSS may carry fewer cell IDs, for example, 1 cell ID is carried by the PSS, thereby further reducing the complexity of detecting the synchronization signal. This is because, for the synchronization signal, the detection complexity of the synchronization signal includes the detection complexity of the PSS and the detection complexity of the SSS, and the detection complexity of the PSS is larger in proportion. Thus, in example D, when there are more cell IDs, the PSS may carry fewer cell IDs to further reduce the detection complexity of the synchronization signal.

Referring to table 3, the complexity of generating SSS correspondence based on Gold sequence of length 127 and Z ₄ sequence is shown. Taking PSS carrying 3 cell IDs as an example, table 3 shows the complexity of SSS generation based on Gold sequence and Z ₄ sequence, i.e. the number of computations required to detect SSS, in the case of 1008 cell IDs, 2016 cell IDs and 4032 cell IDs.

TABLE 3 Table 3

As can be seen from table 3, SSS is generated based on the Z4 sequence provided in the embodiment of the present application, so that the detection complexity of SSS can be reduced, thereby reducing the detection complexity of the synchronization signal.

In the embodiment of the application, the first sequence (for example, the aforementioned Z ₄ sequence) has better cross-correlation performance, and the first sequence is used for generating the SSS, so that the high-capacity requirement of the SSS can be met. For example, without frequency offset, the cross-correlation value of the 127 long Z ₄ sequence approaches the maximum cross-correlation value of the ZC sequenceIn addition, the detection complexity of the synchronous signal can be reduced under the condition of meeting the high capacity requirement of the SSS.

Alternatively, the first sequence may also be a sequence for generating PSS. In this case, the appropriate PSS may be selected such that the cross-correlation between PSS and SSS is low.

For example, the primitive polynomials used as the first sequence of SSS satisfy either x ⁷+2x⁴ +x+3 or x ⁷+3x⁴+2x² +3, and correspondingly, the primitive polynomials of PSS satisfy x ⁷ +x+1 and x ⁷+x⁴ +1.

As another example, the primitive polynomial used as the first sequence of SSS satisfies x ⁸ ₊x⁵+3x³+x² +2x+1, and correspondingly the primitive polynomial of PSS satisfies x ⁸+x⁴+x³+x² +1.

Wherein if there are a plurality of PSS, different cyclic shifts of the first sequence may be selected at equal intervals to generate a plurality of PSS sequences, e.g. the first sequence for PSS has a length of 127, and possible cyclic shift values are 0, 43 and 87.

In the embodiment of the present application, the method provided by the embodiment of the present application is described by taking the execution of the terminal device and the network device as examples. In the present application, the various embodiments may be implemented independently or in combination based on some intrinsic relation, and in each embodiment, the different implementations may be implemented in combination or independently. In order to implement the functions in the method provided by the embodiment of the present application, the steps performed by the terminal device may be implemented by different functional entities that constitute the terminal device. The steps performed by the network device may be implemented by different functional entities constituting the network device. For example, the network device may be a CU-DU infrastructure, the CU may generate synchronization signals, and the DU may transmit the synchronization signals. In order to implement the functions in the method provided by the embodiment of the present application, the terminal device and the network device may include hardware structures and/or software modules, and implement the functions in the form of hardware structures, software modules, or a combination of hardware structures and software modules. Some of the functions described above are performed in a hardware configuration, a software module, or a combination of hardware and software modules, depending on the specific application of the solution and design constraints.

Based on the same inventive concept as the method embodiment, the present embodiment provides a communication device. Communication devices for implementing the above method in the embodiments of the present application are described below with reference to the accompanying drawings. The above may be used in the following embodiments, and repeated contents are not described again.

Fig. 4 is a schematic block diagram of a communication device 400 according to an embodiment of the present application. The communication device 400 may be the first device or the second device in the above embodiments. For example, the communication apparatus 400 may be the terminal device in fig. 1, or the communication apparatus 400 may be a chip (system) in the terminal device, or the communication apparatus 400 may be a software module of the terminal device. The communication apparatus 400 may correspond to implementing the functions or steps implemented by the terminal device in the above-described method embodiments. For another example, the communication apparatus 400 may be the network device in fig. 1, or the communication apparatus 400 may be a chip (system) in the network device, or the communication apparatus 400 may be a software module of the network device. The communications apparatus 400 may correspond to implementing the functions or steps implemented by the network device in the various method embodiments described above. The communication device 400 may include a processing module 410 and a transceiver module 420. Optionally, a storage module may be included, which may be used to store instructions (code or programs) and/or data. The memory module may be, for example, a memory. The processing module 410 and the transceiver module 420 may be coupled to the memory module. For example, the processing module 410 may read instructions (code or programs) and/or data in the memory module to implement the corresponding methods. When the communication apparatus 400 is a chip in a terminal device or a network device, the storage module may be a storage module in the chip, such as a register, a cache, and the like. For example, the memory module may also be a memory module located outside the chip within the terminal device or network device, such as read-only memory (ROM) or other type of static memory device that may store static information and instructions, random access memory (random access memory, RAM), etc. The units can be independently arranged or partially or fully integrated.

The processing module 410 may be a processor or controller, such as a general purpose central processing unit (central processing unit, CPU), general purpose processor, digital signal processing (DIGITAL SIGNAL processing), application Specific Integrated Circuits (ASIC), field programmable gate array (fieldprogrammable GATE ARRAY, FPGA) or other programmable logic device, transistor logic device, hardware components, or any combination thereof. Which may implement or perform the various exemplary logic blocks, modules and circuits described in connection with this disclosure. The processor may also be a combination that performs the function of a computation, e.g., including one or more microprocessors, a combination of a DSP and a microprocessor, and so forth. Transceiver module 420 is a transceiver, interface circuit, bus, pin, or other possible communication interface for receiving signals from other devices. For example, when the device is implemented as a chip, the transceiver module 420 is an interface circuit of the chip for receiving signals from other chips or devices, or an interface circuit of the chip for transmitting signals to other chips or devices.

In one implementation, the communications apparatus 400 can correspondingly implement the behaviors and functions of the network device in the method embodiment described above. The communication apparatus 400 may be a network device, a component (e.g., a chip or a circuit) in the network device, a part of a chip or a chipset in the network device for performing the related method functions, or a software module in the network device capable of implementing the communication method, which is not limited. Reference may be made specifically to the relevant content of the foregoing method embodiments, and details are not repeated here.

For example, the transceiver module 420 is configured to send the synchronization signal, where the synchronization signal is a signal obtained based on a first sequence, and an initial value of the first sequence belongs to an initial value set, and any two initial values in the initial value set are different. The processing module 410 is configured to generate a synchronization signal.

As an alternative implementation manner, the elements in the first sequence satisfy a recurrence relation, where the recurrence relation corresponds to the primitive polynomial one by one, and the primitive polynomial f (x) satisfies: a _i ∈ {0,1,2, M-1}, M is a positive integer greater than 3, r is a positive integer, and the length of the first sequence is n= ^r -1.

As an alternative implementation, the first sequence is a Z ₄ sequence.

As an alternative implementation, the processing module 410 is specifically configured to generate the synchronization signal according to the second sequence. Wherein the lengths of the first sequence and the second sequence are L, and the element d (n) of the second sequence and the element x (m) of the first sequence satisfy the following conditions: m=n+c) mod L, a is a complex number, c is an integer, 0≤n < L, 0≤m < L, x (m) =0, 1,2 or 3.

As an alternative implementation, the processing module 410 is specifically configured to generate a second sequence according to the first sequence, map the second sequence onto L subcarriers, and generate a synchronization signal according to the second sequence mapped onto L subcarriers.

As an alternative implementation, c is determined from the first cell identity and/or the second sequence is associated with the first cell identity, which belongs to the first set of cell identities.

As an alternative implementation, c belongs to a set of cyclic shift values, and the number of elements in the first set of cell identities is equal to the product of the number of elements in the initial set of values and the number of elements in the set of cyclic shift values.

As an alternative implementation, any two initial values within the initial value set are modulo-2 identical.

As an alternative implementation, the length of the first sequence is 127, the recurrence relation of the first sequence is x (i+7) =mod (2·x (i+4) +3·x (i+1) +x (i), 4), or the recurrence relation of the first sequence is x (i+7) =mod (x (i+4) +2·x (i+2) +x (i), 4), the initial value of the first sequence [ x (6), x (5), x (4), x (3), x (2), x (1), x (0) ] belongs to an initial value set comprising one or more of the following sequences ：[1,0,0,0,0,0,0],[3,0,0,0,0,0,0],[1,0,0,0,2,2,2],[3,2,0,0,0,0,0],[1,2,2,2,0,0,0],[1,0,0,0,0,0,2],[3,0,0,0,0,0,2],[3,2,2,2,0,0,0],[1,2,0,0,0,0,0],[3,0,0,0,2,2,2],[1,2,0,2,0,2,0],[3,2,2,0,0,0,0],[1,2,2,2,2,2,2],[1,2,2,0,0,2,2],[3,0,2,2,0,0,0],[1,2,0,2,0,0,0],[1,0,2,0,0,0,0],[1,0,2,0,2,0,2],[1,0,0,0,2,0,2],[3,2,0,0,2,2,2],[1,0,2,2,2,2,0],[1,0,0,0,0,2,0],[3,0,0,0,0,2,0],[3,2,2,2,0,0,2],[3,2,0,0,0,0,2],[3,0,0,0,2,2,0],[1,0,0,0,0,2,2],[3,0,0,0,0,2,2],[1,0,0,0,2,2,0],[1,2,0,0,0,0,2],[1,2,2,2,0,0,2],[3,2,2,2,2,2,2],[1,2,2,0,0,0,0],[3,2,0,2,0,2,0],[3,0,2,2,2,2,0],[1,2,0,0,2,2,2],[3,0,0,0,2,0,2],[3,0,2,0,2,0,2],[3,0,2,0,0,0,0],[3,2,0,2,0,0,0],[1,0,2,2,0,0,0],[3,2,2,0,0,2,2],[1,0,0,2,0,2,2],[1,0,0,2,0,0,0],[1,2,0,2,2,0,2],[1,0,2,2,0,0,2],[3,2,2,0,2,0,2],[3,2,0,0,2,2,0],[3,0,2,0,2,2,2],[3,2,2,2,2,2,0],[3,2,2,0,2,2,2],[3,2,0,0,2,0,2],[3,0,0,2,0,2,2],[1,2,0,2,2,2,2],[1,2,0,0,2,2,0],[3,0,0,2,0,2,0],[1,0,2,2,2,2,2],[1,2,2,2,0,2,0],[1,2,2,2,2,0,2],[1,2,2,0,2,0,0],[3,0,2,2,2,2,2],[3,0,2,0,2,0,0],[3,2,2,0,0,0,2],[1,0,2,0,2,2,2],[3,0,0,2,0,0,0],[1,0,2,0,0,2,0],[3,2,0,0,0,2,2],[1,0,0,0,2,0,0],[3,0,2,0,0,2,2],[3,2,2,0,2,0,0],[3,0,0,0,2,0,0],[3,2,2,2,0,2,2],[3,2,0,0,0,2,0],[1,2,0,0,0,2,0],[1,2,2,2,0,2,2],[1,0,2,0,2,0,0],[3,2,0,2,0,0,2],[3,2,2,0,0,2,0],[1,2,0,2,0,2,2],[1,0,2,0,0,0,2],[1,2,2,2,2,2,0],[3,2,2,2,0,2,0],[1,2,0,0,0,2,2],[1,2,2,0,0,0,2],[3,0,2,2,0,0,2],[3,0,2,0,0,0,2],[3,2,0,2,0,2,2],[1,2,2,0,0,2,0],[1,2,0,2,0,0,2],[1,2,2,0,2,0,2],[3,2,0,2,2,0,2],[1,0,0,2,0,2,0],[1,0,2,0,0,2,2],[3,0,2,0,0,2,0],[3,2,0,2,2,2,2],[3,2,2,2,2,0,2],[1,2,0,0,2,0,2],[1,2,2,0,2,2,2],[3,0,0,2,2,2,2],[3,2,2,2,2,0,0],[1,2,2,2,2,0,0],[3,0,2,2,0,2,0],[1,2,2,0,2,2,0],[3,2,0,0,2,0,0],[3,0,2,2,2,0,2],[1,0,0,2,2,0,0],[1,2,0,2,2,2,0],[3,0,0,2,2,0,2],[3,0,0,2,0,0,2],[1,0,0,2,2,2,2],[3,2,0,2,2,0,0],[1,0,0,2,2,2,0],[3,0,0,2,2,0,0],[1,0,2,2,2,0,0],[1,0,2,2,0,2,2],[3,0,2,2,2,0,0],[3,0,2,2,0,2,2],[3,2,0,2,2,2,0],[3,2,2,0,2,2,0],[1,0,0,2,0,0,2],[1,2,0,0,2,0,0],[1,0,2,2,2,0,2],[3,0,2,0,2,2,0],[1,2,0,2,2,0,0],[1,0,2,0,2,2,0],[1,0,0,2,2,0,2],[3,0,0,2,2,2,0], or [1,0,2,2,0,2,0].

As an alternative implementation, the length of the first sequence is 127, and the recurrence relation of the first sequence is x (i+7) =mod (2·x (i+4) +3·x (i+1) +x (i), 4), or the recurrence relation of the first sequence is x (i+7) =mod (x (i+4) +2·x (i+2) +x (i), 4), where "·" refers to multiplication. The initial values of the first sequence [ x (0), x (1), x (2), x (3), x (4), x (5), x (6) ] belong to a set of initial values comprising one or more of the sequences ：[1,0,0,0,0,0,0],[3,0,0,0,0,0,0],[1,0,0,0,2,2,2],[3,2,0,0,0,0,0],[1,2,2,2,0,0,0],[1,0,0,0,0,0,2],[3,0,0,0,0,0,2],[3,2,2,2,0,0,0],[1,2,0,0,0,0,0],[3,0,0,0,2,2,2],[1,2,0,2,0,2,0],[3,2,2,0,0,0,0],[1,2,2,2,2,2,2],[1,2,2,0,0,2,2],[3,0,2,2,0,0,0],[1,2,0,2,0,0,0],[1,0,2,0,0,0,0],[1,0,2,0,2,0,2],[1,0,0,0,2,0,2],[3,2,0,0,2,2,2],[1,0,2,2,2,2,0],[1,0,0,0,0,2,0],[3,0,0,0,0,2,0],[3,2,2,2,0,0,2],[3,2,0,0,0,0,2],[3,0,0,0,2,2,0],[1,0,0,0,0,2,2],[3,0,0,0,0,2,2],[1,0,0,0,2,2,0],[1,2,0,0,0,0,2],[1,2,2,2,0,0,2],[3,2,2,2,2,2,2],[1,2,2,0,0,0,0],[3,2,0,2,0,2,0],[3,0,2,2,2,2,0],[1,2,0,0,2,2,2],[3,0,0,0,2,0,2],[3,0,2,0,2,0,2],[3,0,2,0,0,0,0],[3,2,0,2,0,0,0],[1,0,2,2,0,0,0],[3,2,2,0,0,2,2],[1,0,0,2,0,2,2],[1,0,0,2,0,0,0],[1,2,0,2,2,0,2],[1,0,2,2,0,0,2],[3,2,2,0,2,0,2],[3,2,0,0,2,2,0],[3,0,2,0,2,2,2],[3,2,2,2,2,2,0],[3,2,2,0,2,2,2],[3,2,0,0,2,0,2],[3,0,0,2,0,2,2],[1,2,0,2,2,2,2],[1,2,0,0,2,2,0],[3,0,0,2,0,2,0],[1,0,2,2,2,2,2],[1,2,2,2,0,2,0],[1,2,2,2,2,0,2],[1,2,2,0,2,0,0],[3,0,2,2,2,2,2],[3,0,2,0,2,0,0],[3,2,2,0,0,0,2],[1,0,2,0,2,2,2],[3,0,0,2,0,0,0],[1,0,2,0,0,2,0],[3,2,0,0,0,2,2],[1,0,0,0,2,0,0],[3,0,2,0,0,2,2],[3,2,2,0,2,0,0],[3,0,0,0,2,0,0],[3,2,2,2,0,2,2],[3,2,0,0,0,2,0],[1,2,0,0,0,2,0],[1,2,2,2,0,2,2],[1,0,2,0,2,0,0],[3,2,0,2,0,0,2],[3,2,2,0,0,2,0],[1,2,0,2,0,2,2],[1,0,2,0,0,0,2],[1,2,2,2,2,2,0],[3,2,2,2,0,2,0],[1,2,0,0,0,2,2],[1,2,2,0,0,0,2],[3,0,2,2,0,0,2],[3,0,2,0,0,0,2],[3,2,0,2,0,2,2],[1,2,2,0,0,2,0],[1,2,0,2,0,0,2],[1,2,2,0,2,0,2],[3,2,0,2,2,0,2],[1,0,0,2,0,2,0],[1,0,2,0,0,2,2],[3,0,2,0,0,2,0],[3,2,0,2,2,2,2],[3,2,2,2,2,0,2],[1,2,0,0,2,0,2],[1,2,2,0,2,2,2],[3,0,0,2,2,2,2],[3,2,2,2,2,0,0],[1,2,2,2,2,0,0],[3,0,2,2,0,2,0],[1,2,2,0,2,2,0],[3,2,0,0,2,0,0],[3,0,2,2,2,0,2],[1,0,0,2,2,0,0],[1,2,0,2,2,2,0],[3,0,0,2,2,0,2],[3,0,0,2,0,0,2],[1,0,0,2,2,2,2],[3,2,0,2,2,0,0],[1,0,0,2,2,2,0],[3,0,0,2,2,0,0],[1,0,2,2,2,0,0],[1,0,2,2,0,2,2],[3,0,2,2,2,0,0],[3,0,2,2,0,2,2],[3,2,0,2,2,2,0],[3,2,2,0,2,2,0],[1,0,0,2,0,0,2],[1,2,0,0,2,0,0],[1,0,2,2,2,0,2],[3,0,2,0,2,2,0],[1,2,0,2,2,0,0],[1,0,2,0,2,2,0],[1,0,0,2,2,0,2],[3,0,0,2,2,2,0], or [1,0,2,2,0,2,0].

As an alternative implementation, the length of the first sequence is 127, and the primitive polynomial of the first sequence is x ⁷+2x⁴ +x+3 or x ⁷+3x⁴+2x² +3.

As an alternative implementation, the length of the first sequence is 255, and the recurrence relation of the first sequence is x (i+8) =mod (3·x (i+5) +x (i+3) +3·x (i+2) +2·x (i+1) +3·x (i), 4). In this case, the initial values x (7), x (6), x (5), x (4), x (3), x (2), x (1), x (0) of the first sequence belong to an initial value set comprising one or more of the sequences ：[3,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0],[3,2,2,0,2,0,2,2],[3,2,0,0,0,0,0,0],[3,0,0,2,0,2,0,0],[3,0,0,0,0,0,0,2],[1,0,0,0,0,0,0,2],[1,0,0,2,0,2,0,0],[1,2,0,0,0,0,0,0],[1,2,2,0,2,0,2,2],[3,2,0,2,0,2,0,2],[1,0,2,0,0,0,0,0],[3,2,2,2,2,2,2,2],[3,0,2,0,2,2,0,0],[3,2,0,2,0,2,0,0],[1,2,0,0,0,0,0,2],[1,2,2,0,0,0,0,0],[3,0,2,0,2,0,2,0],[1,2,2,2,0,2,2,2],[3,0,2,0,2,0,2,2],[3,0,0,2,2,0,2,0],[3,0,0,0,0,0,2,0],[1,0,0,0,0,0,2,0],[1,0,0,2,0,2,0,2],3,2,0,0,0,0,0,2],[1,2,2,0,2,0,2,0],[3,0,0,0,0,0,2,2],[1,0,0,0,0,0,2,2],[3,2,2,0,2,0,2,0],[3,0,0,2,0,2,0,2],[1,2,2,2,2,2,2,2],[3,0,2,0,0,0,0,0],[1,2,0,2,0,2,0,2],[1,0,0,2,2,0,2,0],[1,0,2,0,2,0,2,2],[3,2,2,2,0,2,2,2],[1,0,2,0,2,0,2,0],[3,2,2,0,0,0,0,0],[1,2,0,2,0,2,0,0],[1,0,2,0,2,2,0,0],[1,0,0,2,2,2,0,0],[1,2,0,2,0,0,0,0],[3,0,2,2,2,0,0,0],[1,2,0,2,0,2,2,2],[3,0,2,0,0,2,0,2],[3,2,2,2,0,0,0,0],[3,2,2,2,0,0,0,2],[3,0,2,2,0,0,2,0],[1,2,0,0,2,2,2,2],[1,2,2,2,0,2,0,0],[1,2,0,2,0,0,2,0],[3,0,2,2,2,2,2,0],[3,2,0,2,2,0,2,0],[3,0,2,0,0,2,2,2],[1,2,2,2,0,2,0,2],[1,2,0,0,2,0,2,2],[1,2,2,0,2,0,0,0],[3,0,0,0,2,2,0,2],[1,0,2,2,0,2,2,2],[3,0,0,0,2,2,2,0],[1,0,0,2,0,0,0,0],[3,0,0,2,2,2,0,0],[1,2,2,0,2,2,2,0],[3,2,0,0,0,2,2,2],[3,0,2,2,0,0,0,0],[1,2,2,0,0,0,2,2],[1,2,2,2,2,0,0,2],[3,0,2,2,2,2,2,2],[3,0,0,0,2,0,2,2],[1,0,2,2,2,0,2,2],[1,0,0,0,2,0,2,2],[1,0,2,0,0,2,2,0],[3,2,0,2,2,0,0,0],[1,0,2,2,0,2,0,0],[3,2,2,0,2,2,0,0],[3,2,2,2,0,0,2,0],[1,0,0,0,0,2,0,0],[3,0,0,0,0,2,0,0],[3,2,0,0,0,0,2,0],[1,0,0,2,0,2,2,2],[1,0,0,0,0,2,0,2],[3,0,0,0,0,2,0,2],[1,2,0,0,0,0,2,0],[3,0,0,2,0,2,2,2],[3,2,2,0,2,0,0,0],[1,0,2,0,0,0,0,2],[1,0,2,0,2,2,0,2],[1,2,2,0,0,0,0,2],[3,2,2,2,2,2,2,0],[3,2,2,2,0,2,2,0],[1,0,0,2,2,0,2,2],[1,0,0,0,0,2,2,0],[3,0,0,0,0,2,2,0],[3,2,0,0,0,0,2,2],[3,0,0,2,0,2,2,0],[3,2,2,0,2,0,0,2],[1,0,0,0,0,2,2,2],[3,0,0,0,0,2,2,2],[1,2,0,0,0,0,2,2],[1,2,2,0,2,0,0,2],[1,0,0,2,0,2,2,0],[3,0,2,0,0,0,0,2],[3,0,0,2,2,0,2,2],[1,2,2,2,0,2,2,0],[3,2,2,0,0,0,0,2],[1,2,2,2,2,2,2,0],[3,0,2,0,2,2,0,2],[1,0,2,2,2,0,0,0],[3,2,0,2,0,0,0,0],[1,0,2,2,0,0,2,0],[1,2,2,2,0,0,0,2],[1,2,2,2,0,0,0,0],[3,2,0,2,0,2,2,2],[1,0,2,0,0,2,0,2],[3,0,2,2,2,0,2,2],[3,0,2,0,0,2,2,0],[1,2,2,2,0,0,2,0],[1,2,2,0,2,2,0,0],[3,0,2,2,0,2,0,0],[1,2,0,2,2,0,0,0],[1,0,0,0,2,2,2,0],[3,0,0,2,0,0,0,0],[3,2,2,2,2,0,0,2],[1,0,2,2,2,2,2,2],[1,2,0,0,0,2,2,2],[3,2,2,0,0,0,2,2],[1,0,2,2,0,0,0,0],[3,2,2,0,2,2,2,0],[3,2,0,0,2,2,2,2],[3,2,0,2,0,0,2,0],[3,2,2,2,0,2,0,0],[1,0,0,0,2,2,0,2],[3,0,2,2,0,2,2,2],[3,2,2,2,0,2,0,2],[3,2,0,0,2,0,2,2],[1,0,2,2,2,2,2,0],[1,0,2,0,0,2,2,2],[1,2,0,2,2,0,2,0],[3,2,0,0,2,2,2,0],[1,0,2,2,0,0,0,2],[3,0,2,2,0,0,2,2],[1,2,0,0,0,2,0,0],[1,0,0,2,2,2,2,0],[1,2,0,2,2,2,0,2],[1,2,2,2,2,2,0,0],[1,0,2,0,2,2,2,0],[3,0,2,0,2,0,0,0],[1,2,0,0,2,0,2,0],[1,2,0,2,0,0,0,2],[3,2,0,2,2,2,0,0],[1,2,0,2,2,0,2,2],[1,2,0,2,2,2,2,2],[3,0,2,0,0,0,2,0],[1,0,0,2,2,0,0,0],[3,0,0,2,2,0,0,2],[1,0,2,0,0,0,2,2],[1,2,2,0,2,2,2,2],[3,2,0,0,2,0,0,0],[3,0,2,2,0,2,2,0],[1,2,0,0,0,2,2,0],[1,0,2,2,2,0,0,2],[1,2,0,0,2,2,0,2],[3,0,2,2,2,2,0,0],[1,2,0,0,0,2,0,2],[1,2,0,2,2,2,0,0],[3,2,0,2,0,0,2,2],[3,0,2,0,0,2,0,0],[1,0,2,2,2,2,0,0],[1,2,2,0,2,2,0,2],[3,0,2,0,2,2,2,0],[3,0,0,2,2,2,2,2],[1,2,2,2,2,0,2,2],[3,2,0,0,0,2,2,0],[1,2,2,0,0,2,2,0],[3,2,2,0,0,2,0,2],[3,2,2,0,0,2,0,0],[1,2,2,2,2,0,2,0],[1,0,0,0,2,2,0,0],[1,0,2,0,0,0,2,0],[3,0,0,2,2,0,0,0],[3,2,0,2,2,0,0,2],[3,0,0,0,2,0,0,0],[3,2,2,0,0,2,2,0],[3,2,2,2,2,2,0,0],[3,2,2,2,2,0,0,0],[1,0,0,0,2,0,0,0],[3,2,0,0,2,0,0,2],[1,0,2,0,2,0,0,0],[1,0,0,2,0,0,0,2],[1,0,2,0,2,2,2,2],[1,0,2,0,0,2,0,0],[1,0,0,2,2,2,2,2],[3,0,0,2,2,2,2,0],[1,2,2,0,0,2,2,2],[1,0,0,0,2,0,2,0],[3,0,2,2,0,0,0,2],[3,2,0,0,2,2,0,0],[1,0,2,2,0,2,0,2],[3,0,0,0,2,0,2,0],[1,2,2,2,0,0,2,2],[3,2,0,2,2,0,2,2],[3,0,0,2,0,0,2,2],[1,0,2,2,2,0,2,0],[3,2,0,0,2,2,0,2],[1,0,0,2,0,0,2,0],[1,2,0,0,2,2,0,0],[1,0,0,0,2,2,2,2],[1,2,0,0,2,0,0,2],[3,2,2,0,0,2,2,2],[3,0,0,0,2,0,0,2],[1,0,0,0,2,0,0,2],[1,0,0,2,0,0,2,2],[3,2,0,0,0,2,0,0],[1,2,2,0,0,0,2,0],[3,0,2,0,2,2,2,2],[1,2,2,2,2,2,0,2],[3,2,2,0,2,2,0,2],[3,2,0,0,0,2,0,2],[3,0,0,2,0,0,2,0],[3,2,2,0,0,0,2,0],[1,0,0,2,2,0,0,2],[3,2,2,2,2,2,0,2],[1,0,0,2,2,2,0,2],[3,0,2,2,2,0,0,2],[3,0,0,2,2,2,0,2],[1,2,2,2,2,0,0,0],[3,0,2,2,0,2,0,2],[3,0,2,2,2,0,2,0],[3,0,0,0,2,2,2,2],[1,2,0,2,0,2,2,0],[3,2,0,0,2,0,2,0],[1,2,0,2,2,0,0,2],[3,0,0,0,2,2,0,0],[3,2,2,0,2,2,2,2],[3,0,2,0,2,0,0,2],[1,0,2,0,2,0,0,2],[3,2,0,2,0,2,2,0],[3,0,0,2,0,0,0,2],[3,0,2,0,0,0,2,2],[3,2,0,2,0,0,0,2],[1,2,0,2,0,0,2,2],[1,2,0,0,2,2,2,0],[3,2,2,2,0,0,2,2],[1,0,2,2,0,0,2,2],[1,0,2,2,0,2,2,0],[3,2,0,2,2,2,0,2],[1,2,0,0,2,0,0,0],[3,2,0,2,2,2,2,2],[1,2,2,0,0,2,0,2],[1,2,2,0,0,2,0,0],[3,2,2,2,2,0,2,2],[3,2,2,2,2,0,2,0],[3,2,0,2,2,2,2,0],[3,0,2,2,2,2,0,2],[1,2,0,2,2,2,2,0],[1,0,2,2,2,2,0,2],[3,2,0,2,0,2,0,0], or [1,2,2,0,2,0,0,2].

As an alternative implementation, the length of the first sequence is 255, and the recurrence relation of the first sequence is x (i+8) =mod (3·x (i+5) +x (i+3) +3·x (i+2) +2·x (i+1) +3·x (i), 4). In this case, the initial values x (0), x (1), x (2), x (3), x (4), x (5), x (6), x (7) of the first sequence belong to an initial value set comprising one or more of the sequences ：[3,0,0,0,0,0,0,0],[1,0,0,0,0,0,0,0],[3,2,2,0,2,0,2,2],[3,2,0,0,0,0,0,0],[3,0,0,2,0,2,0,0],[3,0,0,0,0,0,0,2],[1,0,0,0,0,0,0,2],[1,0,0,2,0,2,0,0],[1,2,0,0,0,0,0,0],[1,2,2,0,2,0,2,2],[3,2,0,2,0,2,0,2],[1,0,2,0,0,0,0,0],[3,2,2,2,2,2,2,2],[3,0,2,0,2,2,0,0],[3,2,0,2,0,2,0,0],[1,2,0,0,0,0,0,2],[1,2,2,0,0,0,0,0],[3,0,2,0,2,0,2,0],[1,2,2,2,0,2,2,2],[3,0,2,0,2,0,2,2],[3,0,0,2,2,0,2,0],[3,0,0,0,0,0,2,0],[1,0,0,0,0,0,2,0],[1,0,0,2,0,2,0,2],[3,2,0,0,0,0,0,2],[1,2,2,0,2,0,2,0],[3,0,0,0,0,0,2,2],[1,0,0,0,0,0,2,2],[3,2,2,0,2,0,2,0],[3,0,0,2,0,2,0,2],[1,2,2,2,2,2,2,2],[3,0,2,0,0,0,0,0],[1,2,0,2,0,2,0,2],[1,0,0,2,2,0,2,0],[1,0,2,0,2,0,2,2],[3,2,2,2,0,2,2,2],[1,0,2,0,2,0,2,0],[3,2,2,0,0,0,0,0],[1,2,0,2,0,2,0,0],[1,0,2,0,2,2,0,0],[1,0,0,2,2,2,0,0],[1,2,0,2,0,0,0,0],[3,0,2,2,2,0,0,0],[1,2,0,2,0,2,2,2],[3,0,2,0,0,2,0,2],[3,2,2,2,0,0,0,0],[3,2,2,2,0,0,0,2],[3,0,2,2,0,0,2,0],[1,2,0,0,2,2,2,2],[1,2,2,2,0,2,0,0],[1,2,0,2,0,0,2,0],[3,0,2,2,2,2,2,0],[3,2,0,2,2,0,2,0],[3,0,2,0,0,2,2,2],[1,2,2,2,0,2,0,2],[1,2,0,0,2,0,2,2],[1,2,2,0,2,0,0,0],[3,0,0,0,2,2,0,2],[1,0,2,2,0,2,2,2],[3,0,0,0,2,2,2,0],[1,0,0,2,0,0,0,0],[3,0,0,2,2,2,0,0],[1,2,2,0,2,2,2,0],[3,2,0,0,0,2,2,2],[3,0,2,2,0,0,0,0],[1,2,2,0,0,0,2,2],[1,2,2,2,2,0,0,2],[3,0,2,2,2,2,2,2],[3,0,0,0,2,0,2,2],[1,0,2,2,2,0,2,2],[1,0,0,0,2,0,2,2],[1,0,2,0,0,2,2,0],[3,2,0,2,2,0,0,0],[1,0,2,2,0,2,0,0],[3,2,2,0,2,2,0,0],[3,2,2,2,0,0,2,0],[1,0,0,0,0,2,0,0],[3,0,0,0,0,2,0,0],[3,2,0,0,0,0,2,0],[1,0,0,2,0,2,2,2],[1,0,0,0,0,2,0,2],[3,0,0,0,0,2,0,2],[1,2,0,0,0,0,2,0],[3,0,0,2,0,2,2,2],[3,2,2,0,2,0,0,0],[1,0,2,0,0,0,0,2],[1,0,2,0,2,2,0,2],[1,2,2,0,0,0,0,2],[3,2,2,2,2,2,2,0],[3,2,2,2,0,2,2,0],[1,0,0,2,2,0,2,2],[1,0,0,0,0,2,2,0],[3,0,0,0,0,2,2,0],[3,2,0,0,0,0,2,2],[3,0,0,2,0,2,2,0],[3,2,2,0,2,0,0,2],[1,0,0,0,0,2,2,2],[3,0,0,0,0,2,2,2],[1,2,0,0,0,0,2,2],[1,2,2,0,2,0,0,2],[1,0,0,2,0,2,2,0],[3,0,2,0,2,2,0,2],[1,0,2,2,2,0,0,0],[3,2,0,2,0,0,0,0],[1,0,2,2,0,0,2,0],[1,2,2,2,0,0,0,2],[1,2,2,2,0,0,0,0],[3,2,0,2,0,2,2,2],[1,0,2,0,0,2,0,2],[3,0,2,2,2,0,2,2],[3,0,2,0,0,2,2,0],[1,2,2,2,0,0,2,0],[1,2,2,0,2,2,0,0],[3,0,2,2,0,2,0,0],[1,2,0,2,2,0,0,0],[1,0,0,0,2,2,2,0],[3,0,0,2,0,0,0,0],[3,2,2,2,2,0,0,2],[1,0,2,2,2,2,2,2],[1,2,0,0,0,2,2,2],[3,2,2,0,0,0,2,2],[1,0,2,2,0,0,0,0],[3,2,2,0,2,2,2,0],[3,2,0,0,2,2,2,2],[3,2,0,2,0,0,2,0],[3,2,2,2,0,2,0,0],[1,0,0,0,2,2,0,2],[3,0,2,2,0,2,2,2],[3,2,2,2,0,2,0,2],[3,2,0,0,2,0,2,2],[1,0,2,2,2,2,2,0],[1,0,2,0,0,2,2,2],[1,2,0,2,2,0,2,0],[3,2,0,0,2,2,2,0],[1,0,2,2,0,0,0,2],[3,0,2,2,0,0,2,2],[1,2,0,0,0,2,0,0],[1,0,0,2,2,2,2,0],[1,2,0,2,2,2,0,2],[1,2,2,2,2,2,0,0],[1,0,2,0,2,2,2,0],[3,0,2,0,2,0,0,0],[1,2,0,0,2,0,2,0],[1,2,0,2,0,0,0,2],[3,2,0,2,2,2,0,0],[1,2,0,2,2,0,2,2],[1,2,0,2,2,2,2,2],[3,0,2,0,0,0,2,0],[1,0,0,2,2,0,0,0],[3,0,0,2,2,0,0,2],[1,0,2,0,0,0,2,2],[1,2,2,0,2,2,2,2],[3,2,0,0,2,0,0,0],[3,0,2,2,0,2,2,0],[1,2,0,0,0,2,2,0],[1,0,2,2,2,0,0,2],[1,2,0,0,2,2,0,2],[3,0,2,2,2,2,0,0],[1,2,0,0,0,2,0,2],[1,2,0,2,2,2,0,0],[3,2,0,2,0,0,2,2],[3,0,2,0,0,2,0,0],[1,0,2,2,2,2,0,0],[1,2,2,0,2,2,0,2],[3,0,2,0,2,2,2,0],[3,0,0,2,2,2,2,2],[1,2,2,2,2,0,2,2],[3,2,0,0,0,2,2,0],[1,2,2,0,0,2,2,0],[3,2,2,0,0,2,0,2],[3,2,2,0,0,2,0,0],[1,2,2,2,2,0,2,0],[1,0,0,0,2,2,0,0],[1,0,2,0,0,0,2,0],[3,0,0,2,2,0,0,0],[3,2,0,2,2,0,0,2],[3,0,0,0,2,0,0,0],[3,2,2,0,0,2,2,0],[3,2,2,2,2,2,0,0],[3,2,2,2,2,0,0,0],[1,0,0,0,2,0,0,0],[3,2,0,0,2,0,0,2],[1,0,2,0,2,0,0,0],[1,0,0,2,0,0,0,2],[1,0,2,0,2,2,2,2],[1,0,2,0,0,2,0,0],[1,0,0,2,2,2,2,2],[3,0,0,2,2,2,2,0],[1,2,2,0,0,2,2,2],[1,0,0,0,2,0,2,0],[3,0,2,2,0,0,0,2],[3,2,0,0,2,2,0,0],[1,0,2,2,0,2,0,2],[3,0,0,0,2,0,2,0],[1,2,2,2,0,0,2,2],[3,2,0,2,2,0,2,2],[3,0,0,2,0,0,2,2],[1,0,2,2,2,0,2,0],[3,2,0,0,2,2,0,2],[1,0,0,2,0,0,2,0],[1,2,0,0,2,2,0,0],[1,0,0,0,2,2,2,2],[1,2,0,0,2,0,0,2],[3,2,2,0,0,2,2,2],[3,0,0,0,2,0,0,2],[1,0,0,0,2,0,0,2],[1,0,0,2,0,0,2,2],[3,2,0,0,0,2,0,0],[1,2,2,0,0,0,2,0],[3,0,2,0,2,2,2,2],[1,2,2,2,2,2,0,2],[3,2,2,0,2,2,0,2],[3,2,0,0,0,2,0,2],[3,0,0,2,0,0,2,0],[3,2,2,0,0,0,2,0],[1,0,0,2,2,0,0,2],[3,2,2,2,2,2,0,2],[1,0,0,2,2,2,0,2],[3,0,2,2,2,0,0,2],[3,0,0,2,2,2,0,2],[1,2,2,2,2,0,0,0],[3,0,2,2,0,2,0,2],[3,0,2,2,2,0,2,0],[3,0,0,0,2,2,2,2],[1,2,0,2,0,2,2,0],[3,2,0,0,2,0,2,0],[1,2,0,2,2,0,0,2],[3,0,0,0,2,2,0,0],[3,2,2,0,2,2,2,2],[3,0,2,0,2,0,0,2],[1,0,2,0,2,0,0,2],[3,2,0,2,0,2,2,0],[3,0,0,2,0,0,0,2],[3,0,2,0,0,0,2,2],[3,2,0,2,0,0,0,2],[1,2,0,2,0,0,2,2],[1,2,0,0,2,2,2,0],[3,2,2,2,0,0,2,2],[1,0,2,2,0,0,2,2],[1,0,2,2,0,2,2,0],[3,2,0,2,2,2,0,2],[1,2,0,0,2,0,0,0],[3,2,0,2,2,2,2,2],[1,2,2,0,0,2,0,2],[1,2,2,0,0,2,0,0],[3,2,2,2,2,0,2,2],[3,2,2,2,2,0,2,0],[3,2,0,2,2,2,2,0],[3,0,2,2,2,2,0,2],[1,2,0,2,2,2,2,0], or [1,0,2,2,2,2,0,2].

As an alternative implementation, the first length is 255 and the primitive polynomial of the first sequence is x ⁸+x⁵+3x³+x² +2x+1.

As an alternative implementation, the length of the first sequence is L, c is p×id, the value range of ID is [0, K-1], K is a positive integer, p satisfies that p=floor (L/K), floor is rounded down, or p=ceil (L/K), ceil is rounded up, or p=round (L/K), round is rounded up to the nearest integer. Alternatively, K is 63 or 127.

As an alternative implementation manner, the synchronization signal is SSS, and data corresponding to the synchronization signal is transmitted by using an OFDM waveform.

In another implementation manner, the communication apparatus 400 can correspondingly implement the behaviors and functions of the terminal device in the above method embodiment. The communication apparatus 400 may be a terminal device, a component (e.g., a chip or a circuit) applied to the terminal device, a part of a chip or a chipset in the terminal device for performing a function of a related method, or a software module capable of implementing a method performed by the terminal device in the above communication method, which is not limited. Reference may be made specifically to the relevant content of the foregoing method embodiments, and details are not repeated here.

For example, the transceiver module 420 is configured to receive a synchronization signal. The processing module 410 is configured to detect a synchronization signal, where the synchronization signal is a signal obtained based on a first sequence, and an initial value of the first sequence belongs to an initial value set, and any two initial values in the initial value set are different.

As an alternative implementation, the processing module 410 is specifically configured to detect the synchronization signal in a first mode, a second mode, a third mode or a fourth mode.

One of the ways includes that the processing module 410 obtains a first sequence, and processes the received signal according to the first sequence to detect the synchronization signal.

The second mode includes that the processing module 410 obtains a first sequence, generates a second sequence according to the first sequence, and processes the received signal according to the second sequence to detect the synchronization signal.

A third way includes the processing module 410 obtaining a second sequence, processing the received signal according to the second sequence to detect the synchronization signal, the second sequence being generated based on the first sequence.

A fourth way comprises the processing module 410 processing the received signal according to a sequence in a set of synchronization sequences to detect the synchronization signal, the sequence in the set of synchronization sequences comprising a second sequence, the second sequence being a sequence derived based on the first sequence.

As an alternative implementation manner, the elements in the first sequence satisfy a recurrence relation, where the recurrence relation corresponds to a primitive polynomial one by one, and the primitive polynomial f (x) satisfies: a _i ∈ {0,1,2, M-1}, M is a positive integer greater than 3, r is a positive integer, and the length of the first sequence is n= ^r -1.

As an alternative implementation, the first sequence is a Z ₄ sequence.

As an alternative implementation, the lengths of the first sequence and the second sequence are both L, and the element d (n) of the second sequence and the element x (m) of the first sequence satisfy: m= (n+c) mod L, a is a complex number, c is an integer, 0≤n < L, 0≤m < L, x (m) =0, 1,2 or 3.

As an alternative implementation manner, the processing module 410 is specifically configured to perform inner products on all sequences in the synchronization sequence set and the received signal in sequence to obtain a correlation value set, where the sequences in the synchronization sequence set include a second sequence, and the second sequence is a sequence obtained based on the first sequence, and determine the synchronization signal according to a maximum correlation value in the correlation value set, or determine the first cell identifier according to a maximum correlation value in the correlation value set.

As an alternative implementation, the processing module 410 is specifically configured to project the synchronization signal, determine a first cyclic shift according to the projected synchronization signal (i.e. c), generate a first sequence set according to the first cyclic shift and the initial value set, determine a first initial value according to the second sequence set and the synchronization signal, and determine a first cell identifier according to the first initial value and the first cyclic shift.

As an alternative implementation, the length of the first sequence is 255, and its primitive polynomial is x ⁸+x⁵+3x³+x² +2x+1.

As an alternative implementation, the length of the first sequence is L, c is p×id, the value range of ID is [0, K-1], K is a positive integer, p satisfies that p=floor (L/K), floor is rounded down, or p=ceil (L/K), ceil is rounded up, or p=round (L/K), round is rounded up to the nearest integer.

When the communication device 400 is a chip-type device or circuit, the transceiver module may be an input-output circuit and/or a communication interface, and the processing module may be an integrated processor or microprocessor or an integrated circuit.

Fig. 5 is a schematic block diagram of a communication device 500 according to an embodiment of the present application. The communication apparatus 500 may be a terminal device or a network device in the above embodiment. For example, the communication apparatus 500 may be a terminal device or a chip (system) in a terminal device in fig. 1. In the embodiment of the application, the chip system can be formed by a chip, and can also comprise the chip and other discrete devices. Specific functions can be seen from the description of the method embodiments described above. As another example, the communication apparatus 500 may be the network device of fig. 1 or a chip (system) in the network device. In the embodiment of the application, the chip system can be formed by a chip, and can also comprise the chip and other discrete devices. Specific functions can be seen from the description of the method embodiments described above.

The communication apparatus 500 comprises one or more processors 501 for implementing or for supporting the communication apparatus 500 to implement the functions of a terminal device or a network device in the method provided by the embodiment of the present application. Reference is made specifically to the detailed description in the method examples, and details are not described here. The processor 501 may also be referred to as a processing unit or a processing module, and may implement a certain control function. The processor 501 may be a general purpose processor or a special purpose processor, etc. Including, for example, a baseband processor, a central processing unit, an application processor, a modem processor, a graphics processor, an image signal processor, a digital signal processor, a video codec processor, a controller, a memory, and/or a neural network processor, etc. The baseband processor may be used to process communication protocols as well as communication data. The central processor may be used to control the communication device 500 (e.g., a network device or a terminal device), execute software programs, and/or process data. The different processors may be separate devices or may be integrated in one or more processors, e.g., integrated on one or more application specific integrated circuits.

In one design, the processor 501 may include a program 503 (sometimes also referred to as code or instructions), the program 503 may be run on the processor 501 to cause the communication device 500 to perform the methods described in the embodiments below. In yet another possible design, the communication apparatus 500 includes circuitry (not shown in fig. 5) for implementing the functionality of the terminal device or the network device in the above-described embodiments.

In one design, the communication device 500 may include one or more memories 502 having a program 504 (sometimes referred to as code or instructions) stored thereon, the program 504 being executable on the processor 501 to cause the communication device 500 to perform the methods described in the method embodiments above.

In one design, the processor 501 and/or memory 502 may include an artificial intelligence (ARTIFICIAL INTELLIGENCE, AI) module 507, an AI module 508 to implement AI-related functions. The AI module may be implemented in software, hardware, or a combination of both. For example, the AI module may include a RAN Intelligent Controller (RIC) module. For example, the AI module may be a near real-time RIC or a non-real-time RIC.

In one possible design, the processor 501 and/or memory 502 may also have data stored therein. The processor and the memory may be provided separately or may be integrated.

In one possible design, the communication device 500 may also include a transceiver 505 and/or an antenna 506. The processor 501 may also be referred to as a processing unit, and controls the communication device 500. The transceiver 505 may also be referred to as a transceiver unit, a transceiver circuit, a transceiver, etc. for implementing the transceiver function of the communication device 500 via the antenna 506.

In one possible design, the communication device 500 may further include one or more of a wireless communication module, an audio module, an external memory interface, an internal memory, a universal serial bus (universal serial bus, USB) interface, a power management module, an antenna, a speaker, a microphone, an input/output module, a sensor module, a motor, a camera, or a display screen, etc. It is to be appreciated that in some embodiments, the communication device 500 may include more or fewer components, or some components may be integrated, or some components may be split. These components may be hardware, software, or a combination of software and hardware implementations.

The communication device in the above embodiment may be a terminal device, a circuit, a chip applied to the terminal device, or other combination devices, components, etc. having the terminal device. Or the communication device in the above embodiment may be a network device, or may be a circuit, or may be a chip applied in the network device or other combination device, component, etc. with the network device. When the communication device is a terminal device or a network device, the transceiver module may be a transceiver, may include an antenna, a radio frequency circuit, and the like, and the processing module may be a processor, such as a CPU. When the communication device is a system-on-chip, the communication device may be an FPGA, may be a dedicated ASIC, may be a system-on-chip (SoC), may be a CPU, may be a network processor (networkprocessor, NP), may be a DSP, may be a microcontroller (micro controller unit, MCU), may be a programmable controller (programmable logic device, PLD) or other integrated chip. The processing module may be a processor of a system-on-chip. The transceiver module or communication interface may be an input-output interface or interface circuit of a system-on-chip. For example, the interface circuit may be a code/data read-write interface circuit. The interface circuit may be configured to receive code instructions (stored in a memory, readable directly from the memory, or readable from the memory via other means) and transmit them to a processor, which may be configured to execute the code instructions to perform the methods of the above-described method embodiments. For another example, the interface circuit may also be a signal transmission interface circuit between the communication processor and the transceiver.

The embodiment of the application also provides a communication system which comprises at least one terminal device and at least one network device. The terminal equipment is used for realizing the related functions of the communication method, and the network equipment is used for realizing the related functions of the communication method. The embodiment of the application also provides a computer readable storage medium, which comprises instructions, when the computer readable storage medium runs on a computer, the computer is caused to execute the method executed by the terminal equipment or the network equipment in the communication method.

The embodiment of the application also provides a computer program product, which comprises computer program code, wherein the computer program code is executed to enable a computer to execute the method executed by the terminal equipment or the network equipment in the communication method.

The embodiment of the application provides a chip system, which comprises a processor and can also comprise a memory, wherein the memory is used for realizing the functions of terminal equipment or network equipment in the communication method. The chip system may be formed of a chip or may include a chip and other discrete devices.

In order to realize the functions of the communication device of fig. 4 to fig. 5, the embodiment of the application further provides a chip, which includes a processor, and is configured to support the communication device to realize the functions related to the terminal device or the network device in the method embodiment. In one possible design, the chip is connected to a memory or the chip comprises a memory for holding the necessary computer programs or instructions and data for the communication device.

It should be understood that, in various embodiments of the present application, the sequence numbers of the foregoing processes do not mean the order of execution, and the order of execution of the processes should be determined by the functions and internal logic thereof, and should not constitute any limitation on the implementation process of the embodiments of the present application.

Those of ordinary skill in the art will appreciate that the various illustrative logical blocks (illustrative logical block) and steps (steps) described in connection with the embodiments disclosed herein can be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.

It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.

In the several embodiments provided by the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.

The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present application may be essentially contributing or part of the technical solution may be embodied in the form of a software product stored in a storage medium, comprising several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present application. The storage medium includes various media capable of storing program codes such as a U disk, a mobile hard disk, a ROM, a RAM, a magnetic disk or an optical disk.

It will be apparent to those skilled in the art that various modifications and variations can be made to the present application without departing from the scope of the application. Thus, it is intended that the present application also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.

Claims

1. A communication method, characterized in that it comprises:

A synchronization signal is generated, the synchronization signal being a signal obtained based on a first sequence;

Send the synchronization signal;

Wherein, the initial value of the first sequence belongs to the initial value set, and any two initial values in the initial value set are different.

2. The method as described in claim 1, characterized in that the elements in the first sequence satisfy a recurrence relation, the recurrence relation being in one-to-one correspondence with the primitive polynomial f(x), wherein the primitive polynomial f(x) satisfies: a _i ∈{0,1,2,M-1}, where M is a positive integer greater than 3, r is a positive integer, and the length of the first sequence is N = ^2r - 1.

3. The method as described in claim 1 or 2, wherein the first sequence is a _Z4 sequence.

4. The method according to any one of claims 1 to 3, characterized in that generating the synchronization signal comprises:

The synchronization signal is generated according to the second sequence, wherein the length of both the first and second sequences is L, and the elements d(n) of the second sequence and the elements x(m) of the first sequence satisfy: Where m = (n + c) mod L, A is a complex number, c is an integer, 0 ≤ n < L, 0 ≤ m < L, and x(m) = 0, 1, 2, or 3.

5. The method as described in claim 4, wherein generating the synchronization signal according to the second sequence comprises:

Generate the second sequence based on the first sequence;

Map the second sequence onto L subcarriers;

The synchronization signal is generated based on the second sequence mapped onto the L subcarriers.

6. The method as described in claim 4 or 5, wherein c is determined based on a first cell identifier, and/or the second sequence is associated with the first cell identifier, the first cell identifier belonging to a first cell identifier set.

7. The method as described in claim 6, wherein c belongs to the cyclic shift value set, and the number of elements in the first cell identifier set is equal to the product of the number of elements in the initial value set and the number of elements in the cyclic shift value set.

8. The method as described in claim 1, wherein any two initial values in the initial value set are identical after modulo 2.

9. The method according to any one of claims 1 to 8, characterized in that the length of the first sequence is 127, the recursive relationship of the first sequence is x(i+7) = mod(2·x(i+4) + 3·x(i+1) + x(i), 4) or x(i+7) = mod(x(i+4) + 2·x(i+2) + x(i), 4), the initial value of the first sequence [x(6), x(5), x(4), x(3), x(2), x(1), x(0)] belongs to the initial value set, the initial value set includes one or more of the following sequences: [1,0,0,0,0,0,0,0], [3,0,0,0,0,0,0], [1,0,0,0,2,2,2], [3,2,0,0,0,0,0], [1,2,2,2,0,0,0], [1,0,0,0,0,0,2]，[3,0,0,0,0,0,2]，[3,2,2,2,0,0,0]，[1,2,0,0,0,0,0]，[3,0,0,0,2,2,2]，[1,2,0,2,0,2,0]，[3,2,2,0,0,0,0]，[1,2,2,2,2,2,2]，[1,2,2,0,0,2 ,2]，[3,0,2,2,0,0,0]，[1,2,0,2,0,0,0]，[1,0,2,0,0,0,0]，[1,0,2,0,2,0,2]，[1,0,0,0,2,0,2]，[3,2,0,0,2,2,2]，[1,0,2,2,2,2,0]，[1,0,0,0,0,2,0]，[3,0,0,0, [0,2,0]，[3,2,2,2,0,0,2]，[3,2,0,0,0,0,2]，[3,0,0,0,2,2,0]，[1,0,0,0,0,2,2]，[3,0,0,0,0,2,2]，[1,0,0,0,2,2,0]，[1,2,0,0,0,0,2]，[1,2,2,2,0,0,2]，[3,2, 2,2,2,2,2]，[1,2,2,0,0,0,0]，[3,2,0,2,0,2,0]，[3,0,2,2,2,2,0]，[1,2,0,0,2,2,2]，[3,0,0,0,2,0,2]，[3,0,2,0,2,0,2]，[3,0,2,0,0,0,0]，[3,2,0,2,0,0,0]，[1 [0,2,2,0,0,0]，[3,2,2,0,0,2,2]，[1,0,0,2,0,2,2]，[1,0,0,2,0,0,0]，[1,2,0,2,2,0,2]，[1,0,2,2,0,0,2]，[3,2,2,0,2,0,2]，[3,2,0,0,2,2,0]，[3,0,2,0,2,2,2] ，[3,2,2,2,2,2,0]，[3,2,2,0,2,2,2]，[3,2,0,0,2,0,2]，[3,0,0,2,0,2,2]，[1,2,0,2,2,2,2]，[1,2,0,0,2,2,0]，[3,0,0,2,0,2,0]，[1,0,2,2,2,2,2]，[1,2,2,2,0,2 [,0]，[1,2,2,2,2,0,2]，[1,2,2,0,2,0,0]，[3,0,2,2,2,2,2]，[3,0,2,0,2,0,0]，[3,2,2,0,0,0,2]，[1,0,2,0,2,2,2]，[3,0,0,2,0,0,0]，[1,0,2,0,0,2,0]，[3,2,0,0] [0,2,2]，[1,0,0,0,2,0,0]，[3,0,2,0,0,2,2]，[3,2,2,0,2,0,0]，[3,0,0,0,2,0,0]，[3,2,2,2,0,2,2]，[3,2,0,0,0,2,0]，[1,2,0,0,0,2,0]，[1,2,2,2,0,2,2]，[1,0, 2,0,2,0,0]，[3,2,0,2,0,0,2]，[3,2,2,0,0,2,0]，[1,2,0,2,0,2,2]，[1,0,2,0,0,0,2]，[1,2,2,2,2,2,0]，[3,2,2,2,0,2,0]，[1,2,0,0,0,2,2]，[1,2,2,0,0,0,2]，[3 [0,2,2,0,0,2], [3,0,2,0,0,0,2], [3,2,0,2,0,2,2], [1,2,2,0,0,2,0], [1,2,0,2,0,0,2], [1,2,2,0,2,0,2], [3,2,0,2,2,0,2], [1,0,0,2,0,2,0], [1,0,2,0,0,2,2] ，[3,0,2,0,0,2,0]，[3,2,0,2,2,2,2]，[3,2,2,2,2,0,2]，[1,2,0,0,2,0,2]，[1,2,2,0,2,2,2]，[3,0,0,2,2,2,2]，[3,2,2,2,2,0,0]，[1,2,2,2,2,0,0]，[3,0,2,2,0] [2,0]，[1,2,2,0,2,2,0]，[3,2,0,0,2,0,0]，[3,0,2,2,2,0,2]，[1,0,0,2,2,0,0]，[1,2,0,2,2,2,0]，[3,0,0,2,2,0,2]，[3,0,0,2,0,0,2]，[1,0,0,2,2,2,2]，[3,2,0,2] [2,0,0]，[1,0,0,2,2,2,0]，[3,0,0,2,2,0,0]，[1,0,2,2,2,0,0]，[1,0,2,2,0,2,2]，[3,0,2,2,2,0,0]，[3,0,2,2,0,2,2]，[3,2,0,2,2,2,0]，[3,2,2,0,2,2,0]，[1,0, 0,2,0,0,2]，[1,2,0,0,2,0,0]，[1,0,2,2,2,0,2]，[3,0,2,0,2,2,0]，[1,2,0,2,2,0,0]，[1,0,2,0,2,2,0]，[1,0,0,2,2,0,2]，[3,0,0,2,2,2,0]，or[1,0,2,2,0,2,0].

10. The method according to any one of claims 1 to 8, characterized in that the length of the first sequence is 127, the recursive relationship of the first sequence is x(i+7) = mod(2·x(i+4) + 3·x(i+1) + x(i), 4) or x(i+7) = mod(x(i+4) + 2·x(i+2) + x(i), 4), the initial values of the first sequence [x(0), x(1), x(2), x(3), x(4), x(5), x(6)] belong to the initial value set, the initial value set includes one or more of the following sequences: [1,0,0,0,0,0,0,0], [3,0,0,0,0,0,0], [1,0,0,0,2,2,2], [3,2,0,0,0,0,0], [1,2,2,2,0,0,0] [1,0,0,0,0,0,2], [3,0,0,0,0,0,2], [3,2,2,2,0,0,0], [1,2,0,0,0,0,0], [3,0,0,0,2,2,2], [1,2,0,2,0,2,0], [3,2,2,0,0,0,0], [1,2,2,2,2,2,2], [1,2,2,0,0,2] ,2]，[3,0,2,2,0,0,0]，[1,2,0,2,0,0,0]，[1,0,2,0,0,0,0]，[1,0,2,0,2,0,2]，[1,0,0,0,2,0,2]，[3,2,0,0,2,2,2]，[1,0,2,2,2,2,0]，[1,0,0,0,0,2,0]，[3,0,0,0, [0,2,0]，[3,2,2,2,0,0,2]，[3,2,0,0,0,0,2]，[3,0,0,0,2,2,0]，[1,0,0,0,0,2,2]，[3,0,0,0,0,2,2]，[1,0,0,0,2,2,0]，[1,2,0,0,0,0,2]，[1,2,2,2,0,0,2]，[3,2, 2,2,2,2,2]，[1,2,2,0,0,0,0]，[3,2,0,2,0,2,0]，[3,0,2,2,2,2,0]，[1,2,0,0,2,2,2]，[3,0,0,0,2,0,2]，[3,0,2,0,2,0,2]，[3,0,2,0,0,0,0]，[3,2,0,2,0,0,0]，[1 [0,2,2,0,0,0]，[3,2,2,0,0,2,2]，[1,0,0,2,0,2,2]，[1,0,0,2,0,0,0]，[1,2,0,2,2,0,2]，[1,0,2,2,0,0,2]，[3,2,2,0,2,0,2]，[3,2,0,0,2,2,0]，[3,0,2,0,2,2,2] ，[3,2,2,2,2,2,0]，[3,2,2,0,2,2,2]，[3,2,0,0,2,0,2]，[3,0,0,2,0,2,2]，[1,2,0,2,2,2,2]，[1,2,0,0,2,2,0]，[3,0,0,2,0,2,0]，[1,0,2,2,2,2,2]，[1,2,2,2,0,2 [,0]，[1,2,2,2,2,0,2]，[1,2,2,0,2,0,0]，[3,0,2,2,2,2,2]，[3,0,2,0,2,0,0]，[3,2,2,0,0,0,2]，[1,0,2,0,2,2,2]，[3,0,0,2,0,0,0]，[1,0,2,0,0,2,0]，[3,2,0,0] [0,2,2]，[1,0,0,0,2,0,0]，[3,0,2,0,0,2,2]，[3,2,2,0,2,0,0]，[3,0,0,0,2,0,0]，[3,2,2,2,0,2,2]，[3,2,0,0,0,2,0]，[1,2,0,0,0,2,0]，[1,2,2,2,0,2,2]，[1,0, 2,0,2,0,0]，[3,2,0,2,0,0,2]，[3,2,2,0,0,2,0]，[1,2,0,2,0,2,2]，[1,0,2,0,0,0,2]，[1,2,2,2,2,2,0]，[3,2,2,2,0,2,0]，[1,2,0,0,0,2,2]，[1,2,2,0,0,0,2]，[3 ,0,2,2,0,0,2]，[3,0,2,0,0,0,2]，[3,2,0,2,0,2,2]，[1,2,2,0,0,2,0]，[1,2,0,2,0,0,2]，[1,2,2,0,2,0,2]，[3,2,0,2,2,0,2]，[1,0,0,2,0,2,0]，[1,0,2,0,0,2,2] ，[3,0,2,0,0,2,0]，[3,2,0,2,2,2,2]，[3,2,2,2,2,0,2]，[1,2,0,0,2,0,2]，[1,2,2,0,2,2,2]，[3,0,0,2,2,2,2]，[3,2,2,2,2,0,0]，[1,2,2,2,2,0,0]，[3,0,2,2,0,2 [,0]，[1,2,2,0,2,2,0]，[3,2,0,0,2,0,0]，[3,0,2,2,2,0,2]，[1,0,0,2,2,0,0]，[1,2,0,2,2,2,0]，[3,0,0,2,2,0,2]，[3,0,0,2,0,0,2]，[1,0,0,2,2,2,2]，[3,2,0,2, [2,0,0]，[1,0,0,2,2,2,0]，[3,0,0,2,2,0,0]，[1,0,2,2,2,0,0]，[1,0,2,2,0,2,2]，[3,0,2,2,2,0,0]，[3,0,2,2,0,2,2]，[3,2,0,2,2,2,0]，[3,2,2,0,2,2,0]，[1,0,0] ,2,0,0,2]，[1,2,0,0,2,0,0]，[1,0,2,2,2,0,2]，[3,0,2,0,2,2,0]，[1,2,0,2,2,0,0]，[1,0,2,0,2,2,0]，[1,0,0,2,2,0,2]，[3,0,0,2,2,2,0]，or，[1,0,2,2,0,2,0].

11. The method as described in claim 2, 9 or 10, wherein the length of the first sequence is 127, and the primitive polynomial of the first sequence is ^x₁₇ + ^2x₄ + x + 3 or ^x₁₇ + ^3x₄ + ^2x₂ + 3.

12. The method according to any one of claims 1 to 8, characterized in that the length of the first sequence is 255, the recursive relationship of the first sequence is x(i+8)＝mod(3·x(i+5)+x(i+3)+3·x(i+2)+2·x(i+1)+3·x(i),4), and the initial value of the first sequence is [x(7), x(6), x(5), x(4), x(3), x(2), x( 1), x(0)] belongs to the set of initial values, which includes one or more of the following sequences: [3,0,0,0,0,0,0,0], [1,0,0,0,0,0,0,0], [3,2,2,0,2,0,2,2], [3,2,0,0,0,0,0,0], [3,0,0,2,0,2,0,0], [3,0,0,0,0,0,0,2], [1,0, [0,0,0,0,0,2]，[1,0,0,2,0,2,0,0]，[1,2,0,0,0,0,0,0]，[1,2,2,0,2,0,2,2,2]，[3,2,0,2,0,2,0,2]，[1,0,2,0,0,0,0,0]，[3,2,2,2,2,2,2,2]，[3,0,2,0,2,2,0,0]，[3,2,0,2,0,2] [,0,0]，[1,2,0,0,0,0,0,2]，[1,2,2,0,0,0,0,0]，[3,0,2,0,2,0,2,0]，[1,2,2,2,0,2,2,2]，[3,0,2,0,2,2,2]，[3,0,0,2,2,0,2,0]，[3,0,0,0,0,0,2,0]，[1,0,0,0,0,0,2,0]，[ [1,0,0,2,0,2,0,2]，3,2,0,0,0,0,0,2]，[1,2,2,0,2,0,2,0]，[3,0,0,0,0,0,2,2]，[1,0,0,0,0,0,2,2]，[3,2,2,0,2,0,2,0]，[3,0,0,2,0,2,0,2]，[1,2,2,2,2,2,2,2]，[3,0,2,0] [0,0,0,0]，[1,2,0,2,0,2,0,2]，[1,0,0,2,2,0,2,0]，[1,0,2,0,2,0,2,2]，[3,2,2,2,0,2,2,2]，[1,0,2,0,2,0,2,0]，[3,2,2,0,0,0,0,0]，[1,2,0,2,0,2,0,0]，[1,0,2,0,2,2,0,0] ]，[1,0,0,2,2,2,0,0]，[1,2,0,2,0,0,0,0]，[3,0,2,2,2,0,0,0]，[1,2,0,2,0,2,2,2]，[3,0,2,0,0,2,0,2]，[3,2,2,2,0,0,0,0]，[3,2,2,2,0,0,0,2]，[3,0,2,2,0,0,2,0]，[1,2, [0,0,2,2,2,2]，[1,2,2,2,0,2,0,0]，[1,2,0,2,0,0,2,0]，[3,0,2,2,2,2,2,0]，[3,2,0,2,2,0,2,0]，[3,0,2,0,0,2,2,2]，[1,2,2,2,0,2,0,2]，[1,2,0,0,2,0,2,2]，[1,2,2,0,2,0] [,0,0]，[3,0,0,0,2,2,0,2]，[1,0,2,2,0,2,2,2]，[3,0,0,0,2,2,2,0]，[1,0,0,2,0,0,0,0]，[3,0,0,2,2,2,0,0]，[1,2,2,0,2,2,2,0]，[3,2,0,0,0,2,2,2]，[3,0,2,2,0,0,0,0]，[ 1,2,2,0,0,0,2,2]，[1,2,2,2,2,0,0,2]，[3,0,2,2,2,2,2,2]，[3,0,0,0,2,0,2,2]，[1,0,2,2,2,0,2,2]，[1,0,0,0,2,0,2,2]，[1,0,2,0,0,2,2,0]，[3,2,0,2,2,0,0,0]，[1,0,2,2 [0,2,0,0]，[3,2,2,0,2,2,0,0]，[3,2,2,2,0,0,2,0]，[1,0,0,0,0,2,0,0]，[3,0,0,0,0,2,0,0]，[3,2,0,0,0,0,2,0]，[1,0,0,2,0,2,2,2]，[1,0,0,0,0,2,0,2]，[3,0,0,0,0,2,0] 2]，[1,2,0,0,0,0,2,0]，[3,0,0,2,0,2,2,2]，[3,2,2,0,2,0,0,0]，[1,0,2,0,0,0,0,2]，[1,0,2,0,2,2,0,2]，[1,2,2,0,0,0,0,2]，[3,2,2,2,2,2,2,0]，[3,2,2,2,0,2,2,0]，[1,0 [0,2,2,0,2,2]，[1,0,0,0,0,2,2,0]，[3,0,0,0,0,2,2,0]，[3,2,0,0,0,0,2,2]，[3,0,0,2,0,2,2,0]，[3,2,2,0,2,0,0,2]，[1,0,0,0,0,2,2,2]，[3,0,0,0,0,2,2,2]，[1,2,0,0,0 [0,2,2]，[1,2,2,0,2,0,0,2]，[1,0,0,2,0,2,2,0]，[3,0,2,0,0,0,0,2]，[3,0,0,2,2,0,2,2]，[1,2,2,2,0,2,2,0]，[3,2,2,0,0,0,0,2]，[1,2,2,2,2,2,2,0]，[3,0,2,0,2,2,0,2]， [1,0,2,2,2,0,0,0]，[3,2,0,2,0,0,0,0]，[1,0,2,2,0,0,2,0]，[1,2,2,2,0,0,0,2]，[1,2,2,2,0,0,0,0]，[3,2,0,2,0,2,2,2]，[1,0,2,0,0,2,0,2]，[3,0,2,2,2,0,2,2]，[3,0,2] [0,0,2,2,0]，[1,2,2,2,0,0,2,0]，[1,2,2,0,2,2,0,0]，[3,0,2,2,0,2,0,0]，[1,2,0,2,2,0,0,0]，[1,0,0,0,2,2,2,0]，[3,0,0,2,0,0,0,0]，[3,2,2,2,2,0,0,2]，[1,0,2,2,2,2,2,2] 2]，[1,2,0,0,0,2,2,2]，[3,2,2,0,0,0,2,2]，[1,0,2,2,0,0,0,0]，[3,2,2,0,2,2,2,0]，[3,2,0,0,2,2,2,2]，[3,2,0,2,0,0,2,0]，[3,2,2,2,0,2,0,0]，[1,0,0,0,2,2,0,2]，[3,0 [2,2,0,2,2,2]，[3,2,2,2,0,2,0,2]，[3,2,0,0,2,0,2,2]，[1,0,2,2,2,2,2,0]，[1,0,2,0,0,2,2,2]，[1,2,0,2,2,0,2,0]，[3,2,0,0,2,2,2,0]，[1,0,2,2,0,0,0,2]，[3,0,2,2,0] [0,2,2]，[1,2,0,0,0,2,0,0]，[1,0,0,2,2,2,2,0]，[1,2,0,2,2,2,0,2]，[1,2,2,2,2,2,0,0]，[1,0,2,0,2,2,2,0]，[3,0,2,0,2,0,0,0]，[1,2,0,0,2,0,2,0]，[1,2,0,2,0,0,0,2]， [3,2,0,2,2,2,0,0]，[1,2,0,2,2,0,2,2]，[1,2,0,2,2,2,2,2]，[3,0,2,0,0,0,2,0]，[1,0,0,2,2,0,0,0]，[3,0,0,2,2,0,0,2]，[1,0,2,0,0,0,2,2]，[1,2,2,0,2,2,2,2]，[3,2,0 [0,2,0,0,0]，[3,0,2,2,0,2,2,0]，[1,2,0,0,0,2,2,0]，[1,0,2,2,2,0,0,2]，[1,2,0,0,2,2,0,2]，[3,0,2,2,2,2,0,0]，[1,2,0,0,0,2,0,2]，[1,2,0,2,2,2,0,0]，[3,2,0,2,0,0,2] ,2]，[3,0,2,0,0,2,0,0]，[1,0,2,2,2,2,0,0]，[1,2,2,0,2,2,0,2]，[3,0,2,0,2,2,2,0]，[3,0,0,2,2,2,2,2]，[1,2,2,2,2,0,2,2]，[3,2,0,0,0,2,2,0]，[1,2,2,0,0,2,2,0]，[3, 2,2,0,0,2,0,2]，[3,2,2,0,0,2,0,0]，[1,2,2,2,2,0,2,0]，[1,0,0,0,2,2,0,0]，[1,0,2,0,0,0,2,0]，[3,0,0,2,2,0,0,0]，[3,2,0,2,2,0,0,2]，[3,0,0,0,2,0,0,0]，[3,2,2,0,0 [2,2,0]，[3,2,2,2,2,2,0,0]，[3,2,2,2,2,0,0,0]，[1,0,0,0,2,0,0,0]，[3,2,0,0,2,0,0,2]，[1,0,2,0,2,0,0,0]，[1,0,0,2,0,0,0,2]，[1,0,2,0,2,2,2,2]，[1,0,2,0,0,2,0,0]， [1,0,0,2,2,2,2,2]，[3,0,0,2,2,2,2,0]，[1,2,2,0,0,2,2,2]，[1,0,0,0,2,0,2,0]，[3,0,2,2,0,0,0,2]，[3,2,0,0,2,2,0,0]，[1,0,2,2,0,2,0,2]，[3,0,0,0,2,0,2,0]，[1,2,2] [2,0,0,2,2]，[3,2,0,2,2,0,2,2]，[3,0,0,2,0,0,2,2]，[1,0,2,2,2,0,2,0]，[3,2,0,0,2,2,0,2]，[1,0,0,2,0,0,2,0]，[1,2,0,0,2,2,0,0]，[1,0,0,0,2,2,2,2]，[1,2,0,0,2,0,0] ,2]，[3,2,2,0,0,2,2,2]，[3,0,0,0,2,0,0,2]，[1,0,0,0,2,0,0,2]，[1,0,0,2,0,0,2,2]，[3,2,0,0,0,2,0,0]，[1,2,2,0,0,0,2,0]，[3,0,2,0,2,2,2,2]，[1,2,2,2,2,2,0,2]，[3, 2,2,0,2,2,0,2]，[3,2,0,0,0,2,0,2]，[3,0,0,2,0,0,2,0]，[3,2,2,0,0,0,2,0]，[1,0,0,2,2,0,0,2]，[3,2,2,2,2,2,0,2]，[1,0,0,2,2,2,0,2]，[3,0,2,2,2,0,0,2]，[3,0,0,2,2 ,2,0,2]，[1,2,2,2,2,0,0,0]，[3,0,2,2,0,2,0,2]，[3,0,2,2,2,0,2,0]，[3,0,0,0,2,2,2,2]，[1,2,0,2,0,2,2,0]，[3,2,0,0,2,0,2,0]，[1,2,0,2,2,0,0,2]，[3,0,0,0,2,2,0,0] ，[3,2,2,0,2,2,2,2]，[3,0,2,0,2,0,0,2]，[1,0,2,0,2,0,0,2]，[3,2,0,2,0,2,2,0]，[3,0,0,2,0,0,0,2]，[3,0,2,0,0,0,2,2]，[3,2,0,2,0,0,0,2]，[1,2,0,2,0,0,2,2]，[1,2,0 [0,2,2,2,0]，[3,2,2,2,0,0,2,2]，[1,0,2,2,0,0,2,2]，[1,0,2,2,0,2,2,0]，[3,2,0,2,2,2,0,2]，[1,2,0,0,2,0,0,0]，[3,2,0,2,2,2,2,2]，[1,2,2,0,0,2,0,2]，[1,2,2,0,0,2,2]，[1,2,2,0,0,2 0,0]，[3,2,2,2,2,0,2,2]，[3,2,2,2,2,0,2,0]，[3,2,0,2,2,2,2,0]，[3,0,2,2,2,2,0,2]，[1,2,0,2,2,2,2,0]，[1,0,2,2,2,2,0,2]，[3,2,0,2,0,2,0,0]，or，[1,2,2,0,2,0,0,2。

13. The method according to any one of claims 1 to 8, characterized in that the length of the first sequence is 255, the recursive relation of the first sequence is x(i+8)＝mod(3·x(i+5)+x(i+3)+3·x(i+2)+2·x(i+1)+3·x(i),4), and the initial value of the first sequence is [x(0), x(1), x(2), x(3), x(4), x(5)]. [x(6), x(7)] belongs to the set of initial values, which includes one or more of the following sequences: [3,0,0,0,0,0,0,0], [1,0,0,0,0,0,0,0], [3,2,2,0,2,0,2,2], [3,2,0,0,0,0,0,0], [3,0,0,2,0,2,0,0], [3,0,0,0,0,0,0,0] 2]，[1,0,0,0,0,0,0,2]，[1,0,0,2,0,2,0,0]，[1,2,0,0,0,0,0,0]，[1,2,2,0,2,0,2,2]，[3,2,0,2,0,2,0,2]，[1,0,2,0,0,0,0,0]，[3,2,2,2,2,2,2,2]，[3,0,2,0,2,2,0,0]， [3,2,0,2,0,2,0,0]，[1,2,0,0,0,0,0,2]，[1,2,2,0,0,0,0,0]，[3,0,2,0,2,0,2,0]，[1,2,2,2,0,2,2,2]，[3,0,2,0,2,0,2,2]，[3,0,0,2,2,0,2,0]，[3,0,0,0,0,0,2,0]，[1, [0,0,0,0,0,2,0]，[1,0,0,2,0,2,0,2]，[3,2,0,0,0,0,0,2]，[1,2,2,0,2,0,2,0]，[3,0,0,0,0,0,2,2]，[1,0,0,0,0,0,2,2]，[3,2,2,0,2,0,2,0]，[3,0,0,2,0,2,0,2]，[1,2,2 [2,2,2,2,2]，[3,0,2,0,0,0,0,0]，[1,2,0,2,0,2,0,2]，[1,0,0,2,2,0,2,0]，[1,0,2,0,2,0,2,2]，[3,2,2,2,0,2,2,2]，[1,0,2,0,2,0,2,0]，[3,2,2,0,0,0,0,0]，[1,2,0,2,2]，[3,2,2,0,0,0,0,0]，[1,2,0,2 [0,2,0,0]，[1,0,2,0,2,2,0,0]，[1,0,0,2,2,2,0,0]，[1,2,0,2,0,0,0,0]，[3,0,2,2,2,0,0,0]，[1,2,0,2,0,2,2,2]，[3,0,2,0,0,2,0,2]，[3,2,2,2,0,0,0,0]，[3,2,2,2,0,0] [,0,2]，[3,0,2,2,0,0,2,0]，[1,2,0,0,2,2,2,2]，[1,2,2,2,0,2,0,0]，[1,2,0,2,0,0,2,0]，[3,0,2,2,2,2,2,0]，[3,2,0,2,2,0,2,0]，[3,0,2,0,0,2,2,2]，[1,2,2,2,0,2,0,2] ]，[1,2,0,0,2,0,2,2]，[1,2,2,0,2,0,0,0]，[3,0,0,0,2,2,0,2]，[1,0,2,2,0,2,2,2]，[3,0,0,0,2,2,2,0]，[1,0,0,2,0,0,0,0]，[3,0,0,2,2,2,0,0]，[1,2,2,0,2,2,2,0]，[ 3,2,0,0,0,2,2,2],[3,0,2,2,0,0,0,0],[1,2,2,0,0,0,2,2],[1,2,2,2,2,0,0,2],[3,0,2,2,2,2,2,2],[3,0,0,0,2,0,2,2],[1,0,2,2,2,0,2,2],[1,0,0,0,2,0,2,2],[1,0 [2,0,0,2,2,0]，[3,2,0,2,2,0,0,0]，[1,0,2,2,0,2,0,0]，[3,2,2,0,2,2,0,0]，[3,2,2,2,0,0,2,0]，[1,0,0,0,0,2,0,0]，[3,0,0,0,0,2,0,0]，[3,2,0,0,0,0,2,0]，[1,0,0, [2,0,2,2,2]，[1,0,0,0,0,2,0,2]，[3,0,0,0,0,2,0,2]，[1,2,0,0,0,0,2,0]，[3,0,0,2,0,2,2,2]，[3,2,2,0,2,0,0,0]，[1,0,2,0,0,0,0,2]，[1,0,2,0,2,2,0,2]，[1,2,2,0,0] [0,0,2]，[3,2,2,2,2,2,2,0]，[3,2,2,2,0,2,2,0]，[1,0,0,2,2,0,2,2]，[1,0,0,0,0,2,2,0]，[3,0,0,0,0,2,2,0]，[3,2,0,0,0,0,2,2]，[3,0,0,2,0,2,2,0]，[3,2,2,0,2,0,0] [,2]，[1,0,0,0,0,2,2,2]，[3,0,0,0,0,2,2,2]，[1,2,0,0,0,0,2,2]，[1,2,2,0,2,0,0,2]，[1,0,0,2,0,2,2,0]，[3,0,2,0,2,2,0,2]，[1,0,2,2,2,0,0,0]，[3,2,0,2,0,0,0,0] ，[1,0,2,2,0,0,2,0]，[1,2,2,2,0,0,0,2]，[1,2,2,2,0,0,0,0]，[3,2,0,2,0,2,2,2]，[1,0,2,0,0,2,0,2]，[3,0,2,2,2,0,2,2]，[3,0,2,0,0,2,2,0]，[1,2,2,2,0,0,2,0]，[1 [2,2,0,2,2,0,0]，[3,0,2,2,0,2,0,0]，[1,2,0,2,2,0,0,0]，[1,0,0,0,2,2,2,0]，[3,0,0,2,0,0,0,0]，[3,2,2,2,2,0,0,2]，[1,0,2,2,2,2,2,2]，[1,2,0,0,0,2,2,2]，[3,2,2 [0,0,0,2,2]，[1,0,2,2,0,0,0,0]，[3,2,2,0,2,2,2,0]，[3,2,0,0,2,2,2,2]，[3,2,0,2,0,0,2,0]，[3,2,2,2,0,2,0,0]，[1,0,0,0,2,2,0,2]，[3,0,2,2,0,2,2,2]，[3,2,2,2,2] [0,2,0,2]，[3,2,0,0,2,0,2,2]，[1,0,2,2,2,2,2,0]，[1,0,2,0,0,2,2,2]，[1,2,0,2,2,0,2,0]，[3,2,0,0,2,2,2,0]，[1,0,2,2,0,0,0,2]，[3,0,2,2,0,0,2,2]，[1,2,0,0,0,2] [0,0]，[1,0,0,2,2,2,2,0]，[1,2,0,2,2,2,0,2]，[1,2,2,2,2,2,0,0]，[1,0,2,0,2,2,2,0]，[3,0,2,0,2,0,0,0]，[1,2,0,0,2,0,2,0]，[1,2,0,2,0,0,0,2]，[3,2,0,2,2,2,0] [0]，[1,2,0,2,2,0,2,2]，[1,2,0,2,2,2,2,2]，[3,0,2,0,0,0,2,0]，[1,0,0,2,2,0,0,0]，[3,0,0,2,2,0,0,2]，[1,0,2,0,0,0,2,2]，[1,2,2,0,2,2,2,2]，[3,2,0,0,2,0,0,0]， [3,0,2,2,0,2,2,0]，[1,2,0,0,0,2,2,0]，[1,0,2,2,2,0,0,2]，[1,2,0,0,2,2,0,2]，[3,0,2,2,2,2,0,0]，[1,2,0,0,0,2,0,2]，[1,2,0,2,2,2,0,0]，[3,2,0,2,0,0,2,2]，[3, [0,2,0,0,2,0,0]，[1,0,2,2,2,2,0,0]，[1,2,2,0,2,2,0,2]，[3,0,2,0,2,2,2,0]，[3,0,0,2,2,2,2,2]，[1,2,2,2,2,0,2,2]，[3,2,0,0,0,2,2,0]，[1,2,2,0,0,2,2,0]，[3,2,2 [0,0,2,0,2]，[3,2,2,0,0,2,0,0]，[1,2,2,2,2,0,2,0]，[1,0,0,0,2,2,0,0]，[1,0,2,0,0,0,2,0]，[3,0,0,2,2,0,0,0]，[3,2,0,2,2,0,0,2]，[3,0,0,0,2,0,0,0]，[3,2,2,0 [0,2,2,0]，[3,2,2,2,2,2,0,0]，[3,2,2,2,2,0,0,0]，[1,0,0,0,2,0,0,0]，[3,2,0,0,2,0,0,2]，[1,0,2,0,2,0,0,0]，[1,0,0,2,0,0,0,2]，[1,0,2,0,2,2,2,2]，[1,0,2,0,0,2] [0,0]，[1,0,0,2,2,2,2,2]，[3,0,0,2,2,2,2,0]，[1,2,2,0,0,2,2,2]，[1,0,0,0,2,0,2,0]，[3,0,2,2,0,0,0,2]，[3,2,0,0,2,2,0,0]，[1,0,2,2,0,2,0,2]，[3,0,0,0,2,0,2,0] ]，[1,2,2,2,0,0,2,2]，[3,2,0,2,2,0,2,2]，[3,0,0,2,0,0,2,2]，[1,0,2,2,2,0,2,0]，[3,2,0,0,2,2,0,2]，[1,0,0,2,0,0,2,0]，[1,2,0,0,2,2,0,0]，[1,0,0,0,2,2,2,2]，[ 1,2,0,0,2,0,0,2]，[3,2,2,0,0,2,2,2]，[3,0,0,0,2,0,0,2]，[1,0,0,0,2,0,0,2]，[1,0,0,2,0,0,2,2]，[3,2,0,0,0,2,0,0]，[1,2,2,0,0,0,2,0]，[3,0,2,0,2,2,2,2]，[1,2 [2,2,2,2,0,2]，[3,2,2,0,2,2,0,2]，[3,2,0,0,0,2,0,2]，[3,0,0,2,0,0,2,0]，[3,2,2,0,0,0,2,0]，[1,0,0,2,2,0,0,2]，[3,2,2,2,2,2,0,2]，[1,0,0,2,2,2,0,2]，[3,0,2,2 [2,0,0,2]，[3,0,0,2,2,2,0,2]，[1,2,2,2,2,0,0,0]，[3,0,2,2,0,2,0,2]，[3,0,2,2,2,0,2,0]，[3,0,0,0,2,2,2,2]，[1,2,0,2,0,2,2,0]，[3,2,0,0,2,0,2,0]，[1,2,0,2,2,2]，[1,2,0,2,2,2,2]，[3,2,0,0,2,0,2,0]，[1,2,0,2,2,2] [0,0,2]，[3,0,0,0,2,2,0,0]，[3,2,2,0,2,2,2,2]，[3,0,2,0,2,0,0,2]，[1,0,2,0,2,0,0,2]，[3,2,0,2,0,2,2,0]，[3,0,0,2,0,0,0,2]，[3,0,2,0,0,0,2,2]，[3,2,0,2,0,0,0] ,2]，[1,2,0,2,0,0,2,2]，[1,2,0,0,2,2,2,0]，[3,2,2,2,0,0,2,2]，[1,0,2,2,0,0,2,2]，[1,0,2,2,0,2,2,0]，[3,2,0,2,2,2,0,2]，[1,2,0,0,2,0,0,0]，[3,2,0,2,2,2,2,2] ，[1,2,2,0,0,2,0,2]，[1,2,2,0,0,2,0,0]，[3,2,2,2,2,0,2,2]，[3,2,2,2,2,0,2,0]，[3,2,0,2,2,2,2,0]，[3,0,2,2,2,2,0,2]，[1,2,0,2,2,2,2,0]，or，[1,0,2,2,2,2,2,0,2。

14. The method as described in claim 2, 12 or 13, wherein the length of the first sequence is 255, and the primitive polynomial of the first sequence is ^x⁸ + ^x⁵ + ^3x³ + ^x² + 2x + 1.

15. The method according to any one of claims 1 to 14, characterized in that the length of the first sequence is L, c is p × ID, the value range of ID is [0, K-1], K is a positive integer, and p satisfies:

p = floor(L/K), where floor is the floor function, or...

p = ceil(L/K), where ceil is the floor function; or,

p = round(L/K), where round is the rounding function to the nearest integer.

16. A communication method, characterized in that it comprises:

A synchronization signal is detected, the synchronization signal being a signal obtained based on a first sequence;

17. The method of claim 16, wherein detecting the synchronization signal comprises: detecting the synchronization signal in mode one, mode two, mode three, or mode four;

The first method includes: acquiring the first sequence, processing the received signal according to the first sequence, and detecting the synchronization signal;

The second method includes: acquiring a first sequence, generating a second sequence based on the first sequence, and processing the received signal based on the second sequence to detect the synchronization signal;

The third method includes: acquiring a second sequence, processing the received signal according to the second sequence to detect the synchronization signal, wherein the second sequence is generated based on the first sequence;

Method four includes: processing the received signal according to a sequence in a synchronization sequence set to detect the synchronization signal, wherein the sequence in the synchronization sequence set includes a second sequence, which is a sequence obtained based on the first sequence.

18. The method of claim 17, wherein processing the received signal according to the second sequence comprises:

The received signal is subjected to correlation processing according to the second sequence.

19. The method according to any one of claims 16 to 18, characterized in that the elements in the first sequence satisfy a recurrence relation, the recurrence relation corresponding one-to-one with the primitive polynomial, and the primitive polynomial f(x) satisfies: a _i ∈{0,1,2,M-1}, where M is a positive integer greater than 3, r is a positive integer, and the length of the first sequence is N = ^2r - 1.

20. The method according to any one of claims 16 to 19, wherein the first sequence is a _Z4 sequence.

21. The method according to any one of claims 17 to 20, characterized in that the length of both the first sequence and the second sequence is L, and the elements d(n) of the second sequence and the elements x(m) of the first sequence satisfy:

Where m = (n + c) mod L, A is a complex number, c is an integer, 0 ≤ n < L, 0 ≤ m < L, and x(m) = 0, 1, 2, or 3.

22. The method of claim 21, wherein c is determined based on a first cell identifier, and/or the second sequence is associated with the first cell identifier, the first cell identifier belonging to a first cell identifier set.

23. The method as described in claim 22, wherein c belongs to the cyclic shift value set, and the number of elements in the first cell identifier set is equal to the product of the number of elements in the initial value set and the number of elements in the cyclic shift value set.

24. The method according to any one of claims 16 to 23, wherein any two initial values in the set of initial values are the same after modulo 2.

25. The method according to any one of claims 16 to 24, characterized in that the length of the first sequence is 127, the recursive relationship of the first sequence is x(i+7) = mod(2·x(i+4) + 3·x(i+1) + x(i), 4) or x(i+7) = mod(x(i+4) + 2·x(i+2) + x(i), 4), the initial value of the first sequence [x(6), x(5), x(4), x(3), x(2), x(1), x(0)] belongs to the initial value set, the initial value set includes one or more of the following sequences: [1,0,0,0,0,0,0,0], [3,0,0,0,0,0,0], [1,0,0,0,2,2,2], [3,2,0,0,0,0,0], [1,2,2,2,0,0, [0]，[1,0,0,0,0,0,2]，[3,0,0,0,0,0,2]，[3,2,2,2,0,0,0]，[1,2,0,0,0,0,0]，[3,0,0,0,2,2,2]，[1,2,0,2,0,2,0]，[3,2,2,0,0,0,0]，[1,2,2,2,2,2,2]，[1,2,2,0,0] [2,2]，[3,0,2,2,0,0,0]，[1,2,0,2,0,0,0]，[1,0,2,0,0,0,0]，[1,0,2,0,2,0,2]，[1,0,0,0,2,0,2]，[3,2,0,0,2,2,2]，[1,0,2,2,2,2,0]，[1,0,0,0,0,2,0]，[3,0,0, [0,0,2,0]，[3,2,2,2,0,0,2]，[3,2,0,0,0,0,2]，[3,0,0,0,2,2,0]，[1,0,0,0,0,2,2]，[3,0,0,0,0,2,2]，[1,0,0,0,2,2,0]，[1,2,0,0,0,0,2]，[1,2,2,2,0,0,2]，[3,2 ,2,2,2,2,2]，[1,2,2,0,0,0,0]，[3,2,0,2,0,2,0]，[3,0,2,2,2,2,0]，[1,2,0,0,2,2,2]，[3,0,0,0,2,0,2]，[3,0,2,0,2,0,2]，[3,0,2,0,0,0,0]，[3,2,0,2,0,0,0]，[ [1,0,2,2,0,0,0]，[3,2,2,0,0,2,2]，[1,0,0,2,0,2,2]，[1,0,0,2,0,0,0]，[1,2,0,2,2,0,2]，[1,0,2,2,0,0,2]，[3,2,2,0,2,0,2]，[3,2,0,0,2,2,0]，[3,0,2,0,2,2,2] ]，[3,2,2,2,2,2,0]，[3,2,2,0,2,2,2]，[3,2,0,0,2,0,2]，[3,0,0,2,0,2,2]，[1,2,0,2,2,2,2]，[1,2,0,0,2,2,0]，[3,0,0,2,0,2,0]，[1,0,2,2,2,2,2]，[1,2,2,2,0 2,0]，[1,2,2,2,2,0,2]，[1,2,2,0,2,0,0]，[3,0,2,2,2,2,2]，[3,0,2,0,2,0,0]，[3,2,2,0,0,0,2]，[1,0,2,0,2,2,2]，[3,0,0,2,0,0,0]，[1,0,2,0,0,2,0]，[3,2,0 [0,0,2,2]，[1,0,0,0,2,0,0]，[3,0,2,0,0,2,2]，[3,2,2,0,2,0,0]，[3,0,0,0,2,0,0]，[3,2,2,2,0,2,2]，[3,2,0,0,0,2,0]，[1,2,0,0,0,2,0]，[1,2,2,2,0,2,2]，[1,0 [2,0,2,0,0]，[3,2,0,2,0,0,2]，[3,2,2,0,0,2,0]，[1,2,0,2,0,2,2]，[1,0,2,0,0,0,2]，[1,2,2,2,2,2,0]，[3,2,2,2,0,2,0]，[1,2,0,0,0,2,2]，[1,2,2,0,0,0,2]，[ 3,0,2,2,0,0,2]，[3,0,2,0,0,0,2]，[3,2,0,2,0,2,2]，[1,2,2,0,0,2,0]，[1,2,0,2,0,0,2]，[1,2,2,0,2,0,2]，[3,2,0,2,2,0,2]，[1,0,0,2,0,2,0]，[1,0,2,0,0,2,2 ]，[3,0,2,0,0,2,0]，[3,2,0,2,2,2,2]，[3,2,2,2,2,0,2]，[1,2,0,0,2,0,2]，[1,2,2,0,2,2,2]，[3,0,0,2,2,2,2]，[3,2,2,2,2,0,0]，[1,2,2,2,2,0,0]，[3,0,2,2,0 [2,0]，[1,2,2,0,2,2,0]，[3,2,0,0,2,0,0]，[3,0,2,2,2,0,2]，[1,0,0,2,2,0,0]，[1,2,0,2,2,2,0]，[3,0,0,2,2,0,2]，[3,0,0,2,0,0,2]，[1,0,0,2,2,2,2]，[3,2,0,2] [2,0,0]，[1,0,0,2,2,2,0]，[3,0,0,2,2,0,0]，[1,0,2,2,2,0,0]，[1,0,2,2,0,2,2]，[3,0,2,2,2,0,0]，[3,0,2,2,0,2,2]，[3,2,0,2,2,2,0]，[3,2,2,0,2,2,0]，[1,0, 0,2,0,0,2]，[1,2,0,0,2,0,0]，[1,0,2,2,2,0,2]，[3,0,2,0,2,2,0]，[1,2,0,2,2,0,0]，[1,0,2,0,2,2,0]，[1,0,0,2,2,0,2]，[3,0,0,2,2,2,0]，or[1,0,2,2,0,2,0].

26. The method according to any one of claims 16 to 24, characterized in that the length of the first sequence is 127, the recursive relationship of the first sequence is x(i+7) = mod(2·x(i+4) + 3·x(i+1) + x(i), 4) or x(i+7) = mod(x(i+4) + 2·x(i+2) + x(i), 4), the initial values of the first sequence [x(0), x(1), x(2), x(3), x(4), x(5), x(6)] belong to the initial value set, the initial value set includes one or more sequences as follows: [1,0,0,0,0,0,0,0], [3,0,0,0,0,0,0], [1,0,0,0,2,2,2], [3,2,0,0,0,0,0], [1,2,2,2,0,0, [0]，[1,0,0,0,0,0,2]，[3,0,0,0,0,0,2]，[3,2,2,2,0,0,0]，[1,2,0,0,0,0,0]，[3,0,0,0,2,2,2]，[1,2,0,2,0,2,0]，[3,2,2,0,0,0,0]，[1,2,2,2,2,2,2]，[1,2,2,0,0] [2,2]，[3,0,2,2,0,0,0]，[1,2,0,2,0,0,0]，[1,0,2,0,0,0,0]，[1,0,2,0,2,0,2]，[1,0,0,0,2,0,2]，[3,2,0,0,2,2,2]，[1,0,2,2,2,2,0]，[1,0,0,0,0,2,0]，[3,0,0, [0,0,2,0]，[3,2,2,2,0,0,2]，[3,2,0,0,0,0,2]，[3,0,0,0,2,2,0]，[1,0,0,0,0,2,2]，[3,0,0,0,0,2,2]，[1,0,0,0,2,2,0]，[1,2,0,0,0,0,2]，[1,2,2,2,0,0,2]，[3,2 ,2,2,2,2,2]，[1,2,2,0,0,0,0]，[3,2,0,2,0,2,0]，[3,0,2,2,2,2,0]，[1,2,0,0,2,2,2]，[3,0,0,0,2,0,2]，[3,0,2,0,2,0,2]，[3,0,2,0,0,0,0]，[3,2,0,2,0,0,0]，[ [1,0,2,2,0,0,0]，[3,2,2,0,0,2,2]，[1,0,0,2,0,2,2]，[1,0,0,2,0,0,0]，[1,2,0,2,2,0,2]，[1,0,2,2,0,0,2]，[3,2,2,0,2,0,2]，[3,2,0,0,2,2,0]，[3,0,2,0,2,2,2] ]，[3,2,2,2,2,2,0]，[3,2,2,0,2,2,2]，[3,2,0,0,2,0,2]，[3,0,0,2,0,2,2]，[1,2,0,2,2,2,2]，[1,2,0,0,2,2,0]，[3,0,0,2,0,2,0]，[1,0,2,2,2,2,2]，[1,2,2,2,0 2,0]，[1,2,2,2,2,0,2]，[1,2,2,0,2,0,0]，[3,0,2,2,2,2,2]，[3,0,2,0,2,0,0]，[3,2,2,0,0,0,2]，[1,0,2,0,2,2,2]，[3,0,0,2,0,0,0]，[1,0,2,0,0,2,0]，[3,2,0,0 [0,2,2]，[1,0,0,0,2,0,0]，[3,0,2,0,0,2,2]，[3,2,2,0,2,0,0]，[3,0,0,0,2,0,0]，[3,2,2,2,0,2,2]，[3,2,0,0,0,2,0]，[1,2,0,0,0,2,0]，[1,2,2,2,0,2,2]，[1,0, 2,0,2,0,0]，[3,2,0,2,0,0,2]，[3,2,2,0,0,2,0]，[1,2,0,2,0,2,2]，[1,0,2,0,0,0,2]，[1,2,2,2,2,2,0]，[3,2,2,2,0,2,0]，[1,2,0,0,0,2,2]，[1,2,2,0,0,0,2]，[3 ,0,2,2,0,0,2]，[3,0,2,0,0,0,2]，[3,2,0,2,0,2,2]，[1,2,2,0,0,2,0]，[1,2,0,2,0,0,2]，[1,2,2,0,2,0,2]，[3,2,0,2,2,0,2]，[1,0,0,2,0,2,0]，[1,0,2,0,0,2,2] ，[3,0,2,0,0,2,0]，[3,2,0,2,2,2,2]，[3,2,2,2,2,0,2]，[1,2,0,0,2,0,2]，[1,2,2,0,2,2,2]，[3,0,0,2,2,2,2]，[3,2,2,2,2,0,0]，[1,2,2,2,2,0,0]，[3,0,2,2,0,2 [,0]，[1,2,2,0,2,2,0]，[3,2,0,0,2,0,0]，[3,0,2,2,2,0,2]，[1,0,0,2,2,0,0]，[1,2,0,2,2,2,0]，[3,0,0,2,2,0,2]，[3,0,0,2,0,0,2]，[1,0,0,2,2,2,2]，[3,2,0,2, [2,0,0]，[1,0,0,2,2,2,0]，[3,0,0,2,2,0,0]，[1,0,2,2,2,0,0]，[1,0,2,2,0,2,2]，[3,0,2,2,2,0,0]，[3,0,2,2,0,2,2]，[3,2,0,2,2,2,0]，[3,2,2,0,2,2,0]，[1,0,0] ,2,0,0,2]，[1,2,0,0,2,0,0]，[1,0,2,2,2,0,2]，[3,0,2,0,2,2,0]，[1,2,0,2,2,0,0]，[1,0,2,0,2,2,0]，[1,0,0,2,2,0,2]，[3,0,0,2,2,2,0]，or，[1,0,2,2,0,2,0].

27. The method as described in claim 20, 25 or 26, wherein the length of the first sequence is 127, and the primitive polynomial of the first sequence is ^x₁₇ + ^2x₄ + x + 3 or ^x₁₇ + ^3x₄ + 2x₂ + ³ .

28. The method according to any one of claims 16 to 24, characterized in that the length of the first sequence is 255, the recursive relation of the first sequence is x(i+8)＝mod(3·x(i+5)+x(i+3)+3·x(i+2)+2·x(i+1)+3·x(i),4), and the initial value of the first sequence is [x(7), x(6), x(5), x(4), x(3), x(2), x(1), x(0)] belong to the initial value set, which includes one or more of the following sequences: [3,0,0,0,0,0,0,0], [1,0,0,0,0,0,0,0], [3,2,2,0,2,0,2,2], [3,2,0,0,0,0,0,0], [3,0,0,2,0,2,0,0], [3,0,0,0,0,0,0,2], [1, [0,0,0,0,0,0,2]，[1,0,0,2,0,2,0,0]，[1,2,0,0,0,0,0,0]，[1,2,2,0,2,0,2,2,2]，[3,2,0,2,0,2,0,2]，[1,0,2,0,0,0,0,0]，[3,2,2,2,2,2,2,2]，[3,0,2,0,2,2,0,0]，[3,2,0,2,0] [2,0,0], [1,2,0,0,0,0,0,2], [1,2,2,0,0,0,0,0], [3,0,2,0,2,0,2,0], [1,2,2,2,0,2,2,2], [3,0,2,0,2,2,2], [3,0,0,2,2,0,2,0], [3,0,0,0,0,0,2,0], [1,0,0,0,0,0,2,0] ，[1,0,0,2,0,2,0,2]，3,2,0,0,0,0,0,2]，[1,2,2,0,2,0,2,0]，[3,0,0,0,0,0,2,2]，[1,0,0,0,0,0,2,2]，[3,2,2,0,2,0,2,0]，[3,0,0,2,0,2,0,2]，[1,2,2,2,2,2,2,2]，[3,0,2 [0,0,0,0,0]，[1,2,0,2,0,2,0,2]，[1,0,0,2,2,0,2,0]，[1,0,2,0,2,0,2,2]，[3,2,2,2,0,2,2,2]，[1,0,2,0,2,0,2,0]，[3,2,2,0,0,0,0,0]，[1,2,0,2,0,2,0,0]，[1,0,2,0,2,2,0] ,0]，[1,0,0,2,2,2,0,0]，[1,2,0,2,0,0,0,0]，[3,0,2,2,2,0,0,0]，[1,2,0,2,0,2,2,2]，[3,0,2,0,0,2,0,2]，[3,2,2,2,0,0,0,0]，[3,2,2,2,0,0,0,2]，[3,0,2,2,0,0,2,0]，[1, 2,0,0,2,2,2,2]，[1,2,2,2,0,2,0,0]，[1,2,0,2,0,0,2,0]，[3,0,2,2,2,2,2,0]，[3,2,0,2,2,0,2,0]，[3,0,2,0,0,2,2,2]，[1,2,2,2,0,2,0,2]，[1,2,0,0,2,0,2,2]，[1,2,2,0,2] [0,0,0]，[3,0,0,0,2,2,0,2]，[1,0,2,2,0,2,2,2]，[3,0,0,0,2,2,2,0]，[1,0,0,2,0,0,0,0]，[3,0,0,2,2,2,0,0]，[1,2,2,0,2,2,2,0]，[3,2,0,0,0,2,2,2]，[3,0,2,2,0,0,0,0]， [1,2,2,0,0,0,2,2]，[1,2,2,2,2,0,0,2]，[3,0,2,2,2,2,2,2]，[3,0,0,0,2,0,2,2]，[1,0,2,2,2,0,2,2]，[1,0,0,0,2,0,2,2]，[1,0,2,0,0,2,2,0]，[3,2,0,2,2,0,0,0]，[1,0,2 [2,0,2,0,0]，[3,2,2,0,2,2,0,0]，[3,2,2,2,0,0,2,0]，[1,0,0,0,0,2,0,0]，[3,0,0,0,0,2,0,0]，[3,2,0,0,0,0,2,0]，[1,0,0,2,0,2,2,2]，[1,0,0,0,0,2,0,2]，[3,0,0,0,0,2,0] ,2]，[1,2,0,0,0,0,2,0]，[3,0,0,2,0,2,2,2]，[3,2,2,0,2,0,0,0]，[1,0,2,0,0,0,0,2]，[1,0,2,0,2,2,0,2]，[1,2,2,0,0,0,0,2]，[3,2,2,2,2,2,2,0]，[3,2,2,2,0,2,2,0]，[1, [0,0,2,2,0,2,2]，[1,0,0,0,0,2,2,0]，[3,0,0,0,0,2,2,0]，[3,2,0,0,0,0,2,2]，[3,0,0,2,0,2,2,0]，[3,2,2,0,2,0,0,2]，[1,0,0,0,0,2,2,2]，[3,0,0,0,0,2,2,2]，[1,2,0,0,0] [0,2,2]，[1,2,2,0,2,0,0,2]，[1,0,0,2,0,2,2,0]，[3,0,2,0,0,0,0,2]，[3,0,0,2,2,0,2,2]，[1,2,2,2,0,2,2,0]，[3,2,2,0,0,0,0,2]，[1,2,2,2,2,2,2,0]，[3,0,2,0,2,2,2,0,2] ，[1,0,2,2,2,0,0,0]，[3,2,0,2,0,0,0,0]，[1,0,2,2,0,0,2,0]，[1,2,2,2,0,0,0,2]，[1,2,2,2,0,0,0,0]，[3,2,0,2,0,2,2,2]，[1,0,2,0,0,2,0,2]，[3,0,2,2,2,0,2,2]，[3,0,2 [0,0,2,2,0]，[1,2,2,2,0,0,2,0]，[1,2,2,0,2,2,0,0]，[3,0,2,2,0,2,0,0]，[1,2,0,2,2,0,0,0]，[1,0,0,0,2,2,2,0]，[3,0,0,2,0,0,0,0]，[3,2,2,2,2,0,0,2]，[1,0,2,2,2,2,2] ,2]，[1,2,0,0,0,2,2,2]，[3,2,2,0,0,0,2,2]，[1,0,2,2,0,0,0,0]，[3,2,2,0,2,2,2,0]，[3,2,0,0,2,2,2,2]，[3,2,0,2,0,0,2,0]，[3,2,2,2,0,2,0,0]，[1,0,0,0,2,2,0,2]，[3, [0,2,2,0,2,2,2]，[3,2,2,2,0,2,0,2]，[3,2,0,0,2,0,2,2]，[1,0,2,2,2,2,2,0]，[1,0,2,0,0,2,2,2]，[1,2,0,2,2,0,2,0]，[3,2,0,0,2,2,2,0]，[1,0,2,2,0,0,0,2]，[3,0,2,2,0] ,0,2,2]，[1,2,0,0,0,2,0,0]，[1,0,0,2,2,2,2,0]，[1,2,0,2,2,2,0,2]，[1,2,2,2,2,2,0,0]，[1,0,2,0,2,2,2,0]，[3,0,2,0,2,0,0,0]，[1,2,0,0,2,0,2,0]，[1,2,0,2,0,0,0,2] ，[3,2,0,2,2,2,0,0]，[1,2,0,2,2,0,2,2]，[1,2,0,2,2,2,2,2]，[3,0,2,0,0,0,2,0]，[1,0,0,2,2,0,0,0]，[3,0,0,2,2,0,0,2]，[1,0,2,0,0,0,2,2]，[1,2,2,0,2,2,2,2]，[3,2,0 [0,2,0,0,0]，[3,0,2,2,0,2,2,0]，[1,2,0,0,0,2,2,0]，[1,0,2,2,2,0,0,2]，[1,2,0,0,2,2,0,2]，[3,0,2,2,2,2,0,0]，[1,2,0,0,0,2,0,2]，[1,2,0,2,2,2,0,0]，[3,2,0,2,0,0] 2,2]，[3,0,2,0,0,2,0,0]，[1,0,2,2,2,2,0,0]，[1,2,2,0,2,2,0,2]，[3,0,2,0,2,2,2,0]，[3,0,0,2,2,2,2,2]，[1,2,2,2,2,0,2,2]，[3,2,0,0,0,2,2,0]，[1,2,2,0,0,2,2,0]，[3 [2,2,0,0,2,0,2]，[3,2,2,0,0,2,0,0]，[1,2,2,2,2,0,2,0]，[1,0,0,0,2,2,0,0]，[1,0,2,0,0,0,2,0]，[3,0,0,2,2,0,0,0]，[3,2,0,2,2,0,0,2]，[3,0,0,0,2,0,0,0]，[3,2,2,0 [0,2,2,0]，[3,2,2,2,2,2,0,0]，[3,2,2,2,2,0,0,0]，[1,0,0,0,2,0,0,0]，[3,2,0,0,2,0,0,2]，[1,0,2,0,2,0,0,0]，[1,0,0,2,0,0,0,2]，[1,0,2,0,2,2,2,2]，[1,0,2,0,0,2,0,0] ，[1,0,0,2,2,2,2,2]，[3,0,0,2,2,2,2,0]，[1,2,2,0,0,2,2,2]，[1,0,0,0,2,0,2,0]，[3,0,2,2,0,0,0,2]，[3,2,0,0,2,2,0,0]，[1,0,2,2,0,2,0,2]，[3,0,0,0,2,0,2,0]，[1,2,2 [2,0,0,2,2]，[3,2,0,2,2,0,2,2]，[3,0,0,2,0,0,2,2]，[1,0,2,2,2,0,2,0]，[3,2,0,0,2,2,0,2]，[1,0,0,2,0,0,2,0]，[1,2,0,0,2,2,0,0]，[1,0,0,0,2,2,2,2]，[1,2,0,0,2,0] [0,2]，[3,2,2,0,0,2,2,2]，[3,0,0,0,2,0,0,2]，[1,0,0,0,2,0,0,2]，[1,0,0,2,0,0,2,2]，[3,2,0,0,0,2,0,0]，[1,2,2,0,0,0,2,0]，[3,0,2,0,2,2,2,2]，[1,2,2,2,2,2,0,2]，[3 [2,2,0,2,2,0,2]，[3,2,0,0,0,2,0,2]，[3,0,0,2,0,0,2,0]，[3,2,2,0,0,0,2,0]，[1,0,0,2,2,0,0,2]，[3,2,2,2,2,2,0,2]，[1,0,0,2,2,2,0,2]，[3,0,2,2,2,0,0,2]，[3,0,0,2,2,2,0,0,2]，[3,0,0,2,2] ,2,0,2]，[1,2,2,2,2,0,0,0]，[3,0,2,2,0,2,0,2]，[3,0,2,2,2,0,2,0]，[3,0,0,0,2,2,2,2]，[1,2,0,2,0,2,2,0]，[3,2,0,0,2,0,2,0]，[1,2,0,2,2,0,0,2]，[3,0,0,0,2,2,0,0] ，[3,2,2,0,2,2,2,2]，[3,0,2,0,2,0,0,2]，[1,0,2,0,2,0,0,2]，[3,2,0,2,0,2,2,0]，[3,0,0,2,0,0,0,2]，[3,0,2,0,0,0,2,2]，[3,2,0,2,0,0,0,2]，[1,2,0,2,0,0,2,2]，[1,2,0 [0,2,2,2,0]，[3,2,2,2,0,0,2,2]，[1,0,2,2,0,0,2,2]，[1,0,2,2,0,2,2,0]，[3,2,0,2,2,2,0,2]，[1,2,0,0,2,0,0,0]，[3,2,0,2,2,2,2,2]，[1,2,2,0,0,2,0,2]，[1,2,2,0,0,2,2]，[1,2,2,0,0,2 0,0]，[3,2,2,2,2,0,2,2]，[3,2,2,2,2,0,2,0]，[3,2,0,2,2,2,2,0]，[3,0,2,2,2,2,0,2]，[1,2,0,2,2,2,2,0]，[1,0,2,2,2,2,0,2]，[3,2,0,2,0,2,0,0]，or，[1,2,2,0,2,0,0,2。

29. The method according to any one of claims 16 to 24, characterized in that the length of the first sequence is 255, the recursive relation of the first sequence is x(i+8) = mod(3·x(i+5)+x(i+3)+3·x(i+2)+2·x(i+1)+3·x(i),4), and the initial value of the first sequence is [x(0), x(1), x(2), x(3), x(4), x [(5), x(6), x(7)] belongs to the set of initial values, which includes one or more of the following sequences: [3,0,0,0,0,0,0,0], [1,0,0,0,0,0,0,0], [3,2,2,0,2,0,2,2], [3,2,0,0,0,0,0,0], [3,0,0,2,0,2,0,0], [3,0,0,0,0,0,0] [0,2]，[1,0,0,0,0,0,0,2]，[1,0,0,2,0,2,0,0]，[1,2,0,0,0,0,0,0]，[1,2,2,0,2,0,2,2]，[3,2,0,2,0,2,0,2]，[1,0,2,0,0,0,0,0]，[3,2,2,2,2,2,2,2]，[3,0,2,0,2,2,0,0] ]，[3,2,0,2,0,2,0,0]，[1,2,0,0,0,0,0,2]，[1,2,2,0,0,0,0,0]，[3,0,2,0,2,0,2,0]，[1,2,2,2,0,2,2,2]，[3,0,2,0,2,2,2]，[3,0,0,2,2,0,2,0]，[3,0,0,0,0,0,2,0]，[1 [0,0,0,0,0,0,2,0]，[1,0,0,2,0,2,0,2]，[3,2,0,0,0,0,0,2]，[1,2,2,0,2,0,2,0]，[3,0,0,0,0,0,2,2]，[1,0,0,0,0,0,2,2]，[3,2,2,0,2,0,2,0]，[3,0,0,2,0,2,0,2]，[1,2, 2,2,2,2,2,2]，[3,0,2,0,0,0,0,0]，[1,2,0,2,0,2,0,2]，[1,0,0,2,2,0,2,0]，[1,0,2,0,2,0,2,2]，[3,2,2,2,0,2,2,2]，[1,0,2,0,2,0,2,0]，[3,2,2,0,0,0,0,0]，[1,2,0,2 [0,2,0,0]，[1,0,2,0,2,2,0,0]，[1,0,0,2,2,2,0,0]，[1,2,0,2,0,0,0,0]，[3,0,2,2,2,0,0,0]，[1,2,0,2,0,2,2,2]，[3,0,2,0,0,2,0,2]，[3,2,2,2,0,0,0,0]，[3,2,2,2,0 [0,0,2]，[3,0,2,2,0,0,2,0]，[1,2,0,0,2,2,2,2]，[1,2,2,2,0,2,0,0]，[1,2,0,2,0,0,2,0]，[3,0,2,2,2,2,2,0]，[3,2,0,2,2,0,2,0]，[3,0,2,0,0,2,2,2]，[1,2,2,2,0,2,0] 2]，[1,2,0,0,2,0,2,2]，[1,2,2,0,2,0,0,0]，[3,0,0,0,2,2,0,2]，[1,0,2,2,0,2,2,2]，[3,0,0,0,2,2,2,0]，[1,0,0,2,0,0,0,0]，[3,0,0,2,2,2,0,0]，[1,2,2,0,2,2,2,0]， [3,2,0,0,0,2,2,2],[3,0,2,2,0,0,0,0]，[1,2,2,0,0,0,2,2]，[1,2,2,2,2,0,0,2]，[3,0,2,2,2,2,2,2]，[3,0,0,0,2,0,2,2]，[1,0,2,2,2,0,2,2]，[1,0,0,0,2,0,2,2]，[1, [0,2,0,0,2,2,0]，[3,2,0,2,2,0,0,0]，[1,0,2,2,0,2,0,0]，[3,2,2,0,2,2,0,0]，[3,2,2,2,0,0,2,0]，[1,0,0,0,0,2,0,0]，[3,0,0,0,0,2,0,0]，[3,2,0,0,0,0,2,0]，[1,0,0 [2,0,2,2,2]，[1,0,0,0,0,2,0,2]，[3,0,0,0,0,2,0,2]，[1,2,0,0,0,0,2,0]，[3,0,0,2,0,2,2,2]，[3,2,2,0,2,0,0,0]，[1,0,2,0,0,0,0,2]，[1,0,2,0,2,2,0,2]，[1,2,2,0,0] [0,0,2]，[3,2,2,2,2,2,2,0]，[3,2,2,2,0,2,2,0]，[1,0,0,2,2,0,2,2]，[1,0,0,0,0,2,2,0]，[3,0,0,0,0,2,2,0]，[3,2,0,0,0,0,2,2]，[3,0,0,2,0,2,2,0]，[3,2,2,0,2,0]，[3,2,2,0,2,0] [0,2]，[1,0,0,0,0,2,2,2]，[3,0,0,0,0,2,2,2]，[1,2,0,0,0,0,2,2]，[1,2,2,0,2,0,0,2]，[1,0,0,2,0,2,2,0]，[3,0,2,0,2,2,0,2]，[1,0,2,2,2,0,0,0]，[3,2,0,2,0,0,0,0] ]，[1,0,2,2,0,0,2,0]，[1,2,2,2,0,0,0,2]，[1,2,2,2,0,0,0,0]，[3,2,0,2,0,2,2,2]，[1,0,2,0,0,2,0,2]，[3,0,2,2,2,0,2,2]，[3,0,2,0,0,2,2,0]，[1,2,2,2,0,0,2,0]，[ 1,2,2,0,2,2,0,0]，[3,0,2,2,0,2,0,0]，[1,2,0,2,2,0,0,0]，[1,0,0,0,2,2,2,0]，[3,0,0,2,0,0,0,0]，[3,2,2,2,2,0,0,2]，[1,0,2,2,2,2,2,2]，[1,2,0,0,0,2,2,2]，[3,2, 2,0,0,0,2,2]，[1,0,2,2,0,0,0,0]，[3,2,2,0,2,2,2,0]，[3,2,0,0,2,2,2,2]，[3,2,0,2,0,0,2,0]，[3,2,2,2,0,2,0,0]，[1,0,0,0,2,2,0,2]，[3,0,2,2,0,2,2,2]，[3,2,2,2 [0,2,0,2]，[3,2,0,0,2,0,2,2]，[1,0,2,2,2,2,2,0]，[1,0,2,0,0,2,2,2]，[1,2,0,2,2,0,2,0]，[3,2,0,0,2,2,2,0]，[1,0,2,2,0,0,0,2]，[3,0,2,2,0,0,2,2]，[1,2,0,0,0,0 [2,0,0]，[1,0,0,2,2,2,2,0]，[1,2,0,2,2,2,0,2]，[1,2,2,2,2,2,0,0]，[1,0,2,0,2,2,2,0]，[3,0,2,0,2,0,0,0]，[1,2,0,0,2,0,2,0]，[1,2,0,2,0,0,0,2]，[3,2,0,2,2,2,0] [,0]，[1,2,0,2,2,0,2,2]，[1,2,0,2,2,2,2,2]，[3,0,2,0,0,0,2,0]，[1,0,0,2,2,0,0,0]，[3,0,0,2,2,0,0,2]，[1,0,2,0,0,0,2,2]，[1,2,2,0,2,2,2,2]，[3,2,0,0,2,0,0,0]， [3,0,2,2,0,2,2,0]，[1,2,0,0,0,2,2,0]，[1,0,2,2,2,0,0,2]，[1,2,0,0,2,2,0,2]，[3,0,2,2,2,2,0,0]，[1,2,0,0,0,2,0,2]，[1,2,0,2,2,2,0,0]，[3,2,0,2,0,0,2,2]，[3, [0,2,0,0,2,0,0]，[1,0,2,2,2,2,0,0]，[1,2,2,0,2,2,0,2]，[3,0,2,0,2,2,2,0]，[3,0,0,2,2,2,2,2]，[1,2,2,2,2,0,2,2]，[3,2,0,0,0,2,2,0]，[1,2,2,0,0,2,2,0]，[3,2,2 [0,0,2,0,2]，[3,2,2,0,0,2,0,0]，[1,2,2,2,2,0,2,0]，[1,0,0,0,2,2,0,0]，[1,0,2,0,0,0,2,0]，[3,0,0,2,2,0,0,0]，[3,2,0,2,2,0,0,2]，[3,0,0,0,2,0,0,0]，[3,2,2,0 [0,2,2,0]，[3,2,2,2,2,2,0,0]，[3,2,2,2,2,0,0,0]，[1,0,0,0,2,0,0,0]，[3,2,0,0,2,0,0,2]，[1,0,2,0,2,0,0,0]，[1,0,0,2,0,0,0,2]，[1,0,2,0,2,2,2,2]，[1,0,2,0,0,2] [0,0]，[1,0,0,2,2,2,2,2]，[3,0,0,2,2,2,2,0]，[1,2,2,0,0,2,2,2]，[1,0,0,0,2,0,2,0]，[3,0,2,2,0,0,0,2]，[3,2,0,0,2,2,0,0]，[1,0,2,2,0,2,0,2]，[3,0,0,0,2,0,2,0] ]，[1,2,2,2,0,0,2,2]，[3,2,0,2,2,0,2,2]，[3,0,0,2,0,0,2,2]，[1,0,2,2,2,0,2,0]，[3,2,0,0,2,2,0,2]，[1,0,0,2,0,0,2,0]，[1,2,0,0,2,2,0,0]，[1,0,0,0,2,2,2,2]，[ 1,2,0,0,2,0,0,2]，[3,2,2,0,0,2,2,2]，[3,0,0,0,2,0,0,2]，[1,0,0,0,2,0,0,2]，[1,0,0,2,0,0,2,2]，[3,2,0,0,0,2,0,0]，[1,2,2,0,0,0,2,0]，[3,0,2,0,2,2,2,2]，[1,2 [2,2,2,2,0,2]，[3,2,2,0,2,2,0,2]，[3,2,0,0,0,2,0,2]，[3,0,0,2,0,0,2,0]，[3,2,2,0,0,0,2,0]，[1,0,0,2,2,0,0,2]，[3,2,2,2,2,2,0,2]，[1,0,0,2,2,2,0,2]，[3,0,2,2 [2,0,0,2]，[3,0,0,2,2,2,0,2]，[1,2,2,2,2,0,0,0]，[3,0,2,2,0,2,0,2]，[3,0,2,2,2,0,2,0]，[3,0,0,0,2,2,2,2]，[1,2,0,2,0,2,2,0]，[3,2,0,0,2,0,2,0]，[1,2,0,2,2,2]，[1,2,0,2,2,2,2]，[3,2,0,0,2,0,2,0]，[1,2,0,2,2,2] [0,0,2]，[3,0,0,0,2,2,0,0]，[3,2,2,0,2,2,2,2]，[3,0,2,0,2,0,0,2]，[1,0,2,0,2,0,0,2]，[3,2,0,2,0,2,2,0]，[3,0,0,2,0,0,0,2]，[3,0,2,0,0,0,2,2]，[3,2,0,2,0,0,0] ,2]，[1,2,0,2,0,0,2,2]，[1,2,0,0,2,2,2,0]，[3,2,2,2,0,0,2,2]，[1,0,2,2,0,0,2,2]，[1,0,2,2,0,2,2,0]，[3,2,0,2,2,2,0,2]，[1,2,0,0,2,0,0,0]，[3,2,0,2,2,2,2,2] ，[1,2,2,0,0,2,0,2]，[1,2,2,0,0,2,0,0]，[3,2,2,2,2,0,2,2]，[3,2,2,2,2,0,2,0]，[3,2,0,2,2,2,2,0]，[3,0,2,2,2,2,0,2]，[1,2,0,2,2,2,2,0]，or，[1,0,2,2,2,2,2,0,2。

30. The method as described in claim 20, 28 or 29, wherein the length of the first sequence is 255, and the primitive polynomial of the first sequence is ^x⁸ + ^x⁵ + ^3x³ + ^x² + 2x + 1.

31. The method according to any one of claims 16 to 30, characterized in that the length of the first sequence is L, c is p × ID, the value range of ID is [0, K-1], K is a positive integer, and p satisfies:

p = floor(L/K), where floor is the floor function, or...

p = ceil(L/K), where ceil is the floor function; or,

p = round(L/K), where round is the rounding function to the nearest integer.

32. The method as described in claim 31, wherein K is 63 or 127, and the synchronization signal is an auxiliary synchronization signal SSS.

33. A communication device, characterized in that it includes a module for performing the method as described in any one of claims 1 to 15, or a module for performing the method as described in any one of claims 16 to 30.

34. A computer-readable storage medium, characterized in that the computer-readable storage medium is used to store a computer program that, when the computer program is run on a computer, causes the computer to perform the method as described in any one of claims 1 to 15, or causes the computer to perform the method as described in any one of claims 16 to 30.