A communication method, apparatus and system

Abstract

This application relates to the field of communication technology and discloses a communication method, apparatus, and system. The method includes: a first communication device generating a synchronization signal for a first cell based on a first sequence and transmitting the synchronization signal; wherein the first sequence is a sequence associated with the first cell in a first sequence set, the first sequence set also includes a second sequence, and the first sequence and the second sequence are Gray complementary sequence pairs. Thus, in the solution provided by the embodiments of this application, the synchronization signal is generated based on the first sequence, and the first sequence and the second sequence are Gray complementary sequence pairs, thereby facilitating a reduction in the detection complexity of the synchronization signal.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a communication method, apparatus and system. Background Technology

[0002] In wireless communication systems, synchronization signals are used for time and frequency synchronization between terminal devices and network devices. For example, a network device can send a synchronization signal (SS) / physical broadcast channel (PBCH) block (SS / PBCH block), and the terminal device, upon receiving the SS / PBCH block, can perform time and frequency synchronization and obtain cell information.

[0003] Because the reception and demodulation of SS / PBCH blocks place high demands on the RF bandwidth, signal processing capabilities, and power consumption of terminal devices, low-power synchronization signals have been designed to match the low-power receivers of less capable terminal devices. However, further research is needed to reduce the detection complexity of synchronization signals (such as low-power synchronization signals). Summary of the Invention

[0004] This application provides a communication method, apparatus, and system for reducing the detection complexity of synchronization signals, thereby reducing the power consumption of terminal devices.

[0005] In a first aspect, embodiments of this application provide a communication method, which can be executed by a first communication device. Unless otherwise specified, the "first communication device" in this application can refer to a first communication equipment (e.g., a network device), a component within the first communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. For example, in the method provided in the first aspect, the first communication device generates a synchronization signal for a first cell based on a first sequence and transmits the synchronization signal; wherein the first sequence is a sequence associated with the first cell in a first sequence set, the first sequence set further includes a second sequence, and the first sequence and the second sequence are Gray complementary sequence pairs.

[0006] Thus, in the solution provided by the embodiments of this application, the synchronization signal is generated based on the first sequence, and the first sequence and the second sequence are Gray complementary sequence pairs, which facilitates the reduction of the detection complexity of the synchronization signal and reduces the power consumption of the terminal device.

[0007] For example, when the first sequence set includes two sequences (i.e., the first sequence and the second sequence), and these two sequences are Gray complementary sequence pairs, the terminal device, during time-domain sliding detection, performs 2log2N addition and subtraction operations for each sliding sampling point to obtain the two correlation values ​​between the received sequence at that sampling point and the two sequences in the first sequence set. N represents the length of the first or second sequence (the first and second sequences have the same length). However, when the first sequence set includes two sequences, and these two sequences are m-sequences or Gold sequences, the terminal device, during time-domain sliding detection, performs 2(N-1) addition operations for each sliding sampling point to obtain the two correlation values ​​between the received sequence at that sampling point and the two sequences in the first sequence set. Alternatively, when the first sequence set includes two sequences, and these two sequences are generalized Gray sequences but not Gray complementary sequence pairs, the terminal device performs 2(2log2N-1) addition and subtraction operations for each sliding sampling point during time-domain sliding detection to obtain the two correlation values ​​between the received sequence obtained at that sampling point and the two sequences in the first sequence set. By comparison, it can be seen that the scheme provided in this application embodiment can effectively reduce the detection complexity of synchronization signals.

[0008] In one possible design, the method further includes: determining the first sequence associated with the first cell from the first sequence set based on the identifier of the first cell.

[0009] Thus, the sequence associated with the first cell is determined based on the identifier of the first cell, which makes it easier to ensure that different cells (such as adjacent cells) are associated with different sequences, so that the terminal device can accurately obtain the cell identifier.

[0010] In one possible design, the synchronization signal is a single-carrier waveform, which includes an on / off keying OOK waveform.

[0011] Thus, since the overall power consumption of OOK modulation is lower than that of other modulation methods, the waveform of the synchronization signal is an OOK waveform, which is convenient for meeting the requirements of low power consumption.

[0012] In one possible design, the length of the first sequence is 16, and the first sequence is any of the following:

[0013] [1,-1,-1,1,1,-1,1,-1,1,-1,-1,1,-1,1,-1,1,-1];

[0014] [1,1,-1,-1,1,1,1,1,1,1,-1,-1,-1,1,1,1,1];

[0015] [1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1];

[0016] [1,1,1,1,1,1,1,1,1,-1,-1,-1,1,1,-1,-1,1,1];

[0017] [1,-1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,-1,1,1,-1];

[0018] [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,1,1];

[0019] [1,-1,-1,1,-1,1,-1,1,1,-1,-1,1,1,-1,1,-1,1,-1]; or

[0020] [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,1].

[0021] In one possible design, the first sequence and the second sequence are obtained based on the third sequence, the fourth sequence, and the fifth sequence; the nth element in the first sequence is denoted as a(n), the nth element in the second sequence is denoted as b(n), n = 1, 2, ..., N, the i-th element in the third sequence is denoted as W1(i), the i-th element in the fourth sequence is denoted as W2(i), and the i-th element in the fifth sequence is P(i), i = 1, 2, ..., I, I = log2N, where N is an integer greater than 1;

[0022] a1(n)=δ(n)

[0023] b1(n)=δ(n)

[0024] a i+1 (n)=a i (n)+W1(i)b i (n-2 P(i) )

[0025] b i+1 (n)=a i (n)-W2(i)b i (n-2 P(i) )

[0026] Where δ(n) is pre-configured or predefined; a(n) = a I+1 (n), b(n) = b I+1 (n), or, a(n) = b I+1 (n), b(n) = a I+1 (n).

[0027] In one possible design, N equals 16, the third sequence is denoted as W1, the fourth sequence as W2, and the fifth sequence as P; the third, fourth, and fifth sequences are any one of the following:

[0028] W1=[1,1,-1,-1], W2=[-1,1,1,-1], P=[3,2,1,0];

[0029] W1=[-1,1,1,-1], W2=[-1,-1,-1,-1], P=[3,1,2,0];

[0030] W1 = [1,-1,-1,-1], W2 = [1,-1,1,-1], P = [3,1,2,0]; or

[0031] W1=[1,-1,-1,-1], W2=[1,-1,1,-1], P=[3,2,1,0].

[0032] In one possible design, the method further includes: determining the first sequence set, the first sequence set comprising at least one Gray complementary sequence pair.

[0033] In one possible design, the aperiodic cross-correlation value between any two sequences in the first sequence set is less than or equal to a first threshold, and the aperiodic autocorrelation value of any sequence in the first sequence set is less than or equal to a second threshold.

[0034] Thus, since there are a large number of Gray complementary sequence pairs, in this embodiment of the application, at least one Gray complementary sequence pair that meets the above conditions can be selected from a large number of Gray complementary sequence pairs to form a first sequence set, thereby facilitating the improvement of the detection performance and synchronization performance of the synchronization signal.

[0035] In one possible design, each sequence in the first sequence set has a length of 16, and the first sequence set includes at least one Gray complementary sequence pair from Gray complementary sequence pair 1 to Gray complementary sequence pair 4:

[0036] Gray complementary sequence pair 1: [1,-1,-1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,-1,1,-1] and [1,1,-1,-1,-1,-1,1,1,1,1,1,1,-1,-1,-1,1,1,1,1];

[0037] Gray complementary sequence pair 2: [1,-1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1] and [1,1,1,1,1,1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,1];

[0038] Gray complementary sequence pairs 3: [1,-1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,-1,1,1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,1,1]; or...

[0039] Gray complementary sequence pair 4: [1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,1].

[0040] In one possible design, each of the at least one Gray complementary sequence pair is generated based on a third sequence, a fourth sequence, and a fifth sequence, wherein the third sequence is denoted as W1, the fourth sequence as W2, and the fifth sequence as P; when the length of each sequence in the first sequence set is 16, the at least one Gray complementary sequence pair is generated based on at least one of the following:

[0041] W1=[1,1,-1,-1], W2=[-1,1,1,-1], P=[3,2,1,0];

[0042] W1=[-1,1,1,-1], W2=[-1,-1,-1,-1], P=[3,1,2,0];

[0043] W1 = [1,-1,-1,-1], W2 = [1,-1,1,-1], P = [3,1,2,0]; or

[0044] W1=[1,-1,-1,-1], W2=[1,-1,1,-1], P=[3,2,1,0].

