Communication method and apparatus
By generating a first sequence and a second sequence based on different sets of initial values, the problem of high complexity in synchronization signal detection in wireless communication systems is solved, achieving more efficient synchronization detection performance and cell identifier differentiation.
Patent Information
- Application Number
- PCT/CN2025/095225
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2024-08-16
- Filing Date
- 2025-05-15
- Publication Date
- 2025-11-27
AI Technical Summary
In wireless communication systems, as the number of cell IDs increases, the detection complexity of synchronization signals increases and the synchronization detection performance decreases, especially when carrying beam indication information, the detection complexity is even higher.
A synchronization signal is generated by using a first sequence based on different sets of initial values to ensure that any two initial values in the initial value set are different, thus avoiding confusion of cyclic shift sequences. A second sequence is generated through recursion and primitive polynomials to generate the synchronization signal.
It reduces the complexity of synchronization signal detection, improves synchronization detection performance, ensures that cell identifiers are not confused, and adapts to the allocation needs of more cell identifiers.
Smart Images

Figure CN2025095225_27112025_PF_FP_ABST
Abstract
Description
A communication method and apparatus
[0001] Cross-reference to Related Applications
[0002] This application claims priority to the Chinese Patent Application No. 202410634588.X, filed on May 21, 2024, and entitled "A communication method and apparatus", the content of which is incorporated herein by reference in its entirety.
[0003] This application claims priority to the Chinese Patent Application No. 202411134550.2, filed on August 16, 2024, and entitled "A communication method and apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD
[0004] The present application relates to the field of communication technology, and in particular to a communication method and apparatus. BACKGROUND
[0005] In a wireless communication system, a network device sends a synchronization signal generated based on a specific sequence to a terminal device; the terminal device receives the synchronization signal and detects the specific sequence to achieve time synchronization and frequency synchronization between the terminal device and the network device.
[0006] The synchronization signal sent by the network device to the terminal device includes a primary synchronization signal (PSS) and a secondary synchronization signal (SSS). The PSS can be used by the terminal device to obtain preliminary timing, frequency synchronization, and part of the cell identifier (ID). The SSS can be used by the terminal device to further synchronize time, frequency, and the remaining cell ID. The PSS and the SSS respectively carry part of the information of the cell ID, that is, the terminal device acquires the cell ID by detecting the PSS and the SSS. In addition, the SSS may carry other information in addition to part of the information of the cell ID, such as beam indication information.
[0007] Currently, a gold sequence is generally used to generate the SSS. As the number of cell IDs increases, the detection complexity increases and the synchronization detection performance decreases. Even in the case where the SSS also carries other information (such as beam indication information), the detection complexity is higher and the synchronization detection performance is lower. SUMMARY
[0008] Embodiments of the present application provide a communication method and apparatus for reducing the detection complexity of a synchronization signal and improving the synchronization detection performance.
[0009] To achieve the above object, the embodiments of the present application adopt the following technical solutions:
[0010] In a first aspect, the present application provides a communication method, which is applied to a network side, for example, the method is applied to a network device or a component (such as a circuit, a chip or a chip system, etc.) in the network device; or, the method is applied to a module or a unit that completes part of the function of the network device, such as a centralized unit (CU), a distributed unit (DU) or a radio unit (RU); or, the method is applied to a larger device including the network device. For the convenience of description, the following takes the method applied to the network device as an example.
[0011] The communication method comprises: a network device sending a synchronization signal, which is a signal obtained based on a first sequence. Wherein, the initial value of the first sequence belongs to an initial value set, and any two initial values in the initial value set are different. Optionally, before sending the synchronization signal, the network device can also generate the synchronization signal.
[0012] The initial value can also be understood as a base sequence for generating the first sequence, also known as an initial sequence. For example, the first sequence is obtained by processing the initial value. All initial values in the initial value set can be traversed to obtain a plurality of sequences, and any one of the plurality of sequences can be used as the first sequence. In this scheme, any two initial values in the initial value set used to generate the first sequence are different, so that to a certain extent, it can be avoided that there are sequences that are cyclic shifts of each other in the plurality of sequences generated by the initial values in the initial value set. Since there are no sequences that are cyclic shifts of each other in the plurality of sequences generated by the initial values in the initial value set, the sequence generated based on the initial values in the initial value set carries the cell identifier, which can ensure that the cell identifier is not confused, that is, it can ensure that there is no case of cell identifier confusion when detecting the synchronization signal.
[0013] In a possible implementation manner, the elements in the first sequence satisfy a recursive relationship, and the recursive relationship corresponds to a primitive polynomial one-to-one. The primitive polynomial f(x) satisfies: M is a positive integer greater than 3, r is a positive integer, and the length of the first sequence is N = 2 r -1.
[0014] In a possible implementation manner, the first sequence is a Z4 sequence. Alternatively, the first sequence is a sequence A that satisfies the following conditions: the length of the sequence A is 2 r -1, and the period of the binary sequence obtained by projecting the sequence A to a binary field is 2 r-1, and the binary sequence is an m-sequence generated by a primitive polynomial obtained by projecting the primitive polynomial of the sequence A to a binary field.
[0015] In a possible implementation, the network device generates the synchronization signal, including: the network device generates the synchronization signal according to the second sequence. Wherein, the length 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: A is a complex number, and A is a constant, c is an integer, c is a cyclic shift value, 0≤n
[0016] The second sequence can be obtained from the first sequence, for example, the first sequence can be cyclically shifted, and the elements in the sequence obtained after the cyclic shift can be mapped to other values to obtain the second sequence. For example, the first sequence is cyclically shifted by c, the element 0 in the first sequence after the cyclic shift can be mapped to A, the element 1 can be mapped to A×j, the element 2 can be mapped to -A, and the element 3 can be mapped to A×j, that is, the element d(n) of the second sequence is A, A×j, -A, A×j. The network device can store the second sequence or the second sequence predefined by the protocol, and when the network device needs to generate the synchronization signal, the second sequence is obtained, and the synchronization signal is generated according to the second sequence.
[0017] In a possible implementation, the network device generates the synchronization signal according to the second sequence, including: the network device generates the second sequence according to the first sequence, maps the second sequence to the L subcarriers, and generates the synchronization signal according to the second sequence mapped to the L subcarriers.
[0018] The network device can store the first sequence or the first sequence predefined by the protocol, and when the network device needs to generate the synchronization signal, the first sequence can be obtained, the second sequence is generated based on the first sequence, and the synchronization signal is generated according to the second sequence.
[0019] In a possible implementation, c is determined according to the first cell identifier, and / or the second sequence is associated with the first cell identifier, and the first cell identifier belongs to the first cell identifier set.
[0020] C is a cyclic shift value, and the cell identifier can be carried by the cyclic shift value. Different cyclic shift values correspond to different cell identifiers, so that c for generating the first sequence can be determined based on the first cell identifier. Since the second sequence is obtained according to the first sequence, it can also be considered that the second sequence is associated with the first cell identifier.
[0021] In a possible implementation, c belongs to a 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.
[0022] The cell identity can also be carried by the initial values, different cell identities are carried by different initial values and / or cyclic shift values c, for example, the number of cell identities that can be carried by the set of initial values and the set of cyclic shift values is the product of the number of elements in the set of initial values and the number of elements in the set of cyclic shift values, so as to meet the demand of more cell identity allocation.
[0023] In a possible implementation, any two initial values in the set of initial values are the same after modulo 2.
[0024] It can be understood that, by stipulating that any two initial values in the set of initial values are the same after modulo 2, it can be ensured that the set of binary sequences obtained after modulo 2 of any two initial values is the same, that is, it can be ensured that the set of cyclic shifts used by each initial value is the same. In this way, for different initial values, the cyclic shift value of the synchronization signal can be detected based on the same detection mechanism, and the complexity is low.
[0025] In possible implementations, the first sequence has a length of 127, and a recurrence relation of the first sequence is x(i+7) = mod(2 x(i+4) + 3 x(i+1) + x(i), 4), or a recurrence relation of the first sequence is x(i+7) = mod(x(i+4) + 2 x(i+2) + x(i), 4), where “·” denotes multiplication. Initial values [x(6), x(5), x(4), x(3), x(2), x(1), x(0)] of the first sequence belong to an initial value set, and the initial value set includes one or more sequences as follows: [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]. ,
[0026] In possible implementations, the first sequence has a length of 127, and a recurrence relation of the first sequence is x(i+7) = mod(2 x(i+4) + 3 x(i+1) + x(i), 4), or a recurrence relation of the first sequence is x(i+7) = mod(x(i+4) + 2 x(i+2) + x(i), 4), where “·” denotes multiplication. Initial values [x(0), x(1), x(2), x(3), x(4), x(5), x(6)] of the first sequence belong to an initial value set, and the initial value set includes one or more sequences as follows: [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,[1, 0, 2, 2, 0, 2, 2], [3, 0, 2, 2, 0, 2, 2], [3, 2, 0, 2, 2, 0, 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].
[0027] In a possible implementation, the length of the first sequence is 127, and the primitive polynomial of the first sequence is x 7 + 2x 4 + x + 3 or x 7 + 3x 4 + 2x 2 + 3. When the length of the first sequence is 127, the scheme provides fewer taps of the primitive polynomial and lower implementation complexity.
[0028] In a possible implementation, 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 [x(7), x(6), x(5), x(4), x(3), x(2), x(1), x(0)] of the first sequence belongs to an initial value set, the initial value set including one or more sequences as follows: [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, 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,[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,
[0029] In a possible implementation, 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 [x(0), x(1), x(2), x(3), x(4), x(5), x(6), x(7)] of the first sequence belongs to an initial value set, the initial value set including one or more sequences as follows: [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, 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],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,[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].
[0030] In a possible implementation, the length of the first is 255, the primitive polynomial of the first sequence is x 8 +x 5 +3x 3 +x 2 +2x+1. When the length of the first sequence is 255, the scheme provides fewer taps of the primitive polynomial, and the implementation complexity is lower.
[0031] In a possible implementation, the length of the first sequence is L, c is p x ID, ID ranges from 0 to K-1, K is a positive integer, and p satisfies: p = floor(L / K), floor is a floor function, or p = ceil(L / K), ceil is a ceiling function, or p = round(L / K), round is a rounding function. Optionally, K is 63 or 127.
[0032] In the scheme, c is p x ID, that is, the cyclic shifts are equidistant, or the cyclic shift values are uniformly distributed. In this way, the minimum value of the interval between any two cyclic shift values is maximized, which can ensure low correlation between sequences. In addition, by maximizing the interval between adjacent cyclic shifts, better frequency offset resistance can also be achieved.
[0033] In a possible implementation, the synchronization signal is an SSS, and data corresponding to the synchronization signal is transmitted in an orthogonal frequency division multiplexing (OFDM) waveform.
[0034] In a second aspect, the present application provides a communication method, which is applied to a terminal side, for example, the method is applied to a terminal device or a component (such as a circuit, a chip or a chip system, etc.) in the terminal device, or the method is applied to a larger device including the terminal device. For the convenience of description, the following takes the method applied to the terminal device as an example.
[0035] The communication method includes: detecting, by a terminal device, a synchronization signal, the synchronization signal being a signal obtained based on a first sequence; wherein 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.
[0036] In a possible implementation, the terminal device detecting the synchronization signal includes: the terminal device detecting the synchronization signal in a first manner, a second manner, a third manner or a fourth manner.
[0037] The first manner includes: the terminal device obtaining the first sequence, and processing a received signal according to the first sequence to detect the synchronization signal.
[0038] In the first manner, the first sequence can be stored in the terminal device, or the first sequence can be generated by the terminal device. For example, the terminal device can store an initial value, and the terminal device can obtain 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, and performing correlation processing on the received signal according to the second sequence, for example, performing correlation calculation on the second sequence and the received signal to detect the synchronization signal.
[0039] The second method includes: the terminal device acquires a first sequence, generates a second sequence according to the first sequence, and processes a received signal according to the second sequence to detect a synchronization signal.
[0040] In the second method, the first sequence can be stored in the terminal device, or the first sequence can be generated by the terminal device. For example, the terminal device can store an initial value, and the terminal device can acquire the stored initial value to generate the first sequence. The second sequence is generated according to the first sequence, and the received signal is processed according to the second sequence, for example, the second sequence and the received signal are correlated to calculate, to detect the synchronization signal.
[0041] The third method includes: the terminal device acquires a second sequence, and processes a received signal according to the second sequence to detect a synchronization signal, the second sequence is generated based on a first sequence.
[0042] In the third method, the second sequence can be stored in the terminal device, or the second sequence can be generated by the terminal device. For example, the terminal device can store an initial value, and the terminal device can acquire the stored initial value to generate the first sequence, and then generate the second sequence according to the first sequence. For another example, the terminal device can store the first sequence, and the terminal device can acquire the stored first sequence to generate the second sequence. The received signal is processed according to the second sequence, including correlating the received signal according to the second sequence, for example, the second sequence and the received signal are correlated to calculate, to detect the synchronization signal.
[0043] The fourth method includes: the terminal device processes a received signal according to a sequence in a synchronization sequence set to detect a synchronization signal, the sequence in the synchronization sequence set includes a second sequence, and the second sequence is a sequence obtained based on a first sequence.
[0044] In the fourth method, the synchronization sequence set can be stored in the terminal device, or the synchronization sequence set can also be generated by the terminal device. For example, the terminal device can store an initial value, and the terminal device can acquire the stored initial value to generate the first sequence, and then generate the second sequence according to the first sequence, and so on, to obtain the synchronization sequence set. For another example, the terminal device can store the first sequence, and the terminal device can acquire the stored first sequence to generate the second sequence, and so on, to obtain the synchronization sequence set. The received signal is processed according to the sequence in the synchronization sequence set, including correlating the received signal according to the second sequence, for example, the second sequence and the received signal are correlated to calculate, to detect the synchronization signal.
[0045] In a possible implementation, the detecting the synchronization signal comprises: sequentially performing inner product of all sequences in a synchronization sequence set and the received signal to obtain a correlation value set, wherein 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 determining the synchronization signal according to a maximum correlation value in the correlation value set, or determining a first cell identifier according to the maximum correlation value in the correlation value set.
[0046] In a possible implementation, the 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 identifier according to the first initial value and the first cyclic shift. The second sequence set includes the first sequence set.
[0047] In a possible implementation, the elements in the first sequence satisfy a recursive relationship, and the recursive relationship is in one-to-one correspondence with a primitive polynomial f(x) that satisfies: M is a positive integer greater than 3, r is a positive integer, and the length of the first sequence is N = 2 r -1.
[0048] In a possible implementation, the first sequence is a Z4 sequence.
[0049] 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: A is a complex number, c is an integer, 0 ≤ n < L, 0 ≤ m < L, and x(m) = 0, 1, 2, or 3.
[0050] In a possible implementation, c is determined according to the first cell identifier, and / or the second sequence is associated with the first cell identifier, and the first cell identifier belongs to a first cell identifier set.
[0051] In a possible implementation, c belongs to a 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 an initial value set and the number of elements in the cyclic shift value set.
[0052] In a possible implementation, any two initial values in the initial value set are the same after modulo 2.
[0053] In possible implementations, the first sequence has a length of 127, a recurrence relation of the first sequence is x(i+7) = mod(2*x(i+4)+3*x(i+1)+x(i), 4), or a recurrence relation of the first sequence is x(i+7) = mod(x(i+4)+2*x(i+2)+x(i), 4), and initial values [x(6), x(5), x(4), x(3), x(2), x(1), x(0)] of the first sequence belong to an initial value set, the initial value set including one or more sequences as follows: [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, 2, 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,[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],
[0054] In possible implementations, the first sequence has a length of 127, and a recurrence relation of the first sequence is x(i+7) = mod(2 x(i+4) + 3 x(i+1) + x(i), 4), or a recurrence relation of the first sequence is x(i+7) = mod(x(i+4) + 2 x(i+2) + x(i), 4), where “·” denotes multiplication. Initial values [x(0), x(1), x(2), x(3), x(4), x(5), x(6)] of the first sequence belong to an initial value set, and the initial value set includes one or more sequences as follows: [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,[1, 0, 2, 2, 0, 2, 2], [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].
[0055] In a possible implementation, a length of the first sequence is 127, a primitive polynomial of the first sequence is x 7 + 2x 4 + x + 3, or x 7 + 3x 4 + 2x 2 + 3.
[0056] In a possible implementation, a length of the first sequence is 255, a 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 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, the initial value set including one or more sequences as follows: [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, 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,[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,
[0057] In a possible implementation, 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 [x(0), x(1), x(2), x(3), x(4), x(5), x(6), x(7)] of the first sequence belongs to an initial value set, the initial value set including one or more sequences as follows: [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, 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],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,[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].
[0058] In a possible implementation, the length of the first sequence is 255, the primitive polynomial of the first sequence is x 8 +x 5 +3x 3 +x 2 +2x+1.
[0059] In a possible implementation, the length of the first sequence is L, c is p x ID, ID is in the range of [0, K-1], K is a positive integer, p satisfies: p = floor(L / K), floor is a down rounding, or p = ceil(L / K), ceil is an up rounding, or p = round(L / K), round is rounding to the nearest integer.
[0060] In a possible implementation, K is 63 or 127.
[0061] In a possible implementation, the synchronization signal is an SSS, and data corresponding to the synchronization signal is transmitted in an OFDM waveform.
[0062] The beneficial effects of the second aspect and the respective implementations can be referred to the beneficial effects of the first aspect and the respective implementations, which are not repeated here.
[0063] In a third aspect, an embodiment of the present application provides a communication method, which can be executed by a first communication device and a second communication device. The first communication device has functions of implementing behaviors in the method instances of the first aspect. For example, the first communication device includes corresponding means or modules or units for executing the method of the first aspect, which can be implemented by software and / or hardware. The second communication device has functions of implementing behaviors in the method instances of any of the second aspects, for example, the second communication device includes corresponding means or modules or units for executing the method of the second aspect, which can be implemented by software and / or hardware. Hereinafter, the first communication device is taken as a network device, and the second communication device is taken as a terminal device as an example.
[0064] The communication method includes: a network device generates a synchronization signal, and transmits the synchronization signal, the synchronization signal being a signal obtained based on a first sequence, wherein 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; and a terminal device detects the synchronization signal.
[0065] The beneficial effects of the third aspect can be referred to the beneficial effects of the first aspect and the respective implementations, which are not repeated here.
[0066] In a fourth aspect, an embodiment of the present application provides a communication device, which has functions of implementing behaviors in the method instances of the first aspect or any of the second aspects. The beneficial effects can be referred to the related description of the first aspect or the second aspect, which are not repeated here. For example, the communication device can be the network device in the first aspect, or the communication device can be a device capable of supporting the functions required for the network device to implement the method provided by the first aspect, for example, the communication device can be a chip or a chip system in the network device. For another example, the communication device can be the terminal device in the second aspect, or the communication device can be a device capable of supporting the functions required for the terminal device to implement the method provided by the second aspect, for example, the communication device can be a chip or a chip system in the terminal device.
[0067] In a possible design, the communication device includes a baseband device and a radio frequency device.
[0068] In a possible design, the communication apparatus includes corresponding means or modules or units for performing the methods of the first aspect or the second aspect, which can be implemented by software, or by hardware, or by a combination of software and hardware. For example, the communication apparatus includes a processing unit (also referred to as a processing module or a processor) and / or a transceiver unit (also referred to as a transceiver module or a transceiver). The transceiver unit can implement the sending function and the receiving function. When the transceiver unit implements the sending function, it can be referred to as a sending unit (also referred to as a sending module). When the transceiver unit implements the receiving function, it can be referred to as a receiving unit (also referred to as a receiving module). The sending unit and the receiving unit can be the same functional unit, which is referred to as a transceiver unit and can implement the sending function and the receiving function. Alternatively, the sending unit and the receiving unit can be different functional units, and the transceiver unit refers to both of the functional units. The units (modules) can perform the corresponding functions in the method examples of the first aspect or the second aspect, details of which are described in the method examples, and will not be repeated here.
[0069] In a fifth aspect, an embodiment of the present application provides a communication apparatus, which can be the communication apparatus in the fourth aspect of the above-described embodiments, or a chip or a chip system in the communication apparatus in the fourth aspect. The communication apparatus includes a communication interface and a processor, and optionally includes a memory. The memory is used to store computer programs or instructions or data, and the processor is coupled with the memory and the communication interface. When the processor reads the computer programs or instructions or data, the communication apparatus performs the method performed by the terminal device in the method embodiments, for example, the communication apparatus can be a terminal device or a functional module in the terminal device, for example, a baseband chip and a radio frequency chip. Alternatively, when the processor reads the computer programs or instructions or data, the communication apparatus performs the method performed by the network device in the method embodiments, for example, the communication apparatus can be a network device or a functional module in the network device, for example, a baseband chip and a radio frequency chip.
[0070] In a sixth aspect, an embodiment of the present application provides a chip system, which includes a processor and can include a communication interface, and is used to implement the method in the first aspect or the second aspect. Optionally, the chip system further includes a memory. The memory is used to store computer programs (also referred to as codes or instructions). The processor is used to call and run the computer programs from the memory, so that the device in which the chip system is installed performs the method in the first aspect or the second aspect and any possible implementation manner thereof. The chip system can be composed of a chip, or can include a chip and other discrete devices.
[0071] In a seventh aspect, an embodiment of the present application provides a communication apparatus, which comprises an input / output interface and a logic circuit. The input / output interface is configured to input and / or output information. The input / output interface can be an interface circuit, an output circuit, an input circuit, a pin or related circuit, etc. The logic circuit is configured to perform the method in the first aspect or the second aspect.
[0072] In a specific implementation, the communication apparatus can be a chip, the input circuit can be an input pin, the output circuit can be an output pin, and the logic circuit can be a transistor, a gate circuit, a flip-flop, various logic circuits, etc. The input signal received by the input circuit can be received and input by, for example but not limited to, a receiver, the output signal output by the output circuit can be output to and transmitted by, for example but not limited to, a transmitter, and the input circuit and the output circuit can be the same circuit which is used as the input circuit and the output circuit at different times. The present application does not limit the specific implementation of the input / output interface and the logic circuit.
[0073] In an implementation, when the communication apparatus is a wireless communication device, the wireless communication device can be a terminal device such as a mobile phone, or the wireless communication device can be a network device such as a base station. The interface circuit can be a radio frequency processing chip in the wireless communication device, and the processing circuit can be a baseband processing chip in the wireless communication device.
[0074] In an eighth aspect, an embodiment of the present application provides a communication system, which comprises a terminal device and a network device. The network device is configured to implement the functions of the method in the first aspect, and the terminal device is configured to implement the functions of the method in the second aspect.
[0075] In a ninth aspect, an embodiment of the present application provides a computer readable storage medium, which is configured to store a computer program or instructions, and when the computer program or instructions are executed, the method in the first aspect or the second aspect and any implementation thereof is implemented.
[0076] In a tenth aspect, an embodiment of the present application further provides a computer program product comprising instructions, which when executed on a computer, cause the method in the first aspect or the second aspect and any implementation thereof to be implemented.
[0077] The beneficial effects of the fourth aspect to the tenth aspect and the implementation thereof can refer to the beneficial effects of the first aspect and any implementation thereof. BRIEF DESCRIPTION OF DRAWINGS
[0078] FIG. 1 is a schematic diagram of an architecture of a communication system according to an embodiment of the present application;
[0079] FIG. 2 is a schematic diagram of two typical protocol stacks of a base station according to an embodiment of the present application;
[0080] FIG. 3 is a schematic diagram of a communication method provided by an embodiment of the present application;
[0081] FIG. 4 is a schematic diagram of a structure of a communication device provided by an embodiment of the present application;
[0082] FIG. 5 is a schematic diagram of another structure of a communication device provided by an embodiment of the present application. DETAILED DESCRIPTION
[0083] Embodiments of the present application provide a new sequence, which can be used to generate SSS. Compared with gold sequence, using the sequence to generate SSS can reduce the detection complexity of the synchronization signal and improve the synchronization detection performance. The scheme provided by the embodiments of the present application will be further introduced below in combination with the drawings.
[0084] The technical scheme provided by the embodiments of the present application can be applied to a communication system related to the 3rd generation partnership project (3GPP), for example, a long term evolution (LTE) communication system, a 5th generation (5G) mobile communication system, or can also be applied to other next generation mobile communication systems or other similar communication systems. The other similar communication systems can include wireless fidelity (WIFI), vehicle to everything (V2X), internet of things (IoT) system, etc.
[0085] Please refer to FIG. 1, which shows a communication system to which an embodiment of the present application is applicable. The communication system includes a radio access network 100 and a core network 200. Optionally, the communication system can also include the Internet (for example, FIG. 1).
[0086] The radio access network 100 can include 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 120j. The number of terminal devices and / or network devices shown in FIG. 1 can be less or more. The communication system described in the embodiments of the present application is used to more clearly illustrate the technical solutions of the embodiments of the present application, and does not constitute a limitation on the communication system to which the embodiments of the present application are applied. For example, the communication system can also include other devices, such as wireless relay devices and wireless backhaul devices, which are not shown in FIG. 1. Those skilled in the art can know that, as the network architecture evolves, the technical solutions provided by the embodiments of the present application are also applicable to similar technical problems. When applying the technical solutions of the embodiments of the present application to other communication systems, the devices, components, modules, etc. in the embodiments can be replaced by corresponding devices, components, modules, etc. in other communication systems, without limitation.
[0087] In the embodiments of the present application, the network device refers to a radio access network (RAN) device. The RAN can be a 3GPP related cellular system, for example, a 5G / new radio (NR) mobile communication system or a future-oriented evolution system. The RAN can also be an open radio access network (O-RAN or ORAN), a cloud radio access network (CRAN), or a virtualized RAN (vRAN), etc. The RAN can also be a communication system in which two or more of the above systems are integrated. The RAN device can also be referred to as a RAN node, a RAN entity, or an access node, etc.
[0088] In a possible scenario, the RAN node can be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next generation NodeB (gNB), a base station in a future mobile communication system, etc. The RAN node can be a macro base station, a micro base station, an indoor station, a relay node, a donor node / host node, or a radio controller, etc. The RAN node can also be a server, a wearable device, a vehicle or a vehicle-mounted device, etc. For example, the RAN node in the V2X technology can be a road side unit (RSU).
[0089] In another possible scenario, a RAN node can be a module or unit that completes part of the function of a base station; or multiple RAN nodes cooperate to assist a terminal device to implement wireless access, and different RAN nodes respectively implement part of the function of a base station. For example, a RAN node can be a centralized unit CU, a distributed unit DU, or a radio unit RU, etc. The function of the CU can be implemented by one entity, or also can be implemented by different entities. For example, the function of the CU can be further divided, that is, the control plane and the user plane are separated and implemented by different entities, respectively, as a control plane CU entity (that is, a CU-control plane (CP) entity) and a user plane CU entity (that is, a CU-user plane (UP) entity). The CU-CP entity and the CU-UP entity can be coupled with the DU to jointly complete the function of the RAN node. The CU and the DU can be separately arranged, or also can be included in the same network element, for example, in a baseband unit (BBU). Any one of the CU (or CU-CP and CU-UP), the DU, and the RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.
[0090] In different systems, the CU (or CU-CP and CU-UP), the DU, or the RU can also have different names, but those skilled in the art can understand their meanings. For example, in an ORAN system, the CU can also be referred to as an O-CU (open CU), the DU can also be referred to as an O-DU, the CU-CP can also be referred to as an O-CU-CP, the CU-UP can also be referred to as an O-CU-UP, and the RU can also be referred to as an O-RU. For the convenience of description, the CU, the CU-CP, the CU-UP, the DU, and the RU are taken as examples for description in this application.
[0091] The CU and the DU can be configured according to protocol layer functions of a wireless network implemented thereby: for example, the CU is configured to implement functions of a packet data convergence protocol (PDCP) layer and protocol layers thereabove (e.g., a radio resource control (RRC) layer and / or a service data adaptation protocol (SDAP) layer, etc.); and the DU is configured to implement functions of protocol layers below the PDCP layer (e.g., a radio link control (RLC), a media access control (MAC), and / or a physical (PHY) layer, etc.). Specific descriptions of the above protocol layers can be referred to relevant technical specifications of the 3GPP or technical specifications of other applicable communication protocols.
[0092] For example, referring to FIG. 2, two typical protocol stack diagrams of a base station provided by embodiments of the present application are shown. In the base station (1), the base station is divided into a CU and a DU, the CU is configured to implement functions of a PDCP layer and protocol layers thereabove (e.g., an RRC layer and / or an SDAP layer, etc.); and the DU is configured to implement functions of protocol layers below the PDCP layer (e.g., an RLC layer, a MAC layer, and / or a PHY layer, etc.). The CU and the DU communicate based on an F1 interface. In the base station (2), the base station is divided into a CU and a DU, wherein the CU includes a CU-CP and a CU-UP, the CU-CP is configured to implement control plane functions of the CU, and the CU-UP is configured to implement user plane functions of the CU. The CU-CP and the CU-UP can communicate based on an E1 interface, the CU-CP and the DU communicate based on an F1 interface supporting a control plane (also referred to as F1-C), and the CU-UP and the DU communicate based on an F1 interface for a user plane (also referred to as F1-U). The CU-CP is configured to implement control plane functions of a PDCP layer and functions of an RRC layer, and the CU-UP is configured to implement user plane functions of the PDCP layer and functions of an SDAP layer. The DU is configured to implement functions of protocol layers below the PDCP layer (e.g., an RLC layer, a MAC layer, and / or a PHY layer, etc.).
[0093] The above division of processing functions of the CU and the DU according to protocol layers is merely an example, and the division can also be performed in other manners, which is not limited in the present application. For example, in one design, the CU or the DU can also be divided into partial processing functions of protocol layers. In one design, partial functions of an RLC layer and functions of protocol layers above the RLC layer are arranged in the CU, and remaining functions of the RLC layer and functions of protocol layers below the RLC layer are arranged in the DU.
[0094] In another possible design, the functions of the PHY layer are jointly implemented by the DUs and the RUs, or described as moving part of the PHY layer functions of the DUs to the RUs. One DU can be connected with one or more RUs. The functions of the DUs and the RUs can be configured in multiple ways according to the design. For example, the DUs are configured to implement baseband functions, and the RUs are configured to implement radio frequency functions. For another example, the DUs are configured to implement high-layer functions in the PHY layer, and the RUs are configured to implement low-layer functions in the PHY layer or implement the low-layer functions and the radio frequency functions. The high-layer functions in the PHY layer can include part of the functions of the PHY layer that are closer to the MAC layer, and the low-layer functions in the PHY layer can include another part of the functions of the PHY layer that are closer to the radio frequency side. The present application does not limit the specific functions of the DUs and the RUs. The interface between the DUs and the RUs can be referred to as a fronthaul interface.
[0095] When the RAN is an O-RAN, it can also have an artificial intelligence (AI) function, for example, the O-RAN includes an intelligent controller. The intelligent controller can be a non-real time RAN intelligent controller (non-RT RIC / non-RT RIC / NRT RIC), or a near-real time RAN intelligent controller (near-RT RIC / near-RT RIC / nRT RIC). The non-real time RIC can be used to implement non-real time intelligent management of the RAN, can implement a workflow including model training and model updating, and guide applications / functions in the nRT RIC based on a policy. The near-real time RIC can be used to implement near-real time intelligent management of the RAN. Through data collection and related operations on the E2 interface, near-real time control and optimization of modules and resources of the O-RAN are implemented.
[0096] In an embodiment of the present application, the apparatus for implementing the functions of the network device can be the network device itself, or an apparatus capable of supporting the network device to implement the functions, such as a chip system or a combination device or component that can implement the functions of the network device, which can be installed in the network device. The embodiments of the present application do not limit the specific technology and specific device form adopted by the network device.
[0097] In the embodiments of the present application, all the terminal devices capable of communicating data with the base station can be regarded as terminal devices. The terminal device is also referred to as a terminal, a terminal device, a user equipment (UE), a user device, a mobile station, or a mobile terminal, etc. The terminal device can be widely applied to various scenarios, for example, the terminal device can be a mobile phone, a computer, a mobile internet device (MID), a wearable device, a virtual reality (VR) device, an augmented reality (AR) device, a station (STA), a mechanical arm, a camera, a robot, a vehicle, a drone, a helicopter, an airplane, a ship, or a smart home device (such as a television, an air conditioner, a sweeper, a sound box, a set top box), a relay, a customer premise equipment (CPE), etc.
[0098] In addition, in the embodiments of the present application, the terminal device can also be a terminal device in an IoT system, for example, a water meter, an electricity meter, etc. IoT is an important part of future information technology development, and its main technical feature is to connect objects through communication technology and network, so as to realize the intelligent network of man-machine interconnection and object-object interconnection.
[0099] Among them, when the terminal device is applied to V2X, it can also be referred to as a V2X device, for example, a smart car or an intelligent car, a digital car, an unmanned car or a driverless car or a pilotless car or an automobile, an automatic car or an autonomous car, a pure EV or a Battery EV, a hybrid electric vehicle (HEV), a range extended EV (REEV), a plug-in HEV (PHEV), a new energy vehicle, a road site unit (RSU).
[0100] The various terminal devices as introduced above can be considered as vehicle-mounted terminal devices if they are located on a vehicle (e.g., placed / installed in a vehicle). The vehicle-mounted terminal device can be built-in as one or more components or units in a vehicle-mounted module, a vehicle-mounted component, a vehicle-mounted chip, or a vehicle-mounted unit of a vehicle, and the vehicle can implement the method of the present application through the built-in vehicle-mounted module, vehicle-mounted component, vehicle-mounted chip, or vehicle-mounted unit. The vehicle-mounted terminal device can be a whole vehicle device, a vehicle-mounted module, a vehicle, an on board unit (OBU), a roadside unit (RSU), a telematics box (T-box), a chip, or a system on chip (SOC), etc. The chip or SOC can be installed in a vehicle, an OBU, an RSU, or a T-box.
[0101] In the embodiments of the present application, the device for implementing the function of the terminal device can be the terminal device itself, or a device capable of supporting the terminal device to implement the function, such as a chip system or a combination device or component that can implement the function of the terminal device, which can be installed in the terminal device. The embodiments of the present application do not limit the specific technology and specific device form adopted by the terminal device.
[0102] Taking the network device as a base station and the terminal device as a UE as an example, the base station and the UE can be in a fixed position or can be movable. The base station and the UE can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; can also be deployed on the water surface; and can also be deployed on an airplane, a balloon, and a man-made satellite. The embodiments of the present application do not limit the application scenarios of the base station and the UE.
[0103] The roles of the base station and the UE can be relative, for example, the helicopter or the unmanned aerial vehicle 120i in FIG. 1 can be configured as a mobile base station, and for the UE 120j that accesses the wireless access network 100 through 120i, the UE 120i is a base station; but for the base station 110a, 120i is a UE, that is, 110a and 120i communicate through a wireless air interface protocol. Of course, 110a and 120i can also communicate through a base station-to-base station interface protocol, and in this case, 120i is also a base station relative to 110a. Therefore, the base station and the UE can be collectively referred to as a communication device, and 110a and 110b in FIG. 1 can be referred to as a communication device with a base station function, and 120a-120j in FIG. 1 can be referred to as a communication device with a UE function.
[0104] In the embodiments of the present application, "at least one" means one or more, and "multiple" means two or more. The association relationship between the associated objects is described by "and / or", which means that there can be three kinds of relationships, for example, A and / or B can represent the following three cases: A exists alone, A and B exist together, and B exists alone, where A and B can be singular or plural. The character " / " generally represents an "or" relationship between the associated objects before and after it. "At least one of the following" or similar expressions means any combination of ten or more items, including any combination of single or multiple items. For example, at least one of a, b, or c can represent a, b, c, a-b, a-c, b-c, or a-b-c, where a, b, and c can be single or multiple.
[0105] In addition, unless otherwise stated, the ordinal numbers "first", "second", etc. mentioned in the embodiments of the present application are used to distinguish multiple objects, and are not used to limit the order, time sequence, priority or importance of the multiple objects. For example, the first TBS and the second TBS are only used to distinguish different sizes, and do not represent different priorities or importance of the two sizes.
[0106] In the embodiments of the present application, "sending" and "receiving" represent the direction of signal transmission. For example, "sending information to XX" can be understood as that the destination of the information is XX, which can include direct sending through the air interface, or indirect sending through the air interface by other units or modules. "Receiving information from YY" can be understood as that the source of the information is YY, which can include direct receiving from YY through the air interface, or indirect receiving from YY through the air interface by other units or modules. "Sending" can also be understood as "output" of a chip interface, and "receiving" can also be understood as "input" of a chip interface. In other words, sending and receiving can be carried out between devices, such as between network devices and terminal devices, or can be carried out within a device, such as between components, modules, chips, software modules or hardware modules within a device through a bus, wire or interface. It can be understood that the information between the source and the destination of the information transmission can be processed as necessary, such as encoding and modulation, but the destination can understand the valid information from the source. Similar expressions in the present application can be understood similarly, and will not be repeated here.
[0107] In the embodiments of the present application, "when", "if" and "whether" all refer to the case that the device will make corresponding processing under certain objective condition, and are not limited to time, and do not require the device to have a judgment action when implemented, and also do not mean that there are other limitations. If no special instructions are given, "if" and "whether" can be replaced, "when" and "in the case of" can be replaced, and "when" and "if" / "whether" can be replaced. In the embodiments of the present application, "*" can be used to represent "multiplication".
[0108] The ordinal numbers "first", "second", and the like mentioned in the embodiments of the present application are used to distinguish a plurality of objects, and are not used to limit the size, content, order, time sequence, priority, or importance of the plurality of objects. For example, the first sequence and the second sequence refer to two different sequences, and do not mean that the contents, priorities, or importance of the two sequences are different. The words "exemplary" or "for example" are used to indicate an example, illustration, or description. Any embodiment or design scheme described as "exemplary" or "for example" in the present application should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. Rather, the words "exemplary" or "for example" are intended to present the relevant concept in a specific manner.
[0109] As introduced above, the network architecture to which the present application is applicable, the following introduces some contents related to the embodiments of the present application, for example, physical cell identity (PCI), synchronization signal detection process, and the like.
[0110] 1) PCI
[0111] The PCI is used to identify a cell at the physical layer, and can also be referred to as a cell identity. The terminal device can determine the PCI through a network identity 1 (NID1) and a network identity 2 (NID2). For example, the NID2 can be obtained from the PSS, and the NID1 can be obtained from the SSS.
[0112] The PSS can be generated by a gold sequence, and the gold sequence can be regarded as a sequence obtained by performing exclusive OR operation on two m sequences with different primitive polynomials element by element. Assuming that the length n of the PSS is 127, the sequence d PSS (n) corresponding to the PSS can satisfy: mod is a remainder operation, that is, the NID2.
[0113] The SSS can be generated by a gold sequence. Assuming that the length n of the SSS is 127, the sequence d SSS (n) corresponding to the SSS can satisfy: SSS(n)=[1-2x0((n+m0)mod127)][1-2x1((n+m1)mod127)], 0 ≤ n < 127, mod is the modulo operation. That is, NID1. Among them, x0(i+7)=(x0(i+4)+x0(i))mod2; x1(i+7)=(x1(i+1)+x1(i))mod2, then we have: [x0(6)x0(5)x0(4)x0(3)x0(2)x0(1)x0(0)]=[0 0 0 0 0 0 1]; [x1(6)x1(5)x1(4)x1(3)x1(2)x1(1)x1(0)]=[0 0 0 0 0 0 1]. For details, please refer to the description in standard 38.211.
[0114] PCI is... in, The set of values for is {0, 1, 2}. The set of values is {0,1,2,...,335}, and correspondingly, there are a total of 1008 PCIs.
[0115] 2) Synchronization signal detection process
[0116] Taking UE detection of synchronization signals as an example, the UE blindly detects the PSS (Physical Signal and Physical Downlink Broadcast Channel Block) on a standard-defined synchronization raster. The synchronization raster defines a set of frequencies with certain intervals within the 5G frequency band, used to divide the 5G frequency band into several synchronization signal and physical downlink broadcast channel blocks (SSBs) in the frequency domain. Alternatively, the synchronization raster can be considered to include one or more center frequencies where cells may exist, and the UE can detect the PSS at these possible center frequencies. After detecting a PSS signal on a synchronization raster, the UE performs frequency correction and then time slot synchronization. After time slot synchronization, the UE detects the SSS. Since the PSS carries... UE detected Afterwards, Substituting it into the SSS detection, it is about to Substitute into d SSS (n). It can be seen that there are 336 possible SSS sequences. The UE needs to use 336 different SSS sequences to perform cross-correlation detection on the SSS. The SSS sequence corresponding to the maximum cross-correlation value is the SSS sequence sent by the base station.
[0117] 3) fast Hadamard transform detection (sast hadamard transform, FHT)
[0118] FHT is a correlation detection method, which detects a sequence by Hadamard transform to calculate a correlation value faster. Taking detection of an SSS sequence as an example, it can be known from 1) that the number of cyclic shifts of m0 and m1 is different, where m0 has 9 cyclic shifts, that is, [0, 1, 2, 3, 4, 5, 6, 7, 8], and the value range of m0 is 5*[0, 1, 2, 3, 4, 5, 6, 7, 8]; m1 has 112 cyclic shifts, and the value range of m1 is [0, 1, 2, …, 111]. When detecting the SSS, the UE can take the m sequence corresponding to m0 as a scrambling code, and perform fast Hadamard transform detection on the m sequence corresponding to m1.
[0119] Taking the primitive polynomial of the m sequence as f(x) = x 3 +x 2 +1 as an example, 8 sequences can be generated, that is, {[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]}. It can be found that, except for the all-0 sequence, other m sequences are cyclic shifts of a certain sequence. For example, the third sequence in it is obtained by cyclically shifting the second sequence to the left by 1 bit. All cyclic shifts of the m sequence can form a matrix M, and an all-0 vector is added to the first row and the first column of the matrix M to obtain a matrix
[0120] Matrix M: Matrix
[0121] Matrix can be obtained from a Hadamard matrix H by row and column transformation, for example, matrix and the Hadamard matrix H satisfy the following relationship:
[0122] where P L and P S are permutation matrices (that is, only one position in each row and each column is 1), and it is assumed that the dimension of the Hadamard matrix H is 2 n *2 n , then the dimensions of P L and P S are both 2 n *2n n is the order of the primitive polynomial.
[0123] The number of additions for correlation detection based on FHT is 2 n *log2(2 n -1) while the number of additions for correlation detection without FHT, for example, directly correlating the received sequence with the matrix M, is 2 n *(2 n -1), therefore, correlation detection based on FHT can reduce the complexity of detection. For example, the received sequence R = [0, 1, 0, 1, 1, 1, 0], converting R into a binary phase signal is [1, -1, 1, -1, -1, -1, 1], converting the elements in the matrix M into a binary phase signal and adding all 0 elements in the first row to obtain Based on the maximum correlation value, the transmitted m-sequence is the third sequence [0, 1, 0, 1, 1, 1, 0], the number of additions required is 2 n *(2 n -1).
[0124] 4) Cross-correlation between PSS and SSS
[0125] Since the downlink timing is not obtained when detecting PSS, all time-domain cyclic shifts need to be considered when calculating the cross-correlation value between PSS and SSS. The calculation formula of the cross-correlation value between PSS and SSS is as follows:
[0126] For time-domain sequences s1 and s2 with length L, the cross-correlation value c max (s1, s2) between s1 and s2 satisfies:
[0127] Wherein, the value range of τ is [-L, L].
[0128] After normalization, c max (s1, s2) satisfies:
[0129] 5) Cross-correlation between SSS and SSS
[0130] The cross-correlation value c max (S1, S2) between frequency-domain sequences S1 and S2 satisfies:
[0131] After normalization, c max (S1, S2) satisfies:
[0132] Currently, the gold sequence is commonly used to generate the SSS, i.e., the gold sequence is a sequence used to generate the SSS. In the future, the frequency point can be increased, the path loss is increased, and a large number of small base stations can be deployed. If the cell ID is limited, it is inevitable that adjacent cells share the same PCI, so the cells cannot be distinguished according to the PCI. Therefore, the cells are expanded, i.e., the cell ID is increased, and the detection complexity of the SSS generated based on the gold sequence is also increased accordingly. If the sequence is increased, the synchronization detection performance will also be reduced as the number of sequences increases.
[0133] To solve the above technical problems, the embodiments of the present application provide a sequence for generating the SSS. Compared with the gold sequence, the sequence provided by the embodiments of the present application can be regarded as a new sequence. The embodiments of the present application do not limit the specific name of the sequence. For example, in the embodiments of the present application, the new sequence is referred to as a Z4 sequence. The Z4 sequence refers to a sequence A satisfying the following conditions: the length of the sequence A is 2 r -1, the period of a binary sequence obtained by projecting the sequence A to a binary field is 2 r -1, and the binary sequence is an m-sequence generated by a primitive polynomial obtained by projecting the primitive polynomial of the sequence A to the binary field. In a possible implementation manner, the Z4 sequence can be a four-element sequence, i.e., the Z4 sequence includes elements with four values. It should be noted that the embodiments of the present application do not limit the number of values of the elements included in the Z4 sequence. For example, the Z4 sequence can also be a six-element sequence or an eight-element sequence, etc. It should be understood that the Q-element sequence refers to that the sequence includes elements with Q values.
[0134] The maximum cross-correlation value of the Z4 sequence is 1 / 2 of the maximum cross-correlation value of the binary sequence, and therefore, the cross-correlation performance is better, so that the larger capacity requirement of the SSS can be met. In addition, the Z4 sequence as a sequence used to generate the SSS can also reduce the detection complexity of the SSS. For the convenience of understanding, first, the principle that the Z4 sequence provided by the embodiments of the present application can reduce the detection complexity compared with the m-sequence is introduced. In the following introduction, the first sequence is taken as an example, and the first sequence can be the Z4 sequence described above.
[0135] Suppose that the length of the first sequence is 2 r -1, the period of a binary sequence obtained by projecting the first sequence to a binary field is 2 r -1, and the binary sequence is an m-sequence generated by a primitive polynomial obtained by projecting the primitive polynomial of the first sequence to the binary field. The difference from the m-sequence is that the initial value of the first sequence with the length of 2 r -1 has 4 rIn one case, the sequences generated with different initial values are mostly cyclic shifts of each other. For example, r = 6, and the length of the sequence is 2 r -1 = 63, and 4095 sequences can be obtained by traversing all the initial values. Among the 4095 sequences, a plurality of sequences are cyclic shifts of each other, for example, 4030 sequences are cyclic shifts of each other. If the sequences that are cyclic shifts of each other are removed, 65 sequences remain, which are used to generate the SSS. The sequences used to generate the SSS are less, and the detection complexity of the SSS can be reduced. In this case, "removing the sequences that are cyclic shifts of each other" is for two sequences. If one of the two sequences is a cyclic shift of the other sequence, one of the two sequences can be retained. Since there are no sequences that are cyclic shifts of each other in the plurality of sequences generated by the initial values in the initial value set, the sequences generated by the initial values in the initial value set carry the cell identifier, and different sequences correspond to different cell identifiers. Therefore, the cell identifier can be guaranteed not to be confused, that is, the situation that the cell identifier is confused when detecting the synchronization signal can be avoided.
[0136] It should be noted that the first sequence and the cyclic shift of the m sequence are one-to-one corresponding. Therefore, the case that the initial value of the first sequence is even needs to be removed, so as to avoid the first sequence being projected to the binary field to obtain a sequence of all 0s.
[0137] The technical solutions provided by the embodiments of the present application are described below with reference to the accompanying drawings.
[0138] In the following introduction process, the communication method provided by the embodiment of the application is applied to the network architecture shown in FIG. 1, and the communication method provided by the embodiment of the application can be executed by the first communication device and the second communication device. The steps executed by the first communication device can be implemented by the first communication device itself, or can be implemented by the components (such as a baseband chip, or other processing units or processors, and the like) in the first communication device, or can be implemented by a larger device including the first communication device. The steps executed by the second communication device can be implemented by the second communication device itself, or can be implemented by the components (such as a baseband chip, or other processing units or processors, and the like) in the second communication device, or can be implemented by a larger device including the second communication device. The specific forms of the first communication device and the second communication device are not limited, for example, the first communication device can be a chip, and the second communication device can be a device; or the first communication device and the second communication device are both chips or devices. In possible scenarios, the first communication device can be the terminal device 120a shown in FIG. 1, or can be a chip (system) in the terminal device 120a in FIG. 1; the second communication device can be the network device 110a in FIG. 1, or can be a chip (system) in the network device 110a in FIG. 1, or a module or unit (such as a CU, a DU, or an RU, etc.) that completes part of the function of the network device 110a. For aspect description, the following takes the first communication device as a terminal device and the second communication device as a network device as an example, that is, the method provided by the embodiment of the application is executed by a terminal device and a network device. In the following, the “·” of the formula means multiplication.
[0139] Please refer to FIG. 3, which is a flowchart of the communication method provided by the embodiment of the application. FIG. 3 introduces the method from the perspective of interaction between the terminal device and the network device. As shown in FIG. 3, the flow of the communication method provided by the embodiment of the application includes the following steps.
[0140] S301, the network device sends a synchronization signal to the terminal device, and correspondingly, the terminal device receives the synchronization signal from the network device.
[0141] The synchronization signal can be obtained based on a first sequence, or in other words, the synchronization signal can be generated based on the first sequence. The elements of the first sequence satisfy a recursive relationship, and the recursive relationship is one-to-one corresponding to a primitive polynomial. For example, the recursive relationship of the first sequence satisfies: The primitive polynomial f(x) of the first sequence satisfies: M is a positive integer greater than 3, and r is a positive integer. When M = 4, the first sequence includes 4 values (i.e., 0, 1, 2, 3), and accordingly, the first sequence is also referred to as a quaternary sequence; when M = 6, the first sequence includes 6 values (i.e., 0, 1, 2, 3, 4, 5), and accordingly, the first sequence is also referred to as a sextenary sequence; and so on.
[0142] For example, the primitive polynomial f(x) of the first sequence satisfies: f(x) = x 7 + 1, and the recurrence relation of the first sequence satisfies: s(t) + s(t-6) + s(t-7) = 0. It can be understood 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 result needs to be modulo 4, i.e., -1 = 3, -2 = 2, and -3 = 1, and thus s(t) + s(t-6) + s(t-7) = 0 can also be converted to s(t) = s(t-6) + s(t-7).
[0143] For example, the length of the first sequence is 127, and the primitive polynomial of the first sequence is x 7 + 2x 4 + x + 3, or the primitive polynomial of the first sequence is x 7 + 3x 4 + 2x 2 + 3; and the recurrence relation of the first sequence can satisfy: x(i+7) = mod(2x(i+4) + 3x(i+1) + x(i), 4), or the recurrence relation of the first sequence can satisfy: x(i+7) = mod(x(i+4) + 2x(i+2) + x(i), 4). For example, the length of the first sequence is 255, and the primitive polynomial of the first sequence is x 8 + x 5 + 3x 3 + x 2 + 2x + 1, and the recurrence relation of the first sequence is x(i+8) = mod(3x(i+5) + x(i+3) + 3x(i+2) + 2x(i+1) + 3x(i), 4).
[0144] In the process of generating the synchronization signal, the initial value of the first sequence needs to be determined, and the first sequence can be obtained by processing the initial value. For example, the initial value is processed according to the recurrence relation, and the 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 can be generated based on any initial value in the initial value set, and then the synchronization signal is generated based on the first sequence.
[0145] In a possible implementation, the initial value set is predefined by a protocol, or is agreed upon by the network device and the terminal device, or is configured by the network device to the terminal device. The initial value set can be pre-stored in the network device or pre-stored in the terminal device. The specific implementation form of the initial value set is not limited in the embodiments of the present application. For example, the initial value set can be represented by a table, each row of the table corresponding to an initial value, so that the corresponding initial value can be determined according to the row index.
[0146] In a possible implementation, a sequence set composed of all sequences obtainable by the initial value set is predefined by a protocol, and the sequence set includes the first sequence. Alternatively, the sequence set is agreed upon by the network device and the terminal device, or is configured by the network device to the terminal device. The sequence set can be pre-stored in the network device or pre-stored in the terminal device. The specific implementation form of the sequence set is not limited in the embodiments of the present application. For example, the sequence set can be represented by a table, each row of the table corresponding to a sequence, so that the corresponding sequence can be determined according to the row index.
[0147] It is considered that there are sequences that are cyclic shifts of each other in the multiple sequences obtained by traversing all initial values in the initial value set. In the embodiments of the present application, any two initial values in the initial value set are different, so that the sequences generated based on the initial values in the initial value set are not cyclic shifts of each other to a certain extent. Therefore, any two initial values in the initial value set are different, and the sequences generated based on the initial values in the initial value set carry the cell identifier, which can ensure that the cell identifier is not confused, that is, it can be ensured that the cell identifier is not confused when detecting the synchronization signal.
[0148] It is considered that the binary sequence set obtained by taking modulo 2 of different initial values can be different, and then the cyclic shift value set used by the initial values is different, and then for different initial values, the same detection mechanism cannot be used to detect the cyclic shift value of the synchronization signal. Therefore, any two initial values in the initial value set are the same after taking modulo 2, so that the binary sequence set obtained by taking modulo 2 of any two initial values is the same, that is, it is ensured that the cyclic shift value set used by each initial value is the same, so that for different initial values, the same detection mechanism can be used to detect the cyclic shift value of the synchronization signal, and the complexity is low.
[0149] According to the length of the first sequence, the different recursive relationships / primitive polynomials of the first sequence, the initial value set corresponding to the first sequence is also different. The following specific examples show several possible initial value sets.
[0150] Example 1, the length of the first sequence is 127, and a recursive relationship of the first sequence satisfies: x(i+7) = mod(2x(i+4) + 3x(i+1) + x(i), 4) or x(i+7) = mod(x(i+4) + 2x(i+2) + x(i), 4); or, the length of the first sequence is 127, and a primitive polynomial of the first sequence is x 7 + 2x 4 + 3x 7 + 3x 4 + 2x 2 + 3.
[0151] In example 1, the initial value of the first sequence can be [x(6), x(5), x(4), x(3), x(2), x(l), x(0)], and the initial value set 1 to which the initial value belongs includes one or more sequences as follows: [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, 2, 0, 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],
[0152] Alternatively, the initial value of the first sequence can be [x(0), x(l), x(2), x(3), x(4), x(5), x(6)], which belongs to an initial value set including one or more sequences as follows: [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, 2, 0, 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],
[0153] Example 2, the length of the first sequence is 255, and 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); or, the length of the first sequence is 255, and the primitive polynomial of the first sequence is x 8 + x 5 + 3x 3 + x 2 + 2x + 1.
[0154] In Example 2, the initial value of the first sequence can be [x(7), x(6), x(5), x(4), x(3), x(2), x(l), x(0)], and the initial value set 2 to which the initial value belongs includes one or more sequences as follows: [3, 0, 0, 0, 0, 0, 0, 0], [l, 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], [l, 0, 0, 2, 0, 2, 0, 0], [l, 2, 0, 0, 0, 0, 0, 0], [l, 2, 2, 0, 2, 0, 2, 2], [3, 2, 0, 2, 0, 2, 0, 2], [l, 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], [l, 2, 0, 0, 0, 0, 0, 2], [l, 2, 2, 0, 0, 0, 0, 0], [3, 0, 2, 0, 2, 0, 2, 0], [l, 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], [l, 0, 0, 0, 0, 0, 2, 0], [l, 0, 0, 2, 0, 2, 0, 2], [3, 2, 0, 0, 0, 0, 0, 2], [l, 2, 2, 0, 2, 0, 2, 0], [3, 0, 0, 0, 0, 0, 2, 2], [l, 0, 0, 0, 0, 0, 2, 2], [3, 2, 2, 0, 2, 0, 2, 0], [3, 0, 0, 2, 0, 2, 0, 2], [l, 2, 2, 2, 2, 2, 2, 2], [3, 0, 2, 0, 0, 0, 0, 0], [l, 2, 0, 2, 0, 2, 0, 2], [l, 0, 2, 0, 2, 0, 2, 2], [l, 0, 0, 2, 2, 2, 0, 0], [l, 2, 0, 2, 0, 0, 0, 0], [3, 0, 2, 2, 2, 0, 0, 0], [l, 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], [l, 2, 0, 0, 2, 2, 2, 2], [l, 2, 2, 2, 0, 2, 0, 0], [l, 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,2,0,0,0],[3,0,2,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,0,2,2],[1,0,2,2,0,2,2,0],[3,2,0,2,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].
[0155] or the initial value of the first sequence can be [x(0), x(l), x(2), x(3), x(4), x(5), x(6), x(7)], which belongs to an initial value set including one or more sequences as follows: [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, 2, 0, 2, 0, 2, 2], [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,[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].
[0156] The cross-correlation values of the sequences corresponding to any two initial values in the initial value set of Example 1 / Example 2 are close, and therefore, an initial value can be selected from the initial value set as the initial value of the first sequence. For example, when the length of the first sequence is 127, an initial value can be selected from the initial value set 1 as the initial value of the first sequence. When the length of the first sequence is 255, an initial value can be selected from the initial value set 2 as the initial value of the first sequence.
[0157] It should be noted that the initial value set in Example 1 and Example 2 is only an example, and embodiments of the present application do not limit the primitive polynomial of the first sequence, and do not limit the recursive relationship of the first sequence. For example, a primitive polynomial with the least number of taps can be selected, thereby reducing the implementation complexity.
[0158] The first sequence can be obtained by cyclic shift of the initial value. For example, sequence [a, b, c, d] is cyclic shifted by cyclic shift value c, if c = 1, then sequence [a, b, c, d] is changed to [d, b, c, a] after cyclic shift. In the embodiments of the present application, different cyclic shift values c can carry different cell IDs, so that the cell IDs are distinguished by cyclic shift. There are multiple cyclic shift values c, and all possible c form a cyclic shift value set. When generating the synchronization signal, the cyclic shift value of the first sequence can be determined according to the cell to be identified. For example, c can be determined according to the first cell identifier, and the first cell identifier can be one identifier in the first cell identifier set. For example, for SSS, the first cell identifier is The first cell identifier set can be a set composed of all possible For example, the first cell identifier set is {0, 1, 2,..., 335}.
[0159] In specific implementation, the cyclic shift values can be obtained at equal intervals from the cyclic shift value set, that is, the cyclic shift values are at equal intervals. In this way, the minimum value of the interval between any two cyclic shift values is maximized, which can ensure lower cross-correlation between sequences. In addition, considering that frequency offset can cause confusion of different cyclic shift values. In the embodiments of the present application, the cyclic shift values are at equal intervals, which can achieve better anti-frequency offset effect by maximizing the interval between adjacent cyclic shift values.
[0160] For example, the length of the first sequence is L, c is p x ID, and the value range of ID is [0, K-1], K is a positive integer. p satisfies: p = floor (L / K), floor is the floor function, or p = ceil (L / K), ceil is the ceiling function; or p = round (L / K), round is rounding to the nearest integer.
[0161] Alternatively, K is 63, that is, the length of the first sequence is 127; or K is 127, that is, the length of the first sequence is 255.
[0162] 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. In this way, the number of initial values in the initial value set and the number of cyclic shift values in the cyclic shift value set can be determined according to the elements in the first cell identifier set (that is, the number of cell IDs), and all identifiers in the first cell identifier set can be distinguished by different initial values and / or cyclic shift values, that is, there is no confusion of cell identifiers.
[0163] For example, when the length of the SSS is 127, the first set of cell identities includes 378 cell identities, and the set of initial values includes 6 initial values, the set of cyclic shift values corresponding to each initial value includes 63 cyclic shift values. When the length of the SSS is 127, the first set of cell identities includes 672 cell identities, and the set of initial values includes 32 initial values, the set of cyclic shift values corresponding to each initial value includes 21 cyclic shift values. When the length of the SSS is 127, the first set of cell identities includes 1386 cell identities, and the set of initial values includes 22 initial values, the set of cyclic shift values corresponding to each initial value includes 63 cyclic shift values. In possible implementations, the correspondence between the first set of cell identities, the set of initial values, and the set of cyclic shift values corresponding to each initial value can be defined in advance.
[0164] The synchronization signal can be generated according to the cell ID, for example, the PSS and the SSS are generated according to the cell ID, and the cell ID is carried by the PSS and the SSS. According to the number of cell IDs, the number of cell IDs carried by the PSS is different, and the number of cell IDs carried by the SSS is different. The following is described with specific examples.
[0165] Example A: the number of cell IDs is 1134, the length of the SSS is 127, the first set of cell identities includes 378 cell identities, and the set of initial values includes 6 initial values, and the set of cyclic shift values corresponding to each initial value includes 63 cyclic shift values. Among the 6 initial values in the initial value set, any two initial values are different. In this case, the PSS can carry 3 cell IDs, and the SSS carries 378 cell IDs.
[0166] Among the 6 initial values in the initial value set, any two initial values are different, so there is no sequence that is cyclically shifted with each other in the plurality of sequences obtained by traversing all the initial values. In addition, the plurality of sequences correspond to cyclic shifts with a certain interval, which can achieve good frequency offset resistance.
[0167] Example B: the number of cell IDs is 2016, the length of the SSS is 127, the first set of cell identities includes 672 cell identities, and the set of initial values includes 32 initial values, and the set of cyclic shift values corresponding to each initial value includes 21 cyclic shift values. In this case, the PSS can carry 3 cell IDs, and the SSS carries 672 cell IDs. Among the 32 initial values in the initial value set, any two initial values are different.
[0168] Compared with Example A, the number of cell IDs in Example B is increased, in which case the initial value can be increased to distinguish more cells. For example, the initial value is increased to 32, so that more sequences can be obtained, which can carry more cell IDs.
[0169] In example C, the number of cell IDs is 1386, the length of SSS is 127, the first set of cell identities includes 672 cell identities, and the set of initial values includes 22 initial values, each of which corresponds to a set of 63 cyclic shift values. In this case, the PSS can carry 1 cell ID, and the SSS can carry 1386 cell IDs. Any two of the 22 initial values in the set of initial values are different.
[0170] Compared with example A, the number of cell IDs is increased in example C. In this case, the initial values can be increased to distinguish more cells. For example, the initial values are increased to 22, so that more sequences can be obtained to carry more cell IDs. In 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, and the set of initial values includes 32 initial values, each of which corresponds to a set of 63 cyclic shift values. Any two of the 32 initial values in the set of initial values are different. In this case, the PSS can carry 1 cell ID, and the SSS can carry 2016 cell IDs.
[0171] Compared with example C, the number of cell IDs is increased in example D. In this case, the initial values can be increased to distinguish more cells. For example, the initial values are increased to 32, and the cyclic shift values included in each set of initial values are increased, for example, the set of cyclic shift values corresponding to each initial value includes 63 cyclic shift values.
[0172] Before transmitting the synchronization signal, a second sequence can be generated according to the first sequence carrying the cell ID, and then the synchronization signal is generated according to the second sequence. For example, the first sequence can be obtained, the first sequence is cyclically shifted and modulated to generate the second sequence, and then the synchronization signal is generated according to the second sequence. The set of sequences in which the first sequence is located can be stored or predefined, and accordingly, the first sequence can be obtained from the predefined or stored set of sequences. Alternatively, a set of initial values used to generate the first sequence can be stored or predefined, and accordingly, an initial value can be obtained from the predefined or stored set of initial values, and the first sequence is generated according to the initial value.
[0173] Alternatively, before transmitting the synchronization signal, a second sequence can also be generated according to the cell ID, and then the synchronization sequence is generated according to the second sequence. In this case, the set of sequences in which the second sequence is located can be stored or predefined, so that the second sequence can be obtained from the set of sequences. The second sequence is a sequence generated according to the first sequence.
[0174] Alternatively, the network device can also generate the synchronization signal directly according to the cell ID and the synchronization sequence. A set of synchronization sequences can be stored or predefined, and the synchronization sequence can be obtained from the set of synchronization sequences. The synchronization sequence is a sequence generated according to the second sequence.
[0175] The modulation on the first sequence is actually mapping the elements in the first sequence to other values. When the synchronization signal is SSS, the network device can modulate the first sequence by quadrature phase shift keying (QPSK) to obtain the second sequence.
[0176] For example, the elements d(n) of the second sequence and the elements x(m) of the first sequence satisfy: wherein m=(n+c)mod L, A is a constant, c is an integer / cyclic shift value, 0≤n
[0177] Table 1
[0178] For another example, the elements d(n) of the second sequence and the elements x(m) of the first sequence satisfy Table 2, i.e., the element 0 in the first sequence can be mapped to 1+1j, the element 1 in the first sequence can be mapped to -1+1j, the element 3 in the first sequence can be mapped to 1-1j, and the element 3 in the first sequence can be mapped to -1-1j.
[0179] Table 2
[0180] When transmitting the synchronization signal, the second sequence can be mapped to L subcarriers, and the synchronization signal, e.g., SSS, can be generated according to the second sequence mapped to the L subcarriers. The synchronization signal can be transmitted in an OFDM waveform. It can be understood that the second sequence can carry a cell identifier, and since the second sequence is obtained according to the first sequence, c of the first sequence is determined according to the first cell identifier, so the second sequence is associated with the first cell identifier.
[0181] S302, the terminal device detects the synchronization signal.
[0182] The network device sends a synchronization signal, and correspondingly, the terminal device receives the synchronization signal. The process of the terminal device receiving the synchronization signal, that is, the process of the terminal device detecting the synchronization signal. The terminal device actually performs a sliding correlation calculation on the received sequence and a specific sequence, and if the obtained correlation peak is high, it can be determined that the received sequence is the specific sequence. The specific sequence can be stored in the terminal device in advance or generated by the terminal device. The terminal device can store multiple specific sequences, and when detecting the synchronization signal, the received sequence is correlated with each specific sequence, and the specific sequence with the maximum autocorrelation value is determined as the received sequence.
[0183] In the embodiments of the present application, the specific sequence has multiple implementation manners, and the detection manner of the synchronization signal is also different according to the implementation manner of the specific sequence, including but not limited to the following four manners.
[0184] Manner 1: The specific sequence is a first sequence, and the received signal can be processed based on the first sequence to detect the synchronization signal.
[0185] The first sequence can be obtained by cyclically shifting an initial value, and can be stored locally. At least one first sequence can be stored, and when detecting the synchronization signal, a first sequence can be obtained from the stored at least one first sequence. Alternatively, a set of initial values can be stored locally, and when detecting the synchronization signal, a first sequence can be generated by cyclically shifting an initial value selected from the set of initial values.
[0186] The terminal device processes the received signal according to the first sequence, including: the terminal device performs correlation processing on the received signal according to the first sequence to detect the synchronization signal. For example, for each obtained first sequence, the terminal device can generate a second sequence, obtain multiple second sequences, and traverse the multiple second sequences to perform correlation processing on the received signal to obtain multiple correlation values. The correlation processing includes correlation calculation, and the second sequence with the maximum correlation value is the synchronization sequence corresponding to the received signal.
[0187] Manner 2: The specific sequence is a first sequence, and the terminal device processes the received signal based on a second sequence to detect the synchronization signal. The second sequence is generated based on the first sequence.
[0188] For example, the first sequence can be obtained by cyclically shifting an initial value, and can be stored locally. At least one first sequence can be stored, and when detecting the synchronization signal, a first sequence can be obtained from the stored at least one first sequence. Alternatively, a set of initial values can be stored locally, and when detecting the synchronization signal, a first sequence can be generated by cyclically shifting an initial value selected from the set of initial values.
[0189] The terminal device processes the received signal according to the second sequence includes that the terminal device generates the second sequence according to the first sequence, and performs correlation processing on the received signal based on the second sequence. For example, for each first sequence obtained, the terminal device can generate a second sequence, obtain a plurality of second sequences, and perform correlation processing on the received signal by traversing the plurality of second sequences to obtain a plurality of correlation values. Among them, the second sequence with the maximum correlation value is the synchronization sequence corresponding to the received signal.
[0190] Method 3, the specific sequence is the second sequence, and the terminal device processes the received signal based on the second sequence to detect the synchronization signal.
[0191] The second sequence is generated based on the first sequence and can be stored locally. At least one second sequence can be stored, and when detecting the synchronization signal, a second sequence can be obtained from the stored at least one second sequence. Alternatively, at least one first sequence can be stored, and when detecting the synchronization signal, a first sequence can be selected from the stored at least one first sequence, and a second sequence is generated according to the selected first sequence. Alternatively, a set of initial values can be stored, and when detecting the synchronization signal, an initial value can be selected from the set of initial values to generate a first sequence through cyclic shift, and then a second sequence is generated according to the first sequence.
[0192] For the obtained second sequence, the terminal device performs correlation processing on the received signal by traversing the obtained second sequence, and determines the second sequence with the maximum correlation value as the synchronization sequence corresponding to the received signal.
[0193] Method 4, the specific sequence is the synchronization sequence, and the terminal device processes the received signal based on the synchronization sequence set to detect the synchronization signal.
[0194] The synchronization sequence set includes a second sequence, which is a sequence obtained based on the first sequence. At least one synchronization sequence set can be stored, and when detecting the synchronization signal, a sequence can be selected from the stored synchronization sequence set to process the received signal to detect the synchronization signal. Alternatively, at least one first sequence can be stored, and when detecting the synchronization signal, a first sequence can be selected from the stored at least one first sequence, and a second sequence is generated according to the selected first sequence. In this way, by traversing the stored first sequence, at least one second sequence can be generated to obtain the synchronization sequence set. Alternatively, a set of initial values can be stored, and when detecting the synchronization signal, an initial value can be selected from the set of initial values to generate a first sequence through cyclic shift, and then a second sequence is generated according to the first sequence. In this way, by traversing the stored initial value, at least one second sequence can be generated to obtain the synchronization sequence set.
[0195] When the terminal device detects the synchronization signal, all sequences in the synchronization sequence set can be sequentially correlated with the received signal to obtain a correlation value set, and the synchronization signal can be determined according to the maximum correlation value in the correlation value set. For example, the terminal device can determine the synchronization sequence corresponding to the maximum correlation value in the correlation value set as the synchronization sequence sent by the network device.
[0196] The terminal device can also determine the first cell identifier according to the maximum correlation value in the correlation value set. For example, when the terminal device processes the received synchronization signal according to the second sequence, the terminal device can project the synchronization signal to the binary field, determine the cyclic shift value (for example, referred to as the first cyclic shift value, that is, the aforementioned c) of the first sequence carried by the signal according to the projected synchronization signal, generate the first sequence set according to the first cyclic shift value and the initial value set, and then determine the first initial value according to the second sequence set and the synchronization signal; and then determine the first cell identifier according to the first initial value and the first cyclic shift value. The second sequence set includes the first sequence set, and the sequence in the second sequence set can be a sequence after modulation or a sequence without modulation.
[0197] For example, the terminal device actually obtains the absolute value of the real part (referred to as the real part absolute value) or the absolute value of the imaginary part (referred to as the imaginary part absolute value) of the received synchronization signal when projecting the synchronization signal to the binary field. For example, if the first sequence used to generate the synchronization signal is modulated according to Table 1, the terminal device projects the synchronization signal to the binary field, that is, the terminal device obtains the imaginary part absolute value of the received synchronization signal. If the first sequence used to generate the synchronization signal is modulated according to Table 2, the terminal device projects the synchronization signal to the binary field, that is, the terminal device obtains the real part of the received synchronization signal.
[0198] In the embodiments of the present application, the synchronization signals generated based on any different sequences in the plurality of sequences obtained based on the initial values in the initial value set are completely the same when projected to the binary field. 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 obtains the real part absolute value or the imaginary part absolute value of the synchronization signal, the terminal device performs correlation calculation on the obtained real part absolute value or imaginary part absolute value and the local sequence based on the FHT to determine the first cyclic shift value. After the terminal device determines the first cyclic shift value, the terminal device can obtain the first sequence set according to the first cyclic shift value and each initial value in the initial value set. One sequence in the first sequence set is obtained by performing the first cyclic shift value on one initial value in the initial value set. According to the maximum likelihood (ML) criterion, the first initial value corresponding to the synchronization signal can be determined according to the first sequence set and the synchronization signal, and the first cell identifier carried by the synchronization signal can be determined according to the first initial value and the first cyclic shift value.
[0199] The sequence generated based on the initial value in the initial value set provided by the embodiment of the present application can also reduce the detection complexity of the synchronization signal. When the number of cell IDs is large, the PSS can carry fewer cell IDs, for example, 1 cell ID, thereby further reducing the detection complexity of 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 accounts for a larger proportion. Therefore, in example D, when the number of cell IDs is large, the PSS can carry fewer cell IDs to further reduce the detection complexity of the synchronization signal.
[0200] Please refer to Table 3, which shows the complexity of generating SSS based on Gold sequence and Z4 sequence with length of 127. Table 3 takes PSS carrying 3 cell IDs as an example, and Table 3 shows the complexity of generating SSS based on Gold sequence and Z4 sequence, i.e. the number of calculations required to detect SSS, in the case of 1008 cell IDs, 2016 cell IDs and 4032 cell IDs.
[0201] Table 3
[0202] As can be seen from Table 3, generating SSS based on the Z4 sequence provided by the embodiment of the present application can reduce the detection complexity of SSS, thereby reducing the detection complexity of the synchronization signal.
[0203] In the embodiment of the present application, the first sequence (for example, the aforementioned Z4 sequence) has good cross-correlation performance, and using the first sequence to generate SSS can meet the large capacity requirement of SSS. For example, without frequency offset, the cross-correlation value of the 127-long Z4 sequence approaches the maximum cross-correlation value of the ZC sequence In addition, under the condition of meeting the large capacity requirement of SSS, the detection complexity of the synchronization signal can be reduced.
[0204] Alternatively, the first sequence can also be used as a sequence for generating PSS. In this case, a suitable PSS can be selected so that the cross-correlation between the PSS and the SSS is low.
[0205] For example, the primitive polynomial of the first sequence used as SSS satisfies: x 7 + 2x 4 + x + 3 or x 7 + 3x 4 + 2x 2 + 3, and correspondingly, the primitive polynomial of the PSS satisfies: x 7 + x + 1 and x 7 + x 4 + 1.
[0206] For example, the primitive polynomial of the first sequence used as the SSS satisfies: x 8 +x 5 +3x 3 +x 2 +2x+1, and correspondingly, the primitive polynomial of the PSS satisfies: x 8 +x 4 +x 3 +x 2 +1.
[0207] Wherein, if there are multiple PSSs, different cyclic shifts of the first sequence can be selected at equal intervals to generate multiple PSS sequences, for example, the length of the first sequence used for the PSS is 127, and the possible cyclic shift values are 0, 43 and 87.
[0208] The above describes the method provided by the embodiments of the present application by taking the terminal device and the network device as examples. In the present application, each embodiment can be implemented independently or in combination based on certain internal relations; different implementation manners in each embodiment can be implemented in combination or independently. In order to implement the functions in the method provided by the embodiments of the present application, the steps performed by the terminal device can be implemented by different functional entities constituting the terminal device. The steps performed by the network device can be implemented by different functional entities constituting the network device. For example, the network device can be a CU-DU architecture, the CU can generate a synchronization signal, and the DU can transmit the synchronization signal. In order to implement the functions in the method provided by the embodiments of the present application, the terminal device and the network device can include hardware structures and / or software modules, and the above functions can be implemented in the form of hardware structures, software modules, or hardware structures plus software modules. Whether a certain function in the above functions is implemented in the form of hardware structure, software module, or hardware structure plus software module depends on the specific application and design constraints of the technical solution.
[0209] Based on the same inventive concept as the method embodiments, the embodiments of the present application provide a communication apparatus. The communication apparatus used to implement the above method in the embodiments of the present application is introduced below with reference to the drawings. The content in the above can be used in the subsequent embodiments, and the repeated content will not be described again.
[0210] FIG. 4 is a schematic block diagram of a communication apparatus 400 provided by the embodiments of the present application. The communication apparatus 400 can be the first device or the second device in the above embodiments. For example, the communication apparatus 400 can be the terminal device in FIG. 1; or the communication apparatus 400 is a chip (system) in the terminal device; or the communication apparatus 400 is a software module of the terminal device. The communication apparatus 400 can correspond to implement the functions or steps implemented by the terminal device in the above various method embodiments. For another example, the communication apparatus 400 can be the network device in FIG. 1; or the communication apparatus 400 is a chip (system) in the network device; or the communication apparatus 400 is a software module of the network device. The communication apparatus 400 can correspond to implement the functions or steps implemented by the network device in the above various method embodiments. The communication apparatus 400 can include a processing module 410 and a transceiver module 420. Optionally, the communication apparatus 400 can further include a storage module, which can be used to store instructions (codes or programs) and / or data. The storage module can be, for example, a memory. The processing module 410 and the transceiver module 420 can be coupled with the storage module. For example, the processing module 410 can read the instructions (codes or programs) and / or data in the storage module to implement corresponding methods. When the communication apparatus 400 is a chip in the terminal device or the network device, the storage module can be a storage module in the chip, such as a register, a cache, etc. For example, the storage module can also be a storage module outside the chip in the terminal device or the network device, such as a read-only memory (ROM) or other types of static storage devices that can store static information and instructions, a random access memory (RAM), etc. The above various units can be independently arranged, or partially or entirely integrated.
[0211] The processing module 410 can be a processor or a controller, for example, can be a general central processing unit (CPU), a general processor, a digital signal processing (DSP), an application specific integrated circuits (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, transistor logic devices, hardware components or any combination thereof. It can implement or execute various exemplary logical blocks, modules and circuits described in combination with the disclosure. The processor can also be a combination of computing functions, such as including one or more microprocessor combinations, combinations of DSP and microprocessor, etc. The 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 in the form of a chip, the transceiver module 420 is an interface circuit of the chip for receiving signals from other chips or devices, or is an interface circuit of the chip for transmitting signals to other chips or devices.
[0212] In an implementation manner, the communication device 400 can correspondingly implement the behaviors and functions of the network device in the above method embodiments. The communication device 400 can be a network device, can be a component (for example, a chip or a circuit) in the network device, can be a part of a chip or a chip set in the network device for executing related method functions, or can be a software module in the network device capable of implementing the above communication method, without limitation. For details, reference can be made to the related contents of the above method embodiments, which will not be described here.
[0213] For example, the transceiver module 420 is configured to transmit the synchronization signal, the synchronization signal being a signal obtained based on the first sequence, wherein 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 the synchronization signal.
[0214] As an optional implementation manner, the elements in the first sequence satisfy a recursive relationship, the recursive relationship corresponding to a primitive polynomial in one-to-one manner, and the primitive polynomial f(x) satisfies: M is a positive integer greater than 3, r is a positive integer, and the length of the first sequence is N = 2 r -1.
[0215] As an optional implementation manner, the first sequence is a Z4 sequence.
[0216] As an optional implementation, the processing module 410 is specifically configured to generate the synchronization signal according to the second sequence. Wherein, the length 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: A is a complex number, c is an integer, 0≤n
[0217] As an optional implementation, the processing module 410 is specifically configured to: generate the second sequence according to the first sequence, map the second sequence onto the L subcarriers, and generate the synchronization signal according to the second sequence mapped onto the L subcarriers.
[0218] As an optional implementation, c is determined according to the first cell identifier, and / or the second sequence is associated with the first cell identifier, and the first cell identifier belongs to the first cell identifier set.
[0219] As an optional implementation, c belongs to a 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.
[0220] As an optional implementation, any two initial values in the initial value set are the same after modulo 2.
[0221] As an optional implementation, the length of the first sequence is 127, a recursive relation of the first sequence is x(i+7)=mod(2*x(i+4)+3*x(i+1)+x(i),4), or a recursive relation of the first sequence is x(i+7)=mod(x(i+4)+2*x(i+2)+x(i),4), and initial values [x(6), x(5), x(4), x(3), x(2), x(1), x(0)] of the first sequence belong to an initial value set, the initial value set including one or more sequences as follows: [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, 2, 0, 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],
[0222] As an optional implementation, the length of the first sequence is 127, and the recursive relationship of the first sequence is x(i+7) = mod(2*x(i+4)+3*x(i+1)+x(i), 4), or the recursive relationship of the first sequence is x(i+7) = mod(x(i+4)+2*x(i+2)+x(i), 4), wherein “*” indicates multiplication. The initial value [x(0), x(1), x(2), x(3), x(4), x(5), x(6)] of the first sequence belongs to an initial value set, and the initial value set includes one or more sequences such as [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,[1, 0, 2, 2, 0, 2, 2], [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].
[0223] As an optional implementation, the length of the first sequence is 127, the primitive polynomial of the first sequence is x 7 + 2x 4 + x + 3 or x 7 + 3x 4 + 2x 2 + 3.
[0224] As an optional implementation, the length of the first sequence is 255, and 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). In this case, the initial value [x(7), x(6), x(5), x(4), x(3), x(2), x(1), x(0)] of the first sequence belongs to an initial value set, and the initial value set includes one or more sequences such as [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, 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,[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,
[0225] As an optional implementation, the length of the first sequence is 255, and 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). In this case, the initial value [x(0), x(1), x(2), x(3), x(4), x(5), x(6), x(7)] of the first sequence belongs to an initial value set, and the initial value set includes one or more sequences such as [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, 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],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,[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].
[0226] As an optional implementation, the length of the first sequence is 255, the primitive polynomial of the first sequence is x 8 +x 5 +3x 3 +x 2 +2x+1.
[0227] As an optional implementation, the length of the first sequence is L, c is p x ID, ID is in the range of [0, K-1], K is a positive integer, p satisfies: p = floor(L / K), floor is a down rounding, or p = ceil(L / K), ceil is an up rounding; or p = round(L / K), round is rounding to the nearest integer. Optionally, K is 63 or 127.
[0228] As an optional implementation, the synchronization signal is an SSS, and data corresponding to the synchronization signal is transmitted in an OFDM waveform.
[0229] In another implementation, the communication apparatus 400 can correspondingly implement the behaviors and functions of the terminal device in the above method embodiments. The communication apparatus 400 can be a terminal device, or a component (for example, a chip or a circuit) applied to a terminal device, or a chip or a part of a chip group in a terminal device for executing related method functions, or a software module capable of implementing the method executed by the terminal device in the above communication method, without limitation. For details, reference can be made to the related content of the above method embodiments, which will not be described here again.
[0230] For example, the transceiver module 420 is configured to receive a synchronization signal. The processing module 410 is configured to detect the synchronization signal, which is a signal obtained based on a first sequence; wherein 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.
[0231] As an optional implementation, the processing module 410 is specifically configured to detect the synchronization signal in a manner one, manner two, manner three, or manner four.
[0232] The manner one includes that the processing module 410 acquires the first sequence, and processes the received signal according to the first sequence to detect the synchronization signal.
[0233] The manner two includes that the processing module 410 acquires the 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.
[0234] The manner three includes that the processing module 410 acquires a second sequence, and processes the received signal according to the second sequence to detect the synchronization signal, wherein the second sequence is generated based on the first sequence.
[0235] The manner four includes that the processing module 410 processes 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, and the second sequence is a sequence obtained based on the first sequence.
[0236] As an optional implementation, the elements in the first sequence satisfy a recursive relationship, and the recursive relationship corresponds to a primitive polynomial in one-to-one correspondence, wherein the primitive polynomial f(x) satisfies: M is a positive integer greater than 3, r is a positive integer, and the length of the first sequence is N=2 r -1.
[0237] As an optional implementation, the first sequence is a Z4 sequence.
[0238] As an optional implementation, 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: A is a complex number, c is an integer, 0≤n<L, 0≤m<L, x(m)=0, 1, 2 or 3.
[0239] As an optional implementation, c is determined according to the first cell identifier, and / or the second sequence is associated with the first cell identifier, which belongs to a first cell identifier set.
[0240] As an optional implementation, c belongs to a cyclic shift value set, and a number of elements in the first cell identifier set is equal to a product of a number of elements in an initial value set and a number of elements in the cyclic shift value set.
[0241] As an optional implementation, any two initial values in the initial value set are the same after modulo 2.
[0242] As an optional implementation, the processing module 410 is specifically configured to: sequentially perform inner product operations on all sequences in a synchronization sequence set and the received signal to obtain a correlation value set, the sequence in the synchronization sequence set includes the 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 the maximum correlation value in the correlation value set.
[0243] As an optional implementation, the processing module 410 is specifically configured to: project the synchronization signal, determine a first cyclic shift (i.e., c) according to the projected synchronization signal; 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 the first cell identifier according to the first initial value and the first cyclic shift.
[0244] As an optional implementation, the length of the first sequence is 127, a recursive relation of the first sequence is x(i+7)=mod(2*x(i+4)+3*x(i+1)+x(i),4), or a recursive relation of the first sequence is x(i+7)=mod(x(i+4)+2*x(i+2)+x(i),4), and initial values [x(6), x(5), x(4), x(3), x(2), x(1), x(0)] of the first sequence belong to an initial value set, the initial value set including one or more sequences as follows: [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, 2, 0, 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,[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].
[0245] As an optional implementation, the length of the first sequence is 127, and the recursive relationship of the first sequence is x(i+7) = mod(2 x(i+4) + 3 x(i+1) + x(i), 4), or the recursive relationship of the first sequence is x(i+7) = mod(x(i+4) + 2 x(i+2) + x(i), 4), where “·” indicates multiplication. The initial value of the first sequence is [x(0), x(1), x(2), x(3), x(4), x(5), x(6)] = [1, 0, 0, 0, 0, 0, 1]. 3), x(4), x(5), x(6)] belongs to a set of initial values that includes one or more sequences such as: [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, 2, 0, 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,[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],
[0246] As an alternative implementation, the first sequence has a length of 127, and a primitive polynomial of x 7 + 2x 4 + x + 3 or x 7 + 3x 4 + 2x 2 + 3.
[0247] As an optional implementation, the length of the first sequence is 255, and 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). In this case, the initial value [x(7), x(6), x(5), x(4), x(3), x(2), x(1), x(0)] of the first sequence belongs to an initial value set, and the initial value set includes one or more sequences such as [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, 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,[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,
[0248] As an optional implementation, the length of the first sequence is 255, and 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). In this case, the initial value [x(0), x(1), x(2), x(3), x(4), x(5), x(6), x(7)] of the first sequence belongs to an initial value set, and the initial value set includes one or more sequences such as [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, 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],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,[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].
[0249] As an optional implementation, the length of the first sequence is 255, the primitive polynomial is x 8 +x 5 +3x 3 +x 2 +2x+1.
[0250] As an optional implementation, the length of the first sequence is L, c is p x ID, ID is in the range of [0, K-1], K is a positive integer, p satisfies: p = floor(L / K), floor is down rounding, or p = ceil(L / K), ceil is up rounding; or p = round(L / K), round is rounding to the nearest integer.
[0251] As an optional implementation, the synchronization signal is an SSS, and data corresponding to the synchronization signal is transmitted in an OFDM waveform.
[0252] When the communication apparatus 400 is a chip type apparatus or circuit, the transceiver module can be an input / output circuit and / or a communication interface; and the processing module is an integrated processor or microprocessor or integrated circuit.
[0253] FIG. 5 is a schematic block diagram of a communication apparatus 500 according to an embodiment of the present application. The communication apparatus 500 can be a terminal device or a network device in the above embodiments. For example, the communication apparatus 500 can be a terminal device or a chip (system) in the terminal device in FIG. 1. In an embodiment of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices. The specific functions can be referred to the description in the above method embodiments. For another example, the communication apparatus 500 can be a network device or a chip (system) in the network device in FIG. 1. In an embodiment of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices. The specific functions can be referred to the description in the above method embodiments.
[0254] The communication apparatus 500 includes one or more processors 501 for implementing or for supporting implementation of the functions of a terminal device or a network device in the methods according to the embodiments of the present application. For details, refer to the detailed description in the method embodiments, which will not be repeated here. The processor 501 can also be referred to as a processing unit or a processing module, and can implement certain control functions. The processor 501 can be a general purpose processor or a special purpose processor. For example, it includes 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 coding and decoding processor, a controller, a memory, and / or a neural network processor, etc. The baseband processor can be used to process communication protocols and communication data. The central processing unit can be used to control the communication apparatus 500 (e.g., a network device or a terminal device), execute software programs and / or process data. Different processors can be independent devices, or can be integrated into one or more processors, for example, integrated into one or more application specific integrated circuits.
[0255] In one design, the processor 501 can include a program 503 (which can also be referred to as code or instructions at times) that can be run on the processor 501 to cause the communication apparatus 500 to perform the methods described in the following embodiments. In another possible design, the communication apparatus 500 includes a circuit (not shown in FIG. 5) for implementing the functions of a terminal device or a network device in the above embodiments.
[0256] In an example, the communication device 500 can include one or more memories 502 having thereon instructions 504 (which can also be referred to as code or a computer program) that are executable by the processor 501 to cause the communication device 500 to perform the methods described in the above method embodiments.
[0257] In an example, the processor 501 and / or the memory 502 can include an artificial intelligence (AI) module 507, which can be used to implement AI related functions. The AI module can be implemented in software, hardware, or a combination of software and hardware. For example, the AI module can include a RAN intelligent controller (RIC) module. The AI module can be a near-real-time RIC or a non-real-time RIC.
[0258] In an example, the processor 501 and / or the memory 502 can also store data. The processor and the memory can be separately arranged or integrated together.
[0259] In an example, the communication device 500 can also include a transceiver 505 and / or an antenna 506. The processor 501 can also be referred to as a processing unit, which controls the communication device 500. The transceiver 505 can also be referred to as a transceiving unit, a transceiver, a transceiving circuit, or a transceiver, which can be used to implement the transceiving function of the communication device 500 through the antenna 506.
[0260] In an example, the communication device 500 can also include one or more of the following components: a wireless communication module, an audio module, an external memory interface, an internal memory, a 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 can be understood that, in some embodiments, the communication device 500 can include more or less components, or some components can be integrated, or some components can be split. These components can be implemented in hardware, software, or a combination of software and hardware.
[0261] The communication apparatus in the above embodiments can be a terminal device, can be a circuit, can be a chip applied in the terminal device, or other combination device, component, etc. with the terminal device. Alternatively, the communication apparatus in the above embodiments can be a network device, can be a circuit, can be a chip applied in the network device, or other combination device, component, etc. with the network device. When the communication apparatus is a terminal device or a network device, the transceiver module can be a transceiver, can include an antenna and a radio frequency circuit, etc., and the processing module can be a processor, for example, a CPU. When the communication apparatus is a chip system, the communication apparatus can be an FPGA, can be a dedicated ASIC, can be a system chip (SoC), can be a CPU, can be a network processor (NP), can be a DSP, can be a micro controller unit (MCU), can be a programmable logic device (PLD), or other integrated chip. The processing module can be a processor of the chip system. The transceiver module or the communication interface can be an input / output interface or an interface circuit of the chip system. For example, the interface circuit can be a code / data read / write interface circuit. The interface circuit can be used to receive code instructions (the code instructions are stored in a memory, can be directly read from the memory, or can be read from the memory through other devices) and transmit to the processor; the processor can be used to run the code instructions to execute the method in the above method embodiments. For another example, the interface circuit can also be a signal transmission interface circuit between the communication processor and the transceiver.
[0262] The embodiments of the present application further provide a communication system, which includes at least one terminal device and at least one network device. The terminal device is a terminal device for implementing the functions related to the above communication method, and the network device is a network device for implementing the functions related to the above communication method. The embodiments of the present application further provide a computer readable storage medium, which includes instructions, when the instructions are executed on a computer, cause the computer to execute the method performed by the terminal device or the network device in the above communication method.
[0263] The embodiments of the present application further provide a computer program product, which includes computer program codes, when the computer program codes are executed, cause a computer to execute the method performed by the terminal device or the network device in the above communication method.
[0264] The embodiments of the present application provide a chip system, which includes a processor, and can further include a memory, for implementing the functions of the terminal device or the network device in the above communication method. The chip system can be composed of a chip, or can include a chip and other discrete devices.
[0265] To implement the functions of the communication apparatuses in FIGS. 4-5, the embodiments of the present application further provide a chip including a processor for supporting the communication apparatus to implement the functions of the terminal device or the network device involved in the above method embodiments. In a possible design, the chip is connected with a memory or the chip includes a memory, and the memory is used to store the computer programs or instructions and data necessary for the communication apparatus.
[0266] It should be understood that, in the various embodiments of the present application, the size of the sequence number of each process described above does not mean the order of execution, and the execution order of each process should be determined according to its function and inherent logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.
[0267] Those skilled in the art can realize that the various illustrative logical blocks and steps described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether the functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. The skilled person can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.
[0268] Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working processes of the above-described system, apparatus and unit can refer to the corresponding processes in the foregoing method embodiments, which will not be repeated here.
[0269] In several embodiments provided by the present application, it should be understood that the disclosed system, apparatus and method can be implemented by other manners. For example, the apparatus embodiments described above are merely illustrative, for example, the division of the units is only a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another system, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units shown or discussed can be indirect coupling or communication connection through some interfaces, devices or units, which can be electrical, mechanical or other forms.
[0270] The units described as separate components can or can not be physically separated, and the components shown as units can or can not be physical units, i.e. they can be located in one place or distributed on a plurality of network units. Part or all of the units can be selected according to actual needs to achieve the purpose of the embodiments of the present application.
[0271] If the functions are implemented in the form of software function units and sold or used as independent products, they can be stored in a computer readable storage medium. Based on this understanding, the part of the technical solutions of the present application that essentially contributes or the part of the technical solutions can be embodied in the form of a software product. The computer software product is stored in a storage medium and includes a plurality of instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the method described in the various embodiments of the present application. The aforementioned storage medium includes various media that can store program codes, such as a U disk, a mobile hard disk, a ROM, a RAM, a magnetic disk or an optical disk, etc.
[0272] Obviously, those skilled in the art can make various modifications and variations to the present application without departing from the scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application also intends to include these modifications and variations.
Claims
1. A communication method characterized by comprising: The method comprises: generating a synchronization signal, the synchronization signal being a signal obtained based on a first sequence; transmitting the synchronization signal; wherein 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.
2. The method of claim 1, wherein, The elements in the first sequence satisfy a recursive relationship, the recursive relationship corresponds to a primitive polynomial one by one, and the primitive polynomial f(x) satisfies: The M is a positive integer greater than 3, r is a positive integer, the length of the first sequence is N=2 r -1.
3. The method of claim 1 or 2, wherein, The first sequence is a Z4 sequence.
4. The method of any one of claims 1 to 3, wherein, The generating of the synchronization signal comprises: generating the synchronization signal according to a second sequence, wherein the first sequence and the second sequence both have a length L, and elements d(n) of the second sequence and elements x(m) of the first sequence satisfy: wherein m=(n+c)mod L, A is a complex number, c is an integer, 0≤n 5. The method of claim 4, wherein, The generating of the synchronization signal based on the second sequence comprises: generating the second sequence based on the first sequence; mapping the second sequence onto L subcarriers; generating the synchronization signal based on the second sequence mapped onto the L subcarriers.
6. The method of claim 4 or 5, wherein, The c is determined according to a first cell identifier, and / or the second sequence is associated with the first cell identifier, and the first cell identifier belongs to a first cell identifier set.
7. The method of claim 6, wherein, 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 a cyclic shift value set.
8. The method of claim 1, wherein, Any two initial values in the initial value set are the same after modulo 2.
9. The method of any one of claims 1 to 8, wherein, The first sequence has a length of 127, a recurrence relation of 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), and initial values [x(6), x(5), x(4), x(3), x(2), x(1), x(0)] belonging to a set of initial values, the set of initial values including one or more sequences of: [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, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0], [0, 1, 0, 0, 0, 1, 0], [0, 0, 1, 0, 0, 0, 1], [1, 1, 0, 0, 0, 0, 1], [0, 0, 0, 1, 1, 0, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 10. The method of any one of claims 1 to 8, wherein, The first sequence has a length of 127, a recurrence relation of 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), and initial values [x(0), x(1), x(2), x(3), x(4), x(5), x(6)] belonging to a set of initial values, the set of initial values including one or more sequences of: [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, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0], [0, 1, 0, 0, 0, 1, 0], [0, 0, 1, 0, 0, 0, 1], [1, 1, 0, 0, 0, 0, 1], [0, 0, 0, 1, 1, 0, 0], [1, 0, 0, 0, 1, 1, 0], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 1], [1, 1, 0, 0, 0, 0, 1], [0, 0, 0, 1, 1, 1, 1], [1, 0, 0, 0, 1, 1, 1], 11. The method of claim 2, 9 or 10, wherein, The first sequence has a length of 127, and a primitive polynomial of x 7 + 2x 4 + x + 3 or x 7 + 3x 4 + 2x 2 + 3.
12. The method of any one of claims 1 to 8, wherein, The first sequence has a length of 255, a recurrence relation of x(i+8) = mod(3*x(i+5) + x(i+3) + 3*x(i+2) + 2*x(i+1) + 3*x(i), 4), and initial values [x(7), x(6), x(5), x(4), x(3), x(2), x(1), x(0)] that belong to a set of initial values, the set of initial values including one or more sequences of: [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, 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,[3, 0, 0, 0, 0, 0, 0, 2], [3, 0, 0, 0, 0, 0, 2, 2], [3, 0, 0, 0, 0, 2, 0, 2], [3, 0, 0, 0, 0, 2, 2, 2], [3, 0, 0, 0, 2, 0, 0, 2], [3, 0, 0, 0, 2, 0, 2, 2], [3, 0, 0, 0, 2, 2, 0, 2], [3, 0, 0, 0, 2, 2, 2, 2], [3, 0, 0, 2, 0, 0, 0, 2], [3, 0, 0, 2, 0, 0, 2, 2], [3, 0, 0, 2, 0, 2, 0, 2], [3, 0, 0, 2, 0, 2, 2, 2], [3, 0, 0, 2, 2, 0, 0, 2], [3, 0, 0, 2, 2, 0, 2, 2], [3, 0, 0, 2, 2, 2, 0, 2], [3, 0, 0, 2, 2, 2, 2, 2], [3, 0, 2, 0, 0, 0, 0, 2], [3, 0, 2, 0, 0, 0, 2, 2], [3, 0, 2, 0, 0, 2, 0, 2], [3, 0, 2, 0, 0, 2, 2, 2], [3, 0, 2, 0, 2, 0, 0, 2], [3, 0, 2, 0, 2, 0, 2, 2], [3, 0, 2, 0, 2, 2, 0, 2], [3, 0, 2, 0, 2, 2, 2, 2], [3, 0, 2, 2, 0, 0, 0, 2], [3, 0, 2, 2, 0, 0, 2, 2], [3, 0, 2, 2, 0, 2, 0, 2], [3, 0, 2, 2, 0, 2, 2, 2], [3, 0, 2, 2, 2, 0, 0, 2], [3, 0, 2, 2, 2, 0, 2, 2], [3, 0, 2, 2, 2, 2, 0, 2], [3, 0, 2, 2, 2, 2, 2, 2], [3, 2, 0, 0, 0, 0, 0, 2], [3, 2, 0, 0, 0, 0, 2, 2], [3, 2, 0, 0, 0, 2, 0, 2], [3, 2, 0, 0, 0, 2, 2, 2], [3, 2, 0, 0, 2, 0, 0, 2], [3, 2, 0, 0, 2, 0, 2, 2], [3, 2, 0, 0, 2, 2, 0, 2], [3, 2, 0, 0, 2, 2, 2, 2], [3, 2, 0, 2, 0, 0, 0, 2], [3, 2, 0, 2, 0, 0, 2, 2], [3, 2, 0, 2, 0, 2, 0, 2], [3, 2, 0, 2, 0, 2, 2, 2], [3, 2, 0, 2, 2, 0, 0, 2], [3, 2, 0, 2, 2, 0, 2, 2], [3, 2, 0, 2, 2, 2, 0, 2], [3, 2, 0, 2, 2, 2, 2, 2], [3, 2, 2, 0, 0, 0, 0, 2], [3, 2, 2, 0, 0, 0, 2, 2], [3, 2, 2, 0, 0, 2, 0, 2], [3, 2, 2, 0, 0, 2, 2, 2], [3, 2, 2, 0, 2, 0, 0, 2], [3, 2, 2, 0, 2, 0, 2, 2], [3, 2, 2, 0, 2, 2, 0, 2], [3, 2, 2, 0, 2, 2, 2, 2], [3, 2, 2, 2, 0, 0, 0, 2], [3, 2, 2, 2, 0, 0, 2, 2], [3, 2, 2, 2, 0, 2, 0, 2], [3, 2, 2, 2, 0, 2, 2, 2], [3, 2, 2, 2, 2, 0, 0, 2], [3, 2, 2, 2, 2, 0, 2, 2], [3, 2, 2, 2, 2, 2, 0, 2], [3, 2, 2, 2, 2, 2, 2, 2], 13. The method of any one of claims 1 to 8, wherein, The first sequence has a length of 255, a recurrence relation of x(i+8) = mod(3*x(i+5) + x(i+3) + 3*x(i+2) + 2*x(i+1) + 3*x(i), 4), and initial values [x(0), x(1), x(2), x(3), x(4), x(5), x(6), x(7)] belonging to a set of initial values, the set of initial values including one or more sequences of: [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, 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, 0, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0, 0], [0, 1, 0, 0, 0, 1, 0, 0], [0, 0, 1, 0, 0, 0, 1, 0], [1, 1, 0, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0, 1], [0, 1, 0, 0, 0, 1, 0, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 0, 0], [1, 0, 0, 0, 1, 1, 0, 0], [0, 1, 0, 0, 0, 1, 1, 0], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 0, 0, 1], [1, 0, 0, 0, 1, 0, 0, 1], [0, 1, 0, 0, 0, 1, 0, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 1, 0], [1, 0, 0, 0, 1, 1, 1, 0], [0, 1, 0, 0, 0, 1, 1, 0], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 1, 1], 14. The method of claim 2, 12 or 13, wherein, The first sequence has a length of 255, and a primitive polynomial of x 8 + x 5 + 3x 3 + x 2 + 2x + 1.
15. The method of any one of claims 1 to 14, wherein, The length of the first sequence is L, the c is p×ID, the value range of ID is [0, K-1], K is a positive integer, and the p satisfies: p=floor(L / K), floor is a down rounding, or p=ceil(L / K), ceil is an up rounding; or p=round(L / K), round is rounding to the nearest integer.
16. A method of communication, comprising: The method comprises: detecting a synchronization signal, the synchronization signal being a signal obtained based on a first sequence; wherein 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.
17. The method of claim 16, wherein, The detecting of the synchronization signal comprises: detecting the synchronization signal in a manner one, manner two, manner three or manner four; wherein the manner one comprises: obtaining the first sequence, and processing a received signal according to the first sequence to detect the synchronization signal; The manner two comprises: obtaining the first sequence, generating a second sequence based on the first sequence, and processing the received signal according to the second sequence to detect the synchronization signal; The manner three comprises: obtaining the second sequence, and processing the received signal according to the second sequence to detect the synchronization signal, the second sequence being a sequence obtained based on the first sequence; The manner four comprises: processing the received signal according to a sequence in a synchronization sequence set to detect the synchronization signal, the sequence in the synchronization sequence set comprising the second sequence, the second sequence being a sequence obtained based on the first sequence.
18. The method of claim 17, wherein, The processing of the received signal according to the second sequence comprises: performing correlation processing on the received signal according to the second sequence.
19. The method of any one of claims 16 to 18, wherein, The elements in the first sequence satisfy a recursive relationship, the recursive relationship corresponds to a primitive polynomial one by one, and the primitive polynomial f(x) satisfies: The M is a positive integer greater than 3, r is a positive integer, the length of the first sequence is N=2 r -1.
20. The method of any one of claims 16 to 19, wherein, The first sequence is a Z4 sequence.
21. The method of any one of claims 17 to 20, wherein, The lengths of the first sequence and the second sequence are both L, and an element d(n) of the second sequence and an element x(m) of the first sequence satisfy: wherein m=(n+c)mod L, A is a complex number, c is an integer, 0≤n 22. The method of claim 21, wherein, The c is determined according to a first cell identifier, and / or the second sequence is associated with the first cell identifier, and the first cell identifier belongs to a first cell identifier set.
23. The method of claim 22, wherein, The c belongs to a cyclic shift value set, and a number of elements in the first cell identifier set is equal to a product of a number of elements in the initial value set and a number of elements in the cyclic shift value set.
24. The method of any one of claims 16 to 23, wherein, Any two initial values in the initial value set are the same after modulo 2.
25. The method of any one of claims 16 to 24, wherein, The first sequence has a length of 127, a recurrence relation of 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), and initial values [x(6), x(5), x(4), x(3), x(2), x(1), x(0)] belonging to a set of initial values, the set of initial values including one or more sequences of: [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, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0], [0, 1, 0, 0, 0, 1, 0], [0, 0, 1, 0, 0, 0, 1], [1, 1, 0, 0, 0, 0, 1], [0, 0, 0, 1, 1, 0, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 26. The method of any one of claims 16 to 24, wherein, The first sequence has a length of 127, a recurrence relation of 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), and initial values [x(0), x(1), x(2), x(3), x(4), x(5), x(6)] belonging to a set of initial values, the set of initial values including one or more sequences of: [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, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0], [0, 1, 0, 0, 0, 1, 0], [0, 0, 1, 0, 0, 0, 1], [1, 1, 0, 0, 0, 0, 1], [0, 0, 0, 1, 1, 0, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 1], 27. The method of claim 20 or 25 or 26, wherein, The first sequence has a length of 127, and a primitive polynomial of x 7 + 2x 4 + x + 3 or x 7 + 3x 4 + 2x 2 + 3.
28. The method of any one of claims 16 to 24, wherein, The first sequence has a length of 255, a recurrence relation of x(i+8) = mod(3*x(i+5) + x(i+3) + 3*x(i+2) + 2*x(i+1) + 3*x(i), 4), and initial values [x(7), x(6), x(5), x(4), x(3), x(2), x(1), x(0)] that belong to a set of initial values, the set of initial values including one or more sequences of: [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, 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,[3, 0, 0, 0, 0, 0, 0, 2], [3, 0, 0, 0, 0, 0, 2, 2], [3, 0, 0, 0, 0, 2, 0, 2], [3, 0, 0, 0, 0, 2, 2, 2], [3, 0, 0, 0, 2, 0, 0, 2], [3, 0, 0, 0, 2, 0, 2, 2], [3, 0, 0, 0, 2, 2, 0, 2], [3, 0, 0, 0, 2, 2, 2, 2], [3, 0, 0, 2, 0, 0, 0, 2], [3, 0, 0, 2, 0, 0, 2, 2], [3, 0, 0, 2, 0, 2, 0, 2], [3, 0, 0, 2, 0, 2, 2, 2], [3, 0, 0, 2, 2, 0, 0, 2], [3, 0, 0, 2, 2, 0, 2, 2], [3, 0, 0, 2, 2, 2, 0, 2], [3, 0, 0, 2, 2, 2, 2, 2], [3, 0, 2, 0, 0, 0, 0, 2], [3, 0, 2, 0, 0, 0, 2, 2], [3, 0, 2, 0, 0, 2, 0, 2], [3, 0, 2, 0, 0, 2, 2, 2], [3, 0, 2, 0, 2, 0, 0, 2], [3, 0, 2, 0, 2, 0, 2, 2], [3, 0, 2, 0, 2, 2, 0, 2], [3, 0, 2, 0, 2, 2, 2, 2], [3, 0, 2, 2, 0, 0, 0, 2], [3, 0, 2, 2, 0, 0, 2, 2], [3, 0, 2, 2, 0, 2, 0, 2], [3, 0, 2, 2, 0, 2, 2, 2], [3, 0, 2, 2, 2, 0, 0, 2], [3, 0, 2, 2, 2, 0, 2, 2], [3, 0, 2, 2, 2, 2, 0, 2], [3, 0, 2, 2, 2, 2, 2, 2], [3, 2, 0, 0, 0, 0, 0, 2], [3, 2, 0, 0, 0, 0, 2, 2], [3, 2, 0, 0, 0, 2, 0, 2], [3, 2, 0, 0, 0, 2, 2, 2], [3, 2, 0, 0, 2, 0, 0, 2], [3, 2, 0, 0, 2, 0, 2, 2], [3, 2, 0, 0, 2, 2, 0, 2], [3, 2, 0, 0, 2, 2, 2, 2], [3, 2, 0, 2, 0, 0, 0, 2], [3, 2, 0, 2, 0, 0, 2, 2], [3, 2, 0, 2, 0, 2, 0, 2], [3, 2, 0, 2, 0, 2, 2, 2], [3, 2, 0, 2, 2, 0, 0, 2], [3, 2, 0, 2, 2, 0, 2, 2], [3, 2, 0, 2, 2, 2, 0, 2], [3, 2, 0, 2, 2, 2, 2, 2], [3, 2, 2, 0, 0, 0, 0, 2], [3, 2, 2, 0, 0, 0, 2, 2], [3, 2, 2, 0, 0, 2, 0, 2], [3, 2, 2, 0, 0, 2, 2, 2], [3, 2, 2, 0, 2, 0, 0, 2], [3, 2, 2, 0, 2, 0, 2, 2], [3, 2, 2, 0, 2, 2, 0, 2], [3, 2, 2, 0, 2, 2, 2, 2], [3, 2, 2, 2, 0, 0, 0, 2], [3, 2, 2, 2, 0, 0, 2, 2], [3, 2, 2, 2, 0, 2, 0, 2], [3, 2, 2, 2, 0, 2, 2, 2], [3, 2, 2, 2, 2, 0, 0, 2], [3, 2, 2, 2, 2, 0, 2, 2], [3, 2, 2, 2, 2, 2, 0, 2], [3, 2, 2, 2, 2, 2, 2, 2], 29. The method of any one of claims 16 to 24, wherein, The first sequence has a length of 255, a recurrence relation of x(i+8) = mod(3*x(i+5) + x(i+3) + 3*x(i+2) + 2*x(i+1) + 3*x(i), 4), and initial values [x(0), x(1), x(2), x(3), x(4), x(5), x(6), x(7)] belonging to a set of initial values, the set of initial values including one or more sequences of: [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, 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, 0, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0, 0], [0, 1, 0, 0, 0, 1, 0, 0], [0, 0, 1, 0, 0, 0, 1, 0], [1, 1, 0, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0, 1], [0, 1, 0, 0, 0, 1, 0, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 0, 0], [1, 0, 0, 0, 1, 1, 0, 0], [0, 1, 0, 0, 0, 1, 1, 0], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 0, 0, 1], [1, 0, 0, 0, 1, 0, 0, 1], [0, 1, 0, 0, 0, 1, 0, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 1, 0], [1, 0, 0, 0, 1, 1, 1, 0], [0, 1, 0, 0, 0, 1, 1, 0], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 1, 1], 30. The method of claim 20, 28, or 29, wherein, The first sequence has a length of 255, and a primitive polynomial of x 8 + x 5 + 3x 3 + x 2 + 2x + 1.
31. The method of any one of claims 16 to 30, wherein, The first sequence has a length of L, the c is p*ID, the ID ranges from 0 to K-1, K is a positive integer, and the p satisfies: The p is floor(L / K), floor is a down rounding, or The p is ceil(L / K), ceil is an up rounding; or The p is round(L / K), round is rounding to the nearest integer.
32. The method of claim 31, wherein, K is 63 or 127, and the synchronization signal is a secondary synchronization signal SSS.
33. A communications device, characterized by Comprising: A processing module, configured to generate a synchronization signal, the synchronization signal being a signal obtained based on a first sequence; wherein 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; A transceiving module, configured to send the synchronization signal.
34. The apparatus of claim 33, wherein, The elements in the first sequence satisfy a recursive relationship, the recursive relationship corresponds to a primitive polynomial one-to-one, and the primitive polynomial f(x) satisfies: The M is a positive integer greater than 3, r is a positive integer, the length of the first sequence is N=2 r -1.
35. The apparatus of claim 33 or 34, wherein, The first sequence is a Z4 sequence.
36. The apparatus of any one of claims 33 to 35, wherein, The generating the synchronization signal comprises: generating the synchronization signal according to a second sequence, wherein the first sequence and the second sequence both have a length L, and elements d(n) of the second sequence and elements x(m) of the first sequence satisfy: wherein m=(n+c)mod L, A is a complex number, c is an integer, 0≤n 37. The apparatus of claim 36, wherein, The generating the synchronization signal based on the second sequence comprises: Generating the second sequence according to the first sequence; Mapping the second sequence onto L subcarriers; Generating the synchronization signal according to the second sequence mapped onto the L subcarriers.
38. The apparatus of claim 36 or 37, wherein, The c is determined according to a first cell identifier, and / or the second sequence is associated with the first cell identifier, and the first cell identifier belongs to a first cell identifier set.
39. The apparatus of claim 38, wherein, The c belongs to a cyclic shift value set, and a number of elements in the first cell identifier set is equal to a product of a number of elements in the initial value set and a number of elements in the cyclic shift value set.
40. The apparatus of claim 33, wherein, Any two initial values in the initial value set are the same after modulo 2.
41. The apparatus of any one of claims 33 to 40, wherein, The first sequence has a length of 127, a recurrence relation of 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), and initial values [x(6), x(5), x(4), x(3), x(2), x(1), x(0)] belonging to a set of initial values, the set of initial values including one or more sequences of: [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, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0], [0, 1, 0, 0, 0, 1, 0], [0, 0, 1, 0, 0, 0, 1], [1, 1, 0, 0, 0, 0, 1], [0, 0, 0, 1, 1, 0, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 42. The apparatus of any one of claims 33 to 40, wherein, The first sequence has a length of 127, a recurrence relation of 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), and initial values [x(0), x(1), x(2), x(3), x(4), x(5), x(6)] belonging to a set of initial values, the set of initial values including one or more sequences of: [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, 2, 0, 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, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0], [0, 1, 0, 0, 0, 1, 0], [0, 0, 1, 0, 0, 0, 1], [1, 1, 0, 0, 0, 0, 1], [0, 0, 0, 1, 1, 0, 0], [1, 0, 0, 0, 1, 1, 0], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 1], [1, 1, 0, 0, 0, 0, 1], [0, 0, 0, 1, 1, 1, 1], [1, 0, 0, 0, 1, 1, 1], 43. The apparatus of claim 34, 41 or 42, wherein, The first sequence has a length of 127 and a primitive polynomial of x 7 + 2x 4 + x + 3 or x 7 + 3x 4 + 2x 2 + 3.
44. The apparatus of any one of claims 33 to 40, wherein, The first sequence has a length of 255, a recurrence relation of x(i+8) = mod(3*x(i+5) + x(i+3) + 3*x(i+2) + 2*x(i+1) + 3*x(i), 4), and initial values [x(7), x(6), x(5), x(4), x(3), x(2), x(1), x(0)] that belong to a set of initial values, the set of initial values including one or more sequences of: [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, 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,[3, 0, 0, 0, 0, 0, 0, 2], [3, 0, 0, 0, 0, 0, 2, 2], [3, 0, 0, 0, 0, 2, 0, 2], [3, 0, 0, 0, 0, 2, 2, 2], [3, 0, 0, 0, 2, 0, 0, 2], [3, 0, 0, 0, 2, 0, 2, 2], [3, 0, 0, 0, 2, 2, 0, 2], [3, 0, 0, 0, 2, 2, 2, 2], [3, 0, 0, 2, 0, 0, 0, 2], [3, 0, 0, 2, 0, 0, 2, 2], [3, 0, 0, 2, 0, 2, 0, 2], [3, 0, 0, 2, 0, 2, 2, 2], [3, 0, 0, 2, 2, 0, 0, 2], [3, 0, 0, 2, 2, 0, 2, 2], [3, 0, 0, 2, 2, 2, 0, 2], [3, 0, 0, 2, 2, 2, 2, 2], [3, 0, 2, 0, 0, 0, 0, 2], [3, 0, 2, 0, 0, 0, 2, 2], [3, 0, 2, 0, 0, 2, 0, 2], [3, 0, 2, 0, 0, 2, 2, 2], [3, 0, 2, 0, 2, 0, 0, 2], [3, 0, 2, 0, 2, 0, 2, 2], [3, 0, 2, 0, 2, 2, 0, 2], [3, 0, 2, 0, 2, 2, 2, 2], [3, 0, 2, 2, 0, 0, 0, 2], [3, 0, 2, 2, 0, 0, 2, 2], [3, 0, 2, 2, 0, 2, 0, 2], [3, 0, 2, 2, 0, 2, 2, 2], [3, 0, 2, 2, 2, 0, 0, 2], [3, 0, 2, 2, 2, 0, 2, 2], [3, 0, 2, 2, 2, 2, 0, 2], [3, 0, 2, 2, 2, 2, 2, 2], [3, 2, 0, 0, 0, 0, 0, 2], [3, 2, 0, 0, 0, 0, 2, 2], [3, 2, 0, 0, 0, 2, 0, 2], [3, 2, 0, 0, 0, 2, 2, 2], [3, 2, 0, 0, 2, 0, 0, 2], [3, 2, 0, 0, 2, 0, 2, 2], [3, 2, 0, 0, 2, 2, 0, 2], [3, 2, 0, 0, 2, 2, 2, 2], [3, 2, 0, 2, 0, 0, 0, 2], [3, 2, 0, 2, 0, 0, 2, 2], [3, 2, 0, 2, 0, 2, 0, 2], [3, 2, 0, 2, 0, 2, 2, 2], [3, 2, 0, 2, 2, 0, 0, 2], [3, 2, 0, 2, 2, 0, 2, 2], [3, 2, 0, 2, 2, 2, 0, 2], [3, 2, 0, 2, 2, 2, 2, 2], [3, 2, 2, 0, 0, 0, 0, 2], [3, 2, 2, 0, 0, 0, 2, 2], [3, 2, 2, 0, 0, 2, 0, 2], [3, 2, 2, 0, 0, 2, 2, 2], [3, 2, 2, 0, 2, 0, 0, 2], [3, 2, 2, 0, 2, 0, 2, 2], [3, 2, 2, 0, 2, 2, 0, 2], [3, 2, 2, 0, 2, 2, 2, 2], [3, 2, 2, 2, 0, 0, 0, 2], [3, 2, 2, 2, 0, 0, 2, 2], [3, 2, 2, 2, 0, 2, 0, 2], [3, 2, 2, 2, 0, 2, 2, 2], [3, 2, 2, 2, 2, 0, 0, 2], [3, 2, 2, 2, 2, 0, 2, 2], [3, 2, 2, 2, 2, 2, 0, 2], [3, 2, 2, 2, 2, 2, 2, 2], 45. The apparatus of any one of claims 33 to 40, wherein, The first sequence has a length of 255, a recurrence relation of x(i+8) = mod(3*x(i+5) + x(i+3) + 3*x(i+2) + 2*x(i+1) + 3*x(i), 4), and initial values [x(0), x(1), x(2), x(3), x(4), x(5), x(6), x(7)] belonging to a set of initial values, the set of initial values including one or more sequences of: [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, 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, 0, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0, 0], [0, 1, 0, 0, 0, 1, 0, 0], [0, 0, 1, 0, 0, 0, 1, 0], [1, 1, 0, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0, 1], [0, 1, 0, 0, 0, 1, 0, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 0, 0], [1, 0, 0, 0, 1, 1, 0, 0], [0, 1, 0, 0, 0, 1, 1, 0], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 0, 0, 1], [1, 0, 0, 0, 1, 0, 0, 1], [0, 1, 0, 0, 0, 1, 0, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 1, 0], [1, 0, 0, 0, 1, 1, 1, 0], [0, 1, 0, 0, 0, 1, 1, 0], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 1, 1], 46. The apparatus of claim 34, 44, or 45, wherein, The first sequence has a length of 255, and a primitive polynomial of x 8 + x 5 + 3x 3 + x 2 + 2x + 1.
47. The apparatus of any one of claims 33 to 46, wherein, The first sequence has a length of L, the c is p*ID, the ID ranges from 0 to K-1, K is a positive integer, and the p satisfies: The p is floor(L / K), floor is a down rounding, or The p is ceil(L / K), ceil is an up rounding; or The p is round(L / K), round is rounding to the nearest integer.
48. A communications device, characterized by Comprising: Detecting a synchronization signal, the synchronization signal being a signal obtained based on a first sequence; Wherein 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.
49. The apparatus of claim 48, wherein, The detecting the synchronization signal comprises detecting the synchronization signal in a manner one, a manner two, a manner three, or a manner four; The first sequence is obtained, and a received signal is processed according to the first sequence to detect the synchronization signal. The first sequence is obtained, a second sequence is generated according to the first sequence, and the received signal is processed according to the second sequence to detect the synchronization signal. The second sequence is obtained, and the received signal is processed according to the second sequence to detect the synchronization signal, the second sequence being generated based on the first sequence. The received signal is processed according to a sequence in a synchronization sequence set to detect the synchronization signal, the sequence in the synchronization sequence set including the second sequence, the second sequence being a sequence obtained based on the first sequence.
50. The apparatus of claim 49, wherein, The received signal is processed according to the second sequence, including: The received signal is correlated according to the second sequence.
51. The apparatus of any one of claims 48-50, wherein, The elements in the first sequence satisfy a recursive relationship, the recursive relationship corresponds to a primitive polynomial one by one, and the primitive polynomial f(x) satisfies: The M is a positive integer greater than 3, r is a positive integer, the length of the first sequence is N=2 r -1.
52. The apparatus of any one of claims 48-51, wherein, The first sequence is a Z4 sequence.
53. The apparatus of any one of claims 49 to 52, wherein, The first sequence and the second sequence both have a length L, and elements d(n) of the second sequence and elements x(m) of the first sequence satisfy: Wherein, m=(n+c)mod L, A is a complex number, c is an integer, 0≤n 54. The apparatus of claim 53 wherein, The c is determined according to a first cell identifier, and / or the second sequence is associated with the first cell identifier, and the first cell identifier belongs to a first cell identifier set.
55. The apparatus of claim 54 wherein, The c belongs to a cyclic shift value set, and a number of elements in the first cell identifier set is a product of a number of elements in an initial value set and a number of elements in the cyclic shift value set.
56. The apparatus of any one of claims 48 to 55, wherein, Any two initial values in the initial value set are the same after modulo 2.
57. The apparatus of any one of claims 48 to 56, wherein, The first sequence has a length of 127, a recurrence relation of 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), and initial values [x(6), x(5), x(4), x(3), x(2), x(1), x(0)] belonging to a set of initial values, the set of initial values including one or more sequences of: [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, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0], [0, 1, 0, 0, 0, 1, 0], [0, 0, 1, 0, 0, 0, 1], [1, 1, 0, 0, 0, 0, 1], [0, 0, 0, 1, 1, 0, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 58. The apparatus of any one of claims 48 to 56, wherein, The first sequence has a length of 127, a recurrence relation of 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), and initial values [x(0), x(1), x(2), x(3), x(4), x(5), x(6)] belonging to a set of initial values, the set of initial values including one or more sequences of: [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, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0], [0, 1, 0, 0, 0, 1, 0], [0, 0, 1, 0, 0, 0, 1], [1, 1, 0, 0, 0, 0, 1], [0, 0, 0, 1, 1, 0, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 1], 59. The apparatus of claim 52 or 57 or 58, wherein, The first sequence has a length of 127 and a primitive polynomial of x 7 + 2x 4 + x + 3 or x 7 + 3x 4 + 2x 2 + 3.
60. The device of any one of claims 48 to 56, wherein, The first sequence has a length of 255, a recurrence relation of x(i+8) = mod(3*x(i+5) + x(i+3) + 3*x(i+2) + 2*x(i+1) + 3*x(i), 4), and initial values [x(7), x(6), x(5), x(4), x(3), x(2), x(1), x(0)] that belong to a set of initial values, the set of initial values including one or more sequences of: [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, 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,[3, 0, 0, 0, 0, 0, 0, 2], [3, 0, 0, 0, 0, 0, 2, 2], [3, 0, 0, 0, 0, 2, 0, 2], [3, 0, 0, 0, 0, 2, 2, 2], [3, 0, 0, 0, 2, 0, 0, 2], [3, 0, 0, 0, 2, 0, 2, 2], [3, 0, 0, 0, 2, 2, 0, 2], [3, 0, 0, 0, 2, 2, 2, 2], [3, 0, 0, 2, 0, 0, 0, 2], [3, 0, 0, 2, 0, 0, 2, 2], [3, 0, 0, 2, 0, 2, 0, 2], [3, 0, 0, 2, 0, 2, 2, 2], [3, 0, 0, 2, 2, 0, 0, 2], [3, 0, 0, 2, 2, 0, 2, 2], [3, 0, 0, 2, 2, 2, 0, 2], [3, 0, 0, 2, 2, 2, 2, 2], [3, 0, 2, 0, 0, 0, 0, 2], [3, 0, 2, 0, 0, 0, 2, 2], [3, 0, 2, 0, 0, 2, 0, 2], [3, 0, 2, 0, 0, 2, 2, 2], [3, 0, 2, 0, 2, 0, 0, 2], [3, 0, 2, 0, 2, 0, 2, 2], [3, 0, 2, 0, 2, 2, 0, 2], [3, 0, 2, 0, 2, 2, 2, 2], [3, 0, 2, 2, 0, 0, 0, 2], [3, 0, 2, 2, 0, 0, 2, 2], [3, 0, 2, 2, 0, 2, 0, 2], [3, 0, 2, 2, 0, 2, 2, 2], [3, 0, 2, 2, 2, 0, 0, 2], [3, 0, 2, 2, 2, 0, 2, 2], [3, 0, 2, 2, 2, 2, 0, 2], [3, 0, 2, 2, 2, 2, 2, 2], [3, 2, 0, 0, 0, 0, 0, 2], [3, 2, 0, 0, 0, 0, 2, 2], [3, 2, 0, 0, 0, 2, 0, 2], [3, 2, 0, 0, 0, 2, 2, 2], [3, 2, 0, 0, 2, 0, 0, 2], [3, 2, 0, 0, 2, 0, 2, 2], [3, 2, 0, 0, 2, 2, 0, 2], [3, 2, 0, 0, 2, 2, 2, 2], [3, 2, 0, 2, 0, 0, 0, 2], [3, 2, 0, 2, 0, 0, 2, 2], [3, 2, 0, 2, 0, 2, 0, 2], [3, 2, 0, 2, 0, 2, 2, 2], [3, 2, 0, 2, 2, 0, 0, 2], [3, 2, 0, 2, 2, 0, 2, 2], [3, 2, 0, 2, 2, 2, 0, 2], [3, 2, 0, 2, 2, 2, 2, 2], [3, 2, 2, 0, 0, 0, 0, 2], [3, 2, 2, 0, 0, 0, 2, 2], [3, 2, 2, 0, 0, 2, 0, 2], [3, 2, 2, 0, 0, 2, 2, 2], [3, 2, 2, 0, 2, 0, 0, 2], [3, 2, 2, 0, 2, 0, 2, 2], [3, 2, 2, 0, 2, 2, 0, 2], [3, 2, 2, 0, 2, 2, 2, 2], [3, 2, 2, 2, 0, 0, 0, 2], [3, 2, 2, 2, 0, 0, 2, 2], [3, 2, 2, 2, 0, 2, 0, 2], [3, 2, 2, 2, 0, 2, 2, 2], [3, 2, 2, 2, 2, 0, 0, 2], [3, 2, 2, 2, 2, 0, 2, 2], [3, 2, 2, 2, 2, 2, 0, 2], [3, 2, 2, 2, 2, 2, 2, 2], 61. The device of any one of claims 48 to 56, wherein, The first sequence has a length of 255, a recurrence relation of x(i+8) = mod(3*x(i+5) + x(i+3) + 3*x(i+2) + 2*x(i+1) + 3*x(i), 4), and initial values [x(0), x(1), x(2), x(3), x(4), x(5), x(6), x(7)] belonging to a set of initial values, the set of initial values including one or more sequences of: [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, 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, 0, 0, 0, 0, 0, 0, 0], [1, 0, 0, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0, 0], [0, 1, 0, 0, 0, 1, 0, 0], [0, 0, 1, 0, 0, 0, 1, 0], [1, 1, 0, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0, 1], [0, 1, 0, 0, 0, 1, 0, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 0, 0], [1, 0, 0, 0, 1, 1, 0, 0], [0, 1, 0, 0, 0, 1, 1, 0], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 0], [0, 0, 0, 1, 1, 0, 0, 1], [1, 0, 0, 0, 1, 0, 0, 1], [0, 1, 0, 0, 0, 1, 0, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 1, 0], [1, 0, 0, 0, 1, 1, 1, 0], [0, 1, 0, 0, 0, 1, 1, 0], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1, 1], [0, 0, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 1, 1], 62. The apparatus of claim 52, 60, or 61, wherein, The first sequence has a length of 255, and a primitive polynomial of x 8 + x 5 + 3x 3 + x 2 + 2x + 1.
63. The device of any one of claims 48 to 62, wherein, The first sequence has a length L, the c is p×ID, the ID ranges from 0 to K-1, K is a positive integer, and the p satisfies: p=floor(L / K), floor is a down rounding, or p=ceil(L / K), ceil is an up rounding; or p=round(L / K), round is rounding to the nearest integer.
64. The apparatus of claim 63 wherein, K is 63 or 127, and the synchronization signal is a secondary synchronization signal SSS.
65. A communications device, characterized by The communication device includes at least one processor and at least one memory, the at least one memory is used to store a computer program, and the at least one processor is used to execute the computer program stored on the memory, so that the communication device executes the method in any one of claims 1-15, or so that the communication device executes the method in any one of claims 16-32.
66. A computer-readable storage medium, characterized in that, The computer readable storage medium is used to store a computer program, when the computer program runs on a computer, so that the computer executes the method in any one of claims 1-15, or so that the computer executes the method in any one of claims 16-32.
67. A computer program product, characterised in that, The computer program product comprises a computer program which, when run on a computer, causes the computer to perform the method of any one of claims 1-15, or causes the computer to perform the method of any one of claims 16-32.
68. A chip or chip system, characterized by The chip or chip system comprises: at least one processor and an interface, the at least one processor being configured to call and run instructions from the interface, the at least one processor, when executing the instructions, implementing the method of any one of claims 1-15, or implementing the method of any one of claims 16-32.
Citation Information
Patent Citations
Synchronization signal transmission method, synchronization signal detection method, base station and user equipment
CN108282432A
Sequence design for synchronization and device identification in wireless communication systems
CN108811522A
Communication method and apparatus
CN113767682A
Narrow band synchronization signal transmission and detection
US20170288848A1