[0045] Secondly, embodiments of this application provide a communication method, which can be executed by a second communication device. Unless otherwise specified, the "second communication device" in this application can refer to a second communication equipment (e.g., a terminal device), a component within the second communication equipment (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication equipment. For example, in the method provided in the second aspect, the second communication device receives a synchronization signal and processes the synchronization signal according to a first sequence; wherein the first sequence belongs to a first sequence set, the first sequence set further includes a second sequence, and the first sequence and the second sequence are Gray complementary sequence pairs.

[0046] In one possible design, the method further includes: determining the first sequence associated with the first cell from the first sequence set based on the identifier of the first cell.

[0047] In one possible design, the synchronization signal is a single-carrier waveform, which includes an on / off keying OOK waveform.

[0048] In one possible design, the length of the first sequence is 16, and the first sequence is any of the following:

[0049] [1,-1,-1,1,1,-1,1,-1,1,-1,-1,1,-1,1,-1,1,-1];

[0050] [1,1,-1,-1,1,1,1,1,1,1,-1,-1,-1,1,1,1,1];

[0051] [1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1];

[0052] [1,1,1,1,1,1,1,1,1,-1,-1,-1,1,1,-1,-1,1,1];

[0053] [1,-1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,-1,1,1,-1];

[0054] [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,1,1];

[0055] [1,-1,-1,1,-1,1,-1,1,1,-1,-1,1,1,-1,1,-1,1,-1]; or

[0056] [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,1].

[0057] In one possible design, the first sequence and the second sequence are obtained based on the third sequence, the fourth sequence, and the fifth sequence; the nth element in the first sequence is denoted as a(n), the nth element in the second sequence is denoted as b(n), n = 1, 2, ..., N, the i-th element in the third sequence is denoted as W1(i), the i-th element in the fourth sequence is denoted as W2(i), and the i-th element in the fifth sequence is P(i), i = 1, 2, ..., I, I = log2N, where N is an integer greater than 1;

[0058] a1(n)=δ(n)

[0059] b1(n)=δ(n)

[0060] a i+1 (n)=a i (n)+W1(i)b i (n-2 P(i) )

[0061] b i+1 (n)=a i (n)-W2(i)b i (n-2 P(i) )

[0062] Where δ(n) is pre-configured or predefined; a(n) = a I+1 (n), b(n) = b I+1 (n), or, a(n) = b I+1 (n), b(n) = a I+1 (n).

[0063] In one possible design, N equals 16, the third sequence is denoted as W1, the fourth sequence as W2, and the fifth sequence as P; the third, fourth, and fifth sequences are any one of the following:

[0064] W1=[1,1,-1,-1], W2=[-1,1,1,-1], P=[3,2,1,0];

[0065] W1=[-1,1,1,-1], W2=[-1,-1,-1,-1], P=[3,1,2,0];

[0066] W1 = [1,-1,-1,-1], W2 = [1,-1,1,-1], P = [3,1,2,0]; or

[0067] W1=[1,-1,-1,-1], W2=[1,-1,1,-1], P=[3,2,1,0].

[0068] In one possible design, the method further includes: determining the first sequence set, the first sequence set comprising at least one Gray complementary sequence pair.

[0069] In one possible design, the aperiodic cross-correlation value between any two sequences in the first sequence set is less than or equal to a first threshold, and the aperiodic autocorrelation value of any sequence in the first sequence set is less than or equal to a second threshold.

[0070] In one possible design, each sequence in the first sequence set has a length of 16, and the first sequence set includes at least one Gray complementary sequence pair from Gray complementary sequence pair 1 to Gray complementary sequence pair 4:

[0071] Gray complementary sequence pair 1: [1,-1,-1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,-1,1,-1] and [1,1,-1,-1,-1,-1,1,1,1,1,1,1,-1,-1,-1,1,1,1,1];

[0072] Gray complementary sequence pair 2: [1,-1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1] and [1,1,1,1,1,1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,1];

[0073] Gray complementary sequence pairs 3: [1,-1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,-1,1,1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,1,1]; or...

[0074] Gray complementary sequence pair 4: [1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,1].

[0075] In one possible design, each of the at least one Gray complementary sequence pair is generated based on a third sequence, a fourth sequence, and a fifth sequence, wherein the third sequence is denoted as W1, the fourth sequence is denoted as W2, and the fifth sequence is P.

[0076] When each sequence in the first sequence set has a length of 16, the at least one Gray complementary sequence pair is generated according to at least one of the following:

[0077] W1=[1,1,-1,-1], W2=[-1,1,1,-1], P=[3,2,1,0];

[0078] W1=[-1,1,1,-1], W2=[-1,-1,-1,-1], P=[3,1,2,0];

[0079] W1 = [1,-1,-1,-1], W2 = [1,-1,1,-1], P = [3,1,2,0]; or

[0080] W1=[1,-1,-1,-1], W2=[1,-1,1,-1], P=[3,2,1,0].

[0081] It is understood that the method provided in the second aspect corresponds to the method provided in the first aspect, and the beneficial effects of the relevant technical features in the second aspect can be referred to the description in the first aspect.

[0082] Thirdly, this application provides a communication device that has the functions involved in the first or second aspect above. For example, the communication device includes modules, units, or means corresponding to the operations involved in the first or second aspect above. The functions, units, or means can be implemented by software, or by hardware, or by hardware executing corresponding software.

[0083] In one possible design, the communication device includes a processing unit and a communication unit, wherein the communication unit can be used to transmit and receive signals to enable communication between the communication device and other devices; the processing unit can be used to perform some internal operations of the communication device. The functions performed by the processing unit and the communication unit can correspond to the operations involved in the first or second aspect described above.

[0084] In one possible design, the communication device includes a processor that can be coupled to a memory. The memory can store necessary computer programs or instructions for implementing the functions described in the first or second aspect above. The processor can execute the computer programs or instructions stored in the memory, causing the communication device to implement the methods in any possible design or implementation of the first or second aspect above, when executed.

[0085] In one possible design, the communication device includes a processor and a memory, the memory of which may store necessary computer programs or instructions for implementing the functions involved in the first or second aspect described above. The processor may execute the computer programs or instructions stored in the memory, and when the computer programs or instructions are executed, cause the communication device to implement the methods in any possible design or implementation of the first or second aspect described above.

[0086] In one possible design, the communication device includes a processor and an interface circuit, wherein the processor is configured to communicate with other devices via the interface circuit and execute the methods in any possible design or implementation of the first or second aspect described above.

[0087] Understandably, in the third aspect described above, the processor can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc.; when implemented in software, the processor can be a general-purpose processor that reads software code stored in memory. Furthermore, there can be one or more processors, and one or more memories. The memory can be integrated with the processor or separated from it. In specific implementations, the memory can be integrated with the processor on the same chip or disposed on different chips. This application does not limit the type of memory or the arrangement of the memory and processor.

[0088] Fourthly, this application provides a communication system, which may include a first communication device and a second communication device; wherein the first communication device is used to perform the method described in the first aspect, and the second communication device is used to perform the method described in the second aspect.

[0089] For example, a first communication device generates a synchronization signal for a first cell based on a first sequence and sends the synchronization signal; a second communication device receives the synchronization signal and processes the synchronization signal based on the first sequence; wherein the first sequence is a sequence associated with the first cell in a first sequence set, the first sequence set also includes a second sequence, and the first sequence and the second sequence are Gray complementary sequence pairs.

[0090] Fifthly, this application provides a computer-readable storage medium storing a computer program (or computer-readable instructions) in which, when a computer reads and executes some or all of the computer-readable instructions, the method in any of the possible designs of the first or second aspect described above is executed.

[0091] For example, a computer-readable storage medium can be any available medium that a computer can access. This includes, but is not limited to, non-transient computer-readable media, random-access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), CD-ROM or other optical disc storage, magnetic disk storage media, or other magnetic storage devices, or any other medium capable of carrying or storing desired program code in the form of instructions or data structures and accessible by a computer.

[0092] Sixthly, this application provides a computer program product that, when read and executed by a computer, causes the method in any of the possible designs of the first or second aspect to be performed.

[0093] In a seventh aspect, this application provides a chip (or chip system) including a processor coupled to a memory storing a computer program; the processor is configured to invoke part or all of the computer program in the memory, such that the method in any of the possible designs of the first or second aspect described above is executed. Attached Figure Description

[0094] Figure 1 This is a schematic diagram of the architecture of the communication system used in the embodiments of this application;

[0095] Figure 2 This is a schematic diagram of the basic structure of a feedback shift register;

[0096] Figure 3 A flowchart illustrating the communication method provided in the embodiments of this application;

[0097] Figure 4 A schematic diagram of the register architecture for Gray complementary sequence pairs;

[0098] Figure 5 A flowchart illustrating the process of generating the synchronization signal for the first cell for network devices;

[0099] Figure 6 A schematic diagram of a correlator provided for an embodiment of this application;

[0100] Figure 7 This is a simulation diagram provided for an embodiment of this application;

[0101] Figure 8 The following are possible exemplary block diagrams of the apparatus involved in the embodiments of this application;

[0102] Figure 9 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application. Detailed Implementation

[0103] The technical solutions in the embodiments of this application will now be described with reference to the accompanying drawings. This application will focus on various aspects, embodiments, or features of a system that may include multiple devices, components, modules, etc. It should be understood and appreciated that each system may include additional devices, components, modules, etc., and / or may not include all the devices, components, modules, etc. discussed in conjunction with the accompanying drawings. Furthermore, combinations of these solutions may also be used.

[0104] In the embodiments of this application, words such as "exemplarily" and "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design scheme described as an "example" in this application should not be construed as being more preferred or advantageous than other embodiments or design schemes. Specifically, the use of the term "example" is intended to present concepts in a concrete manner. In the embodiments of this application, "of," "corresponding, relevant," and "corresponding" may sometimes be used interchangeably, and it should be noted that their intended meanings are consistent unless their distinction is emphasized.

[0105] The technical solutions of this application can be applied to various wireless communication systems, such as Universal Mobile Telecommunications System (UMTS), Wireless Local Area Network (WLAN), short-range wireless communication systems (such as sidelink, Wireless Fidelity (Wi-Fi), Bluetooth, etc.), wired networks, vehicle-to-everything (V2X) communication systems, device-to-device (D2D) communication systems, vehicle-to-everything (V2X) communication systems, 4th generation (4G) mobile communication systems (such as Long Term Evolution (LTE) systems), LTE Frequency Division Duplex (FDD) systems, LTE Time Division Duplex (TDD) systems, Worldwide Interoperability for Microwave Access (WiMAX) communication systems, 5G mobile communication systems (such as New Radio (NR) systems), Future Communications systems, or other similar communication systems, and are not limited thereto. The embodiments of this application use... Figure 1 The communication system shown is used as an example for description. When the technical solutions of the embodiments of this application are applied to other communication systems, the devices, components, modules, etc. in the embodiments can be replaced with corresponding devices, components, modules in other communication systems without limitation.

[0106] Figure 1 This is a schematic diagram of the architecture of the communication system used in the embodiments of this application. Figure 1 As shown, the communication system includes an access network (AN) 100, and optionally also includes a core network (CN) 200 and an Internet 300. The access network can be a radio access network (RAN), which can be an access network in the 3rd Generation Partnership Project (3GPP), such as 4G, 5G, or future networks. The RAN can also be an open RAN (O-RAN or ORAN), a cloud radio access network (CRAN), or a communication network combining two or more of these networks.

[0107] The access network 100 may include at least one network device, such as Figure 1 110a and 110b may also include at least one terminal device, such as Figure 1 The series consists of 120a-120j. Specifically, 110a is a base station, 110b is a micro-station, 120a, 120e, 120f, and 120j are mobile phones, 120b is a car, 120c is a fuel dispenser, 120d is a home access point (HAP) deployed indoors or outdoors, 120g is a laptop, 120h is a printer, and 120i is a drone. The same terminal device or network device can provide different functions in different application scenarios. For example... Figure 1 The mobile phones included are 120a, 120e, 120f, and 120j. Mobile phone 120a can access base station 110a, connect to car 120b, communicate directly with mobile phone 120e, and access HAP. Car 120b can access HAP and communicate directly with mobile phone 120a. Mobile phone 120f can connect to micro-station 110b, connect to laptop 120g, and connect to printer 120h. Mobile phone 120j can control drone 120i.

[0108] (1) Network equipment

[0109] A network device is a network-side device with wireless transceiver capabilities. For example, a network device is a unit in a Radio Area Network (RAN) that provides wireless communication functionality to terminal devices. Network devices can be base stations, evolved NodeBs (eNodeBs), transmission reception points (TRPs), next-generation NodeBs (gNBs) in 5G mobile communication systems, base stations in future mobile communication systems, or access nodes in WiFi systems, etc.

[0110] Network equipment can also be modules or units that perform some of the functions of a base station. For example, it can be a central unit (CU), a distributed unit (DU), or a radio unit (RU). The CU performs the functions of the radio resource control (RRC) and packet data convergence protocol (PDCP) layers of the base station, and can also perform the functions of the service data adaptation protocol (SDAP). The CU can be further divided into a control plane (CP) (CU-CP) and a user plane (UP) (CU-UP). The DU performs the functions of the radio link control (RLC) and media access control (MAC) layers of the base station, and can also perform some or all of the physical layer functions. For specific descriptions of the above protocol layers, please refer to the relevant 3GPP technical specifications. The CU and DU can be set up separately or included in the same network element, such as in a baseband unit (BBU). An RU can be included in a radio frequency (RF) device or RF unit, such as a remote radio unit (RRU), an active antenna unit (AAU), or a remote radio head (RRH). In different systems, CU, DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called O-CU (open CU), DU can also be called O-DU, and RU can also be called O-RU. Any of the CU (or CU-CP, CU-UP), DU, and RU units in this application can be implemented through software modules, hardware modules, or a combination of software and hardware modules.

[0111] Network equipment can also be macro base stations (such as...) Figure 1 110a in the text), can also be a micro base station or an indoor station (such as... Figure 1 110b in the context can also be a relay node or a donor node, etc.

[0112] In the embodiments of this application, the functions of the network device can be executed by modules (such as chips) within the network device, or by a control subsystem that includes the functions of the network device. This control subsystem, which includes the functions of the network device, can be a control center in the aforementioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities.

[0113] (2) Terminal equipment

[0114] A terminal device is a user-side device with wireless transceiver capabilities. Terminal devices can also be called terminals, user equipment (UE), mobile stations, mobile terminals, etc. They can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), the Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, intelligent transportation, and smart cities. Terminal devices can be: mobile phones, tablets, laptops, PDAs, mobile internet devices (MIDs), wearable devices (such as smartwatches, smart bracelets, pedometers, smart glasses, etc.), in-vehicle equipment (such as cars, bicycles, electric vehicles, airplanes, ships, trains, high-speed trains, etc.), satellite terminals, virtual reality (VR) devices, augmented reality (AR) devices, smart point of sale (POS) machines, customer-premises equipment (CPE), light user equipment (UE), reduced capability user equipment (REDCAP UE), wireless terminals in industrial control, smart home devices (such as refrigerators, televisions, air conditioners, electricity meters, etc.), smart robots, robotic arms, workshop equipment, wireless terminals in autonomous driving, wireless terminals in telemedicine, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, or wireless terminals in smart homes, and flying equipment (such as smart robots, hot air balloons, drones, airplanes), etc. The terminal device can also be a vehicle device (such as a complete vehicle device, vehicle module, vehicle chip, on-board unit (OBU), or telematics box (T-BOX), etc.). In the embodiments of this application, the device used to implement the function of the terminal device can be the terminal device itself, or it can be a device that supports the terminal device in implementing the function, such as a chip system or a combination of devices or components that can implement the function of the terminal device. This device can be installed in the terminal device.

[0115] In this embodiment of the application, the functions of the terminal device can also be performed by modules (such as chips or modems) in the terminal device, or by a device containing the functions of the terminal device.

[0116] Furthermore, network devices and terminal devices can be fixed in location or mobile. They can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; they can also be deployed on water; and they can be deployed in the air on aircraft, balloons, and satellites. The embodiments of this application do not limit the application scenarios of the network devices and terminal devices.

[0117] The roles of network devices and terminal devices can be relative, for example, Figure 1 The helicopter or drone 120i can be configured as a mobile network device. For terminal devices 120j that access the wireless access network 100 via 120i, terminal device 120i is a network device; however, for network device 110a, 120i is a terminal device, meaning that 110a and 120i communicate via a wireless air interface protocol. Of course, 110a and 120i can also communicate via a network device-to-network device interface protocol; in this case, 120i is also a network device relative to 110a. Therefore, both network devices and terminal devices can be collectively referred to as communication devices. Figure 1 110a and 110b can be referred to as communication devices with network equipment functions. Figure 1 The 120a-120j in the text can be referred to as communication devices with terminal equipment functions.

[0118] Network devices and terminal devices, network devices and network devices, and terminal devices can communicate through licensed spectrum, unlicensed spectrum, or both simultaneously, without limitation.

[0119] The network architecture and business scenarios described in this application are intended to more clearly illustrate the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0120] The following is an explanation of the relevant terms used in the embodiments of this application. Unless otherwise specified, these explanations are provided to support the meaning of the relevant terms and to make the embodiments of this application easier to understand, and should not be regarded as a strict limitation of the relevant terms within the scope of protection claimed by this application.

[0121] (1) Sequence

[0122] In this application's embodiments, the "sequence" includes one or more elements. These elements can be represented as complex numbers, including a real part and an imaginary part; alternatively, elements can also be represented as real numbers, without any specific limitation.

[0123] For example, the nth element in sequence s is denoted as s(n), where n = 0, ..., N-1. Sequence s represents a sequence containing N elements, where N is an integer greater than 1. n belongs to {0, ..., N-1}, where "..." represents an integer between 0 and N-1. For example, when N = 5, n ∈ {0, 1, 2, 3, 4}. The N elements in sequence s can be s(0), ..., s(4). It is understood that this embodiment uses a numbering method with a starting number of 0 and incrementing by a step size of 1 as an example, but it is not limited to this. For example, the numbering method can also be: starting number of 1 and incrementing by a step size of 1. Another example is that the numbering method can also be: starting number of X and decrementing by a step size of 1, where X is an integer greater than 1.

[0124] (2) Synchronization signal

[0125] In wireless communication systems, synchronization signals are used for time and frequency synchronization between terminal devices and network devices. For example, a network device can send an SS / PBCH block, often simply called a synchronization signal block (SSB). Upon receiving the SSB, the terminal device can perform time and frequency synchronization and obtain cell information (such as the physical cell identity (PCI)) to facilitate cell access. The SSB includes the primary synchronization signal (PSS), the secondary synchronization signal (SSS), and the PBCH.

[0126] PSS: Used for frequency synchronization and symbol-level time synchronization. The PSS sequence is used to carry... It can be called the neighborhood number. The set of values ​​for is {0, 1, 2}. Because The set of possible values ​​has 3 possible values, therefore, there can be 3 PSS sequences.

[0127] SSS: Used for carrying It can be called the neighborhood group number. The set of values ​​for is {0, 1, 2, ..., 335}, therefore, there can be 336 SSS sequences. The cell number and cell group number together determine multiple PCIs in the 5G communication system. PCI (denoted as ) The calculation method for ) is as follows: Therefore, there are a total of 1008 PCIs.

[0128] In some possible scenarios (such as initial cell search without prior information), the terminal device needs to perform full sequence detection on all possible sequences when detecting the synchronization signal. Specifically, there are three possible PSS sequences. By traversing these three possible sequences and detecting the actual PSS sequence, the terminal device can determine the PSS sequence. Furthermore, the terminal device will Substituting into SSS detection, once It is confirmed that there are a total of 336 possible SSS sequences. The terminal device can use these 336 different SSS sequences for correlation detection, and the SSS sequence with the highest correlation value is the one actually used. Once the terminal device successfully searches for the PSS and SSS, it obtains the cell information (such as PCI), thus gaining the ability to parse the system messages contained in the SSB.

[0129] (3) Low-capacity terminal equipment

[0130] Future communication systems will increase network connection density. Specifically, massive MIMO, as an extension of massive machine-type communication, places new demands on network capabilities, such as requiring a network connection density of 10^10^6. 6 -10 8 With an average of 100 devices per kilometer, the number of terminal devices accessing the network will further increase in the future.

[0131] In scenarios with massive connectivity, there are various types of terminal devices, such as low-capability terminal devices. Low-capability terminal devices refer to terminal devices with simplified capabilities, including at least one of the following: lower data processing capabilities, smaller signal transmission and reception bandwidth, lower battery capacity, and fewer transceiver antennas. In this embodiment, the low-capability terminal device can be a terminal device in a narrowband Internet of Things (NB-IoT), and is not specifically limited thereto.

[0132] (4) Low-power synchronization signal

[0133] Because SSB reception and demodulation place high demands on the RF bandwidth, signal processing capabilities, and power consumption of terminal equipment, a low-power synchronization signal (LP-SS) has been designed to match the low-power receivers of low-capability terminal equipment.

[0134] Low-power synchronization signals are generated using Gold sequences, m-sequences, or computer-searched sequences. The sequence length for low-power synchronization signals can range from 4 to 32. An m-sequence is short for Longest Linear Feedback Shift Register Sequence, which is the longest-period sequence generated by a shift register with linear feedback. Generally, the longest period generated by a V-stage linear feedback shift register is equal to 2. v -1. Figure 2 The basic structure of a feedback shift register involves storing initialization bit data in memory, and then generating new values ​​through a feedback function and adding them back to memory. Assume the feedback function performs an XOR operation on all bits in memory, i.e. Then a1, a2, ..., a n Given the initial value sequence, the output sequence is: The length of the output sequence is 2. v -1. This can be understood as the m-sequence being determined by the initial value sequence stored in the register and the primitive polynomial. The Gold sequence can be seen as obtained by performing an element-wise XOR operation on two m-sequences with different primitive polynomials. In the embodiments of this application, the recursive formula corresponds one-to-one with the primitive polynomial, and the "recursive formula" and "primitive polynomial" can be interchanged.

[0135] The low-power synchronization signal uses four sequences, namely LP-SS sequences 1 to LP-SS sequences 4. Typically, the low-power synchronization signals of adjacent cells are generated based on different LP-SS sequences; in other words, adjacent cells are associated with different LP-SS sequences. The associated LP-SS sequences can be determined based on cell-related information (such as PCI). For example, if cells 1 and 2 are adjacent cells, cell 1's low-power synchronization signal is generated based on LP-SS sequence 1, while cell 2's low-power synchronization signal is generated based on LP-SS sequence 2.

[0136] Based on the above description, taking the full-sequence detection of low-power synchronization signals by a terminal device as an example, since the terminal device does not obtain the downlink timing when detecting the low-power synchronization signal, it needs to perform sliding detection over a relatively long period of time. A common detection method is time-domain sliding detection, which involves truncating the low-power synchronization signal at each sliding time-domain sampling point, bandpass filtering the truncated signal, and then correlating it with a local LP-SS sequence (e.g., if the low-power synchronization signal uses 4 sequences, there are 4 LP-SS sequences, and the length of each LP-SS sequence is N). This process is repeated to obtain multiple correlation values, and the LP-SS sequence corresponding to the maximum correlation value is identified as the actual sequence used by the low-power synchronization signal. Based on the actual sequence used by the low-power synchronization signal, the terminal device can obtain the cell identifier, and optionally, the sampling point corresponding to the maximum correlation value is the synchronization position. The terminal device can then perform time synchronization based on this synchronization position.

[0137] Specifically, assuming the signal received by the terminal device is r = [r(0), r(1), ..., r(L'-1)], and the length L' of the received signal corresponds to the length of the receiving window, the length of which is preset, for example, 5 milliseconds (ms). Taking downsampling detection as an example, the terminal device can downsample the received signal r to obtain a sequence r', for example, the sequence r' includes N+L elements (the number of elements in the sequence r' is related to the downsampling factor and L', and here we take the number of elements in the sequence r' as N+L as an example). The terminal device slides one sampling point at a time, and extracts a sequence of length N from the sequence r', for example, the sequence obtained by the first sliding sampling point is r1 = [r(0), r(1), ..., r(N-1)], the sequence obtained by the second sliding sampling point is r2 = [r(1), r(2), ..., r(N)], and so on. Assuming the sequence obtained by the lth sliding sampling point is r tmp = [r(l-1), r(l), ..., r(N+l-1)], l = 1, 2, ..., L. For the four LP-SS sequences, the terminal device can respectively process these four LP-SS sequences and sequence r. tmp Performing the inner product yields four LP-SS sequences and sequence r. tmpThe system generates 4 correlation values ​​between the L and L sampling points. The terminal device can sequentially slide each of the L sampling points to obtain 4L correlation values. Therefore, the terminal device needs to perform 4 correlation operations for each sliding sampling point, for a total of 4L correlation operations. Each correlation operation requires N-1 addition operations and N multiplication operations. Since the sequence elements take values ​​of 1 or -1, multiplication operations are ignored. Therefore, each sliding sampling point requires 4(N-1) addition operations, for a total of 4L(N-1) addition operations, resulting in high detection complexity. Furthermore, the detection complexity increases linearly with the number of sequences.

[0138] Based on this, embodiments of this application provide a communication method, apparatus, and system for reducing the detection complexity of synchronization signals. For example, the synchronization signal of a first cell is generated based on a first sequence associated with the first cell in a first sequence set, where the first sequence and a second sequence in the first sequence set are Gray complementary sequence pairs. Thus, compared to generating synchronization signals based on Gold sequences, m-sequences, or computer-searched sequences, the detection complexity of synchronization signals can be reduced.

[0139] The method provided in this application embodiment will be described in detail below with reference to specific embodiments. The method provided in this application embodiment involves a first communication device and / or a second communication device. The first communication device is a signal transmitting end (e.g., transmitting a synchronization signal), and the second communication device is a signal receiving end (e.g., receiving a synchronization signal). Unless otherwise specified, the "first communication device" in this application can refer to a first communication device (e.g., a network device), a component used in the first communication device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the communication device's functions. Similarly, the "second communication device" in this application can refer to a second communication device (e.g., a terminal device), a component used in the second communication device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the communication device's functions. The component used in the communication device can be a component within the communication device, or it can be independent of the communication device but coupled to it. This application embodiment uses the example of "the first communication device being a network device and the second communication device being a terminal device" for description.

[0140] Figure 3 This is a flowchart illustrating the communication method provided in an embodiment of this application. Figure 3 As shown, the process may include:

[0141] S301, The network device generates a synchronization signal for the first cell according to the first sequence.

[0142] The first sequence is the sequence in the first sequence set associated with the first cell. The first sequence set also includes a second sequence, and the first and second sequences are Gray complementary sequence pairs.

[0143] (1) Gray complementary sequence pairs

[0144] A pair of Gray complementary sequences is called a Gray complementary pair (GCP). For example, if the first sequence and the second sequence are Gray complementary sequences, and the nth element in the first sequence is denoted as a(n), and the nth element in the second sequence is denoted as b(n), where n = 1, 2, ..., N, and N is an integer greater than 1, then:

[0145] C j +D j =0,j≠0

[0146] C0 + D0 = 2N

[0147] Among them, C j D represents the autocorrelation function of the first sequence. j is the autocorrelation function of the second sequence.

[0148]

[0149] The above a * (n+j) is the conjugate of a(n+j), b * (n+j) is the conjugate of b(n+j), a * (n) is the conjugate of a(n), b * (n) is the conjugate of b(n).

[0150] For example, the first sequence is obtained from the third, fourth, and fifth sequences, denoted as W1, W2, and P, respectively. The i-th element in the third sequence is denoted as W1(i), the i-th element in the fourth sequence is denoted as W2(i), and the i-th element in the fifth sequence is denoted as P(i), where i = 1, 2, ..., I, I = log2N. The values ​​of W1(i) belong to {1, -1}, and the values ​​of W2(i) belong to {1, -1}. Sequences W1 and W2 can be the same or different, without any specific limitation. When sequences W1 and W2 are different, the first sequence can be understood as a generalized Gray sequence.

[0151] For example, the first sequence is generated using the following recursive formula:

[0152] a1(n)=δ(n)

[0153] b1(n)=δ(n)

[0154] a i+1(n)=a i (n)+W1(i)b i (n-2 P(i) )

[0155] b i+1 (n)=a i (n)-W2(i)b i (n-2 P(i) )

[0156] Here, δ(n) is pre-configured or predefined; for example, δ(n) is the impulse function, where δ(n) = 1 when n = 0 and δ(n) = 0 when n ≠ 0. The first sequence can be generated using the above recursive formula, such as a(n) = a I+1 (n), and can also generate complementary sequences (i.e., second sequences), such as b(n) = b I+1 (n); or, the first sequence can be generated through the above recursive formula, such as a(n) = b I+1 (n), and can also generate complementary sequences (i.e., second sequences), such as b(n) = a I+1 (n).

[0157] The above describes the derivation of the formula for Gray's complementary sequence pairs. In practical applications, Gray's complementary sequence pairs can be generated based on registers. For example... Figure 4 As shown, for a sequence of length N, Figure 4 The illustrated register architecture contains I (i.e., log₂N) level registers, log₂N adders, log₂N subtractors, and log₂N multipliers. In the formula, P(i) represents the register depth of the i-th level register as 2. P(i) Register depth represents the number of memory locations in the register; therefore, the i-th level register in a log₂N level register includes 2... P(i) One storage unit.

[0158] (2) First sequence set

[0159] For example, the network device determines a first sequence set, which includes at least one Gray complementary sequence pair, or the first sequence set is composed of at least one Gray complementary sequence pair. For instance, the first sequence set includes K Gray complementary sequence pairs, where K is an integer greater than or equal to 1, and the first sequence and the second sequence mentioned above are one of the K Gray complementary sequence pairs.

[0160] The aperiodic cross-correlation value between any two sequences in the first sequence set is less than or equal to a first threshold (condition 1). This facilitates the receiver's differentiation of synchronization signals from different cells and reduces interference between them. The aperiodic autocorrelation value of any sequence in the first sequence set is less than or equal to a second threshold (condition 2). This ensures synchronization performance. Typically, there are many Gray complement sequence pairs. In this embodiment, K Gray complement sequence pairs that satisfy conditions 1 and 2 can be selected from a large number of Gray complement sequence pairs to form the first sequence set, thereby improving the detection and synchronization performance of the synchronization signal.

[0161] The first and second thresholds can be set according to actual needs. For example, when the sequence length in the first sequence set is 32, the first threshold is 0.6 and the second threshold is 0.2. For example, when the sequence length in the first sequence set is 8, the first threshold is 0.5 and the second threshold is 0.5.

[0162] In one example, the K Gray complementary sequence pairs in the first sequence set are pre-configured or pre-defined, such as being stored on the network device side (and the terminal device side) in a way that is specified by protocol or predefined. In this case, the network device can directly obtain (or determine) the first sequence set.

[0163] For example, each sequence in the first sequence set has a length of 16. The first sequence set includes K Gray complementary sequence pairs from Gray complementary sequence pair 1 to Gray complementary sequence pair 4 (a total of 8 sequences), specifically:

[0164] Gray complementary sequence pair 1: [1,-1,-1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,-1,1,-1] and [1,1,-1,-1,-1,-1,1,1,1,1,1,1,-1,-1,-1,1,1,1,1];

[0165] Gray complementary sequence pair 2: [1,-1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1] and [1,1,1,1,1,1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,1];

[0166] Gray complementary sequence pairs 3: [1,-1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,-1,1,1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,1,1]; or...

[0167] Gray complementary sequence pair 4: [1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,1].

[0168] When the sequence length is 16, there are many Gray complementary sequence pairs. The 8 sequences here are selected from a large number of Gray complementary sequence pairs that satisfy conditions 1 and 2 above. Therefore, the first sequence set includes K Gray complementary sequence pairs from these 4 Gray complementary sequence pairs, which is convenient for improving the detection performance and synchronization performance of the synchronization signal.

[0169] For another example, each sequence in the first sequence set has a length of 8. The first sequence set includes K Gray complementary sequence pairs from Gray complementary sequence pair 1 to Gray complementary sequence pair 5 (a total of 10 sequences). Specifically:

[0170] Gray complementary sequence pair 1: [1,-1,-1,1,1,-1,1,-1,-1] and [1,1,-1,-1,-1,1,1,1,1];

[0171] Gray complementary sequence pair 2: [1,-1,1,1,-1,-1,-1,-1,1] and [1,-1,-1,-1,-1,-1,-1,-1,-1];

[0172] Gray complementary sequence pair 3: [1,-1,-1,1,1,-1,-1,-1,1] and [1,-1,1,-1,1,-1,1,-1,-1];

[0173] Gray complementary sequence pair 4: [1,-1,-1,-1,1,1,-1,1] and [1,-1,1,1,1,1,1,-1];

[0174] Gray complementary sequence pair 5: [1,-1,1,-1,-1,1,1,-1]; or [1,1,1,1,-1,-1,1,1].

[0175] When the sequence length is 8, there are many Gray complementary sequence pairs. The 10 sequences here are selected from a large number of Gray complementary sequence pairs that satisfy conditions 1 and 2 above. Therefore, the first sequence set includes K Gray complementary sequence pairs from these 5 Gray complementary sequence pairs, which is convenient for improving the detection performance and synchronization performance of the synchronization signal.

[0176] For another example, each sequence in the first sequence set has a length of 32. The first sequence set includes K Gray complementary sequence pairs from Gray complementary sequence pair 1 to Gray complementary sequence pair 24 (a total of 48 sequences). Specifically:

[0177] Gray complementary sequence pair 1: [1,-1,-1,1,1,-1,1,-1,-1,1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1] and [1,1,-1,-1,-1,1,1,1,1,-1,-1,-1,1,1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,1,1,1];

[0178] Gray complementary sequence pairs 2: [1,-1,-1,1,1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,-1,1,-1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1] and [1,1,-1,-1,-1,1,1,1,- ...

[0179] Gray complementary sequence pairs 3: [1,-1,1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,1,-1,1,-1,-1,-1,1,-1,-1,1,-1,-1,1,-1] and [1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1];

[0180] Gray complementary sequence pairs 4: [1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1] and [1,1,1,1,1,1,1,1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,1,1,1];

[0181] Gray complementary sequence pairs 5: [1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,-1,-1,-1,1,1,1,1];

[0182] Gray complementary sequence pairs 6: [1,-1,1,-1,1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,1,-1] and [1,1,1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,1,1,1,-1,-1,-1,-1,-1,1,1,1,1,1,1,-1,-1,-1,-1,1,1,1,1,1,-1,-1,-1,-1,1,1,1,1];

[0183] Gray complementary sequence pairs 7: [1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1] and [1,1,-1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,1,1,1,1,1,1];

[0184] Gray complementary sequence pairs 8: [1,-1,1,-1,-1,1,1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,-1] and [1,1,1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1];

[0185] Gray complementary sequence pairs 9: [1,-1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,-1,1,1,-1,-1,1,-1,1,-1,1,-1,-1,-1,1,-1,-1,-1,1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,1,1,1,1,1,-1,-1,-1,-1,1,1];

[0186] Gray complementary sequence pair 10: [1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1] and [1,1,1,1,1,1,1,1,1,-1,-1,1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,1,1,1];

[0187] Gray complementary sequence pair 11: [1,-1,-1,1,1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1] and [1,1,-1,-1,-1,1,1,1,- ...

[0188] Gray complementary sequence pair 12: [1,-1,1,-1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1] and [1,1,1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1];

[0189] Gray complementary sequence pair 13: [1,-1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,-1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1] and [1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,1,1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,1];

[0190] Gray complementary sequence pair 14: [1,-1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1];

[0191] Gray complementary sequence pair 15: [1,-1,-1,1,1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,-1,-1] and [1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,1];

[0192] Gray complementary sequence pair 16: [1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,-1,1,-1,-1,-1,1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1];

[0193] Gray complementary sequence pair 17: [1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,1,1];

[0194] Gray complementary sequence pairs 18: [1,-1,1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1] and [1,1,1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,1,1];

[0195] Gray complementary sequence pair 19: [1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,-1,1,-1,1,-1,1,-1,1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1];

[0196] Gray complementary sequence pair 20: [1,-1,1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,-1,1,-1,1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1] and [1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,1,1,1,-1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,-1,-1,-1,1,1,1,1];

[0197] Gray complementary sequence pair 21: [1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1];

[0198] Gray complementary sequence pair 22: [1,-1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,-1,1,-1,1,-1,1,-1,-1] and [1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,1,1,1,1];

[0199] Gray complementary sequence pairs 23: [1,-1,1,-1,-1,1,-1,1,1,-1,1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,-1,1,-1] and [1,1,1,1,-1,-1,-1,-1,-1,1,1,1,1,1,1,1,1,1,1,-1,-1,-1,-1,1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,1];

[0200] Gray complementary sequence pairs 24: [1,-1,1,-1,1,-1,1,-1,-1,-1,1,-1,1,-1,1,-1,-1,-1,1,-1,-1,-1,1,1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1] and [1,1,1,1,1,1,1,1,- ...

[0201] When the sequence length is 32, there are many Gray complementary sequence pairs. The 48 sequences here are selected from a large number of Gray complementary sequence pairs that satisfy conditions 1 and 2 above. Therefore, the first sequence set includes K Gray complementary sequence pairs from these 24 Gray complementary sequence pairs, which is convenient for improving the detection performance and synchronization performance of the synchronization signal.

[0202] In another example, each of the K Gray complementary sequence pairs in the first sequence set is generated based on the third, fourth, and fifth sequences. Exemplarily, the third, fourth, and fifth sequences corresponding to the K Gray complementary sequence pairs are pre-configured or predefined, for example, stored on the network device side (and the terminal device side) in a manner specified by protocol or predefined. In this case, the network device can generate K Gray complementary sequence pairs based on the third, fourth, and fifth sequences corresponding to the K Gray complementary sequence pairs, that is, determine the first sequence set based on the third, fourth, and fifth sequences corresponding to the K Gray complementary sequence pairs.

[0203] For example, when N equals 16, the K pairs of Gray complementary sequences are generated based on K of the following four terms:

[0204] W1=[1,1,-1,-1], W2=[-1,1,1,-1], P=[3,2,1,0];

[0205] W1=[-1,1,1,-1], W2=[-1,-1,-1,-1], P=[3,1,2,0];

[0206] W1 = [1,-1,-1,-1], W2 = [1,-1,1,-1], P = [3,1,2,0]; or

[0207] W1=[1,-1,-1,-1], W2=[1,-1,1,-1], P=[3,2,1,0].

[0208] The sequences generated based on the above four items are the eight sequences mentioned earlier (with a length of 16). Specifically, the Gray complement sequence pairs generated based on W1 = [1,1,-1,-1], W2 = [-1,1,1,-1], and P = [3,2,1,0] include the sequences [1,-1,-1,1,1,-1,1,-1,1,-1,1,1,-1,1,-1,1,-1,1,-1] and [1,1,-1,-1,-1,-1,1,1,1,1,1,1,-1,-1,-1,1,1,1,1], which are the first and second sequences among the eight sequences mentioned above.

[0209] The Gray complement sequence pairs generated based on W1=[-1,1,1,-1], W2=[-1,-1,-1,-1], and P=[3,1,2,0] include the sequences [1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,1,1,-1] and [1,1,1,1,1,1,1,1,1,-1,-1,1,1,1,-1,-1,1,1,1], which are the 3rd and 4th sequences among the above 8 sequences.

[0210] The Gray complement sequence pairs generated based on W1=[1,-1,-1,-1], W2=[1,-1,1,-1], and P=[3,1,2,0] include the sequences [1,-1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,-1,1,1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,1,1], which are the 5th and 6th sequences among the above 8 sequences.

[0211] The Gray complement sequence pairs generated based on W1=[1,-1,-1,-1], W2=[1,-1,1,-1], and P=[3,2,1,0] include the sequences [1,-1,-1,1,-1,1,-1,1,1,-1,-1,1,1,-1,1,-1,1,-1] and [1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,1,1,1,1], which are the 7th and 8th sequences among the above 8 sequences.

[0212] For example, when N equals 8, the K pairs of Gray complementary sequences are generated based on K of the following 5 terms:

[0213] W1=[1,-1,-1], W2=[1,1,-1], P[2,1,0];

[0214] W1=[-1,-1,1], W2=[-1,-1,1], P=[2,0,1];

[0215] W1=[1,-1,-1], W2=[-1,1,-1], P=[2,0,1];

[0216] W1 = [1, -1, -1], W2 = [1, -1, -1], P = [2, 0, 1]; or

[0217] W1=[-1,1,-1], W2=[-1,-1,-1], P=[2,1,0].

[0218] The sequences generated based on the above 5 items are the 10 sequences (8 in length) mentioned earlier, which will not be described in detail here.

[0219] For example, when N equals 32, the K pairs of Gray complementary sequences are generated based on K of the following 24 terms:

[0220] W1=[-1,-1,1,-1,-1], W2=[-1,-1,1,1,-1], P=[4,3,2,1,0];

[0221] W1=[-1,-1,-1,1,-1], W2=[-1,-1,-1,-1,-1], P=[3,4,1,2,0];

[0222] W1=[-1,-1,-1,1,-1], W2=[-1,-1,-1,-1,-1], P=[4,2,3,1,0];

[0223] W1[-1,1,1,1,-1], W2=[-1,1,1,-1,-1], P=[4,2,3,1,0];

[0224] W1=[-1,1,-1,-1,-1], W2=[-1,1,-1,1,-1], P=[4,3,2,1,0];

[0225] W1=[1,-1,1,1,-1], W2=[1,-1,1,-1,-1], P=[4,3,2,1,0];

[0226] W1=[1,1,1,-1,-1], W2=[1,1,1,1,-1], P=[4,2,3,1,0];

[0227] W1=[-1,-1,-1,1,-1], W2=[-1,-1,-1,-1,-1], P=[4,2,3,1,0]

[0228] W1=[-1,1,-1,-1,-1], W2=[-1,1,-1,1,-1], P=[4,3,1,2,0];

[0229] W1=[1,1,-1,1,-1], W2=[1,1,-1,-1,-1], P=[4,2,3,1,0];

[0230] W1=[1,1,-1,-1,-1], W2=[1,1,1,1,-1], P=[4,2,1,3,0];

[0231] W1=[1,1,1,-1,-1], W2=[1,1,1,1,-1], P=[4,1,3,2,0];

[0232] W1=[-1,-1,1,-1,-1], W2=[-1,-1,1,1,-1], P=[2,3,4,1,0];

[0233] W1=[-1,-1,-1,1,-1], W2=[-1,-1,-1,-1,-1], P=[4,2,1,3,0];

[0234] W1[-1,-1,1,-1,-1], W2=[-1,-1,1,1,-1], P=[3,4,2,1,0];

[0235] W1=[1,-1,-1,-1,-1], W2=[1,-1,-1,1,-1], P=[4,3,2,1,0];

[0236] W1=[1,-1,-1,-1,-1], W2=[1,-1,-1,1,-1], P=[4,3,1,2,0];

[0237] W1=[-1,1,1,-1,-1], W2=[-1,1,-1,1,-1], P=[4,2,1,3,0];

[0238] W1=[1,-1,-1,-1,-1], W2=[1,-1,-1,1,-1], P[4,2,1,3,0];

[0239] W1=[-1,1,-1,-1,-1], W2=[-1,1,-1,1,-1], P=[4,1,2,3,0];

[0240] W1=[1,-1,-1,-1,-1], W2=[1,-1,-1,1,-1], P=[3,4,1,2,0];

[0241] W1=[-1,-1,1,-1,-1], W2=[-1,-1,1,1,-1], P=[3,2,4,1,0];

[0242] W1 = [1, -1, 1, 1, -1], W2 = [1, -1, 1, -1, -1], P = [3, 2, 4, 1, 0]; or

[0243] W1=[1,-1,1,1,-1], W2=[1,-1,1,-1,-1], P=[2,3,4,1,0].

[0244] The sequences generated from the above 24 items are the 48 sequences (32 in length) mentioned earlier, which will not be described in detail here.

[0245] (3)First sequence

[0246] For example, after determining the first sequence set, the network device can determine the first sequence associated with the first cell from the first sequence set based on the identifier of the first cell. Here, the first cell is a cell managed by the network device. Specifically, the network device determines a first index based on the information of the first cell (such as the identifier of the first cell). The first index is the index of the first sequence associated with the first cell in the first sequence set. For example, the first index conforms to the following formula:

[0247] q = X ID mod S

[0248] Where q represents the first index, X ID This represents the identifier of the first cell, S represents the number of sequences in the first sequence set, and mod represents the modulo operation. Optionally, the identifier of the first cell can be the PCI of the first cell.

[0249] For example, the length of the first sequence is 16, and the first sequence can be any of the eight sequences mentioned above. In this case, the first sequence is generated based on any one of the following four items:

[0250] W1=[1,1,-1,-1], W2=[-1,1,1,-1], P=[3,2,1,0];

[0251] W1=[-1,1,1,-1], W2=[-1,-1,-1,-1], P=[3,1,2,0];

[0252] W1 = [1,-1,-1,-1], W2 = [1,-1,1,-1], P = [3,1,2,0]; or

[0253] W1=[1,-1,-1,-1], W2=[1,-1,1,-1], P=[3,2,1,0].

[0254] For example, the first sequence set includes the above Gray complementary sequence pair 1 to Gray complementary sequence pair 4, that is, the first sequence set includes the above 8 sequences. If the first index is 3, the network device can determine that the first sequence associated with the first cell is the 3rd sequence among the 8 sequences, such as [1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,-1,1,1,-1,-1,1,1,-1].

[0255] For example, the length of the first sequence is 8, and the first sequence can be any one of the 10 sequences mentioned above. In this case, the first sequence is generated based on any one of the following 5 items:

[0256] W1=[1,-1,-1], W2=[1,1,-1], P[2,1,0];

[0257] W1=[-1,-1,1], W2=[-1,-1,1], P=[2,0,1];

[0258] W1=[1,-1,-1], W2=[-1,1,-1], P=[2,0,1];

[0259] W1 = [1, -1, -1], W2 = [1, -1, -1], P = [2, 0, 1]; or

[0260] W1=[-1,1,-1], W2=[-1,-1,-1], P=[2,1,0].

[0261] For example, the length of the first sequence is 32, and the first sequence can be any of the 48 sequences mentioned above. In this case, the first sequence is generated based on any one of the following 24 items:

[0262] W1=[-1,-1,1,-1,-1], W2=[-1,-1,1,1,-1], P=[4,3,2,1,0];

[0263] W1=[-1,-1,-1,1,-1], W2=[-1,-1,-1,-1,-1], P=[3,4,1,2,0];

[0264] W1=[-1,-1,-1,1,-1], W2=[-1,-1,-1,-1,-1], P=[4,2,3,1,0];

[0265] W1[-1,1,1,1,-1], W2=[-1,1,1,-1,-1], P=[4,2,3,1,0];

[0266] W1=[-1,1,-1,-1,-1], W2=[-1,1,-1,1,-1], P=[4,3,2,1,0];

[0267] W1=[1,-1,1,1,-1], W2=[1,-1,1,-1,-1], P=[4,3,2,1,0];

[0268] W1=[1,1,1,-1,-1], W2=[1,1,1,1,-1], P=[4,2,3,1,0];

[0269] W1=[-1,-1,-1,1,-1], W2=[-1,-1,-1,-1,-1], P=[4,2,3,1,0]

[0270] W1=[-1,1,-1,-1,-1], W2=[-1,1,-1,1,-1], P=[4,3,1,2,0];

[0271] W1=[1,1,-1,1,-1], W2=[1,1,-1,-1,-1], P=[4,2,3,1,0];

[0272] W1=[1,1,-1,-1,-1], W2=[1,1,1,1,-1], P=[4,2,1,3,0];

[0273] W1=[1,1,1,-1,-1], W2=[1,1,1,1,-1], P=[4,1,3,2,0];

[0274] W1=[-1,-1,1,-1,-1], W2=[-1,-1,1,1,-1], P=[2,3,4,1,0];

[0275] W1=[-1,-1,-1,1,-1], W2=[-1,-1,-1,-1,-1], P=[4,2,1,3,0];

[0276] W1[-1,-1,1,-1,-1], W2=[-1,-1,1,1,-1], P=[3,4,2,1,0];

[0277] W1=[1,-1,-1,-1,-1], W2=[1,-1,-1,1,-1], P=[4,3,2,1,0];

[0278] W1=[1,-1,-1,-1,-1], W2=[1,-1,-1,1,-1], P=[4,3,1,2,0];

[0279] W1=[-1,1,1,-1,-1], W2=[-1,1,-1,1,-1], P=[4,2,1,3,0];

[0280] W1=[1,-1,-1,-1,-1], W2=[1,-1,-1,1,-1], P[4,2,1,3,0];

[0281] W1=[-1,1,-1,-1,-1], W2=[-1,1,-1,1,-1], P=[4,1,2,3,0];

[0282] W1=[1,-1,-1,-1,-1], W2=[1,-1,-1,1,-1], P=[3,4,1,2,0];

[0283] W1=[-1,-1,1,-1,-1], W2=[-1,-1,1,1,-1], P=[3,2,4,1,0];

[0284] W1 = [1, -1, 1, 1, -1], W2 = [1, -1, 1, -1, -1], P = [3, 2, 4, 1, 0]; or

[0285] W1=[1,-1,1,1,-1], W2=[1,-1,1,-1,-1], P=[2,3,4,1,0].

[0286] (4) Specific implementation of generating the synchronization signal of the first cell based on the first sequence

[0287] For example, the waveform of the synchronization signal of the first cell can be a single-carrier waveform, such as an on-offkeying (OOK) waveform. OOK is a simple digital modulation technique that represents binary data (1 and 0) by controlling the "on" and "off" of the carrier. OOK-M is an extension of OOK, where M = 1, 2, 4, and M represents the number of sequence elements contained in each orthogonal frequency division multiplexing (OFDM) symbol. Since the overall power consumption of OOK modulation is lower than other modulation schemes, when OOK modulation is used, the synchronization signal of the first cell can be understood as a low-power synchronization signal, and the aforementioned first sequence can be understood as an LP-SS sequence.

[0288] for example, Figure 5 A schematic diagram illustrating the process of generating the synchronization signal for the first cell for network devices. (Example) Figure 5 As shown, the process can include: the network device performing a Discrete Fourier Transform (DFT) on the first sequence (i.e., the target OOK time-domain signal). This transforms the time-domain signal into the frequency domain, decomposing the signal into a superposition of different frequency components. Through DFT operations, the amplitude and phase information of the signal at each discrete frequency point can be obtained, thus yielding the frequency-domain signal. Further, the network device maps the frequency-domain signal onto different subcarriers according to certain rules (i.e., subcarrier mapping), and performs an Inverse Fast Fourier Transform (IFFT) on the signal mapped to the subcarriers. IFFT is the inverse process of DFT, and its purpose is to convert the frequency-domain signal back into a time-domain signal. After IFFT processing, the signal becomes a time-domain waveform that can be transmitted in a practical communication system, i.e., the synchronization signal of the first cell.

[0289] S302, the network device sends a synchronization signal; correspondingly, the terminal device receives the synchronization signal.

[0290] It is understandable that the synchronization signal is generated by the baseband chip of the network device. Sending the synchronization signal involves the baseband chip transmitting the signal to the radio frequency (RF) chip. Sending the synchronization signal also involves the RF chip transmitting the signal to the terminal device.

[0291] S303, The terminal device processes the synchronization signal according to the first sequence.

[0292] For example, taking full sequence detection as an example, the terminal device can determine a first sequence set and process the synchronization signal based on multiple sequences (including the first sequence) in the first sequence set. For instance, the terminal device calculates the correlation values ​​between multiple sequences and the received synchronization signal for each sliding sampling point, and then determines the sequence actually used by the network device based on the maximum correlation value, thereby obtaining the identifier of the first cell and completing downlink synchronization. The specific implementation of the terminal device determining the first sequence set can refer to the description on the network device side: for example, the first sequence set is stored on the terminal device side in a way specified by the protocol or predefined, so the terminal device can directly obtain (or determine) the first sequence set; or, the third, fourth, and fifth sequences are stored on the terminal device side in a way specified by the protocol or predefined, so the terminal device can generate sequences in the first sequence set based on the third, fourth, and fifth sequences.

[0293] For example, the terminal device processes the synchronization signal based on the first sequence. Specifically, taking downsampling detection as an example, assume the terminal device downsamples the received synchronization signal to obtain a received signal or received sequence of length N+L, such as the received sequence R = [R0, R1, ..., R...]. N+L-1 Then, the terminal device can obtain the correlation value sequence of the received sequence R and the first sequence based on the correlator. For example... Figure 6 As shown, the correlator includes log2N registers, log2N adders, log2N subtractors, and log2N multipliers, at time T k Enter R k 0≤k≤N+L-1, and k is an integer; that is, input R0 at time T0, input R1 at time T1, ..., and input R2 at time T... N+L-1 Enter R N+L-1 Ignoring the time delay caused by the correlator calculation, the output terminal 1 of the correlator at time T... N-1 The output correlation value is At time T N The output correlation value is And so on, at time T N+L-1 The output correlation value is The correlator can output N+L-1 correlation values ​​at its output terminal 1. The last L correlation values ​​(i.e., those at time T) are the first of these N+L-1 values. N-1 up to time T N+L-1 The output L correlation values ​​are the global aperiodic correlation value sequence between the received sequence and the first sequence. Wherein, time T... N-1 up to time T N+L-1 The time corresponding to the maximum value among the L output correlation values ​​is the end position of the first sequence in the received sequence R. The start position of the first sequence in the received signal R can be determined based on the length N of the first sequence, thereby achieving time synchronization.

[0294] For example, N=4, the first sequence is [1,1,-1,1], the length of the received sequence is N+L=8, and the received sequence R=[R0,R1,…,R7]=[1,1,-1,1,0,0,0,0]. The lengths of the third, fourth, and fifth sequences are all 2, W1=W2=[1,-1], P=[0,1]. Where P(1)=0, the register depth of the first-level register (denoted as register 1) is 2. 0 =1, the register includes 1 storage unit; P(2)=1, then the register depth of the second-level register (i.e., register 2) is 2. 1 =2, this register includes 2 storage units. D1 and D2 are used below to represent the storage state of the storage units in register 1 and register 2 respectively. The initial storage state of register 1 and register 2 is D1 = [0] and D2 = [0,0].

[0295] If the received sequence R is input sequentially Figure 6 The correlator shown has:

[0296] At time T0, input R0 = 1, D1 and D2 are updated to D1 = [1] and D2 = [1,0] respectively, and the correlation value output by output terminal 1 is 1;

[0297] At time T1, input R1 = 1, D1 and D2 are updated to D1 = [1] and D2 = [2,1] respectively, and the correlation value output by output terminal 1 is 0;

[0298] At time T2, the input R2 = -1, D1 and D2 are updated to D1 = [-1] and D2 = [0,2] respectively, and the correlation value output by output terminal 1 is -1;

[0299] At time T3, input R3 = 1, D1 and D2 are updated to D1 = [1] and D2 = [0,0] respectively, and the correlation value output by output terminal 1 is 4;

[0300] At time T4, input R4 = 0, D1 and D2 are updated to D1 = [0] and D2 = [1,0] respectively, and the correlation value output by output terminal 1 is -1;

[0301] At time T5, input R5 = 0, D1 and D2 are updated to D1 = [0] and D2 = [0,1] respectively, and the correlation value output by output terminal 1 is 0;

[0302] At time T6, input R6 = 0, D1 and D2 are updated to D1 = [0] and D2 = [0,0] respectively, and the correlation value output by output terminal 1 is 1;

[0303] At time T7, input R7 = 0, D1 and D2 are updated to D1 = [0] and D2 = [0,0] respectively, and the correlation value output by output terminal 1 is 0.

[0304] Therefore, the correlation value sequence between the first sequence and the received signal R can be obtained as [-1,0,1,0]. Since the maximum correlation value in the correlation value sequence is the correlation value output at time T6, the end position of the transmitted sequence in the received signal R can be determined as R6 in the received signal R. Then, the start position of the transmitted sequence in the received signal R can be determined according to the length N of the transmitted sequence, thereby achieving time synchronization.

[0305] Furthermore, since the first and second sequences are Gray complementary sequence pairs, the last L correlation values ​​out of the N+L-1 correlation values ​​output by the correlator's output terminal 2 are the global aperiodic correlation value sequence between the received sequence and the second sequence. In other words, by sliding one sampling point, performing log₂N additions and log₂N subtractions (which can be considered as 2log₂N additions and subtractions), a correlation value between the received sequence R and the first sequence, and a correlation value between the received sequence R and the second sequence, can be obtained. For example, if N=8, then by sliding one sampling point, performing 3 additions and 3 subtractions, a correlation value between the received sequence R and the first sequence, and a correlation value between the received sequence R and the second sequence, can be obtained. Or, for example, if N=4, then by sliding one sampling point, performing 2 additions and 2 subtractions, a correlation value between the received sequence R and the first sequence, and a correlation value between the received sequence R and the second sequence, can be obtained.

[0306] Assuming the first sequence set includes two Gray complementary sequence pairs (i.e., four sequences), then for each sliding sampling point, 2*(2log2N) addition and subtraction operations are performed to obtain four correlation values ​​between the received sequence at that sampling point and the four sequences in the first sequence set. Compared to the previous statement that "each sliding sampling point requires 4(N-1) addition operations," this effectively reduces the detection complexity, with a reduction in complexity of [percentage missing]. Table 1 illustrates the percentage reduction in complexity for different lengths.

[0307] Table 1: Examples of complexity reduction percentages for different lengths

[0308] The sequence length (i.e., N) of the first sequence set. Complexity reduction ratio 4 33％ 8 57％ 16 73％ 32 84％

[0309] Furthermore, this embodiment uses downsampling detection as an example. In other examples, upsampling detection can also be performed. For instance, the terminal device upsamples multiple sequences in the first sequence set, and then calculates the correlation value between the upsampled sequence and the received sequence obtained at each sampling point. For details, please refer to the description of downsampling; it will not be repeated here. The difference between upsampling detection and downsampling detection lies in the number of sampling points; upsampling detection has more sampling points than downsampling detection.

[0310] This embodiment uses full sequence detection as an example. In other examples, the terminal device may not perform full sequence detection. For instance, the terminal device may determine the first sequence associated with the first cell based on the identifier of the first cell, and then process the synchronization signal based on the first sequence (instead of processing the synchronization sequence based on multiple sequences in the first sequence set). The specific implementation is not limited. For example, the terminal device may determine the first sequence associated with the first cell from the first sequence set based on the identifier of the first cell. The specific implementation can be found in the description on the network device side.

[0311] The performance of Scheme 1 and Scheme 2 is compared below using simulation examples. Scheme 1 is the scheme provided in this application embodiment, where the synchronization signal is generated based on a first sequence from a first sequence set. The first sequence and a second sequence from the first sequence set are Gray complementary sequence pairs, and the first sequence is any one of the eight sequences (16 in length) given above. Scheme 2 is where the synchronization signal is generated based on a baseline m sequence. See [link to relevant documentation]. Figure 7 As shown, the horizontal axis represents the timing error, i.e., the time deviation of the synchronization signal detection. The larger the value of the horizontal axis, the more severe the error. The unit of timing error can be microseconds (µs). The vertical axis represents the cumulative distribution function (CDF), i.e., the probability that the timing error is less than the current value of the horizontal axis. The probability value of the cumulative distribution function is 0 to 1. Figure 7 It can be seen that the synchronization performance of Scheme 1 and Scheme 2 is basically the same under the envelope detector receiver.

[0312] Regarding the above embodiments, it is understood that:

[0313] (1) In this application, “predefined” usually refers to information that is defined by the standard, does not require configuration by other devices, and is recorded / written in advance in the hardware and / or software of the terminal device or network device itself, or can be understood as information that cannot be changed by the network device or terminal device.

[0314] In this application, "pre-configuration" can refer to the server sending relevant information to network devices or terminal devices; alternatively, it can refer to defining the relevant information and pre-writing it into the network devices or terminal devices. This application does not limit the specific method used. Furthermore, the relevant information can be changed or updated.

[0315] (2) In the embodiments of this application, unless otherwise specified or in case of logical conflict, the terms and / or descriptions in different examples or implementations are consistent and can be referenced by each other. The technical features in different examples or implementations can be combined to form new embodiments according to their inherent logical relationships. In addition, different implementations or different examples can be referenced or referenced by each other.

[0316] (3) The various numerical designations used in this application are merely for descriptive convenience and are not intended to limit the scope of this application. The step numbers in the above flowcharts are only examples of the execution process and do not constitute a restriction on the order of execution of the steps. That is, the size of each step number does not imply the order of execution, and the execution order of each step should be determined by its function and internal logic. In addition, not all steps shown in the flowcharts are mandatory steps, and some steps can be added or deleted based on actual needs.

[0317] (4) The above is based on the synchronization signal. The synchronization signal in this application embodiment can also be a signal in other scenarios, such as a low power-wake up signal (LP-WUS), a physical downlink control channel (PDCCH) signal, or a physical downlink shared channel (PDSCH) signal, etc., without any specific limitation.

[0318] The above mainly describes the solution provided by the embodiments of this application from the perspective of the interaction between the first communication device and the second communication device. It is understood that, in order to achieve the above functions, the first communication device and the second communication device may include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art should readily recognize that, in conjunction with the units and algorithm steps of the various examples described in the embodiments disclosed herein, the embodiments of this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0319] In this application embodiment, the first communication device and the second communication device can be divided into functional units according to the above method example. For example, each function can be divided into a separate functional unit, or two or more functions can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0320] When using integrated units, Figure 8 A possible exemplary block diagram of the apparatus involved in an embodiment of this application is shown. For example... Figure 8 As shown, the device 800 may include a processing unit 802 and a communication unit 803. The processing unit 802 is used to control and manage the operation of the device 800. The communication unit 803 is used to support communication between the device 800 and other devices. Optionally, the communication unit 803 is also called a transceiver unit, and may include a receiving unit and / or a transmitting unit, respectively used to perform receiving and transmitting operations. The device 800 may also include a storage unit 801 for storing the program code and / or data of the device 800.

[0321] (1) The device 800 can be the first communication device in the above embodiments. The processing unit 802 can support the device 800 in performing the actions of the first communication device in the above method embodiments. Alternatively, the processing unit 802 mainly performs the internal actions of the first communication device in the method embodiments, and the communication unit 803 can support communication between the device 800 and other devices.

[0322] For example, in one embodiment, the processing unit 802 is configured to: generate a synchronization signal for a first cell based on a first sequence; the communication unit 803 is configured to: transmit the synchronization signal; wherein the first sequence is a sequence associated with the first cell in a first sequence set, the first sequence set further includes a second sequence, and the first sequence and the second sequence are Gray complementary sequence pairs.

[0323] Other further technical features can be found in the descriptions in the above method embodiments.

[0324] (2) The device 800 can be the second communication device in the above embodiments. The processing unit 802 can support the device 800 in performing the actions of the second communication device in the above method embodiments. Alternatively, the processing unit 802 mainly performs the internal actions of the second communication device in the method embodiments, and the communication unit 803 can support communication between the device 800 and other devices.

[0325] For example, in one embodiment, the communication unit 803 is used to: receive a synchronization signal; the processing unit 802 is used to: process the synchronization signal according to a first sequence; wherein the first sequence belongs to a first sequence set, the first sequence set further includes a second sequence, and the first sequence and the second sequence are Gray complementary sequence pairs.

[0326] Other further technical features can be found in the descriptions in the above method embodiments.

[0327] It should be understood that the division of units in the above device is merely a logical functional division. In actual implementation, they can be fully or partially integrated into a single physical entity, or they can be physically separated. Furthermore, all units in the device can be implemented entirely through software calls from processing elements; all units can be implemented entirely in hardware; or some units can be implemented through software calls from processing elements, while others are implemented in hardware. For example, each unit can be a separate processing element, or it can be integrated into a chip within the device. Alternatively, it can be stored as a program in memory, called and executed by a processing element of the device. Moreover, these units can be fully or partially integrated together, or implemented independently. The processing element here can also be called a processor, which can be an integrated circuit with signal processing capabilities. In the implementation process, the operations or units described above can be implemented through integrated logic circuits in the processor element or through software calls from processing elements.

[0328] In one example, a unit in any of the above devices can be one or more integrated circuits configured to implement the methods described above, such as one or more application-specific integrated circuits (ASICs), or one or more digital signal processors (DSPs), or one or more field-programmable gate arrays (FPGAs), or a combination of at least two of these forms of integrated circuits. As another example, when a unit in the device can be implemented in the form of a processing element scheduler, the processing element can be a processor, such as a central processing unit (CPU), or other processor capable of calling programs. Furthermore, these units can be integrated together to implement a system-on-chip (SoC).

[0329] The receiving unit described above is an interface circuit of the device, used to receive signals from other devices. For example, when the device is implemented as a chip, the receiving unit is an interface circuit for the chip to receive signals from other chips or devices. The transmitting unit described above is an interface circuit of the device, used to transmit signals to other devices. For example, when the device is implemented as a chip, the transmitting unit is an interface circuit for the chip to transmit signals to other chips or devices.

[0330] Based on the above embodiments, this application also provides a communication device, see [link to relevant documentation]. Figure 9 As shown, the communication device 900 may include one or more processors 901. Optionally, the communication device 900 may also include a memory 902, which may be located inside or outside the communication device 900. It is understood that... Figure 9 Only the main components of the communication device are shown; the communication device may further include a transceiver (not shown in the figure).

[0331] Specifically, processor 901 can be a CPU, a network processor (NP), or a combination of a CPU and an NP. Processor 901 may further include a hardware chip. The aforementioned hardware chip can be an ASIC, a programmable logic device (PLD), or a combination thereof. The aforementioned PLD can be a complex programmable logic device (CPLD), an FPGA, a generic array logic (GAL), or any combination thereof.

[0332] The processor 901 and memory 902 are interconnected. Optionally, the processor 901 and memory 902 are interconnected via bus 903; bus 903 can be a peripheral component interconnect (PCI) bus or an extended industry standard architecture (EISA) bus, etc. The bus can be divided into address bus, data bus, control bus, etc. For ease of representation, Figure 9 The bus is represented by a single thick line, but this does not mean that there is only one bus or one type of bus.

[0333] In one alternative implementation, memory 902 is used to store programs, etc. Specifically, the program may include program code, which includes computer operation instructions. Memory 902 may include RAM, and may also include non-volatile memory, such as one or more disk storage devices. Processor 901 executes the application program stored in memory 902 to implement the above functions, thereby realizing the functions of communication device 900.

[0334] For example, the communication device 900 may be the first communication device or the second communication device in the above embodiments.

[0335] In one embodiment, when the communication device 900 implements the functions of the first communication device in the above method embodiment, the transceiver can perform the transmit and receive operations executed by the first communication device in the above method embodiment; the processor 901 can perform other operations besides the transmit and receive operations executed by the first communication device in the above method embodiment. For specific details, please refer to the relevant descriptions in the above embodiments, which will not be elaborated here.

[0336] In one embodiment, when the communication device 900 implements the functions of the second communication device in the above method embodiment, the transceiver can perform the transmit and receive operations executed by the second communication device in the above method embodiment; the processor 901 can perform other operations besides the transmit and receive operations executed by the second communication device in the above method embodiment. Specific details can be found in the relevant descriptions in the above embodiments, and will not be elaborated upon here.

[0337] The terms "system" and "network" in this application embodiment are used interchangeably. "At least one" refers to one or more, and "multiple" refers to two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, "at least one of A, B, and C" includes A, B, C, AB, AC, BC, or ABC. And, unless otherwise specified, the ordinal numbers such as "first" and "second" mentioned in this application embodiment are used to distinguish multiple objects and are not used to limit the order, sequence, priority, or importance of multiple objects.

[0338] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0339] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart illustrations. Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0340] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0341] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

Claims

1. A communication method, characterized in that, The method includes: Generate the synchronization signal for the first cell based on the first sequence; Send the synchronization signal; Wherein, the first sequence is a sequence in the first sequence set associated with the first cell, and the first sequence set also includes a second sequence, and the first sequence and the second sequence are Gray complementary sequence pairs.

2. The method according to claim 1, characterized in that, The method further includes: Based on the identifier of the first cell, determine the first sequence associated with the first cell from the first sequence set.

3. The method according to claim 1 or 2, characterized in that, The synchronization signal is a single-carrier waveform, which includes the on / off key control OOK waveform.

4. The method according to any one of claims 1 to 3, characterized in that, The length of the first sequence is 16, and the first sequence is any one of the following: [1,-1,-1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,-1]； [1,1,-1,-1,1,1,1,1,1,1,-1,-1,1,1,1,1]； [1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,1,1,-1]； [1,1,1,1,1,1,1,1,-1,-1,1,1,-1,-1,1,1]； [1,-1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,1,1,-1]； [1,1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,1,1]； [1,-1,-1,1,-1,1,-1,1,1,-1,-1,1,1,-1,1,-1,1,-1]; or [1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,1,1,1,1]。 5. The method according to any one of claims 1 to 3, characterized in that, The first sequence and the second sequence are obtained based on the third sequence, the fourth sequence, and the fifth sequence; The nth element in the first sequence is denoted as a(n), the nth element in the second sequence is denoted as b(n), n = 1, 2, ..., N, the ith element in the third sequence is denoted as W1(i), the ith element in the fourth sequence is denoted as W2(i), and the ith element in the fifth sequence is P(i), i = 1, 2, ..., I, I = log2N, where N is an integer greater than 1; a1(n)=δ(n) b1(n)=δ(n) a i+1 (n)=a i (n)+W1(i)b i (n-2 P(i) ) b i+1 (n)=a i (n)-W2(i)b i (n-2 P(i) ) Where δ(n) is pre-configured or predefined; a(n) = a I+1 (n), b(n) = b I+1 (n), or, a(n) = b I+1 (n), b(n) = a I+1 (n).

6. The method according to claim 5, characterized in that, N equals 16, the third sequence is denoted as W1, the fourth sequence as W2, and the fifth sequence as P; the third sequence, the fourth sequence, and the fifth sequence are any one of the following: W1=[1,1,-1,-1], W2=[-1,1,1,-1], P=[3,2,1,0]; W1=[-1,1,1,-1], W2=[-1,-1,-1,-1], P=[3,1,2,0]; W1 = [1,-1,-1,-1], W2 = [1,-1,1,-1], P = [3,1,2,0]; or W1=[1,-1,-1,-1], W2=[1,-1,1,-1], P=[3,2,1,0].

7. The method according to any one of claims 1 to 6, characterized in that, The method further includes: Determine the first sequence set, which includes at least one Gray complementary sequence pair.

8. The method according to claim 7, characterized in that, The aperiodic cross-correlation value between any two sequences in the first sequence set is less than or equal to a first threshold, and the aperiodic autocorrelation value of any sequence in the first sequence set is less than or equal to a second threshold.

9. The method according to claim 7 or 8, characterized in that, Each sequence in the first sequence set has a length of 16, and the first sequence set includes at least one Gray complementary sequence pair from Gray complementary sequence pair 1 to Gray complementary sequence pair 4: Gray complementary sequence pair 1: [1,-1,-1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,-1,1,-1] and [1,1,-1,-1,-1,-1,1,1,1,1,1,1,-1,-1,-1,1,1,1,1]; Gray complementary sequence pair 2: [1,-1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1] and [1,1,1,1,1,1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,1]; Gray complementary sequence pairs 3: [1,-1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,-1,1,1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,1,1]; or... Gray complementary sequence pair 4: [1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,1].

10. The method according to claim 7 or 8, characterized in that, Each of the at least one Gray complementary sequence pair is generated based on a third sequence, a fourth sequence, and a fifth sequence, wherein the third sequence is denoted as W1, the fourth sequence is denoted as W2, and the fifth sequence is denoted as P; When each sequence in the first sequence set has a length of 16, the at least one Gray complementary sequence pair is generated according to at least one of the following: W1=[1,1,-1,-1], W2=[-1,1,1,-1], P=[3,2,1,0]; W1=[-1,1,1,-1], W2=[-1,-1,-1,-1], P=[3,1,2,0]; W1 = [1,-1,-1,-1], W2 = [1,-1,1,-1], P = [3,1,2,0]; or W1=[1,-1,-1,-1], W2=[1,-1,1,-1], P=[3,2,1,0].

11. A communication method, characterized in that, The method includes: Receive synchronization signal; The synchronization signal is processed according to the first sequence; Wherein, the first sequence belongs to the first sequence set, the first sequence set also includes the second sequence, and the first sequence and the second sequence are Gray complementary sequence pairs.

12. The method according to claim 11, characterized in that, The method further includes: Based on the identifier of the first cell, determine the first sequence associated with the first cell from the first sequence set.

13. The method according to claim 11 or 12, characterized in that, The synchronization signal is a single-carrier waveform, which includes the on / off key control OOK waveform.

14. The method according to any one of claims 11 to 13, characterized in that, The length of the first sequence is 16, and the first sequence is any one of the following: [1,-1,-1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,-1]； [1,1,-1,-1,1,1,1,1,1,1,-1,-1,1,1,1,1]； [1,-1,1,-1,1,-1,1,-1,-1,1,1,-1,-1,1,1,-1]； [1,1,1,1,1,1,1,1,-1,-1,1,1,-1,-1,1,1]； [1,-1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,1,1,-1]； [1,1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,1,1]； [1,-1,-1,1,-1,1,-1,1,1,-1,-1,1,1,-1,1,-1,1,-1]; or [1,1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,1,1,1,1]。 15. The method according to any one of claims 11 to 13, characterized in that, The first sequence and the second sequence are obtained based on the third sequence, the fourth sequence, and the fifth sequence; The nth element in the first sequence is denoted as a(n), the nth element in the second sequence is denoted as b(n), n = 1, 2, ..., N, the ith element in the third sequence is denoted as W1(i), the ith element in the fourth sequence is denoted as W2(i), and the ith element in the fifth sequence is P(i), i = 1, 2, ..., I, I = log2N, where N is an integer greater than 1; a1(n)=δ(n) b1(n)=δ(n) a i+1 (n)=a i (n)+W1(i)b i (n-2 P(i) ) b i+1 (n)=a i (n)-W2(i)b i (n-2 P(i) ) Where δ(n) is pre-configured or predefined; a(n) = a I+1 (n), b(n) = b I+1 (n), or, a(n) = b I+1 (n), b(n) = a I+1 (n).

16. The method according to claim 15, characterized in that, N equals 16, the third sequence is denoted as W1, the fourth sequence as W2, and the fifth sequence as P; the third sequence, the fourth sequence, and the fifth sequence are any one of the following: W1=[1,1,-1,-1], W2=[-1,1,1,-1], P=[3,2,1,0]; W1=[-1,1,1,-1], W2=[-1,-1,-1,-1], P=[3,1,2,0]; W1 = [1,-1,-1,-1], W2 = [1,-1,1,-1], P = [3,1,2,0]; or W1=[1,-1,-1,-1], W2=[1,-1,1,-1], P=[3,2,1,0].

17. The method according to any one of claims 11 to 16, characterized in that, The method further includes: Determine the first sequence set, which includes at least one Gray complementary sequence pair.

18. The method according to claim 17, characterized in that, The aperiodic cross-correlation value between any two sequences in the first sequence set is less than or equal to a first threshold, and the aperiodic autocorrelation value of any sequence in the first sequence set is less than or equal to a second threshold.

19. The method according to claim 17 or 18, characterized in that, Each sequence in the first sequence set has a length of 16, and the first sequence set includes at least one Gray complementary sequence pair from Gray complementary sequence pair 1 to Gray complementary sequence pair 4: Gray complementary sequence pair 1: [1,-1,-1,1,1,-1,1,-1,1,-1,-1,1,1,-1,1,-1,1,-1] and [1,1,-1,-1,-1,-1,1,1,1,1,1,1,-1,-1,-1,1,1,1,1]; Gray complementary sequence pair 2: [1,-1,1,-1,1,-1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,-1] and [1,1,1,1,1,1,1,1,1,-1,-1,-1,1,1,-1,-1,-1,1,1,1]; Gray complementary sequence pairs 3: [1,-1,-1,1,-1,1,-1,1,1,-1,1,-1,-1,-1,1,1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,1,1,-1,-1,-1,1,1]; or... Gray complementary sequence pair 4: [1,-1,-1,1,-1,1,-1,1,1,-1,-1,-1,1,1,-1,1,-1,-1] and [1,1,-1,-1,-1,-1,-1,-1,-1,1,1,-1,-1,-1,1,1,1,-1,-1,-1,1,1,1].

20. The method according to claim 17 or 18, characterized in that, Each of the at least one Gray complementary sequence pair is generated based on a third sequence, a fourth sequence, and a fifth sequence, wherein the third sequence is denoted as W1, the fourth sequence is denoted as W2, and the fifth sequence is denoted as P; When each sequence in the first sequence set has a length of 16, the at least one Gray complementary sequence pair is generated according to at least one of the following: W1=[1,1,-1,-1], W2=[-1,1,1,-1], P=[3,2,1,0]; W1=[-1,1,1,-1], W2=[-1,-1,-1,-1], P=[3,1,2,0]; W1 = [1,-1,-1,-1], W2 = [1,-1,1,-1], P = [3,1,2,0]; or W1=[1,-1,-1,-1], W2=[1,-1,1,-1], P=[3,2,1,0].

21. A communication device, characterized in that, The device includes a processor coupled to a memory in which a computer program is stored; the processor is configured to invoke part or all of the computer program in the memory such that the method as described in any one of claims 1 to 20 is executed.

22. A communication system, characterized in that, The communication system includes a first communication device and a second communication device, wherein the first communication device is used to perform the method as described in any one of claims 1 to 10, and the second communication device is used to perform the method as described in any one of claims 11 to 20.

23. A computer-readable storage medium, characterized in that, The storage medium stores a computer program that, when some or all of the computer program is executed by a computer, causes the method described in any one of claims 1 to 20 to be performed.

24. A computer program product, characterized in that, When the computer reads and executes the computer program product, the method described in any one of claims 1 to 20 is performed.

Images