WO2025112001A1 - Signal transmission method and apparatus, and device and medium - Google Patents

Abstract

The present application belongs to the field of communications. Disclosed are a signal transmission method and apparatus, and a device and a medium. The method, which is executed by a network device, comprises: sending a first signal, wherein the first signal is generated on the basis of a binary sequence, and the first signal is used for radio resource management (RRM) measurement and/or downlink synchronization (1010). Low-power-consumption downlink synchronization and RRM measurement are realized by means of a low-complexity synchronization sequence, and the possibility of transmitting a synchronization signal and a measurement signal is provided for some communication scenarios in which it is difficult to use an OFDM waveform.

Description

Signal transmission method, device, equipment and medium Technical Field

The present application relates to the field of communications, and in particular to a signal transmission method, device, equipment and medium.

Background Art

Some communication devices have difficulty receiving or processing common Orthogonal Frequency-Division Multiplexing (OFDM) signals due to their low complexity, and the common ZC sequence used to generate OFDM signals is no longer applicable. In addition, there are also some communication devices that are not a good choice for receiving OFDM signals due to the limitation of the working frequency band.

However, for these communication devices that are not suitable for OFDM signals, the need to send synchronization signals and measurement signals still exists. There is currently no feasible solution for designing synchronization signals and measurement signals with non-OFDM waveforms for communication devices that are not suitable for OFDM signals.

Summary of the invention

The present application provides a signal transmission method, apparatus, device and medium, and the technical solution at least includes:

According to one aspect of an embodiment of the present application, a signal transmission method is provided, the method being performed by a network device, the method comprising:

A first signal is sent, where the first signal is generated based on a binary sequence, and the first signal is used for radio resource management RRM measurement and/or downlink synchronization.

According to another aspect of an embodiment of the present application, a signal transmission method is provided, the method being executed by a terminal device, the method comprising:

A first signal is received, where the first signal is generated based on a binary sequence, and the first signal is used for radio resource management RRM measurement and/or downlink synchronization.

According to another aspect of an embodiment of the present application, a signal transmission device is provided, the device comprising:

The sending module is used to send a first signal, where the first signal is generated based on a binary sequence and is used for radio resource management RRM measurement and/or downlink synchronization.

According to another aspect of an embodiment of the present application, a signal transmission device is provided, the device comprising:

The receiving module is used to receive a first signal, where the first signal is generated based on a binary sequence and is used for radio resource management RRM measurement and/or downlink synchronization.

According to one aspect of an embodiment of the present application, a communication device is provided, the communication device comprising:

A processor; a receiver and/or a transmitter connected to the processor; a memory for storing executable instructions of the processor;

Wherein, the communication device is used to implement the signal transmission method as described above.

According to another aspect of an embodiment of the present application, a communication device is provided, the communication device comprising: a receiver and/or a transmitter;

Wherein, the communication device is used to implement the signal transmission method as described above.

According to one aspect of the present application, a computer-readable storage medium is provided, in which executable instructions are stored. The executable instructions are loaded and executed by the processor to implement the signal transmission method as described in the above aspect.

According to one aspect of the present application, a computer program product is provided, which includes computer instructions, the computer instructions are stored in a computer-readable storage medium, a processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes to implement the signal transmission method as described in the above aspects.

According to one aspect of the present application, a chip is provided, which includes a programmable logic circuit and/or program instructions, and when the chip is running, it is used to implement the signal transmission method described in the above aspects.

According to one aspect of the present application, a computer program is provided, wherein the computer program includes computer instructions, and a processor of a computer device executes the computer instructions so that the computer device executes the signal transmission method as described in the above aspect.

The technical solution provided by the embodiments of the present application may have the following beneficial effects:

Since the first signal is generated according to a binary sequence, the binary sequence has low complexity, is easy to generate and easy to detect, and is very easy to combine with non-OFDM waveforms such as OOK waveforms, PSK waveforms, and FSK waveforms. It provides the possibility of transmitting synchronization signals and measurement signals for some communication scenarios where OFDM waveforms are difficult to use, and provides a new feasible solution for downlink synchronization and RRM measurement. If the receiving end of the first signal is a low-power device or a terminal device including WUR, downlink synchronization and RRM measurement can be achieved while maintaining the good characteristics of low complexity and low power consumption. If the receiving end of the first signal is a terminal device operating in the millimeter wave frequency band, the first signal has the advantages of simple generation, easy implementation, and power saving. Combined with the characteristics of high reliability and narrow beam of millimeter wave transmission, the first signal can meet the needs of downlink synchronization and RRM measurement in the millimeter wave frequency band.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following briefly introduces the drawings required for use in the description of the embodiments. Obviously, the drawings described below are only some embodiments of the present application, and for ordinary technicians in this field, they will not be described in detail without paying attention to the following. On the premise of creative work, other drawings can be obtained based on these drawings.

FIG1 shows a schematic diagram of a wireless communication system provided by an exemplary embodiment of the present application;

FIG2 shows a schematic diagram of a communication system provided by an exemplary embodiment of the present application;

FIG3 shows a schematic diagram of radio frequency energy harvesting provided by an exemplary embodiment of the present application;

FIG4 is a schematic diagram showing a backscatter communication process provided by an exemplary embodiment of the present application;

FIG5 shows a schematic diagram of resistive load modulation provided by an exemplary embodiment of the present application;

FIG6 shows a schematic diagram of a receiver provided by an exemplary embodiment of the present application;

FIG7 shows a schematic diagram of an encoding method provided by an exemplary embodiment of the present application;

FIG8 shows a schematic diagram of generating an m-sequence provided by an exemplary embodiment of the present application;

FIG9 shows a schematic diagram of generating an m-sequence provided by an exemplary embodiment of the present application;

FIG10 is a schematic diagram showing a signal transmission method provided by an exemplary embodiment of the present application;

FIG11 is a schematic diagram showing a signal transmission method provided by an exemplary embodiment of the present application;

FIG12 is a schematic diagram showing a signal transmission method provided by an exemplary embodiment of the present application;

FIG13 is a schematic diagram showing a cyclic shift provided by an exemplary embodiment of the present application;

FIG14 is a schematic diagram showing a signal transmission method provided by an exemplary embodiment of the present application;

FIG15 is a schematic diagram showing time domain resources occupied by different sequences provided by an exemplary embodiment of the present application;

FIG16 is a schematic diagram showing time domain resource mapping provided by an exemplary embodiment of the present application;

FIG17 is a schematic diagram showing time domain resource mapping provided by an exemplary embodiment of the present application;

FIG18 is a schematic diagram showing a signal transmission method provided by an exemplary embodiment of the present application;

FIG19 is a schematic diagram showing a signal transmission method provided by an exemplary embodiment of the present application;

FIG20 is a schematic diagram showing a signal transmission method provided by an exemplary embodiment of the present application;

FIG21 shows a structural block diagram of a signal transmission device provided by an exemplary embodiment of the present application;

FIG22 shows a structural block diagram of a signal transmission device provided by an exemplary embodiment of the present application;

FIG23 shows a schematic diagram of the structure of a communication device provided by an exemplary embodiment of the present application;

FIG. 24 shows a schematic diagram of the structure of a communication device provided by an exemplary embodiment of the present application.

DETAILED DESCRIPTION

In order to make the purpose, technical scheme and advantages of the present application clearer, the implementation mode of the present application will be further described in detail below in conjunction with the accompanying drawings. The exemplary embodiments will be described in detail here, and examples thereof are shown in the accompanying drawings. When the following description refers to the drawings, unless otherwise indicated, the same numbers in different drawings represent the same or similar elements. The implementation modes described in the following exemplary embodiments do not represent all implementation modes consistent with the present application. Instead, they are merely examples of devices and methods consistent with some aspects of the present application as detailed in the attached claims.

The terms used in this application are for the purpose of describing specific embodiments only and are not intended to limit this application. The singular forms of "a", "said" and "the" used in this application and the appended claims are also intended to include plural forms unless the context clearly indicates other meanings. It should also be understood that the term "and/or" used herein refers to and includes any or all possible combinations of one or more associated listed items.

It should be understood that although the terms first, second, third, etc. may be used in the present application to describe various information, these information should not be limited to these terms. These terms are only used to distinguish the same type of information from each other. For example, without departing from the scope of the present application, the first information may also be referred to as the second information, and similarly, the second information may also be referred to as the first information. Depending on the context, the word "if" as used herein may be interpreted as "at the time of" or "when" or "in response to determining".

Fig. 1 shows a schematic diagram of a wireless communication system provided by an exemplary embodiment of the present application. The wireless communication system includes a network device 110 and a terminal device 120, and/or a terminal device 120 and a terminal device 130, which are not limited in the present application.

The network device 110 in the present application provides a wireless communication function, and the network device 110 includes but is not limited to: an evolved Node B (eNB), a radio network controller (RNC), a Node B (NB), a base station controller (BSC), a base transceiver station (BTS), a home base station (e.g., Home Evolved Node B, or Home Node B, HNB), a baseband unit (BBU), an access point (AP) in a wireless fidelity (Wi-Fi) system, a wireless relay node, a wireless backhaul node, a transmission point (TP) or a transmission and reception point (TRP), etc., and can also be a next generation Node B (Next Generation Node B) in a fifth generation (5G) mobile communication system. B, gNB) or transmission point (TRP or TP), or, one or a group of (including multiple antenna panels) antenna panels of a base station in a 5G system, or, it can also be a network node constituting a gNB or a transmission point, such as a baseband unit (BBU) or a distributed unit (Distributed Unit, DU), or a base station in a Beyond Fifth Generation (B5G) mobile communication system or a sixth generation (6G) mobile communication system, or a core network (CN), fronthaul, backhaul, radio access network (RAN), network slicing, etc., or The reader/writer of the Radio Frequency Identification (RFID) system.

The terminal device 120 and/or the terminal device 130 in the present application are also called user equipment (UE), access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, user device. The terminal includes but is not limited to: handheld devices, wearable devices, vehicle-mounted devices and Internet of Things devices, such as: electronic tags, controllers, mobile phones, tablet computers, e-book readers, laptop computers, desktop computers, televisions, game consoles, mobile Internet devices (MID), augmented reality (AR) terminals, virtual reality (VR) terminals and mixed reality (MR) terminals, wearable devices, handles, wireless terminals in industrial control (Industrial Control), wireless terminals in self-driving (Self Driving), wireless terminals in remote medical care (Remote Medical), wireless terminals in smart grid (Smart Grid) and so on. Wireless terminals in transportation safety, wireless terminals in smart city, wireless terminals in smart home, wireless terminals in remote medical surgery, cellular phones, cordless phones, Session Initiation Protocol (SIP) phones, Wireless Local Loop (WLL) stations, Personal Digital Assistant (PDA), TV set-top box (STB), Customer Premise Equipment (CPE), etc.

In some embodiments, the network device 110 and the terminal device 120 communicate with each other via some air interface technology, such as a Uu interface.

In some embodiments, there are two communication scenarios between the network device 110 and the terminal device 120: an uplink communication scenario and a downlink communication scenario. Uplink communication refers to sending signals to the network device 110; downlink communication refers to sending signals to the terminal device 120.

In some embodiments, the terminal device 120 and the terminal device 130 communicate with each other via some direct communication interface, such as a PC5 interface.

In some embodiments, there are two communication scenarios between the terminal device 120 and the terminal device 130: a first side communication scenario and a second side communication scenario. The first side communication refers to sending a signal to the terminal device 130; the second side communication refers to sending a signal to the terminal device 120.

In some embodiments, terminal device 120 and terminal device 130 are both within the network coverage and located in the same cell, or terminal device 120 and terminal device 130 are both within the network coverage but located in different cells, or terminal device 120 is within the network coverage but terminal device 130 is outside the network coverage.

The technical solutions provided in the embodiments of the present application can be applied to various communication systems, such as: Global System of Mobile communication (GSM) system, Code Division Multiple Access (CDMA) system, Wideband Code Division Multiple Access (WCDMA) system, General Packet Radio Service (GPRS), Long Term Evolution (LTE) system, LTE Frequency Division Duplex (FDD) system, LTE Time Division Duplex (TDD) system, Advanced Long Term Evolution (LTE-A) system, Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability The present invention is applicable to WiMAX) communication system, 5G mobile communication system, New Radio (NR) system, NR system evolution system, LTE-based access to unlicensed spectrum (LTE-U) system, NR (NR-based access to unlicensed spectrum, NR-U) system, terrestrial communication network (TN) system, non-terrestrial communication network (NTN) system, wireless local area network (WLAN), wireless fidelity (Wi-Fi), cellular Internet of Things system, cellular passive Internet of Things system, ambient power Internet of Things (Ambient Power Enabled Internet of Things, Ambient IoT/A-IoT) system, zero-power Internet of Things system, and can also be applied to the subsequent evolution system of 5G NR system, and can also be applied to B5G, 6G and subsequent evolution systems. In some embodiments of the present application, "NR" may also be referred to as a 5G NR system or a 5G system. The 5G mobile communication system may include a non-standalone (NSA) and/or a standalone (SA) network.

The technical solution provided in the embodiments of the present application can also be applied to machine type communication (MTC), long term evolution technology for machine-to-machine communication (LTE-M), device to device (D2D) network, machine to machine (M2M) network, Internet of Things (IoT) network or other networks. Among them, IoT network can include vehicle networking, for example. Among them, the communication mode in the vehicle networking system is collectively referred to as vehicle to other devices (Vehicle to X, V2X, X can represent anything), for example, the V2X can include: vehicle to vehicle (V2V) communication, vehicle to infrastructure (V2I) communication, vehicle to pedestrian communication (V2P) or vehicle to network (V2N) communication, etc.

The wireless communication system provided in this embodiment can be applied to but is not limited to at least one of the following communication scenarios: an uplink communication scenario, a downlink communication scenario, and a sidelink communication scenario.

Low power devices:

In some embodiments, the terminal device shown in FIG. 1 may also be implemented as a low-power consumption device.

The low-power device may also be referred to as at least one of the following: an ultra-low-power device, a zero-power device, a Passive IoT device, or an Ambient Power Enabled Internet of Things (Ambient IoT/A-IoT) device.

The communication technology implemented by low-power devices can also be called at least one of the following: zero-power communication technology, ultra-low-power communication technology, low-power communication technology, ambient energy Internet of Things (Ambient IoT/A-IoT) technology, passive Internet of Things technology, and zero-power Internet of Things technology.

Low-power devices can harvest energy from the environment (such as radio frequency energy, solar energy, light energy, thermal energy, mechanical energy, kinetic energy, etc.) to obtain energy for communication. Generally speaking, based on the energy source and usage method, low-power devices can be divided into the following three types:

(1) Passive devices: Passive devices do not require built-in batteries. When a passive device is close to a network device (such as the reader of an RFID system), the passive device is within the near field formed by the radiation of the antenna of the network device. Therefore, the antenna of the passive device generates an induced current through electromagnetic induction, and the induced current drives the low-power chip circuit of the passive device. It realizes the demodulation of the forward link signal and the modulation of the reverse link signal. For the backscatter link, the passive device can use backscatter or extremely low-power active transmission to transmit the signal. Passive devices do not require built-in batteries to drive either the forward link or the reverse link. Therefore, passive devices can be considered as zero-power devices.

In addition to not requiring batteries, the RF circuits and baseband circuits of passive devices are also very simple. For example, they do not require devices such as LNA, power amplifier (PA), crystal oscillator, analog to digital converter (ADC), etc., which makes passive devices have many advantages such as small size, light weight, very low price, and long service life.

Passive devices can also support other energy harvesting methods by harvesting energy from the environment (such as solar energy, light energy, thermal energy, kinetic energy, mechanical energy, etc.) to obtain energy for driving circuits, thereby achieving communication.

(2) Semi-passive devices: Semi-passive devices do not have conventional batteries installed on them. They can use radio frequency energy harvesting modules to harvest radio wave energy, or use energy harvesting modules to harvest energy from the environment (such as solar energy, light energy, thermal energy, kinetic energy, mechanical energy, etc.), and store the harvested energy in an energy storage unit (such as a capacitor). After the energy storage unit obtains energy, it can drive the low-power chip circuit of the semi-passive device. It can realize tasks such as demodulation of forward link signals and modulation of backward link signals. For backscatter links, semi-passive devices can use backscatter to transmit signals. Semi-passive devices can also have the ability to actively transmit, that is, in addition to communicating through backscatter, the backward link can also use active transmission to communicate.

Semi-passive devices do not require built-in batteries to drive either the forward link or the reverse link. Although energy stored in capacitors is used during operation, this energy comes from radio energy or ambient energy collected by the energy harvesting module. Therefore, semi-passive devices can be considered as zero-power devices.

Semi-passive devices inherit many advantages of passive devices, such as small size, light weight, very cheap price, long service life, etc.

(3) Active devices: Active devices can have built-in batteries. The battery is used to drive the low-power chip circuit of the active device to achieve demodulation of the forward link signal and modulation of the reverse link signal. The reverse link signal transmission of the active device does not need to consume the active device's own power, and reverse link transmission is achieved through backscattering, thereby achieving zero power consumption. Active devices can also have the ability to actively transmit, that is, in addition to communicating through backscattering, the reverse link can also use active transmission to communicate.

Although the battery is built in, this type of active device has extremely low power consumption and complexity, so the battery capacity can be set within a smaller range, thereby achieving a smaller cost and size. The battery built into the active device can also be used as an energy storage unit to store the ambient energy collected by the energy harvesting module, thereby making the maintenance cycle of the active device longer or even maintenance-free.

In active devices, built-in batteries are used to power the devices, which increases the communication distance of active devices, for example, increases the reading and writing distance of electronic tags, so as to improve the reliability of communication. Therefore, active devices are used in some scenarios with relatively high requirements on communication distance, reading delay, etc.

In terms of communication mode, low-power devices can support backscattering and/or active transmission communication. Generally speaking, based on the transmitter type, low-power devices can be divided into the following three types:

(1) Low-power devices based on backscattering: This type of device uses the backscattering method as described above for uplink data transmission. This type of device does not have an active transmitter for active transmission, but only has a backscattering transmitter. Therefore, when this type of device sends uplink data, the network device needs to provide a carrier. This type of device performs backscattering based on the carrier to achieve uplink data transmission.

(2) Low-power devices based on active transmitters: This type of device uses an active transmitter with active transmission capability for uplink data transmission. Therefore, when sending uplink data, this type of device can use its own active transmitter to send uplink data without the need for network equipment to provide a carrier. Active transmitters suitable for this type of device can be, for example, ultra-low power ASK transmitters, ultra-low power FSK transmitters, etc. Based on current implementations, when transmitting a 100 microwatt signal, the overall power consumption of this type of transmitter can be reduced to 400 to 600 microwatts.

(3) Low-power devices with both backscatter and active transmitters: This type of device can support both backscatter and active transmitters. This type of device can determine whether to use backscatter or active transmitters for active transmission based on different situations (such as different power levels, different available environmental energy levels), or based on the scheduling of network devices.

Fig. 2 shows a communication system 200 provided by an exemplary embodiment of the present application. The communication system 200 includes a network device 110 and a terminal device 140 which is a low-power consumption device.

The terminal device 140, which is a low-power device, includes an energy collection module 321. Optionally, in addition to the energy collection module 321, the terminal device 140 also includes a backscatter communication module 322. Optionally, in addition to the energy collection module 321, the terminal device 140 also includes a logic processing module 323. Exemplarily, the logic processing module 323 includes a low-power computing module. Optionally, in addition to the energy collection module 321, the terminal device 140 also includes a sensor module 324. Optionally, in addition to the energy collection module 321, the terminal device 140 also includes a memory (not shown in the figure). Optionally, in addition to the energy collection module 321, the terminal device 140 also includes a backscatter communication module 322, a logic processing module 323, one or more of a sensor module 324 and a memory.

Exemplarily, the energy collection module 321 can collect energy carried by radio waves in space, or light energy, or kinetic energy, or mechanical energy, or solar energy, etc., so as to provide energy for driving each module of the terminal device 140. After the terminal device 140 obtains energy, it can receive a signal from the network device 110 through a receiver, or reflect a signal to the network device 110 through a backscatter communication module 322, or transmit a signal to the network device 110 through a transmitter (not shown in the figure). The data reflected or transmitted by the terminal device 140 can be data stored by itself (such as an identity or pre-written information, such as the production date, brand, manufacturer, etc. of the product). The sensor module 324 can include various types of sensors, and the terminal device 140 can report the data collected by various types of sensors based on a low power consumption mechanism. The memory is used to store some basic information (such as item identification, etc.) or obtain sensor data such as ambient temperature and ambient humidity.

The terminal device 140 can use the logic processing module 323 to implement simple signal demodulation, decoding or encoding, modulation and other simple computing tasks, and the hardware design can be very simple, making the terminal device 140 very low in cost and small in size.

It should be understood that the modules included in the terminal device 140 shown in FIG. 2 are merely examples and not limitations.

FIG3 shows a schematic diagram of radio frequency power harvesting by the energy harvesting module 321. Radio frequency power harvesting is based on the principle of electromagnetic induction. The radio frequency module RF is connected with the capacitor C and the load resistor RL in parallel through electromagnetic induction to achieve the collection of electromagnetic wave energy in space and obtain the energy required to drive low-power devices, such as: for driving low-power demodulation modules, modulation modules, sensors and memory reading. Based on this, the effect of low-power devices without traditional batteries is achieved.

FIG4 shows a schematic diagram of backscatter communication module 322 performing backscatter communication (Back Scattering). Terminal device 140 receives wireless signal carrier 131 sent by transmitter module (Transmit, TX) 111 of network device 110 using amplifier (Amplifier, AMP) 112, modulates wireless signal carrier 131, uses logic processing module 323 to load information to be sent, and uses energy collection module 321 to collect radio frequency energy. Terminal device 140 uses antenna 316 to radiate modulated reflected signal 132, and this information transmission process is called backscatter communication. Receive module (Receive, RX) 113 of network device 110 uses low noise amplifier (Low Noise Amplifier, LNA) 114 to receive modulated reflected signal 132. Backscatter and load modulation functions are inseparable. Load modulation completes the modulation process by adjusting and controlling the circuit parameters of the oscillation circuit of terminal device 140 according to the beat of the data stream, so that the impedance and other parameters of terminal device 140 change accordingly.

Load modulation technology mainly includes resistive load modulation and capacitive load modulation. FIG5 shows a schematic diagram of resistive load modulation. In resistive load modulation, the load resistor RL is connected in parallel with the third resistor R3, and the switch S based on binary coding control is turned on or off. The on and off of the third resistor R3 will cause the voltage on the circuit to change. The load resistor RL maintains a parallel connection relationship with the first capacitor C1, the load resistor RL maintains a series connection relationship with the second resistor R2, and the second resistor R2 maintains a series connection relationship with the first inductor L1. The first inductor L1 is coupled with the second inductor L2, and the second inductor L2 maintains a series connection relationship with the second capacitor C2. Exemplarily, amplitude shift keying (ASK) can be implemented, that is, the amplitude of the backscattered signal of the terminal device is adjusted to achieve signal modulation and transmission. Similarly, in capacitive load modulation, the circuit resonant frequency can be changed by turning the capacitor on and off, and frequency shift keying (FSK) can be implemented, that is, the signal modulation and transmission is achieved by adjusting the operating frequency of the backscattered signal of the terminal device.

The terminal device 140 can perform information modulation on the incoming signal by means of load modulation, thereby realizing the backscatter communication process.

Therefore, low-power devices have the following significant advantages: (1) They do not need to actively transmit signals, so they do not require complex RF links, such as PA, RF filters, etc.; (2) They do not need to actively generate high-frequency signals, so they do not need high-frequency crystal oscillators; (3) With the help of backscatter communication, signal transmission does not need to consume its own energy.

Due to its significant advantages such as extremely low cost, extremely low power consumption, and small size, the communication system shown in Figure 2 can be widely used in various industries, such as logistics for vertical industries, smart warehousing, smart agriculture, energy and electricity, industrial Internet, etc.; it can also be applied to personal applications such as smart wearables and smart homes.

For example, it is applied to at least the following four scenarios: (1) object recognition, such as logistics, production line product management, and supply chain management; (2) environmental monitoring, such as temperature, humidity, and harmful gas monitoring of the working environment and natural environment; (3) positioning, such as indoor positioning, intelligent object search, and production line item positioning; (4) intelligent control, such as intelligent control of various electrical appliances in smart homes (turning on and off air conditioners, adjusting temperature), and intelligent control of various facilities in agricultural greenhouses (automatic irrigation and fertilization).

Wake-Up Receiver (WUR):

In another scenario, in order to achieve further power saving of UE, a mechanism for WUR to receive energy-saving signals is introduced. WUR has the characteristics of extremely low cost, extremely low complexity and extremely low power consumption. It mainly receives energy-saving signals based on envelope detection. Therefore, the energy-saving signals received by WUR are different from the conventional signals based on PDCCH carrier in terms of modulation mode, waveform, etc. The energy-saving signal is mainly an envelope signal that ASK modulates the carrier signal. The demodulation of the envelope signal can also be completed based on the energy provided by the wireless RF signal to drive the low-power circuit, so it can be passive. WUR can also be powered by UE. Regardless of the power supply method, WUR greatly reduces power consumption compared to the traditional receiver of UE. For example, WUR can achieve power consumption of less than 1 milliwatt (mw), which is much lower than the power consumption of tens to hundreds of milliwatts of traditional receivers. WUR can be combined with UE as an additional module of the traditional receiver of UE, or it can be a separate module of UE, such as a wake-up function module.

The receiver system block diagram including WUR is shown in FIG6. WUR receives the energy-saving signal. If the UE needs to turn on the main transceiver (Main In the embodiment of the present invention, the UE uses a WUR 103 to monitor the WUS, and the UE can always use the WUR 103 when there is no business or paging message. Only when there is business, the UE receives the WUS to wake up the main transceiver 101 for data transmission and reception. Therefore, compared with the traditional UE always using the main transceiver mode, the WUR 103 can significantly reduce the overall power consumption of the UE and achieve energy saving on the UE side.

On the one hand, WUR can be used as an auxiliary receiver of a traditional UE to achieve energy saving of the main transceiver. For example, the terminal device 120 shown in FIG1 includes a main transceiver and a WUR, so that the terminal device 120 can achieve energy saving. On the other hand, a low-power receiver similar to WUR can also be used as a receiver of a low-power device to receive downlink signals (such as control signaling sent by a network device, downlink data, etc.). For example, the terminal device 140 shown in FIG2 receives downlink signals through a low-power receiver (similar to WUR), so that the terminal device 140 can achieve energy saving.

FIG7 is a schematic diagram showing the coding method used by the communication devices shown in FIG1, FIG2, and FIG6. The signals transmitted by the communication devices shown in FIG1, FIG2, and FIG6 can use different forms of codes to represent binary "1" and "0", that is, use different pulse signals to represent "0" and "1". Here are several coding methods:

·Not Return to Zero (NRZ) encoding: Non-return to zero encoding uses a high level to represent binary "1" and a low level to represent binary "0". Figure 6 shows the level diagram of using the NRZ method to encode binary data: 101100101001011.

Manchester coding: Manchester coding is also known as Split-Phase Coding. In Manchester coding, the binary value is represented by the change in level (rising or falling) during half a bit period within the bit length. A negative jump during half a bit period represents a binary "1", and a positive jump during half a bit period represents a binary "0". Manchester coding is usually used for data transmission from low-power devices to network devices when using carrier load modulation or backscatter modulation, because it is conducive to discovering data transmission errors. This is because the "no change" state is not allowed within the bit length of Manchester coding. When multiple low-power devices send data bits with different values at the same time, the received rising and falling edges cancel each other, resulting in an uninterrupted carrier signal throughout the bit length. Since this state is not allowed, the network device can use this error to determine the specific location where the collision occurred. Figure 6 shows a level diagram of binary data encoded using the Manchester method: 101100101001011.

Unipolar Return to Zero (URZ) encoding: In URZ encoding, a high level in the first half of the bit period represents a binary "1", while a low level signal that lasts throughout the entire bit period represents a binary "1". Figure 6 shows a level diagram of using the URZ method to encode binary data: 101100101001011.

Differential Binary Phase (DBP) encoding: Differential Binary Phase encoding represents binary "0" at any edge in half a bit period, and no edge represents binary "1". In addition, the level is inverted at the beginning of each bit period. Therefore, the bit beat is easier to reconstruct for the receiver. Figure 6 shows a level diagram of binary data 101100101001011 encoded using the DBP method.

Miller coding: Miller coding uses any edge within half a bit period to represent a binary "1", while a constant level in the next bit period represents a binary "0". Level changes occur at the beginning of a bit period, and the bit beat is easier to reconstruct for the receiver. Figure 6 shows a schematic diagram of the level of binary data 101100101001011 encoded using the Miller method.

Differential encoding: In differential encoding, each binary "1" to be transmitted causes a change in the signal level, while for binary "0", the signal level remains unchanged.

It should be noted that the above encoding methods are examples of encoding methods that can be adopted by the communication devices shown in Figures 1, 2, and 6, but are not limiting.

Downlink synchronization:

In order to establish a connection with a network device, the terminal device needs to synchronize the terminal device and the network device in time and/or frequency. The process of the terminal device maintaining time domain synchronization and/or frequency domain synchronization with the network device based on the downlink signal sent by the network device is called downlink synchronization. Among them, the downlink signal used to achieve downlink synchronization can be called a synchronization signal.

Radio Resource Management (RRM) measurements:

RRM is the management of channel interference, wireless resources and other aspects in wireless communication systems. Its goal is to provide high-quality service quality assurance for terminal devices under limited bandwidth conditions. RRM is based on the RRM measurement and reporting of terminal devices. The terminal devices measure the downlink signals sent by network devices and report the measurement results so that network devices can adjust one or more of the parameters such as channels, power, bandwidth, beams, etc. in a timely manner, so that the wireless network can quickly adapt to environmental changes, thereby maintaining high-quality service quality within the communication system. Among them, the downlink signal used to implement RRM measurement can be called a measurement signal, a reference signal, etc.

Low-power devices and terminal devices including WUR, as terminal devices with low power consumption characteristics, naturally also have the need for downlink synchronization and RRM measurement.

Among them, when the low-power device performs downlink synchronization and RRM measurement, the power consumption required for the low-power receiver to receive the synchronization signal for downlink synchronization is significantly less than the power consumption required for the traditional receiver to perform downlink synchronization, and the power consumption required for the low-power receiver to receive the measurement signal for RRM measurement is significantly less than the power consumption required for the traditional receiver to perform RRM measurement.

When a terminal device including WUR performs downlink synchronization and RRM measurement, WUR can take over the RRM measurement task of the main transceiver, reducing or avoiding the need to wake up the main transceiver to perform RRM measurement, thereby achieving energy saving of the main transceiver.

Exemplarily, WUR replaces the main transceiver to perform RRM measurements. Since the main transceiver is not required to perform RRM measurements, the power consumption of the main transceiver can be saved. Since the power consumption of WUR is lower than that of the main transceiver, performing RRM measurements through WUR can significantly reduce the overall power consumption of the UE. Exemplarily, WUR replaces part of the RRM measurement tasks, and the main transceiver undertakes another part of the RRM measurement tasks, reducing the number of times the main transceiver performs RRM measurements, thereby saving the power consumption of the main transceiver.

Exemplarily, WUR receives a synchronization signal and performs downlink synchronization. Since the main transceiver does not need to perform downlink synchronization, the power consumption of the main transceiver can be saved. After waking up the main transceiver, the main transceiver can directly send and receive data according to the downlink synchronization result of WUR, thereby reducing service delay. Exemplarily, WUR receives a synchronization signal and performs coarse synchronization, wakes up the main transceiver to further perform fine synchronization, and reduces the duration and steps of the main transceiver for downlink synchronization, thereby saving the power consumption of the main transceiver and reducing service delay.

However, the low complexity characteristics of low-power receivers and WURs make it difficult to support the reception of common Orthogonal Frequency-Division Multiplexing (OFDM) waveforms. Therefore, for low-power devices and terminal devices including WURs, if they want to perform downlink synchronization and RRM measurements through low-power receivers and WURs, it is difficult to achieve this using signals based on OFDM waveforms.

Therefore, in some scenarios where OFDM signals are difficult to transmit, there is no feasible solution for achieving downlink synchronization and RRM measurement, but the need for various terminal devices to receive signals to perform downlink synchronization and RRM measurement is very urgent.

To this end, the present application provides a signal transmission method, apparatus, device and medium, which support a network device to send a first signal generated according to a binary sequence to achieve one or more of downlink synchronization, RRM measurement, etc.

The binary sequence involved in this application refers to a sequence of sequence elements that only have two possible values. It can also be understood that each bit in the binary sequence has only two possible values. For example, the value of any bit in a pseudo-noise (PN) sequence, an m sequence, or a gold sequence is "1" or "0", and the value of any bit in a Walsh sequence is "+1" or "-1".

Three types of binary sequences are introduced here: m-sequence, gold sequence and Walsh sequence.

m-sequence:

The m-sequence is the longest code sequence generated by a multi-stage shift register or its delay element through linear feedback. The m-sequence is also called the longest linear feedback shift register sequence or the maximum-length sequence. The number of shift register stages can be understood as the number of shift registers. The sequence currently stored in a shift register is called a state. After the shift register outputs one bit and the feedback function supplements one bit, the shift register moves to the next state.

In a binary shift register, if r is the number of shift register stages, an r-stage shift register has ^2r states, excluding the all-0 state, there are ^2r -1 states left. Therefore, the maximum length of the code sequence it can generate is ^2r -1 bits. In other words, the longest period generated by an r-stage linear feedback shift register is equal to ^2r -1.

First, the linear feedback shift register is introduced. FIG8 shows a general schematic diagram of the linear feedback shift register. Assume that the initial state of the shift register is (a ₀ a ₁ … a _r-2 a _r-1 ). After one shift linear feedback, the input of the first stage at the left end of the shift register is shown in the following formula (1).

If the shift is performed f times, the input of the first stage on the left side of the shift register is as shown in the following formula (2).

Among them, e＝r+f-1≥r, f＝1,2,3,… It can be seen that the input of the first stage of the shift register is affected by the feedback logic and the initial state of the shift register. Formula (2) is called the recursive relationship of the r-stage linear feedback shift register.

Referring to the recursive relationship described by equation (2), an r-stage shift register can generate ^2r -1 non-constant zero sequences according to different initial states. Therefore, the maximum length of the code sequence that can be generated by an r-stage linear feedback shift register is ^2r -1 bits, that is, the longest period of the sequence generated by an r-stage linear feedback shift register is equal to ^2r -1.

The following formula (3) is called the characteristic polynomial of the r-stage linear feedback shift register, which can be used to describe the feedback connection state of the r-stage linear feedback shift register. Among them, the existence of x ⁱ indicates that c _i = 1, otherwise c _i = 0, and the value of x itself has no practical meaning. The value of c _i determines the feedback link of the shift register. Since c ₀ = _cr = 1, f(x) is an r-order polynomial with a constant term of 1.

The necessary and sufficient condition for an r-stage linear feedback shift register to generate an m-sequence is that f(x) is an r-order primitive polynomial. If f(x) satisfies the following three conditions, then f(x) is considered to be an r-order primitive polynomial: (1) f(x) is a reduced polynomial, that is, f(x) cannot be factorized; (2) f(x) is divisible by (x ^p +1), where p = 2 ^r -1; (3) f(x) is not divisible by (x ^q +1), where q < p.

Take r = 4 as an example to illustrate the generation of m-sequence. The longest period of the sequence generated by the 4-stage linear feedback shift register is 2 ^r -1 = 15. When r = 4, the characteristic polynomial f(x) must be a 4th-order primitive polynomial to generate the m-sequence. In other words, it is required that f(x) cannot be factored any further, and f(x) can divide (x ¹⁵ +1) and f(x) cannot divide (x ^q +1), and q < 15.

First, factorize (x ¹⁵ +1) as shown in equation (4) below, so that each factor of (x ¹⁵ +1) is a reduced polynomial, and then find f(x).
x ¹⁵ +1＝(x+1)(x ² +x+1)(x ⁴ +x+1)(x ⁴ +x ³ +1)(x ⁴ +x ³ +x ² +x+1) Formula (4)

Among them, (x ¹⁵ +1) has 3 fourth-order factors. But (x ⁴ +x ³ +x ² +x+1) can divide (x ⁵ +1), so (x ⁴ +x ³ +x ² +x+1) is not a primitive polynomial. Therefore, we can find two fourth-order primitive polynomials: (x ⁴ +x+1) and (x ⁴ +x ³ +1), and either of them can generate an m-sequence.

For example, taking f(x)=x ⁴ +x+1 as an example, the m-sequence generator is shown in FIG9 . The modulo-2 sum of a ₀ and a ₃ will be used as the new highest bit a ₃ after the sequence is shifted right, and the lowest bit a ₀ of the sequence will be used as the output. Assume that the initial state of the 4-stage shift register is "1000", c ₄ =c ₁ =c ₀ =1, c ₃ =c ₂ =0. After a cycle of length 15, the lowest bit of the sequence output by each sequence shift constitutes an m-sequence, and thus the m-sequence "100110101111000" is obtained.

The m-sequence is balanced. In one cycle of the m-sequence, the number of "1" and "0" is basically equal. To be precise, the number of "1" is one more than the number of "0".

The run distribution of the m-sequence also has characteristics. Elements in a sequence that have the same value and are connected are collectively called a run. The number of elements in a run is called the run length. The number of runs of length h accounts for 2 ^-h of the total number of runs of the m-sequence, and in a run of length h, runs of consecutive "1"s and runs of consecutive "0"s each account for half. For example, in the m-sequence "100110101111000", there are a total of 8 runs. Among them, the number of runs of length 4 is 1, that is, 1111. The number of runs of length 3 is 1, that is, 000. The number of runs of length 2 is 2, that is, 11 and 00. The number of runs of length 1 is 4, that is, two "1"s and two "0"s.

The sequence obtained by adding the m sequence and its shift sequence modulo 2 is still a shift sequence of the m sequence. This property is called the shift-addition property of the m sequence, or linear superposition. The shift sequence is relative to the basic m sequence. The sequence obtained by cyclic shifting the basic m sequence is called the shift sequence. For details, please refer to the "cyclic shift" section below.

The m sequence has a good autocorrelation characteristic. Assume that the autocorrelation function of the m sequence is defined as equation (5). Where A is the number of elements in one period of the m sequence and its j-time shift sequence that are the same, D is the number of elements in one period of the m sequence and its j-time shift sequence that are different, and L is the period of the m sequence.

Formula (5) can also be rewritten as Formula (6).

From the shift-add property of m sequence, we can know that is still an element of the m-sequence. Therefore, the numerator of equation (6) is equal to the difference between the number of "0" and the number of "1" in one period of the m-sequence.

From the equilibrium of the m sequence, we can see that the number of "0" in one cycle of the m sequence is one less than the number of "1", so the numerator is equal to "-1".

Therefore, the autocorrelation function of the m sequence can be obtained as shown in formula (7).

Since the balance, run distribution and autocorrelation characteristics of the m-sequence are very similar to the basic properties of a random sequence, the m-sequence can also be called a pseudo-noise (PN) sequence, a pseudo-random sequence, etc.

Gold Sequence:

The gold sequence is a code sequence obtained based on the optimal pair of m-sequences. First, the optimal pair of m-sequences is introduced. Two different primitive polynomials of order r each generate an m-sequence. The condition for these two m-sequences to form an optimal pair of m-sequences is that the cross-correlation function value satisfies equation (8).

Two m-sequences that satisfy equation (8) can be called a pair of m-sequence preferred pairs. The gold sequence is constructed by adding a pair of m-sequence preferred pairs modulo 2. Moreover, a new gold sequence can be obtained after each cyclic shift of one of the m-sequences. Therefore, compared with the m-sequence, a significant advantage of the gold sequence is that it can obtain more independent code sequences.

The gold sequence has good cross-correlation characteristics and still has excellent properties similar to the m sequence, such as excellent balance, run distribution characteristics, autocorrelation characteristics, etc. In addition, the maximum cross-correlation value between each gold sequence obtained by a pair of m sequence optimization pairs will not exceed the maximum cross-correlation value between this pair of m sequence optimization pairs.

Walsh Sequence:

Walsh sequence, also known as Walsh code, is derived from the Hadamard matrix.

Assume that the second-order Hadamard matrix is We can obtain the second-order Walsh sequences (1,1) and (1,-1).

Assume that the high-order Hadamard matrix is A Walsh sequence of length 2n can be obtained. For example, a Walsh sequence of order 4 (1,1,1,1), (1,-1,1,-1), (1,1,-1,-1), (1,-1,-1,1) can be obtained.

Walsh sequences are a set of orthogonal sequences, which means that all elements in the Walsh sequence are orthogonal to each other and do not interfere with each other. Each Walsh sequence is a binary sequence with a length that is a power of 2, such as 2, 4, 8, 16, etc. Walsh sequences are symmetrical, that is, the positive and negative versions of the Walsh sequence are the same, just in reverse order. Walsh sequences also have good cross-correlation characteristics.

In this application, "agreement" can be implemented by pre-saving corresponding codes, tables or other methods that can be used to indicate relevant information in communication devices (such as terminal devices, network devices), and this application does not limit its specific implementation method. Communication protocol agreement can also be understood as The solution is predefined for the communication protocol.

FIG. 10 is a schematic diagram showing a flow chart of a signal transmission method provided by an exemplary embodiment of the present application. The method is executed by a network device, and the method includes:

Step 1010: Send a first signal, where the first signal is used for RRM measurement and/or downlink synchronization, and the first signal is generated based on a binary sequence.

The first signal involved in the present application can be used for downlink synchronization and RRM measurement. Therefore, the first signal can also be called at least one of the following: a first synchronization signal, a first measurement signal, a first reference signal, a low power synchronization signal (Low Power Synchronization Signal, LP-SS), a low power reference signal (Low Power Reference Signal, LP-RS), and a low power measurement signal.

The binary sequence includes only two sequence elements with different values, so the sequence of the first signal also includes only two sequence elements with different values. Exemplarily, the sequence of the first signal includes only "0" and "1", or the sequence of the first signal includes only "+1" and "-1".

In some embodiments, the first signal is generated according to at least one of: an m-sequence; a gold sequence; a Walsh sequence.

In some embodiments, the modulation method of the first signal includes at least one of the following: On-Off Keying (OOK) modulation; Phase Shift Keying (PSK) modulation; Binary Phase Shift Keying (BPSK) modulation; Frequency Shift Keying (FSK) modulation.

It should be noted that the types of binary sequences provided in the present application are not limited to m-sequences, gold sequences and Walsh sequences. Other binary sequences or other sequences with sequence characteristics similar to binary sequences are also applicable to the methods provided in the embodiments of the present application.

The network device that performs step 1010 may be the network device 110 shown in FIG. 1 , or the network device 110 shown in FIG. 2 , or a network device operating in a millimeter wave (mmWave) frequency band, and so on.

In summary, the method provided in the embodiment of the present application, since the first signal is generated according to a binary sequence, the binary sequence has low complexity, is easy to generate and easy to detect, and is very easy to combine with non-OFDM waveforms such as OOK waveforms, PSK waveforms, and FSK waveforms, which provides the possibility of transmitting synchronization signals and measurement signals for some communication scenarios where OFDM waveforms are difficult to use, and provides a new feasible solution for downlink synchronization and RRM measurement. If the receiving end of the first signal is a low-power device or a terminal device including WUR, downlink synchronization and RRM measurement can be achieved while maintaining the good characteristics of low complexity and low power consumption. If the receiving end of the first signal is a terminal device operating in the millimeter wave frequency band, the first signal has the advantages of simple generation, easy implementation, and power saving. Combined with the characteristics of high reliability and narrow beam of millimeter wave transmission, the first signal can meet the needs of downlink synchronization and RRM measurement in the millimeter wave frequency band.

Next, taking the generation of the first signal based on the gold sequence as an example, the relevant contents of the generation of the first signal based on the gold sequence are further introduced on the basis of step 1010.

FIG. 11 is a schematic flow chart of a signal transmission method provided by an exemplary embodiment of the present application. The method is executed by a network device, and the method includes:

Step 1110: Send a first signal, where the first signal is used for RRM measurement and/or downlink synchronization, and the first signal is generated based on a gold sequence.

As can be seen from the foregoing, the gold sequence is obtained by adding a preferred pair of m-sequences modulo 2. In the embodiment of the present application, the two m-sequences included in a pair of m-sequence preferred pairs are referred to as the first m-sequence and the second m-sequence. It can be understood that in the present application, the names such as "first", "second", "third", "fourth", and "fifth" are only used to distinguish the descriptions, and do not mean that the m-sequences are restricted in terms of order, naming, etc. For example, the first m-sequence is any one m-sequence in the preferred pair of m-sequences, and the second m-sequence is another m-sequence in the preferred pair of m-sequences.

This application provides three ways to generate gold sequences:

Gold sequence generation method 1: the first m sequence remains unchanged, and the second m sequence is cyclically shifted

Assuming that the number of shift register stages is r, if the first m-sequence remains unchanged and the second m-sequence is cyclically shifted, the cyclic shift sequences of the fourth m-sequence and the fifth m-sequence are added modulo 2, and at most 2 ^r -1 gold sequences can be obtained. Adding the first m-sequence and the second m-sequence themselves, then, through method 1, at most 2 ^r -1 + 2 = 2 ^r + 1 gold sequences can be obtained.

For the sake of distinction, the several gold sequences generated by way 1 can be referred to as the first gold sequence family, and the gold sequences included in the first gold sequence family are referred to as first gold sequences. The first gold sequence family includes at most 2 ^r +1 first gold sequences. Exemplarily, if r=5, at most 33 first gold sequences can be obtained by way 1.

It should be noted that 2 ^r +1 is the upper limit of the number of first gold sequences that the first gold sequence family can include, but it does not mean that the first gold sequence family must include 2 ^r +1 first gold sequences.

Optionally, the number of first gold sequences in the first gold sequence family is determined according to at least one of the following: the level r, the length L ₀ of the first m-sequence, the length L ₁ of the second m-sequence, the cyclic offset, and the cyclic shift step.

Optionally, the number of first gold sequences in the first gold sequence family is configured by a network device or agreed upon by a communication protocol.

Assuming that the number of optimal pairs of m sequences is M, the upper limit of the number of gold sequences that can be generated by method 1 is M*(2 ^r +1). Wherein, M is determined according to the number of shift register stages r and the above-mentioned formula (8), which represents the number of optimal pairs of m sequences that can be found when the number of stages is r.

Gold sequence generation method 2: the first m sequence is cyclically shifted, and the second m sequence is also cyclically shifted

Assuming that the number of shift register stages is r, if the first m-sequence remains unchanged and the second m-sequence is cyclically shifted, the cyclic shift sequences of the fourth m-sequence and the fifth m-sequence are added modulo 2, and at most 2 ^r -1 gold sequences can be obtained.

Assuming the number of shift registers is r, if the second m sequence remains unchanged, the first m sequence is cyclically shifted to convert the fifth m sequence and By performing modulo-2 addition on the cyclic shift sequence of the fourth m sequence, at most 2 ^r -1 gold sequences can be obtained.

Then, the first m-sequence is cyclically shifted, and the second m-sequence is cyclically shifted, and the cyclically shifted sequence of the fourth m-sequence and the cyclically shifted sequence of the fifth m-sequence are added modulo 2, and at most (2 ^r -1)*(2 ^r -1) gold sequences can be obtained.

For the convenience of distinction, the several gold sequences generated by mode 2 can be referred to as the second gold sequence family, and the gold sequences included in the second gold sequence family are referred to as second gold sequences. The second gold sequence family includes at most ( ^2r -1)*( ^2r -1) second gold sequences. Exemplarily, if r=5, the first m sequence and the second m sequence are cyclically shifted respectively, and at most 961 second gold sequences can be obtained.

It should be noted that (2 ^r -1)*(2 ^r -1) is the upper limit of the number of second gold sequences that the second gold sequence family can contain, but it does not mean that the second gold sequence family must contain (2 ^r -1)*(2 ^r -1) second gold sequences.

Optionally, the number of second gold sequences in the second gold sequence family is determined according to at least one of the following: the level r, the length L ₀ of the first m-sequence, the length L ₁ of the second m-sequence, the cyclic offset, and the cyclic shift step.

Optionally, the number of second gold sequences in the second gold sequence family is configured by the network device or agreed upon by the communication protocol.

Assuming that the number of optimal pairs of m sequences is M, the upper limit of the number of gold sequences that can be generated by method 2 is M*(2 ^r -1)*(2 ^r -1). Here, M is determined according to the number of shift register stages r and the above formula (8), which indicates the number of optimal pairs of m sequences that can be found when the number of stages is r.

Gold sequence generation method 3: cyclic shift of the first gold sequence

As described in Mode 1, when the number of shift register stages is r, the first gold sequence family may include at most 2 ^r +1 first gold sequences. Mode 3 obtains more gold sequences by continuously performing cyclic shift on the first gold sequence in the first gold sequence family.

After a gold sequence is cyclically shifted, at most 2 ^r -1 gold sequences can be obtained. Then, after 2 ^r +1 gold sequences are cyclically shifted, at most (2 ^r +1)*(2 ^r -1) gold sequences can be obtained.

For the convenience of distinction, the several gold sequences generated by mode 3 can be referred to as the third gold sequence family, and the gold sequences included in the third gold sequence family are referred to as third gold sequences. The third gold sequence family includes at most ( ^2r +1)*( ^2r -1) third gold sequences. Exemplarily, if r=5, at most 33 first gold sequences can be obtained by mode 1, and at most 33*31=1023 third gold sequences can be obtained by mode 3.

It should be noted that ( ^2r +1)*( ^2r -1) is the upper limit of the number of third gold sequences that the third gold sequence family can contain, but it does not mean that the third gold sequence family must contain ( ^2r +1)*( ^2r -1) third gold sequences.

Optionally, the number of third gold sequences in the third gold sequence family is determined according to at least one of the following: the level r, the length L ₀ of the fourth m-sequence, the length L ₁ of the fifth m-sequence, the cyclic offset, and the cyclic shift step.

Optionally, the number of third gold sequences in the third gold sequence family is configured by a network device or agreed upon by a communication protocol.

Assuming that the number of optimal pairs of m sequences is M, the upper limit of the number of gold sequences that can be generated by mode 3 is M*( ^2r +1)*( ^2r -1). Wherein, M is determined according to the number of shift register stages r and the above-mentioned formula (8), which indicates the number of optimal pairs of m sequences that can be found when the number of stages is r.

It should be noted that mode 1, mode 2 and mode 3 can be used alone or in combination. That is to say, the first gold sequence family, the second gold sequence family and the third gold sequence family are not in conflict, and different types of gold sequences can exist simultaneously in the communication system, for example, the first signal corresponding to cell A is generated according to the first gold sequence, and the first signal corresponding to cell B is generated according to the second gold sequence.

It can be seen that, when the number of levels is the same, compared with method 1, method 2 and method 3 can obtain more sequences. In the case of providing one-to-one corresponding first signals for more cells, method 2 and method 3 are more suitable. However, it is obvious that the complexity of method 3 is higher than that of method 2, and the complexity of method 2 is higher than that of method 1. Therefore, if the complexity is expected to be lower when generating the first signal, method 1 is more suitable.

In the present application, a gold sequence family may also be referred to as a gold sequence group or a gold sequence set. One gold sequence family corresponds to one m-sequence preferred pair.

The first signal provided in the embodiment of the present application may be generated according to the first gold sequence as described above, or may be generated according to the second gold sequence as described above, or may be generated according to the third gold sequence as described above.

In some embodiments, the gold sequence corresponding to the first signal is a gold sequence in a gold sequence set, wherein the gold sequence set is determined according to the shift register level r and/or the m sequence preference pair. Optionally, the gold sequence set includes several gold sequence families.

In some embodiments, the gold sequence corresponding to the first signal is a gold sequence in a group of several gold sequences, wherein the gold sequence group is determined according to the shift register level r and/or the m sequence preference pair.

In some embodiments, the gold sequence corresponding to the first signal is determined according to the cell identifier. That is, the first signal corresponding to each cell is associated with its own cell identifier. Related to the total number S of cells in the communication system, illustratively,

In the embodiment of the present application, the gold sequence used to generate the first signal is referred to as a target gold sequence, and the first signal can be obtained by modulating the target gold sequence.

The target gold sequence is generated based on the first m-sequence and the second m-sequence, that is, the target gold sequence is based on a pair of m-sequences. Then, how to determine the target m sequence preferred pair for generating the target gold sequence, that is, how to determine the target gold sequence family to which the target gold sequence belongs, is a problem that needs to be solved . Among them, the gold sequence family to which the target gold sequence belongs is called the target gold sequence family. The m sequence preferred pair that generates the target gold sequence family is called the target m sequence preferred pair.

The target m-sequence preferred pair is a pair of M-to-m-sequence preferred pairs. If you want to determine the target m-sequence preferred pair, you first need to understand the generation of the M-to-m-sequence preferred pair.

The M-pairs of m-sequences are determined according to the number of shift register stages. Exemplarily, when the number of shift register stages is r, at most N first m-sequences can be generated, and the M-pairs of m-sequences are determined from the N first m-sequences according to formula (8).

As can be seen from the foregoing, M pairs of m sequence preferred pairs can generate M gold sequence families, specifically referring to the gold sequence generation methods 1, 2, and 3 described above. It can be understood that in order to facilitate distinction, these M gold sequence families should have one-to-one corresponding numbers or indexes, and the embodiment of the present application is explained by taking the numbering as an example.

This part involves the numbering order of the M gold sequence families. This concept is briefly introduced here.

In some embodiments, the numbering order of the M gold sequence families is determined by a network device, or is agreed upon by a communication protocol, or is determined by a terminal device. Optionally, the numbering order of the M gold sequence families is arranged according to at least one of the following: the number of the m-sequence preferred pair, the level r, the number of gold sequences in the gold sequence family, the length of the gold sequence in the gold sequence family, the number of the gold sequence family, the number of the gold sequence in the gold sequence family, the number of the corresponding m-sequence, the numbering order of the corresponding m-sequence, the corresponding primitive polynomial coefficient, the binary number of the corresponding primitive polynomial coefficient, and the cyclic offset.

In some embodiments, the M gold sequence families are numbered 0, 1, 2 ..., M-1, or the M gold sequence families are numbered 1, 2 ..., M, etc. Other numbering schemes that can distinguish each gold sequence are also applicable to the embodiments of the present application.

In some embodiments, before assigning numbers to the M gold sequence families, the M gold sequence families are first arranged according to a specific rule or randomly arranged, and then the M gold sequence families are assigned corresponding numbers from front to back according to the arrangement order, for example, forming M gold sequence families with a numbering order of 0, 1, 2..., M-1.

In some embodiments, numbers are first assigned to the M gold sequence families, and then the M gold sequence families are arranged according to a specific rule, and the numbering order of the M gold sequence families is finally disrupted, for example, the M gold sequence families are formed in the order of 2, 0, M-1…, 1.

Assuming that the number of shift register stages is r, there are N m-sequences. M pairs of m-sequence preferred pairs are selected from the N m-sequences according to formula (8). It can be understood that the N m-sequences have one-to-one corresponding sequence numbers, and the N m-sequences have a numbering order. Optionally, the numbering order of the N m-sequences is default, or random, or arranged according to a specific rule, or agreed upon by a communication protocol, or indicated by a network device.

Then, the numbering of all m-sequences included in the M-pairs of m-sequence preferred pairs may be consistent with or inconsistent with their numbering in the N m-sequences. For example, after selecting the M-pairs of m-sequence preferred pairs from the N m-sequences, all m-sequences included in the M-pairs of m-sequence preferred pairs continue to use their numbering in the N m-sequences. For another example, after selecting the M-pairs of m-sequence preferred pairs from the N m-sequences, all m-sequences included in the M-pairs of m-sequence preferred pairs are renumbered from 0 or 1. Regardless of whether all m-sequences included in the M-pairs of m-sequence preferred pairs continue to use their numbering in the N m-sequences, the embodiments of the present application support it, as long as each m-sequence has a one-to-one corresponding number.

The number of the preferred pair of M pairs of m-sequences is related to the number of the m-sequences it contains.

Exemplarily, the number of a pair of m-sequence preferred pairs is the number of the first m-sequence in the pair of m-sequence preferred pairs. Optionally, the first m-sequence is any m-sequence in the pair of m-sequence preferred pairs, or the first m-sequence is an m-sequence with a smaller number value in the pair of m-sequence preferred pairs, or the first m-sequence is an m-sequence with a larger number value in the pair of m-sequence preferred pairs, and so on.

Exemplarily, the number of a pair of m-sequence preferred pairs is the product of the numbers of the two m-sequences included in the pair of m-sequence preferred pairs. Exemplarily, a pair of m-sequence preferred pairs includes m-sequences numbered 2 and 4, then the pair of m-sequence preferred pairs is numbered 8.

Exemplarily, the number of a pair of m-sequence preferred pairs is the sum, difference, modulo result, etc. of the numbers of two m-sequences included in the pair of m-sequence preferred pairs.

In some embodiments, the numbers of the M gold sequence families are consistent with the numbers of the corresponding m-sequence preferred pairs. For example, if a pair of m-sequence preferred pairs is numbered 3, then the number of the gold sequence family generated by the pair of m-sequence preferred pairs is also 3.

In some embodiments, the M gold sequence families are arranged in ascending order according to the numbers of the M-pairs of m-sequence preferred pairs, and then assigned numbers from 0 to M-1, or assigned numbers from 1 to M. Exemplarily, M=5, the M-pairs of m-sequence preferred pairs are numbered 1, 3, 5, 7, 9, the gold sequence family generated by the m-sequence preferred pair numbered 1 is numbered 1, and the gold sequence family generated by the m-sequence preferred pair numbered 9 is numbered 5.

In some embodiments, the M gold sequence families are arranged in descending order according to the numbers of the M-to-m-sequence preferred pairs, and then assigned numbers from 0 to M-1, or assigned numbers from 1 to M. Exemplarily, M=5, the M-to-m-sequence preferred pairs are numbered 9, 7, 5, 3, 1, the gold sequence family generated by the m-sequence preferred pair numbered 9 is numbered 1, and the gold sequence family generated by the m-sequence preferred pair numbered 1 is numbered 5.

In some embodiments, the numbering order of the M gold sequence families is arranged from small to large according to the numbering values of the gold sequence families, or is arranged from large to small according to the numbering values of the gold sequence families.

In some embodiments, the numbering order of the M gold sequence families is arranged according to the numbering and/or numbering order of the m sequences used to generate the gold sequence families.

In some embodiments, the numbering order of the M gold sequence families is consistent with the numbering order of the corresponding m sequence preferred pairs. For example, if the numbering order of the M pairs of m sequence preferred pairs is 2, 0, M-1..., 1, then the numbering order of the M gold sequence families is also 2, 0, M-1..., 1.

In some embodiments, the numbering order of the M gold sequence families is arranged in ascending order according to the numbers of the M-pairs of m-sequence preferred pairs. For example, M=5, and the M-pairs of m-sequence preferred pairs are numbered 1, 3, 5, 7, and 9, then the gold sequence family generated by the m-sequence preferred pair numbered 1 is ranked first, and the gold sequence family generated by the m-sequence preferred pair numbered 9 is ranked fifth.

In some embodiments, the numbering order of the M gold sequence families is arranged in descending order according to the numbers of the M-pairs of m-sequence preferred pairs. For example, M=5, and the numbers of the M-pairs of m-sequence preferred pairs are 9, 7, 5, 3, and 1, then the gold sequence family generated by the m-sequence preferred pair numbered 9 is ranked first, and the gold sequence family generated by the m-sequence preferred pair numbered 1 is ranked fifth.

In some embodiments, the numbering order of the M gold sequence families is arranged in the order of the product of the numbers of the two m sequences respectively included in the M pairs of m-sequence preferred pairs from small to large. Exemplarily, the m-sequence preferred pair A includes m-sequences numbered 2 and 3, then the product of the numbers of the two m sequences included in the m-sequence preferred pair A is 6. The m-sequence preferred pair B includes m-sequences numbered 0 and 5, then the product of the numbers of the two m sequences included in the m-sequence preferred pair B is 0. Then, the gold sequence family corresponding to the m-sequence preferred pair A is arranged after the gold sequence family corresponding to the m-sequence preferred pair B.

In some embodiments, the numbering order of the M gold sequence families is arranged in descending order according to the product of the numbers of the two m sequences respectively included in the M pairs of m-sequence preferred pairs.

In some embodiments, the numbering order of the M gold sequence families is arranged in ascending order according to the sum of the numbers of the two m-sequences respectively included in the M pairs of m-sequence preferred pairs. Exemplarily, the m-sequence preferred pair A includes m-sequences numbered 2 and 3, and the sum of the numbers of the two m-sequences included in the m-sequence preferred pair A is 5. The m-sequence preferred pair C includes m-sequences numbered 0 and 1, and the sum of the numbers of the two m-sequences included in the m-sequence preferred pair C is 1. Then, the gold sequence family corresponding to the m-sequence preferred pair A is arranged after the gold sequence family corresponding to the m-sequence preferred pair C.

In some embodiments, the numbering order of the M gold sequence families is arranged in descending order according to the sum of the numbers of the two m sequences respectively included in the M pairs of m-sequences.

In some embodiments, the numbering order of the M gold sequence families is first arranged based on the m-sequence with a smaller number in the preferred pair, and then arranged based on the m-sequence with a larger number in the preferred pair. Alternatively, the numbering order of the M gold sequence families is first arranged based on the m-sequence with a larger number in the preferred pair, and then arranged based on the m-sequence with a smaller number in the preferred pair.

Assume that in a pair of m-sequence preferred pairs, the m-sequence with a smaller number is called sequence E, and the m-sequence with a larger number is called sequence F. For example, the m-sequence preferred pair C is {0,1}, then in the m-sequence preferred pair C, the m-sequence numbered 0 is called sequence E, and the m-sequence numbered 1 is called sequence F. For another example, the m-sequence preferred pair D is {1,2}, then in the m-sequence preferred pair D, the m-sequence numbered 1 is called sequence E, and the m-sequence numbered 2 is called sequence F.

Exemplarily, assuming that M pairs of m-sequence preferred pairs are {0,1}, {1,2}, {0,3}, {4,6}, {1,5}, respectively, if the sequences E in each preferred pair (i.e., the m-sequences with smaller numbers) are first arranged in ascending order, there are two pairs of m-sequence preferred pairs whose sequence E is numbered 0, there are two pairs of m-sequence preferred pairs whose sequence E is numbered 1, and then the sequences F in each preferred pair (i.e., the m-sequences with larger numbers) are arranged in ascending order, the arrangement order of the M pairs of m-sequence preferred pairs can be obtained as follows: {0,1}, {0,3}, {1,2}, {1,5}, {4,6}.

Exemplarily, assuming that M pairs of m-sequence preferred pairs are {0,1}, {1,2}, {0,3}, {4,6}, {1,5}, respectively, if they are first arranged from large to small according to the number of the sequence E in each preferred pair, there are two pairs of m-sequence preferred pairs whose sequence E is numbered 0, and there are two pairs of m-sequence preferred pairs whose sequence E is numbered 1, and then the numbers of the sequences F in each preferred pair are arranged from large to small, the arrangement order of the M pairs of m-sequence preferred pairs can be obtained as follows: {4,6}, {1,5}, {1,2}, {0,3}, {0,1}.

Exemplarily, assuming that the preferred pairs of M pairs of m sequences are {0,1}, {1,2}, {0,3}, {4,6}, {1,5}, respectively, if the sequences F in each preferred pair are arranged from large to small according to their numbers, the order of arrangement of the preferred pairs of M pairs of m sequences can be obtained as follows: {4,6}, {1,5}, {0,3}, {1,2}, {0,1}.

Exemplarily, assuming that the preferred pairs of M pairs of m sequences are {0,1}, {1,2}, {0,3}, {4,6}, {1,5}, if the sequences F in each preferred pair are arranged from small to large according to their numbers, the order of arrangement of the preferred pairs of M pairs of m sequences can be obtained as follows: {0,1}, {1,2}, {0,3}, {1,5}, {4,6}.

It can be understood that when arranging according to sequence E and sequence F in each preferred pair, they are not limited to the order of numbers from small to large or from large to small, and can also be arranged according to primitive polynomial coefficients, binary numbers of primitive polynomial coefficients, etc. For details, please refer to the arrangement rules described above.

In some embodiments, the numbering order of the M gold sequence families is first arranged based on the first m-sequence in the preferred pair, and then arranged based on the second m-sequence in the preferred pair. Alternatively, the numbering order of the M gold sequence families is first arranged based on the second m-sequence in the preferred pair, and then arranged based on the first m-sequence in the preferred pair.

For example, if the m-sequence preferred pair C is {0,1}, then the first m-sequence in the m-sequence preferred pair C is the m-sequence on the left, that is, the m-sequence numbered 0; the second m-sequence is the m-sequence on the right, that is, the m-sequence numbered 1. For another example, if the m-sequence preferred pair D is {2,1}, then the first m-sequence in the m-sequence preferred pair D is the m-sequence on the left, that is, the m-sequence numbered 2, and the second m-sequence is the m-sequence on the right, that is, the m-sequence numbered 1.

Exemplarily, the preferred pairs of M pairs of m-sequences are {0,1}, {2,1}, {0,3}, {4,6}, {1,5}. If they are first arranged from small to large according to the number of the first m-sequence in each preferred pair, and there are two pairs of m-sequence preferred pairs whose first m-sequences are both numbered 0, and then they are arranged from small to large according to the number of the second m-sequence, the arrangement order of the preferred pairs of M pairs of m-sequences can be obtained as follows: {0,1}, {0,3}, {1,5}, {2,1}, {4,6}.

Exemplarily, the preferred pairs of M pairs of m-sequences are {0,1}, {2,1}, {0,3}, {4,6}, {1,5}. If they are first arranged from large to small according to the number of the second m-sequence in each preferred pair, there are two pairs of m-sequence preferred pairs whose second m-sequences are both numbered 1, and then they are arranged from large to small according to the number of the first m-sequence, the arrangement order of the preferred pairs of M pairs of m-sequences can be obtained as follows: {4,6}, {1,5}, {0,3}, {2,1}, {0,1}.

It can be understood that when arranging according to the first m-sequence and the second m-sequence in each preferred pair, it is not limited to the order of numbers from small to large or from large to small, and can also be arranged according to primitive polynomial coefficients, binary numbers of primitive polynomial coefficients, etc. For details, please refer to the arrangement rules described above.

In addition to designing the numbering order of the M gold sequence families, the numbering order within each gold sequence family can also be designed. The numbering order of the gold sequences within each gold sequence family can also be default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device.

Exemplarily, the numbering order of the gold sequences within each gold sequence family is arranged from small to large according to the cyclic offset, or from large to small according to the cyclic offset.

Optionally, the numbering rules within different gold sequence families are the same or different. Here, taking the case of different numbering rules as an example, the numbering order of the M gold sequence families is first arranged as 0, 1, 2..., 8 according to the numbering of the m sequence preferred pairs, and the gold sequences in the gold sequence family numbered 0 are arranged from small to large according to the cyclic offset, and the gold sequences in the other numbered gold sequence families are arranged from large to small according to the cyclic offset. If the numbering rules are the same, for example, the numbering order within the M gold sequence families is arranged from small to large according to the cyclic offset, or is arranged from large to small according to the cyclic offset.

In some embodiments, the design of the numbering order can be understood as the situation where the gold sequence family has both logical numbering and physical numbering. Among them, the logical numbering refers to the order of the numbering of the gold sequence family in the data logic, such as the numbering 0, 1, 2 ..., M-1, or the numbering 1, 2 ..., M in the embodiment of the present application; the physical numbering refers to the position of the numbering of the gold sequence family in the memory, or the position in the agreed mapping relationship, such as the numbering order (such as 2, 0, M-1 ..., 1) in the embodiment of the present application. The logical numbering and physical numbering of the gold sequence family may be the same or different. The reason why the numbering order is disrupted is that the correlation between the gold sequences is taken into account. For example, by changing the numbering order of the gold sequence, the gold sequences with better correlation can be arranged adjacently, so that the first signals corresponding to the adjacent cells can also have a better correlation. In addition, the storage of data may be affected by factors such as the memory allocation method and the memory management of the operating system, and the numbering order of the gold sequence may also need to be adjusted according to the storage situation. Therefore, there is a possibility of adjusting the numbering order of the gold sequence according to the actual situation, that is, adjusting the physical numbering of the gold sequence.

In simple terms, the numbering sequence involved in this application can be understood as a logical sequence or a physical sequence, and can be adjusted based on actual conditions, communication requirements, and communication protocol agreements.

After understanding the M-pairs of m-sequence preferred pairs/M gold sequence families, the following describes how to determine the target m-sequence preferred pair among the M-pairs of m-sequence preferred pairs, that is, how to determine the target gold sequence family among the M gold sequence families.

It can be understood that in order to facilitate downlink synchronization and RRM measurement of each cell, different first signals should be designed for different cells, so that the UE can implement RRM measurement and synchronization corresponding to each cell according to the first signal. Different first signals can be realized by differences in at least one of the following aspects: the number of the target m-sequence, the number of the target gold sequence family, the number of the first m-sequence, the number of the second m-sequence, the cyclic shift step, and the cell identifier.

In some embodiments, the number of the target gold sequence family is determined according to the cell identifier. Since different cells correspond to different cell identifiers, this design naturally realizes the mapping between the cell and the target gold sequence family, so that each cell has a corresponding target gold sequence family to generate the first signal, thereby supporting each cell to achieve downlink synchronization and RRM measurement.

In some embodiments, the communication protocol stipulates the number of the target gold sequence family corresponding to each cell identifier, and/or the communication protocol stipulates the number of the target m-sequence preferred pair corresponding to each cell identifier.

In some embodiments, the communication protocol stipulates a rule for determining the number of the target gold sequence family according to the cell identifier. For example, the communication protocol stipulates a mathematical operation rule between each cell identifier and the target gold sequence family.

Exemplarily, the number of the target gold sequence family is equal to the cell identifier Exemplarily, the number of the target gold sequence family is equal to the cell identifier The modulo result of M, that is Exemplary, target gold sequence family encoding The number is determined by the quotient of the cell ID and M, for example,

In some embodiments, the network device indicates the number of the target gold sequence family and/or the number of the target m-sequence preferred pair to the terminal device. Exemplarily, the network device indicates the number of the target gold sequence family and/or the number of the target m-sequence preferred pair to the terminal device through at least one of a broadcast message, a system message, an RRC signaling, a MAC CE, etc.

The network device may directly indicate the number of the target gold sequence family, or may indicate information used to determine the number of the target gold sequence family. For example, the network device indicates at least one of the following information to the terminal device: the number of the target gold sequence in the M*Q gold sequences, the first starting value e, the numbering order of the M gold sequence families, and the numbering order of the M-to-m sequence preferred pairs. The terminal device may directly obtain the number of the target gold sequence family according to the received information, or may determine the number of the target gold sequence family according to the received information.

If different cells are expected to use different first signals, this can be achieved by indicating different target gold sequence family numbers to different cells through network equipment, or by indicating different information for determining the target gold sequence family numbers to different cells through network equipment, thereby achieving mapping between cells and target gold sequence families, so that each cell has a corresponding target gold sequence family to generate the first signal, thereby supporting each cell to achieve downlink synchronization and RRM measurement.

In some embodiments, the number of the target gold sequence family is determined according to the number I _SS of the target gold sequence in the M*Q gold sequences, where Q represents the number of gold sequences included in each gold sequence family. Optionally, the number I _SS of the target gold sequence in the M*Q gold sequences is determined by a network device, or is agreed upon by a communication protocol, or is determined by a terminal device.

In some embodiments, the numbering of the target gold sequence family is determined according to at least one of the following: I _SS , a first starting value e, Q, and a numbering order of the M gold sequence families.

The first starting value e is used to indicate the starting position, which is the starting position of the gold sequence family used to determine the target gold sequence within the M gold sequence families. Exemplarily, the numbering order of the M gold sequence families is 5, 1, 0, 4, 3, 2, 7, 8, 6, and the first starting value e=3, which means that when determining the target gold sequence, the gold sequence family ranked third is considered, that is, the gold sequence family numbered 0 is considered.

Exemplarily, the target gold sequence family is arranged in M gold sequence families. If the numbering order of the M gold sequence families is 5, 1, 0, 4, 3, 2, 7, 8, 6, e = 3, I _SS = 35, Q = 12, then the target gold sequence family is the gold sequence family ranked 5th among the M gold sequence families, that is, the gold sequence family numbered 3.

After finding the target gold sequence family/target m sequence preferred pair according to the previous content, the target m sequence can be generated according to the target m sequence preferred pair. Mark the gold sequence.

Assume that the target m-sequence preferred pair includes a first m-sequence and a second m-sequence. The first m-sequence is one m-sequence in the m-sequence preferred pair, and the second m-sequence is the other m-sequence in the m-sequence preferred pair.

In some embodiments, the sequence element numbered n in the target gold sequence is determined according to the sequence element numbered a in the first m sequence and the sequence element numbered b in the second m sequence. It can also be understood that the value of the nth bit in the target gold sequence is determined according to the value of the ath bit in the first m sequence and the value of the bth bit in the second m sequence.

In some embodiments, a is determined according to at least one of the following: n, parameter m ₀ , and a first length value. b is determined according to at least one of the following: n, parameter m ₁ , and a first length value. Parameter m ₀ represents a cyclic offset of a first m sequence when generating a target gold sequence, and parameter m ₁ represents a cyclic offset of a second m sequence when generating a target gold sequence.

The first length value is the length value of the first m-sequence, that is, the length value of the second m-sequence. n is greater than or equal to 0 and less than the first length value.

In some embodiments, a is determined according to a first modulo result. The first modulo result is a modulo result of the first sum value and the first length value. The first sum value is the sum of n and the parameter m ₀ .

In some embodiments, b is determined according to a second modulo result. The second modulo result is a modulo result of the second sum value and the first length value. The second sum value is the sum of n and the parameter _m1 .

In some embodiments, the sequence element numbered n in the target gold sequence is the first product, which can also be understood as the value of the nth bit in the target gold sequence is equal to the first product. The first product is the product of the first difference and the second difference. The first difference is the difference between the value 1 and the second product, and the second product is the product of the value 2 and the sequence element numbered a in the first m-sequence. The second difference is the difference between the value 1 and the third product, and the third product is the product of the value 2 and the sequence element numbered b in the second m-sequence.

Exemplarily, the target gold sequence can be expressed as formula (9): wherein d _SS (n) represents the target gold sequence, x ₀ (n) represents the first m-sequence used to generate the target gold sequence, x ₁ (n) represents the second m-sequence used to generate the target gold sequence, and L represents the first length value.
d _SS (n)＝[1-2x ₀ ((n+m ₀ )mod L)]·[1-2x ₁ ((n+m ₁ )mod L)] (9)

In some embodiments, equation (9) is applicable to the case where the first signal is obtained through BPSK modulation.

In some embodiments, the sequence element numbered n in the target gold sequence is the sequence element numbered a in the first m sequence and the sequence element numbered a in the second The modulo 2 result of the sum of the sequence elements numbered b in the m sequence. It can also be understood that the value of the nth bit in the target gold sequence is equal to the modulo 2 result of the sum of the value of the ath bit in the first m sequence and the value of the bth bit in the second m sequence.

Exemplarily, the target gold sequence can be expressed as formula (10): wherein d _SS (n) represents the target gold sequence, x ₀ (n) represents the first m-sequence used to generate the target gold sequence, x ₁ (n) represents the second m-sequence used to generate the target gold sequence, and L represents the first length value.
d _SS (n)＝[x ₀ ((n+m ₀ )mod L)+x ₁ ((n+m ₁ )mod L)]mod 2 (10)

In some embodiments, formula (10) is applicable to the case where the first signal is obtained through OOK modulation.

In some embodiments, the parameters _m0 and _m1 are based on the cell identifier Sure.

In some embodiments, the parameter _m0 is determined according to the first sub-identifier, the parameter _m1 is determined according to the second sub-identifier, and the first sub-identifier and the second sub-identifier are determined according to the cell identifier. OK. Assume that the first sub-identifier is represented by The second sub-identifier is represented by

In some embodiments, the first sub-identifier and the second sub-identifier According to the cell ID and parameter k. Where 1≤k≤S, S represents the total number of cells in the communication system.

In some embodiments, in,

It can be seen from the above formula that a pair of first sub-identifier and second sub-identifier can be uniquely determined according to the cell identifier, and this pair of first sub-identifier and second sub-identifier can uniquely determine a pair of parameters _m0 and _m1 . A pair of first m-sequence and second m-sequence are uniquely determined according to the method described above. When the first m-sequence, the second m-sequence, the parameter _m0 , and the parameter _m1 are all uniquely determined, the target gold sequence _dSS (n) can be naturally uniquely generated, realizing a one-to-one correspondence between the cell identifier and the target gold sequence. The target gold sequence is a sequence used to generate the first signal, therefore, a one-to-one correspondence between the cell identifier and the first signal is also realized, thereby supporting the terminal device to realize RRM measurement and synchronization of the corresponding cell according to the first signal.

In some embodiments, the number of the first m-sequence is agreed upon by the communication protocol, or indicated by the network device, or determined according to the rules agreed upon by the communication protocol. Exemplarily, the network device directly indicates the number of the first m-sequence, or indicates the number of the target gold sequence family, or indicates the number of the target m-sequence preferred pair, or indicates information used to determine the target gold sequence family.

In some embodiments, the number of the second m-sequence is agreed upon by the communication protocol, or indicated by the network device, or determined according to the rules agreed upon by the communication protocol. Exemplarily, the network device directly indicates the number of the second m-sequence, or indicates the number of the target gold sequence family, or indicates the number of the target m-sequence preferred pair, or indicates information used to determine the target gold sequence family.

In some embodiments, the numbering of the preferred m-sequence pairs is agreed upon by a communication protocol, or is indicated by a network device, or is determined according to a rule agreed upon by a communication protocol.

Regarding the determination of the parameters m ₀ and m ₁ , the present application embodiment provides two calculation methods:

Calculation method 1:

In some embodiments, the parameter _m0 is determined according to a modulo result of the first sub-identifier and the parameter G, and the parameter _m1 is determined according to a modulo result of the second sub-identifier and the parameter F.

In some embodiments, parameter _m0 is equal to the modulo result of the first sub-identifier and parameter G, and parameter _m1 is equal to the modulo result of the second sub-identifier and parameter F. That is,

In some embodiments, parameter _m0 is equal to _q1 times the modulo result of the first sub-identifier and parameter G, and parameter _m1 is equal to _q2 times the modulo result of the second sub-identifier and parameter F. That is, Among them, _q1 is a positive integer and _q2 is a positive integer.

Optionally, the parameter G is smaller than the first length value, that is, G＜L. Optionally, the parameter F is smaller than the first length value, that is, F＜L.

Optionally, the parameter _m0 is smaller than the first length value, that is, _m0 ＜L. Optionally, the parameter _m1 is smaller than the first length value, that is, _m1 ＜L.

In some embodiments, the parameters G and F are determined according to the total number S of cells in the communication system.

In some embodiments, assuming that the total number of cells in the communication system is S, the product of parameter G and parameter F is equal to S, that is, G*F=S. It can also be understood that parameter G and parameter F are divisors of S. Exemplarily, S=64, then G=8, F=8; or, G=1, F=64; or, G=2, F=32; or, G=4, F=16; or, G=1, F=64; or, G=16, F=4; or, G=32, F=2; or, G=64, F=1.

In some embodiments, the sum of parameter G and parameter F is equal to S, that is, G+F=S. Alternatively, an integer multiple of the product of parameter G and parameter F is equal to S, and so on.

In some embodiments, F=k, Among them, 1≤k≤S.

Example 1: Assume that the total number of cells in the communication system is S=64 (S≥1), and the number or index of these 64 cells ranges from 0 to 63. Assume that the cell identifier corresponding to the first signal sent this time is When the number of shift registers is r, the optimal number of m-sequence pairs is M = 2, then, At this time, the first m-sequence x ₀ (n) and the second m-sequence x ₁ (n) correspond to the gold sequence family numbered 15 in the M gold sequence families. Assume that the parameters G and F are divisors of S, for example, G=8, F=8. Assume that the length of the target gold sequence is L=63, k=3.

Then, according to Can get

according to

By calculating according to formula (9), we can obtain d _SS (n) = [1-2x ₀ ((n+2) mod 63)] · [1-2x ₁ ((n+0) mod 63)], 0≤n＜63.

By calculating according to formula (10), we can obtain d _SS (n) = [x ₀ ((n+2) mod 63) + x ₁ ((n+0) mod 63)] mod 2, 0≤n＜63.

Example 2: Assume that the total number of cells in the communication system is S=64 (S≥1), and the number or index of these 64 cells ranges from 0 to 63. Assume that the cell identifier corresponding to the first signal sent this time is The network device indicates the number of the target gold sequence family = 15, L = 63, k = 3, q ₁ = 3, q ₂ = 4. Assume that a gold sequence family includes Q = 12 gold sequences, The network device indicates that the second starting information = 2, then the target gold sequence family is the gold sequence family ranked 2+1=3 among the M gold sequence families. At this time, the first m sequence x ₀ (n) and the second m sequence x ₁ (n) correspond to the gold sequence family ranked 3 among the M gold sequence families.

Then, according to Can get

According to F = k, We can get F = 3,

according to

By calculating according to formula (9), we can obtain d _SS (n) = [1-2x ₀ ((n+30) mod 63)]·[1-2x ₁ ((n+1) mod 63)], 0≤n＜63.

By calculating according to formula (10), we can obtain d _SS (n) = [x ₀ ((n+30) mod 63) + x ₁ ((n+1) mod 63)] mod 2, 0≤n＜63.

Calculation method 2:

In some embodiments, the parameter _m0 is determined according to the first sub-identifier and the second sub-identifier, and the parameter _m1 is determined according to the first sub-identifier.

In some embodiments, parameter _m0 is determined according to the quotient of the first sub-identifier and parameter B and the second sub-identifier, and parameter _m1 is determined according to the modulo result of the first sub-identifier and parameter B.

For example, Optional, B is a positive integer, _f1 is a positive integer, and _f2 is a positive integer. Optional, Optionally, B is smaller than the first length value, that is, B＜L.

Optionally, the parameter _m0 is smaller than the first length value, that is, _m0 ＜L. Optionally, the parameter _m1 is smaller than the first length value, that is, _m1 ＜L.

Example 3: Assume that the total number of cells in the communication system is S=1008, and the number or index of these 1008 cells ranges from 0 to 1007. Assume that the cell identifier corresponding to the first signal sent this time is When the number of shift registers is r, the optimal number of m-sequence pairs is M = 6, then, At this time, the first m-sequence x ₀ (n) and the second m-sequence x ₁ (n) correspond to the gold sequence family numbered 1 among the M gold sequence families. Assume that the length of the target gold sequence is L=127, f ₁ =15, f ₂ =5, B=112, and k=2.

Then, according to Can get

according to

By calculating according to formula (9), we can obtain d _SS (n) = [1-2x ₀ ((n+20) mod 127)]·[1-2x ₁ ((n+53) mod 127)], 0≤n＜127.

By calculating according to formula (10), we can obtain d _SS (n) = [x ₀ ((n+20) mod 127) + x ₁ ((n+53) mod 127)] mod 2, 0≤n＜127.

Example 4: Assume that the total number of cells in the communication system is S=1008 (S≥1), and the number or index of these 1008 cells ranges from 0 to 1007. Assume that the cell identifier corresponding to the first signal sent this time is The network device indicates the number of the target gold sequence family = 15, k = 3. Assume that a gold sequence family includes Q = 12 gold sequences, The network device indicates that the second starting information = 2, then the target gold sequence family is the gold sequence family ranked 2+1=3rd among the M gold sequence families. At this time, the first m-sequence x ₀ (n) and the second m-sequence x ₁ (n) correspond to the gold sequence family ranked 3rd among the M gold sequence families. Assume that the length of the target gold sequence is L=63, f ₁ =10, f ₂ =3, and B=56.

Then, according to Can get

according to

By calculating according to formula (9), we can obtain d _SS (n) = [1-2x ₀ ((n+13) mod 63)]·[1-2x ₁ ((n+54) mod 63)], 0≤n＜63.

By calculating according to formula (10), we can obtain d _SS (n) = [x ₀ ((n+13) mod 63) + x ₁ ((n+54) mod 63)] mod 2, 0≤n＜63.

It should be noted that, regardless of calculation method 1 or calculation method 2, the calculation methods of _m0 and _m1 can be swapped. For example, parameter _m0 is determined according to the second sub-identifier, and parameter _m1 is determined according to the first sub-identifier. For example, parameter _m0 is equal to the modulo result of the second sub-identifier and parameter F, and parameter _m1 is equal to the modulo result of the first sub-identifier and parameter G. For example, for example, For example, parameter _m1 is determined according to the first sub-identifier and the second sub-identifier, and parameter _m0 is determined according to the first sub-identifier. For example, parameter _m1 is determined according to the quotient of the first sub-identifier and parameter B and the second sub-identifier, and parameter _m0 is determined according to the modulo result of the first sub-identifier and parameter B. For example,

In some embodiments, the network device sends at least one of the following information: the number of the gold sequence, the number of the first m sequence, the number of the second m sequence, the number of the m sequence preferred pair, the number of the m sequence, the cyclic shift step, the numbering order of the m sequence in the m sequence set, and the number of the m sequence subset.

In summary, the method provided in the embodiment of the present application provides a low-complexity and low-featured solution for sending synchronization signals and measurement signals through a gold sequence. Since the gold sequence has good autocorrelation and cross-correlation characteristics, the first signal generated by the gold sequence still has such good characteristics, which helps to improve the reliability and efficiency of downlink synchronization and RRM measurement. In addition, by cyclically shifting the preferred m-sequence pair, a large number of gold sequences can be obtained, which can provide available gold sequences for a large number of cells to generate the first signal.

Next, taking the generation of the first signal based on the m-sequence as an example, the related contents of the generation of the first signal based on the m-sequence are further introduced on the basis of step 1010 .

FIG. 12 is a schematic flow chart of a signal transmission method provided by an exemplary embodiment of the present application. The method is executed by a network device, and the method includes:

Step 1210: Send a first signal, where the first signal is used for RRM measurement and/or downlink synchronization, and the first signal is generated based on an m-sequence.

In some embodiments, the first signal is generated based on the first m-sequence or the second m-sequence.

The first m-sequence is the m-sequence generated by the primitive polynomial as mentioned above. An r-order primitive polynomial can generate an r-order first m-sequence.

Table 1 shows the upper limit of the number of first m-sequences that can be generated by shift registers of different series, where the upper limit of the number of first m-sequences is equal to the number of primitive polynomials. For example, when the series r=7, there are 18 primitive polynomials, so the upper limit of the number of first m-sequences is 18.

Table 1 Upper limit of the number of first m-sequences under different levels

The second m-sequence is obtained by cyclically shifting the first m-sequence. It can also be understood that the second m-sequence is a cyclically shifted sequence of the first m-sequence.

In the present application, the first m-sequence may also be referred to as at least one of the following: a basic m-sequence, a root m-sequence, a main m-sequence, a first-level m-sequence, etc. The second m-sequence may also be referred to as at least one of the following: a shift sequence, a displacement sequence, a cyclic shift sequence, an extended m-sequence, a secondary m-sequence, a secondary m-sequence, an auxiliary m-sequence, a second-level m-sequence, etc.

The relevant concepts of circular shift are introduced here. As the name implies, circular shift is to circularly shift the values in a sequence. There are two common circular shifts: circular left shift and circular right shift. Among them, circular left shift is to put the high bit shifted out to the low bit of the sequence, and circular right shift is to put the low bit shifted out to the high bit of the sequence. The number of bits or bits shifted out by a circular shift is called the circular offset of the circular shift, and the sequence obtained by the circular shift can be called a shift sequence. Taking the basic m sequence "10110101" as an example, Figure 13 shows the process of circular shifting when the circular offset is 2 bits. The process of circular left shift is shown in (a) of Figure 12, and the process of circular right shift is shown in (b) of Figure 12. The circular shift in the embodiment of the present application can be a circular left shift or a circular right shift. The circular offset can also be called a circular shift amount.

According to the above, the longest period of a first m-sequence with a level of r is ^2r -1. If the cyclic offset of each cyclic shift is 1, then at most ^2r -2 second m-sequences can be generated. Therefore, by cyclically shifting the first m-sequence with a cyclic offset of 1, at most ^2r -1 m-sequences can be obtained (including the first m-sequence itself).

If the cyclic shift step size of the first m sequence is N _CS , then the maximum value that can be obtained is m-sequences, including a basic m-sequence and Cyclic shift sequences. In this application, Indicates rounding down. Indicates rounding up, which will not be described in detail below.

Assuming that the number of the first m-sequences is N when the level is r, after cyclic shifting these N first m-sequences according to the cyclic shift step length N _CS , the maximum number of possible sequences is m-sequences, including the N first m-sequences themselves and A second m-sequence.

It can be understood that the cyclic shift step N _CS can be used to obtain the cyclic offset, and the first m-sequence is cyclically shifted according to the cyclic offset to obtain several second m-sequences. The smaller the cyclic shift step N _CS is, the more second m-sequences can be obtained.

Assuming the first m-sequence is x(n), the second m-sequence can be expressed as x((n+C)mod L), where L is the length of the first m-sequence, C is the cyclic offset of the second m-sequence relative to the first m-sequence, and mod is the modulo operation. The value of the cyclic offset C can theoretically be any integer between 0 and L.

However, in some cases, a cyclic offset that is too small may make it difficult for the receiving end to distinguish between two adjacent cyclic shift sequences, especially when the chip (Chip) corresponding to each bit of the m-sequence is small. Therefore, the present application also supports further limiting the value of the cyclic offset in some embodiments to ensure the reception quality of the synchronization signal. Exemplarily, the cyclic offset is greater than a first threshold value, which is agreed upon by the communication protocol, or indicated by the network device, or determined according to the chip length of the m-sequence.

In the embodiment of the present application, the m-sequence used to generate the first signal is called a target m-sequence, and the first signal can be obtained after the target m-sequence is modulated.

In some embodiments, the target m-sequence is an m-sequence in an m-sequence set, wherein the m-sequence set is determined according to the number of shift register stages r. The m-sequence set includes the first m-sequence and/or the second m-sequence, and therefore, the target m-sequence may be the first m-sequence or the second m-sequence.

Next, we first introduce the m-sequence set:

Assuming that the number of shift register stages is r, there are X first m-sequences, and the X first m-sequences are cyclically shifted according to the cyclic shift step length to obtain Y second m-sequences. The m-sequence set includes W m-sequences, W≤X+Y. The embodiment of the present application is schematically illustrated by taking W=X+Y as an example.

In some embodiments, the numbering order of the m-sequences in the m-sequence set is default, or random, or arranged according to a specific rule, or agreed upon by a communication protocol, or determined by a network device.

In some embodiments, all m-sequences in the m-sequence set are first arranged according to a specific rule, and then numbers are assigned to form W m-sequences with a numbering sequence of 0, 1, 2 ..., W-1. Alternatively, all m-sequences in the m-sequence set are first randomly arranged, and then numbers are assigned to form W m-sequences with a numbering sequence of 0, 1, 2 ..., W-1.

In some embodiments, all m-sequences in the m-sequence set are assigned numbers first, and then all m-sequences are arranged according to a specific rule. Alternatively, all m-sequences in the m-sequence set are assigned numbers first, and then all m-sequences are randomly arranged. Therefore, the numbering order in the m-sequence set finally formed may be disrupted, and is not a numbering order from 0 to W-1.

In some embodiments, each m-sequence in the m-sequence set has a one-to-one corresponding number, and the numbering order of the m-sequences in the m-sequence set is arranged from small to large according to the number value, or from large to small according to the number value.

In some embodiments, the numbering order of the first m-sequence in the m-sequence set is determined according to at least one of the following: the corresponding primitive polynomial coefficient, the binary number of the corresponding primitive polynomial coefficient, and the numbering value of the first m-sequence.

In some embodiments, the first m-sequences in the m-sequence set are arranged from small to large according to the serial number values of the first m-sequences, or arranged from large to small according to the serial number values of the first m-sequences.

In some embodiments, the numbering order of the first m-sequences in the m-sequence set is arranged according to the coefficients of the primitive polynomial that generates the first m-sequences. Exemplarily, all the first m-sequences are arranged in the order of the coefficients of the primitive polynomial from high to low powers. Exemplarily, all the first m-sequences are arranged in the order of the coefficients of the primitive polynomial from low to high powers.

In some embodiments, the numbering order of the first m-sequences in the m-sequence set is arranged according to the binary numbers of the corresponding primitive polynomial coefficients. Exemplarily, the primitive polynomial coefficients are represented by binary numbers, and all the first m-sequences are arranged in order from small to large according to the binary numbers corresponding to the primitive polynomials. Exemplarily, all the first m-sequences are arranged in order from large to small according to the binary numbers corresponding to the primitive polynomials.

In some embodiments, the numbering order of the second m-sequence in the m-sequence set is determined according to at least one of the following: a cyclic offset, a numbering order of the corresponding first m-sequence, a corresponding primitive polynomial coefficient, a binary number of the corresponding primitive polynomial coefficient, and a numbering value of the second m-sequence.

In some embodiments, the second m-sequences in the m-sequence set are arranged from small to large according to the serial numbers of the second m-sequences, or arranged from large to small according to the serial numbers of the second m-sequences.

In some embodiments, the numbering order of the second m-sequences in the m-sequence set is arranged according to the cyclic offset. Exemplarily, the second m-sequences are arranged in the order of the cyclic offset from small to large. Exemplarily, the second m-sequences are arranged in the order of the cyclic offset from large to small. List.

In some embodiments, within the m-sequence set, all first m-sequences are arranged first (they may be arranged according to binary numbers and/or primitive polynomial coefficients and/or serial values, as described above), and then all second m-sequences are arranged (they may be arranged according to cyclic offsets and/or serial order of the first m-sequences and/or binary numbers and/or primitive polynomial coefficients and/or serial values, as described above), and all second m-sequences are arranged after all first m-sequences. Exemplarily, assuming that all first m-sequences are expressed as M _1,1 ,M _1,2 …,M _1,X , and assuming that all second m-sequences are expressed as M _2,1 ,M _2,2 …,M _2,Y , then the arrangement order of the m-sequences in the m-sequence set is M _1,1 ,M _1,2 …,M _1,X ,M _2,1 ,M _2,2 …,M _2,Y , or, M _1,X ,M _1,X-1 …,M _1,1 ,M _2,Y ,M _2,Y-1 …,M _2,1 .

In some embodiments, within the m-sequence set, all second m-sequences are arranged first (they may be arranged according to the order of cyclic offsets and/or numbering of first m-sequences and/or binary numbers and/or primitive polynomial coefficients and/or numbering values, as described above), and then all first m-sequences are arranged (they may be arranged according to binary numbers and/or primitive polynomial coefficients and/or numbering values, as described above), and all first m-sequences are arranged after all second m-sequences.

In some embodiments, in an m-sequence set, a first m-sequence and a second m-sequence are arranged crosswise. Exemplarily, X first m-sequences are arranged first in an m-sequence set (which may be arranged according to binary numbers and/or primitive polynomial coefficients and/or numbered values, as described above), and each second m-sequence is arranged in order of cyclic offset from small to large after the first m-sequence corresponding to itself. Exemplarily, X first m-sequences are arranged first in an m-sequence set, and each second m-sequence is arranged in order of cyclic offset from large to small after the first m-sequence corresponding to itself. Exemplarily, X first m-sequences are arranged first in an m-sequence set, and each second m-sequence is arranged in order of numbered values from small to large after the first m-sequence corresponding to itself. Exemplarily, X first m-sequences are arranged first in an m-sequence set, and each second m-sequence is arranged in order of numbered values from large to small after the first m-sequence corresponding to itself. Exemplarily, X first m-sequences are arranged first in an m-sequence set, and each second m-sequence is arranged in order of numbered values from large to small after the first m-sequence corresponding to itself.

The numbering order rules of the first m-sequence and the second m-sequence may be the same or different. Exemplarily, the first m-sequence and the second m-sequence are arranged according to the numbering values. Exemplarily, the first m-sequence is arranged according to the primitive polynomial coefficients, and the second m-sequence is arranged according to the cyclic offset. For other possibilities, refer to the above content and will not be repeated one by one.

Then we introduce how to determine the target m sequence:

In some embodiments, S m-sequences are selected from the m-sequence set including W m-sequences. S represents the total number of cells in the communication system.

Optionally, the S m-sequences are randomly selected from the m-sequence set. Alternatively, the S m-sequences are the default S m-sequences in the m-sequence set. Alternatively, the S m-sequences are the S m-sequences in the m-sequence set agreed upon by the communication protocol. Alternatively, the S m-sequences are the S m-sequences selected from the m-sequence set according to a specific rule.

For example, the S m-sequences are the m-sequences with odd default numbers in the m-sequence set. For another example, the S m-sequences are the m-sequences numbered from 0 to S-1 in the m-sequence set. For another example, the S m-sequences are the m-sequences arranged in the first S positions in the m-sequence set. For another example, the S m-sequences are the m-sequences arranged in the last S positions in the m-sequence set, and so on.

In some embodiments, when generating the first signal, the numbering of the S m-sequences continues to use the numbering in the m-sequence set. Exemplarily, the numbering of the S m-sequences in the m-sequence set is (W-1-S) to (W-1), then, when generating the first signal, the numbering of the S m-sequences continues to use (W-1-S) to (W-1). Exemplarily, the numbering of the S m-sequences in the m-sequence set is 1 to S, then, when generating the first signal, the numbering of the S m-sequences continues to use 1 to S.

In some embodiments, when the first signal is generated, the numbers of the S m-sequences are different from their numbers in the m-sequence set. Exemplarily, the S m-sequences in the m-sequence set are numbered from (W-1-S) to (W-1), and when the first signal is generated, the S m-sequences are numbered from 0 to S-1, or from 1 to S.

In some embodiments, the numbering order of the S m-sequences when generating the first signal follows the numbering order of the S m-sequences in the m-sequence set. That is, the numbering order of the S m-sequences when generating the first signal is the same as the numbering order of the S m-sequences in the m-sequence set.

In some embodiments, the numbering order of the S m-sequences when generating the first signal is different from the numbering order of the S m-sequences in the m-sequence set. For example, the S m-sequences are arranged in the order of the number values from small to large, or in the order of the number values from large to small, or in the order of the coefficients of the primitive polynomial from low to high power, or in the order of the coefficients of the primitive polynomial from high to low power, or in the order of the binary numbers of the primitive polynomial from large to small, or in the order of the binary numbers of the primitive polynomial from small to large, etc. Exemplarily, the numbering order of the S m-sequences is 0, 1, 2…, S-1, or the numbering order of the S m-sequences is S-1, S-2, S-3…, 1, 0.

Based on the above method, after sorting the m sequences in the m sequence set and sorting the S m sequences, S m sequences corresponding to the S cells can be obtained. The number of each sequence in the S m sequences can correspond to the number of the sequence of the S first signals. Exemplarily, the m sequence numbered 0 in the S m sequences corresponds to the sequence of the first signal numbered 0; the m sequence numbered 1 in the S m sequences corresponds to the sequence of the first signal numbered 1; and so on. Exemplarily, the m sequence numbered 0 in the S m sequences corresponds to the sequence of the first signal numbered 1; the m sequence numbered 1 in the S m sequences corresponds to the sequence of the first signal numbered 2; and so on.

It can be understood that in order to facilitate downlink synchronization and RRM measurement in each cell, different first signals should be designed for different cells so that The UE can implement RRM measurement and synchronization corresponding to each cell according to the first signal. Different first signals can be implemented by different at least one of the following aspects: the number of the target m-sequence, the cyclic shift step, and the cell identifier.

In some embodiments, the number of the target m-sequence is determined according to the cell identifier. Since different cells correspond to different cell identifiers, this design naturally realizes the mapping between the cell and the target m-sequence, so that each cell has a corresponding m-sequence to generate the first signal, thereby supporting each cell to achieve downlink synchronization and RRM measurement.

In some embodiments, the communication protocol stipulates the number of the target m-sequence corresponding to each cell identifier.

In some embodiments, the communication protocol stipulates a rule for determining the number of the target m-sequence according to the cell identifier. For example, the communication protocol stipulates a mathematical operation rule between each cell identifier and the target m-sequence.

In some embodiments, the target m sequence is based on the cell identifier That is to say, the first signal corresponding to each cell is associated with its own cell identifier. Related to the total number S of cells in the communication system, illustratively,

In some embodiments, the target m-sequence number and the cell identifier Same. For example, The number of the target m-sequence=30, and the target m-sequence is the m-sequence numbered 30 among the S m-sequences.

In some embodiments, the number of the target m-sequence is equal to the cell identifier The modulo result of S, that is Alternatively, the target m-sequence number is based on the cell identifier The quotient value with S is determined, for example,

In some embodiments, the network device indicates the number of the target m-sequence to the terminal device. Exemplarily, the network device indicates the number of the target m-sequence to the terminal device through at least one of a broadcast message, a system message, an RRC signaling, a MAC CE, etc.

The network device may directly indicate the number of the target m-sequence, or may indicate information used to determine the number of the target m-sequence. For example, the network device indicates at least one of the following information to the terminal device: the number of the target m-sequence in the S m-sequences, and the numbering order of the S m-sequences. The terminal device may directly obtain the number of the target m-sequence according to the received information, or may determine the number of the target m-sequence according to the received information.

If different cells are expected to use different first signals, this can be achieved by having the network device indicate different target m-sequence numbers for different cells, or by having the network device indicate different information for determining the target m-sequence numbers for different cells, thereby achieving mapping between cells and target m-sequences, so that each cell has a corresponding target m-sequence to generate the first signal, thereby supporting each cell to achieve downlink synchronization and RRM measurement.

In some embodiments, the network device sends at least one of the following information: the number of the gold sequence, the number of the first m sequence, the number of the second m sequence, the number of the m sequence preferred pair, the number of the m sequence, the cyclic shift step, the numbering order of the m sequence in the m sequence set, and the number of the m sequence subset.

In summary, the method provided in the embodiment of the present application provides a low-complexity and low-featured solution for sending synchronization signals and measurement signals through an m-sequence. Since the m-sequence has good autocorrelation and cross-correlation characteristics, the first signal generated by the gold sequence still has such good characteristics, which helps to improve the reliability and efficiency of downlink synchronization and RRM measurement.

Furthermore, by constructing an m-sequence set, a large number of m-sequences can be obtained, and available m-sequences can be provided for a large number of cells to generate the first signal.

The embodiments shown in Figures 11 and 12 above can meet the needs of RRM measurement and downlink synchronization. The number of first signals received and detected by the WUR (corresponding to the number of cell identifiers to be measured or synchronized) can be configured by the main transceiver, so the number of first signals can be relatively limited, and the WUR only needs to process a limited number of first signals to achieve RRM measurement and downlink synchronization. However, when the low-power device performs RRM measurement and downlink synchronization through a low-power receiver, the search and measurement of the cell at this time needs to be completed independently by the low-power receiver. Therefore, when the total number of cells in the communication system is large and the value range of the cell identifier is large, the number of possible first signal sequences is also large, that is, the low-power receiver needs to detect more first signals. For example, when there are 1008 cells in the communication system, it means that there are 1008 first signals corresponding to 1008 cell identifiers. At this time, the low-power device may need to receive and detect 1008 sequences, which will undoubtedly increase the power consumption of the low-power device.

Therefore, based on Figures 11 and 12, it is possible to consider reducing the number of first signals that the terminal device may need to detect to save power consumption of low-power devices and appropriately save power consumption of WUR.

One way is to reduce the number of cell identifiers, but this may affect the flexibility of deployment and planning on the network side. For example, when deploying low-power cells based on conventional network topology, a simpler way is to continue to use traditional cell identifiers.

Another way is to reduce the complexity of the terminal device detecting the first signal by constructing a suitable binary sequence. The present application provides a solution as shown in FIG14 , in which the first signal is designed to be generated by two binary sequences, each of which carries part of the cell identity information.

FIG. 14 shows a schematic flow chart of a signal transmission method provided by an exemplary embodiment of the present application. The method is executed by a network device, and the method includes:

Step 1410: Send a first signal, where the first signal is used for RRM measurement and/or downlink synchronization, and the first signal is generated based on two m-sequences.

With reference to the embodiment shown in FIG. 11 , the target m-sequence preferred pair is determined, and the specific steps are not repeated here.

Assume that the target m-sequence preferred pair includes a first m-sequence and a second m-sequence. The first m-sequence is one m-sequence in the m-sequence preferred pair, and the second m-sequence is the other m-sequence in the m-sequence preferred pair.

The first signal is generated by two binary sequences, one of which is a first m-sequence and the other is a second m-sequence.

In some embodiments, the first signal includes two sub-signals, namely a first sub-signal and a second sub-signal, wherein the sequence of the first sub-signal is generated according to a first m-sequence, and the sequence of the second sub-signal is generated according to a second m-sequence.

In some embodiments, the number of the first m-sequence is agreed upon by the communication protocol, or indicated by the network device, or determined according to the rules agreed upon by the communication protocol. Exemplarily, the network device directly indicates the number of the first m-sequence, or indicates the number of the target gold sequence family, or indicates the number of the target m-sequence preferred pair, or indicates information used to determine the target gold sequence family.

In some embodiments, the number of the second m-sequence is agreed upon by the communication protocol, or indicated by the network device, or determined according to the rules agreed upon by the communication protocol. Exemplarily, the network device directly indicates the number of the second m-sequence, or indicates the number of the target gold sequence family, or indicates the number of the target m-sequence preferred pair, or indicates information used to determine the target gold sequence family.

In some embodiments, the numbering of the preferred m-sequence pairs is agreed upon by a communication protocol, or is indicated by a network device, or is determined according to a rule agreed upon by a communication protocol.

In some embodiments, the sequence element numbered _n1 in the sequence of the first sub-signal is determined according to the sequence element numbered a in the first m-sequence. It can also be understood that the value of the _n1th bit in the sequence of the first sub-signal is determined according to the value of the ath bit in the first m-sequence.

In some embodiments, the sequence element numbered _n2 in the sequence of the second sub-signal is determined according to the sequence element numbered b in the second m-sequence. It can also be understood that the value of the _n2th bit in the sequence of the second sub-signal is determined according to the value of the bth bit in the second m-sequence.

In some embodiments, a is determined according to at least one of the following: n ₁ , parameter m ₀ , and a first length value. b is determined according to at least one of the following: n ₁ , parameter m ₁ , and a first length value. Parameter m ₀ represents a cyclic offset of a first m-sequence when generating a first sub-signal, and parameter m ₁ represents a cyclic offset of a second m-sequence when generating a second sub-signal.

The first length value is the length value of the first m-sequence, that is, the length value of the second m-sequence. n is greater than or equal to 0 and less than the first length value.

In some embodiments, a is determined according to a first modulo result. The first modulo result is a modulo result of the first sum value and the first length value. The first sum value is the sum of n ₁ and parameter m ₀ .

In some embodiments, b is determined according to a second modulo result. The second modulo result is a modulo result of the second sum value and the first length value. The second sum value is the sum of _n1 and parameter _m1 .

In some embodiments, the sequence element numbered _n1 in the sequence of the first sub-signal is the first difference, which can also be understood as the value of the _n1th bit in the sequence of the first sub-signal is equal to the first difference. The first difference is the difference between the value 1 and the second product, and the second product is the product of the value 2 and the sequence element numbered a in the first m-sequence.

In some embodiments, the sequence element numbered _n2 in the sequence of the second sub-signal is the second difference, which can also be understood as the value of the _n2th bit in the sequence of the second sub-signal is equal to the second difference. The second difference is the difference between the value 1 and the third product, and the third product is the product of the value 2 and the sequence element numbered b in the second m-sequence.

Exemplarily, the sequence of the first sub-signal can be expressed as formula (11), and the sequence of the second sub-signal can be expressed as formula (12). Wherein, d _SS1 (n ₁ ) represents the sequence of the first sub-signal, x ₀ (n) represents the first m-sequence used to generate the sequence of the first sub-signal. _{d SS2} (n ₂ ) represents the sequence of the second sub-signal, x ₁ (n) represents the second m-sequence used to generate the sequence of the second sub-signal. L represents the first length value.
d _SS1 (n ₁ )＝[1-2x ₀ ((n ₁ +m ₀ )mod L)] (11)
d _SS2 (n ₂ )＝[1-2x ₁ ((n ₁ +m ₁ )mod L)] (12)

Optionally, n ₂ =n ₁ +L, that is, the numbers of the first m-sequence and the second m-sequence are continuous. Optionally, n ₂ >n ₁ +L, that is, there is a numbering gap between the first m-sequence and the second m-sequence.

In some embodiments, equations (11) and (12) are applicable to the case where the first signal is obtained through BPSK modulation.

In some embodiments, the sequence element numbered _n1 in the sequence of the first sub-signal is the sequence element numbered a in the first m-sequence. It can also be understood that the value of the _n1th bit in the sequence of the first sub-signal is equal to the value of the ath bit in the first m-sequence.

In some embodiments, the sequence element numbered _n2 in the sequence of the second sub-signal is the sequence element numbered b in the second m-sequence. It can also be understood that the value of the _n2th bit in the sequence of the second sub-signal is equal to the value of the bth bit in the second m-sequence.

Exemplarily, the sequence of the first sub-signal can be expressed as formula (13), and the sequence of the second sub-signal can be expressed as formula (14). Wherein, d _SS1 (n ₁ ) represents the sequence of the first sub-signal, x ₀ (n) represents the first m-sequence used to generate the sequence of the first sub-signal. _{d SS2} (n ₂ ) represents the sequence of the second sub-signal, x ₁ (n) represents the second m-sequence used to generate the sequence of the second sub-signal. L represents the first length value.
d _SS1 (n ₁ )＝[x ₀ ((n ₁ +m ₀ )mod L)] (13)
d _SS2 (n ₂ )=[x ₁ ((n ₁ +m ₁ )mod L)] (14)

Optionally, n ₂ =n ₁ +L, that is, the numbers of the first m-sequence and the second m-sequence are continuous. Optionally, n ₂ >n ₁ +L, that is, there is a numbering gap between the first m-sequence and the second m-sequence.

In some embodiments, equations (13) and (14) are applicable to the case where the first signal is obtained through OOK modulation.

Referring to the embodiment shown in FIG. 11 , the parameter m ₀ and the parameter m ₁ may be determined by calculation method one or by calculation method two.

Calculation method 1:

In some embodiments, the parameter _m0 is determined according to the modulo result of the first sub-identifier and the parameter G, and the parameter _m1 is determined according to the modulo result of the second sub-identifier and the parameter F.

In some embodiments, parameter _m0 is equal to the modulo result of the first sub-identifier and parameter G, and parameter _m1 is equal to the modulo result of the second sub-identifier and parameter F. That is,

In some embodiments, parameter _m0 is equal to _q1 times the modulo result of the first sub-identifier and parameter G, and parameter _m1 is equal to _q2 times the modulo result of the second sub-identifier and parameter F. That is, Among them, _q1 is a positive integer and _q2 is a positive integer.

Optionally, the parameter G is smaller than the first length value, that is, G＜L. Optionally, the parameter F is smaller than the first length value, that is, F＜L.

Optionally, the parameter _m0 is smaller than the first length value, that is, _m0 ＜L. Optionally, the parameter _m1 is smaller than the first length value, that is, _m1 ＜L.

In some embodiments, the parameters G and F are determined according to the total number S of cells in the communication system.

In some embodiments, assuming that the total number of cells in the communication system is S, the product of parameter G and parameter F is equal to S, that is, G*F=S. It can also be understood that parameter G and parameter F are divisors of S. Exemplarily, S=64, then G=8, F=8; or, G=1, F=64; or, G=2, F=32; or, G=4, F=16; or, G=1, F=64; or, G=16, F=4; or, G=32, F=2; or, G=64, F=1.

In some embodiments, the sum of parameter G and parameter F is equal to S, that is, G+F=S. Alternatively, an integer multiple of the product of parameter G and parameter F is equal to S, and so on.

In some embodiments, F=k, Among them, 1≤k≤S.

Calculation method 2:

In some embodiments, the parameter _m0 is determined according to the first sub-identifier and the second sub-identifier, and the parameter _m1 is determined according to the first sub-identifier.

In some embodiments, parameter _m0 is determined according to the quotient of the first sub-identifier and parameter B and the second sub-identifier, and parameter _m1 is determined according to the modulo result of the first sub-identifier and parameter B.

For example, Optional, B is a positive integer, _f1 is a positive integer, and _f2 is a positive integer. Optional, Optionally, B is smaller than the first length value, that is, B＜L.

Optionally, the parameter _m0 is smaller than the first length value, that is, _m0 ＜L. Optionally, the parameter _m1 is smaller than the first length value, that is, _m1 ＜L.

It can be seen from the above formula that a pair of first sub-identifier and second sub-identifier can be uniquely determined according to the cell identifier, and this pair of first sub-identifier and second sub-identifier can uniquely determine a pair of parameters _m0 and _m1 . After determining the target gold sequence family according to the method described above, a pair of first m-sequence and second m-sequence can be uniquely determined. When the first m-sequence and parameter _m0 are uniquely determined, the sequence of the first sub-signal can be uniquely generated. Similarly, when the second m-sequence and parameter m1 are uniquely determined, the sequence of the second _sub -signal can naturally be unique. After the first sub-signal and the second sub-signal are uniquely determined, a one-to-one correspondence between the cell identifier and the first sub-signal + the second sub-signal is realized, that is, a one-to-one correspondence between the cell identifier and the first sub-signal + the second sub-signal is realized, thereby supporting the terminal device to implement RRM measurement and synchronization of the corresponding cell according to the first signal.

Since the first sub-signal and the second sub-signal respectively carry part of the information of the cell identifier, the combination of the first sub-signal and the second sub-signal has a one-to-one correspondence with the cell identifier.

As can be seen from the above, if there are S cell identifiers in the system, S first signals need to be designed to correspond to the S cells one by one. If the solution described above in which the first signal is generated by a gold sequence or an m sequence is adopted, it is obvious that S gold sequences or S m sequences are required to achieve this. That means that the UE may need to detect S sub-sequences.

However, the embodiment of the present application generates a first signal by combining two m-sequences. Assuming that the number of one m-sequence is Z ₁ and the number of the other m-sequence is Z ₂ , then, as long as Z ₁ *Z ₂ =S is satisfied, S first signals can be generated to correspond one-to-one with S cells. Since there are only Z ₁ first m-sequences and Z ₂ second m-sequences, the UE only needs to detect Z ₁ +Z ₂ sequences at most.

Taking S=1008 as an example, if Z ₁ *Z ₂ =S, then Z ₁ and Z ₂ are divisors of S. Assuming Z ₁ =3, Z ₂ =336, the UE only needs to detect 336+3=339 sequences at most, which is much less than 1008, greatly reducing the number of detections and significantly reducing the power consumption of the UE.

Furthermore, according to mathematical principles, the closer the values of Z ₁ and Z ₂ are, the smaller the sum of Z ₁ and Z ₂ is. For example, Z ₁ = 36, Z ₂ = 28, then the UE only needs to detect 64 times at most, which is much less than 339 times and 1008 times. Therefore, considering the energy saving effect, Z ₁ and Z ₂ can be further designed to have relatively close values, which can significantly reduce the power consumption of the UE.

Among them, the values of Z ₁ and Z ₂ can be obtained according to the parameters m ₀ and m ₁ , respectively. The parameters m ₀ and m ₁ respectively represent the cyclic offsets of the first m-sequence and the second m-sequence when generating the first signal. Therefore, by designing the parameters m ₀ and m ₁ , the number of the first m-sequence Z ₁ and the number of the second m-sequence Z ₂ can be determined. The parameters m ₀ and m ₁ can be adjusted by one or more of the parameters G, F, B, q ₁ , q ₂ , f ₁ , f ₂ , etc. For details, please refer to the above calculation method 1 and calculation method 2.

Example 1: Assume that the total number of cell IDs is S = 1008, and the numbering or indexing of these 1008 cells ranges from 0 to 1007. Assume that parameters G and F are divisors of S, for example, G = 56, F = 18. Assume that n ₂ = n ₁ + L, the sequence length of the first sub-signal = the sequence length of the second sub-signal = L = 63, k = 3. Assume that the cell ID corresponding to the first signal sent this time is When the number of shift registers is r, the optimal number of m-sequence pairs is M = 2, then, At this time, the first m-sequence x ₀ (n) and the second m-sequence x ₁ (n) correspond to the gold sequence family numbered 15 among the M gold sequence families.

according to Can get

according to

Then, _dSS1 ( _n1 )=[ _x0 (( _n1 +10)mod63)], _dSS2 ( _n2 )= _dSS2 ( _n1 +63)=[ _x1 (( _n1 +0)mod63)], _0≤n1 <63.

Example 2: Assume that the total number of cell IDs is S = 1008, and the numbering or indexing of these 1008 cells ranges from 0 to 1007. Assume that parameters G and F are divisors of S, for example, G = 56, F = 18, q ₁ = 2, q ₂ = 1. Assume that n ₂ = n ₁ + L, the sequence length of the first sub-signal = the sequence length of the second sub-signal = L = 63, k = 3. Assume that the cell ID corresponding to the first signal sent this time is

according to Can get

according to

Then, _dSS1 ( _n1 )=[ _x0 (( _n1 +20)mod63)], _dSS2 ( _n2 )= _dSS2 ( _n1 +63)=[ _x1 (( _n1 +1)mod63)], _0≤n1 <63.

Example 3: Assume that the total number of cell IDs is S = 1008, and the numbering or indexing of these 1008 cells ranges from 0 to 1007. Assume that n ₂ = n ₁ + L, the sequence length of the first sub-signal = the sequence length of the second sub-signal = L = 63, f ₁ = 10, f ₂ = 4, B = 20, k = 3. Assume that the cell ID corresponding to the first signal sent this time is

according to Can get

according to

Then, _dSS1 ( _n1 )=[ _x0 (( _n1 +14)mod63)], _dSS2 ( _n2 )= _dSS2 ( _n1 +63)=[ _x1 (( _n1 +17)mod63)], _0≤n1 <63.

In some embodiments, the network device sends at least one of the following information: the number of the gold sequence, the number of the first m sequence, the number of the second m sequence, the number of the m sequence preferred pair, the number of the m sequence, the cyclic shift step, the numbering order of the m sequence in the m sequence set, and the number of the m sequence subset.

In summary, the method provided in the embodiment of the present application provides a low-complexity and low-featured solution for sending synchronization signals and measurement signals through an m-sequence. Since the m-sequence has good autocorrelation and cross-correlation characteristics, the first signal generated by the m-sequence still has such good characteristics, which helps to improve the reliability and efficiency of downlink synchronization and RRM measurement. The design of generating the first signal by two m-sequences allows the two m-sequences to respectively carry part of the information of the cell identification, which can greatly reduce the number of first signals that the terminal device needs to detect. In addition, by cyclically shifting the preferred pair of m-sequences, a large number of gold sequences can be obtained, which can provide available gold sequences for a large number of cells to generate the first signal. In addition, by generating the first signal through two binary sequences, the complexity of the terminal device detecting the first signal is greatly reduced, the number of detection times of the synchronization signal and the measurement signal is significantly reduced, and the energy saving of the terminal device is further achieved.

The first signal shown in FIG. 11 , FIG. 12 , and FIG. 14 may be sent periodically or non-periodically.

In some embodiments, the network device sends the first signal in the channel according to the sequence, modulation method, sequence length, cyclic offset and other parameters of the first signal.

In some embodiments, if the length of the binary sequence is L, the binary sequence corresponds to L modulation symbols after being modulated.

In some embodiments, if the first signal is generated by two binary sequences, wherein the length of each binary sequence is L, the two binary sequences respectively correspond to L modulation symbols after being modulated.

In some embodiments, the first signal is a time domain signal. Optionally, the time domain resource occupied by the first signal is continuous or discontinuous. It can also be understood that the time domain unit occupied by the first signal is a continuous time domain unit mapped after the binary sequence is modulated, or a discontinuous time domain unit mapped after the binary sequence is modulated.

In the present application, the time domain unit includes at least one of the following: frame, subframe, slot, mini-slot, sub-slot, symbol, symbol group, and time domain unit based on other time domain units.

For example, in the embodiments shown in FIG. 11 and FIG. 12, when the length of the binary sequence is L, the binary sequence is modulated and mapped to The L modulation symbols are mapped to a group of continuous or discontinuous time domain units, that is, the L modulation symbols are mapped to a group of continuous or discontinuous time domain units.

Exemplarily, in the embodiment shown in FIG14, when the first signal is generated by two binary sequences, wherein the length of each binary sequence is L, the two binary sequences are modulated and mapped to two time domain resources respectively, each time domain resource includes a group of time domain units, that is, 2*L modulation symbols are mapped to two groups of time domain units. Optionally, there is a time domain interval between the two time domain resources or there is no time domain interval. Optionally, each group of time domain units is continuous or discontinuous.

Exemplarily, the time domain units occupied by two time domain resources are exactly the same or partially overlapped. Taking the time domain unit including subframes as an example, the subframes corresponding to the two binary sequences in the time domain are the same or partially overlapped, as shown in (a) of Figure 15, the time domain resources occupied by binary sequence A and binary sequence B both include subframe 2. Taking the time domain unit including time slots as an example, the time slots corresponding to the two binary sequences in the time domain are the same or partially overlapped, as shown in (b) of Figure 15, the time domain resources occupied by binary sequence A and binary sequence B both include time slot 3. Taking the time domain unit including symbols as an example, the symbols corresponding to the two binary sequences in the time domain are different, as shown in (c) of Figure 15, the symbols occupied by binary sequence A and binary sequence B are different.

Exemplarily, the first signal is divided into a plurality of segments, each segment occupies a time domain resource in the time domain. Optionally, there is a time domain interval or no time domain interval between the plurality of time domain resources. Optionally, each time domain resource includes a continuous time domain unit or a discontinuous time domain unit.

The modulation method of the first signal shown in FIG. 11 , FIG. 12 , and FIG. 14 includes at least one of the following: OOK modulation; PSK modulation; BPSK modulation; FSK modulation.

Assuming that the modulation mode is PSK modulation, then the sequence elements with values of "1" and "0" in the sequence of the first signal correspond to phase continuity (+1) and phase jump (0 or -1) in the PSK sequence, respectively. For example, the sequence elements with values of "1" in the sequence of the first signal correspond to phase continuity (+1) in the PSK sequence, and the sequence elements with values of "0" in the sequence of the first signal correspond to phase jump (0 or -1) in the PSK sequence; or, the sequence elements with values of "1" in the sequence of the first signal correspond to phase jump (0 or -1) in the PSK sequence, and the sequence elements with values of "0" in the sequence of the first signal correspond to phase continuity (+1) in the PSK sequence.

Assuming that the modulation mode is BPSK modulation, then the sequence elements with values of "1" and "0" in the sequence of the first signal correspond to the positive level (+1) and the negative level (-1) in the BPSK sequence, respectively. For example, the sequence elements with values of "1" in the sequence of the first signal correspond to the positive level (+1) in the BPSK sequence, and the sequence elements with values of "0" in the sequence of the first signal correspond to the negative level (-1) in the BPSK sequence; or, the sequence elements with values of "1" in the sequence of the first signal correspond to the negative level (-1) in the BPSK sequence, and the sequence elements with values of "0" in the sequence of the first signal correspond to the positive level (+1) in the BPSK sequence.

Assuming that the modulation mode is FSK modulation, then the sequence elements with values of "1" and "0" in the sequence of the first signal correspond to two carrier frequencies of the FSK sequence. For example, the sequence elements with values of "1" in the sequence of the first signal correspond to the carrier frequency 1 of the FSK sequence, and the sequence elements with values of "0" in the sequence of the first signal correspond to the carrier frequency 0 of the FSK sequence; or, the sequence elements with values of "1" in the sequence of the first signal correspond to the carrier frequency 0 of the FSK sequence, and the sequence elements with values of "0" in the sequence of the first signal correspond to the carrier frequency 1 of the FSK sequence.

Assuming that the modulation mode is OOK modulation, then the sequence elements with values of "1" and "0" in the sequence of the first signal correspond to the high level and low level in the OOK sequence, respectively. For example, the sequence elements with values of "1" in the sequence of the first signal correspond to the high level in the OOK sequence, and the sequence elements with values of "0" in the sequence of the first signal correspond to the low level in the OOK sequence; or, the sequence elements with values of "1" in the sequence of the first signal correspond to the low level in the OOK sequence, and the sequence elements with values of "0" in the sequence of the first signal correspond to the high level in the OOK sequence.

In some embodiments, the network device has an OFDM transmitter, or when the OFDM carrier sends the first signal in an in-band manner, it can be considered to use an OFDM waveform to transmit the first signal.

Taking OOK modulation as an example, the first signal shown in Figures 11, 12, and 14 can be a time domain signal mapped based on the OOK-1 method, and the first signal shown in Figures 11, 12, and 14 can also be a time domain signal mapped based on the OOK-4 method.

OOK-1 method:

Assume that the sequence of the first signal is an OOK sequence obtained by OOK modulation of a binary sequence. When an OFDM transmitter is used to transmit an OOK sequence, an OOK symbol is mapped on an OFDM symbol. The OFDM symbol is mapped to all 1s (or other non-zero values) in the frequency domain to indicate that a high-level signal of OOK is transmitted on the OFDM symbol (the high level may represent 1 or 0, depending on the definition or convention), and the OFDM symbol is mapped to all 0s in the frequency domain to indicate that a low-level signal of OOK is transmitted on the OFDM symbol (the low level may represent 0 or 1, depending on the definition or convention).

Exemplarily, as shown in FIG. 16 , in the OOK-1 mode, OFDM symbols and OOK symbols correspond one to one, that is, each OFDM symbol carries 1 bit.

When mapping is performed in OOK-1 mode, if the length of the binary sequence is L, the binary sequence is modulated and mapped to L OFDM symbols. That is, L OOK symbols are mapped to L OFDM symbols. The L OFDM symbols are continuous or discontinuous.

OOK-4 method:

As shown in FIG17 , it is assumed that the sequence of the first signal is an OOK sequence obtained by OOK modulation of a binary sequence, and the OOK sequence includes M ₁ bits in total. The M ₁ bits are upsampled by k ₁ to generate a sequence of length k ₁ M ₁ , which is transformed by discrete Fourier transform (Discrete Fourier After being transformed by discrete Fourier transform (DFT), it is mapped to k ₁ M ₁ resource elements (RE), multiplexed with other OFDM signals (if any) in the frequency domain, and then transformed to the time domain by inverse discrete Fourier transform (IDFT), filtered and shaped, and finally sent out by the transmitter. It can be seen that in the OOK-4 mode, M ₁ OOK symbols can be mapped to one OFDM symbol, that is, each OFDM symbol carries M ₁ bits.

When mapping through OOK-4, if the length of the binary sequence is L, the binary sequence is modulated and mapped to OFDM symbols. That is, L OOK symbols are mapped to OFDM symbols, each OFDM symbol carries M ₁ bits. OFDM symbols may be continuous or non-continuous.

Further, taking a time slot including 14 symbols as an example, if So, this An OFDM symbol can be located in one time slot or in multiple different time slots. For example, an OFDM symbol can be located in one time slot. An OFDM symbol is the first symbols, or the end of a time slot symbols, or the middle of a time slot symbols, or discontinuous symbol.

Take a time slot including 14 symbols as an example. So, this An OFDM symbol may be located in multiple different time slots. The multiple different time slots may belong to the same subframe or different subframes. The multiple time slots may be adjacent or non-adjacent.

When mapping is performed by OOK-4, if the first signal is generated by two binary sequences, where the lengths of the two binary sequences are L ₁ and L ₂ respectively, L ₁ OOK symbols are mapped to OFDM symbols, L ₂ OOK symbols are mapped to OFDM symbols. OFDM symbols and There may be or may not be a time domain gap between OFDM symbols. OFDM symbols are continuous or discontinuous. OFDM symbols may be continuous or non-continuous.

Further, taking a time slot including 14 symbols as an example, if So, this An OFDM symbol can be located in one time slot or in multiple different time slots. For example, an OFDM symbol can be located in one time slot. An OFDM symbol is the first symbols, or the end of a time slot symbols, or the middle of a time slot symbols, or discontinuous symbol.

Take a time slot including 14 symbols as an example. So, this An OFDM symbol may be located in multiple different time slots. The multiple different time slots may belong to the same subframe or different subframes. The multiple time slots may be adjacent or non-adjacent.

In some embodiments, the first signal shown in FIG. 11 , FIG. 12 , and FIG. 14 is a scrambled sequence.

In some embodiments, after the binary sequence is modulated, it is further scrambled to obtain the first signal. Exemplarily, the scrambling sequence is at least one of the following: a ZC sequence, a QPSK sequence, and a QAM sequence. For example, after the binary sequence is modulated, an OOK sequence is obtained, and the OOK sequence is point-to-point multiplied with the ZC sequence used for scrambling to obtain the first signal.

After scrambling, the spectrum or power spectrum can be flattened. Scrambling can prevent the energy distribution of the first signal from being concentrated in the center of the bandwidth, making the energy distribution of the first signal in the frequency domain more uniform, thereby better combating frequency selective fading.

In some embodiments, the length of the binary sequence is equal to or unequal to the length of the scrambling sequence. If the length of the scrambling sequence is longer than the length of the binary sequence, the scrambling sequence may be truncated for point-to-point multiplication. If the length of the scrambling sequence is less than the length of the binary sequence, the scrambling sequence may be repeated several times for point-to-point multiplication.

FIG. 18 is a schematic flow chart of a signal transmission method provided by an exemplary embodiment of the present application, the method being executed by a terminal device, and the method comprising:

Step 1810: Receive a first signal, where the first signal is used for RRM measurement and/or downlink synchronization, and the first signal is generated based on a binary sequence.

The first signal may also be referred to as at least one of the following: a first measurement signal, a first reference signal, LP-SS, and LP-RS.

The binary sequence includes only two sequence elements with different values, so the sequence of the first signal also includes only two sequence elements with different values. Exemplarily, the sequence of the first signal includes only "0" and "1", or the sequence of the first signal includes only "+1" and "-1".

In some embodiments, the first signal is generated according to at least one of: an m-sequence; a gold sequence; a Walsh sequence.

In some embodiments, the modulation method of the first signal includes at least one of the following: OOK modulation; PSK modulation; BPSK modulation; FSK modulation.

It should be noted that the types of binary sequences provided in the present application are not limited to m-sequences, gold sequences and Walsh sequences. Other binary sequences or other sequences with sequence characteristics similar to binary sequences are also applicable to the methods provided in the embodiments of the present application.

The terminal device that executes step 1810 may be the terminal device 120 or the terminal device 130 as shown in FIG1 , or may be the terminal device 140 that is a low-power device as shown in FIG2 (which may include a low-power receiver), or may be a terminal device including WUR as shown in FIG6 , or may be a terminal device that operates in the millimeter wave frequency band, and so on.

In summary, the method provided in the embodiment of the present application is very easy to be combined with the OOK waveform, because the first signal is generated according to the binary sequence. The combination of non-OFDM waveforms such as PSK waveform and FSK waveform provides the possibility of transmitting synchronization signals and measurement signals for some communication scenarios where OFDM waveforms are difficult to use, and provides a new feasible solution for downlink synchronization and RRM measurement. If the receiving end of the first signal is a low-power device or a terminal device including WUR, downlink synchronization and RRM measurement can be achieved while maintaining the good characteristics of low complexity and low power consumption. If the receiving end of the first signal is a terminal device operating in the millimeter wave frequency band, the first signal has the advantages of simple generation, easy implementation, and power saving. Combined with the characteristics of high reliability and narrow beam of millimeter wave transmission, the first signal can meet the needs of downlink synchronization and RRM measurement in the millimeter wave frequency band.

FIG. 19 is a schematic diagram showing a flow chart of a signal transmission method provided by an exemplary embodiment of the present application, the method being executed by a terminal device, and the method comprising:

Step 1910: Receive a first signal, where the first signal is used for RRM measurement and/or downlink synchronization, and the first signal is generated based on a gold sequence.

For the relevant contents of the gold sequence and the first signal, please refer to step 1110 and will not be repeated here.

It should be noted that in order to accurately receive and detect the first signal, the terminal device should also determine the first signal corresponding to each cell accordingly. Specifically, due to oscillator mismatch, Doppler frequency shift, noise interference and other reasons, the first signal sent from the transmitter and the first signal arriving at the receiver will inevitably produce deviations in the time domain and frequency domain. In order to ensure that the detection result of the first signal has a high accuracy, the terminal device needs to perform correlation detection on the received first signal and the local first signal, obtain clock information and/or frequency deviation estimation results, calibrate the received first signal in the time domain according to the clock information, and calibrate the received first signal in the frequency domain according to the frequency deviation estimation results, so as to accurately detect the first signal. The local first signal required for the detection process should be generated locally by the terminal device.

The method of generating the first signal according to the gold sequence shown in Figure 11 is also applicable to the terminal device. That is, the network device and the terminal device should respectively determine the gold sequence for generating the first signal.

Regardless of whether the methods used by the network device and the terminal device to determine the first signal corresponding to the same cell are exactly the same, the first signal determined by the network device and generated by the terminal device for the same cell should be the same. This can ensure that after receiving the first signal, the terminal device can clearly identify which cell the first signal corresponds to.

In some embodiments, the terminal device determines the number of the target gold sequence family according to at least one of the following: a cell identifier, I _SS , a first starting value e, Q, and a numbering order of the M gold sequence families.

In some embodiments, the terminal device determines the numbering order of M gold sequence families according to at least one of the following: the number of the m-sequence preferred pair, the level r, the number of gold sequences in the gold sequence family, the length of the gold sequence in the gold sequence family, the number of the gold sequence family, the number of the gold sequence in the gold sequence family, the number of the corresponding m-sequence, the numbering order of the corresponding m-sequence, the corresponding primitive polynomial coefficient, the binary number of the corresponding primitive polynomial coefficient, and the cyclic offset.

In some embodiments, the terminal device determines a parameter m ₀ , that is, a cyclic offset of the first m sequence when generating a target gold sequence.

In some embodiments, the terminal device determines a parameter m ₁ , that is, a cyclic offset of the second m-sequence when generating a target gold sequence.

In some embodiments, the terminal device receives at least one of the following information: the number of the gold sequence, the number of the first m sequence, the number of the second m sequence, the number of the m sequence preferred pair, the number of the m sequence, the cyclic shift step, the numbering order of the m sequence within the m sequence set, and the number of the m sequence subset.

In summary, the method provided in the embodiment of the present application provides a low-complexity and low-featured solution for sending synchronization signals and measurement signals through a gold sequence. Since the gold sequence has good autocorrelation and cross-correlation characteristics, the first signal generated by the gold sequence still has such good characteristics, which helps to improve the reliability and efficiency of downlink synchronization and RRM measurement.

Furthermore, a large number of gold sequences can be obtained by cyclically shifting the preferred pair of m sequences, and available gold sequences can be provided for a large number of cells to generate the first signal.

FIG. 20 shows a schematic flow chart of a signal transmission method provided by an exemplary embodiment of the present application, the method being executed by a terminal device, and the method comprising:

Step 2010: Receive a first signal, where the first signal is used for RRM measurement and/or downlink synchronization, and the first signal is generated based on an m-sequence.

For the relevant contents of the m-sequence and the first signal, reference may be made to step 1210 and step 1410, which will not be described in detail here.

It should be noted that, in order to accurately receive and detect the first signal, the terminal device should also determine the first signal corresponding to each cell accordingly. The reason here can be referred to step 1910, which will not be repeated here.

The manner of generating the first signal according to the m-sequence shown in Figures 12 and 14 is also applicable to the terminal device. That is, the network device and the terminal device should respectively determine the m-sequence for generating the first signal.

Regardless of whether the methods used by the network device and the terminal device to determine the first signal corresponding to the same cell are exactly the same, the first signal determined by the network device and generated by the terminal device for the same cell should be the same. This can ensure that after receiving the first signal, the terminal device can clearly identify which cell the first signal corresponds to.

In some embodiments, the terminal device determines the number of the target gold sequence family according to at least one of the following: a cell identifier, I _SS , a first starting value e, Q, and a numbering order of the M gold sequence families.

In some embodiments, the terminal device determines the number of m-sequences in the m-sequence set according to the number of shift register stages.

In some embodiments, the terminal device determines the numbering order of the m-sequences within the m-sequence set.

In some embodiments, the terminal device determines the target m-sequence based on the cell identifier.

In some embodiments, the terminal device receives at least one of the following information: the number of the gold sequence, the number of the first m sequence, the number of the second m sequence, the number of the m sequence preferred pair, the number of the m sequence, the cyclic shift step, the numbering order of the m sequence within the m sequence set, and the number of the m sequence subset.

In summary, the method provided in the embodiment of the present application provides a low-complexity and low-featured solution for sending synchronization signals and measurement signals through an m-sequence. Since the m-sequence has good autocorrelation and cross-correlation characteristics, the first signal generated by the gold sequence still has such good characteristics, which helps to improve the reliability and efficiency of downlink synchronization and RRM measurement. In addition, by constructing an m-sequence set, a large number of m-sequences can be obtained, which can provide available m-sequences for a large number of cells to generate the first signal.

FIG21 shows a block diagram of a signal transmission device provided by an exemplary embodiment of the present application, and the device can be implemented as a network device as shown in FIG10 or FIG11 or FIG12 or FIG14, or implemented as a part of a network device as shown in FIG10 or FIG11 or FIG12 or FIG14. The device includes a sending module 2110. Optionally, the device also includes a processing module 2130 and/or a receiving module 2150.

The sending module 2110 is used to send a first signal, where the first signal is generated based on a binary sequence and is used for radio resource management RRM measurement and/or downlink synchronization.

In some embodiments, the binary sequence is associated with a cell identity.

In some embodiments, the binary sequence includes a gold sequence, and different cell identifiers correspond to different gold sequences.

In some embodiments, the sequence element numbered n in the gold sequence is determined according to the sequence element numbered a in the first m sequence and the sequence element numbered b in the second m sequence; wherein the first m sequence is one m sequence in a preferred pair of m sequences, and the second m sequence is the other m sequence in the preferred pair of m sequences.

In some embodiments, the apparatus further comprises a processing module 2130, configured to determine a sequence element numbered n in the gold sequence.

In some embodiments, the sequence element numbered n in the gold sequence is a first product, and the first product is the product of a first difference and a second difference; wherein the first difference is the difference between a value 1 and the second product, and the second product is the product of a value 2 and a sequence element numbered a in the first m sequence; and the second difference is the difference between a value 1 and a third product, and the third product is the product of a value 2 and a sequence element numbered b in the second m sequence.

In some embodiments, the sequence element numbered n in the gold sequence is a modulo-2 result of the sum of the sequence element numbered a in the first m sequence and the sequence element numbered b in the second m sequence.

In some embodiments, a is determined according to at least one of the following: n, parameter m ₀ , and a first length value; b is determined according to at least one of the following: n, parameter m ₁ , and the first length value; wherein n is greater than or equal to 0 and less than the first length value, the first length value is a length value of the first m-sequence and the second m-sequence, the parameter m ₀ represents a cyclic offset when the first m-sequence is used to generate the gold sequence, and the parameter m ₁ represents a cyclic offset when the second m-sequence is used to generate the gold sequence.

In some embodiments, a is determined according to a first modulo result, the second modulo result is the modulo result of the first sum value and the first length value, the first sum value is the sum of n and the parameter _m0 ; b is determined according to a second modulo result, the second modulo result is the modulo result of the second sum value and the first length value, the second sum value is the sum of n and the parameter _m1 .

In some embodiments, the numbering of the first m-sequence is agreed upon by a communication protocol, or indicated by the network device, or determined according to rules agreed upon by a communication protocol; the numbering of the second m-sequence is agreed upon by a communication protocol, or indicated by the network device, or determined according to rules agreed upon by a communication protocol.

In some embodiments, the processing module 2130 is further used to determine a and/or b.

In some embodiments, the gold sequence is a first gold sequence, which is obtained by performing modulo-2 addition of cyclic shift sequences of a first m-sequence and a second m-sequence, and the first m-sequence and the second m-sequence constitute an m-sequence preferred pair.

In some embodiments, the processing module 2130 is further configured to perform cyclic shift.

In some embodiments, the gold sequence is a second gold sequence, which is obtained by performing modulo-2 addition of a cyclic shift sequence of a first m sequence and a cyclic shift sequence of a second m sequence, and the first m sequence and the second m sequence constitute an m sequence preferred pair.

In some embodiments, the gold sequence is a third gold sequence, the third gold sequence is obtained by cyclic shifting the first gold sequence, the first gold sequence is obtained by modulo-2 addition of cyclic shift sequences of a first m sequence and a second m sequence, and the first m sequence and the second m sequence constitute an m sequence preferred pair.

In some embodiments, the binary sequence includes an m-sequence, and different cell identifiers correspond to different m-sequences.

In some embodiments, the m-sequence includes two m-sequences in an m-sequence set, the two m-sequences include a first m-sequence and a second m-sequence, the first m-sequence is one m-sequence in a preferred pair of m-sequences, and the second m-sequence is the other m-sequence in the preferred pair of m-sequences.

In some embodiments, the first signal includes a first sub-signal and a second sub-signal, the first sub-signal is generated according to the first m-sequence, and the second sub-signal is generated according to the second m-sequence.

In some embodiments, the sequence element numbered n ₁ in the sequence of the first sub-signal is based on the sequence element numbered a in the first m sequence. The sequence element is determined; the sequence element numbered n ₂ in the sequence of the second sub-signal is determined according to the sequence element numbered b in the second m sequence.

In some embodiments, the processing module 2130 is further configured to determine a sequence element numbered _n1 in the sequence of the first sub-signal and/or a sequence element numbered _n2 in the sequence of the second sub-signal.

In some embodiments, the sequence element numbered _n1 in the sequence of the first sub-signal is the first difference, and the sequence element numbered _n2 in the sequence of the second sub-signal is the second difference; wherein the first difference is the difference between the value 1 and the second product, and the second product is the product of the value 2 and the sequence element numbered a in the first m-sequence; and the second difference is the difference between the value 1 and the third product, and the third product is the product of the value 2 and the sequence element numbered b in the second m-sequence.

In some embodiments, the numbering of the m-sequence included in the binary sequence is agreed upon by a communication protocol, or is indicated by the network device, or is determined according to a rule agreed upon by a communication protocol.

In some embodiments, the numbering of the m-sequence preferred pairs is agreed upon by a communication protocol, or is indicated by the network device, or is determined according to a rule agreed upon by a communication protocol.

In some embodiments, a is determined according to at least one of the following: n ₁ , parameter m ₀ , and a first length value; b is determined according to at least one of the following: n ₁ , parameter m ₁ , and the first length value; wherein n is greater than or equal to 0 and less than the first length value, the first length value is a length value of the first m-sequence and the second m-sequence, the parameter m ₀ represents a cyclic offset when the first m-sequence is used to generate a sequence of the first sub-signal, and the parameter m ₁ represents a cyclic offset when the second m-sequence is used to generate a sequence of the first sub-signal.

In some embodiments, the parameter _m0 is determined according to the first sub-identifier, and the parameter _m1 is determined according to the second sub-identifier; or, the parameter _m0 is determined according to the second sub-identifier, and the parameter _m1 is determined according to the first sub-identifier; or, the parameter _m0 is determined according to the first sub-identifier and the second sub-identifier, and the parameter _m1 is determined according to the first sub-identifier; or, the parameter _m0 is determined according to the first sub-identifier, and the parameter _m1 is determined according to the first sub-identifier and the second sub-identifier.

In some embodiments, the processing module 2130 is further configured to determine the parameter m ₀ and/or the parameter m ₁ .

In some embodiments, the first sub-identifier and the second sub-identifier are determined according to a cell identifier and/or a cyclic shift step size.

In some embodiments, the processing module 2130 is further configured to determine the first sub-identifier and/or the second sub-identifier.

In some embodiments, the parameter _m0 is determined according to the modulo result of the first sub-identifier and parameter G, and the parameter _m1 is determined according to the modulo result of the second sub-identifier and parameter F; or, the parameter _m1 is determined according to the modulo result of the first sub-identifier and parameter G, and the parameter _m0 is determined according to the modulo result of the second sub-identifier and parameter F.

In some embodiments, the parameter _m0 is determined according to the quotient of the first sub-identifier and parameter B and the second sub-identifier, and the parameter _m1 is determined according to the modulus result of the first sub-identifier and the parameter B; or, the parameter _m1 is determined according to the quotient of the first sub-identifier and parameter B and the second sub-identifier, and the parameter _m0 is determined according to the modulus result of the first sub-identifier and the parameter B; wherein the parameter B is less than the first length value.

In some embodiments, the parameter _m0 is less than or equal to the first length value, and the parameter _m1 is less than or equal to the first length value.

In some embodiments, the m-sequence is an m-sequence in an m-sequence subset, and the number of the m-sequence in the m-sequence subset is determined according to a cell identifier; wherein each m-sequence in the m-sequence subset corresponds one-to-one to each cell identifier in the communication system.

In some embodiments, the number of the m-sequence in the m-sequence set is equal to the cell identifier.

In some embodiments, the number of m-sequences in the m-sequence set is determined according to the number of shift register stages and/or the cyclic shift step size.

In some embodiments, the numbering order of the m-sequences in the m-sequence set is agreed upon by a communication protocol, or is indicated by the network device, or is a default order, or is determined by a terminal device.

In some embodiments, the numbering sequence of the m-sequences in the m-sequence set is determined according to the following order: the order of primitive polynomial coefficients from high power to low power; the order of primitive polynomial coefficients from low power to high power; the order of binary numbers of primitive polynomial coefficients from small to large; the order of binary numbers of primitive polynomial coefficients from large to small; the order of cyclic offsets from small to large; the order of cyclic offsets from large to small.

In some embodiments, each cyclic shift sequence in the m-sequence set is arranged after its corresponding basic m-sequence from small to large according to the cyclic offset; or, each cyclic shift sequence in the m-sequence set is arranged after its corresponding basic m-sequence from large to small according to the cyclic offset; or, all cyclic shift sequences in the m-sequence set are arranged after all basic m-sequences from small to large according to the cyclic offset; or, all cyclic shift sequences in the m-sequence set are arranged after all basic m-sequences from large to small according to the cyclic offset.

In some embodiments, the time domain resources occupied by the first signal are continuous or discontinuous.

In some embodiments, the time domain resources occupied by the first signal include at least two groups of time domain units, there is a time domain interval or there is no time domain interval between the at least two groups of time domain units, and each group of time domain units in the at least two groups of time domain units is continuous or discontinuous.

In some embodiments, the first signal is obtained by a first modulation according to the binary sequence, and the first modulation includes one of the following: OOK modulation, PSK modulation, BPSK modulation, and FSK modulation.

In some embodiments, a first modulation symbol is mapped to a first time domain unit, or multiple first modulation symbols are mapped to a first time domain unit; wherein the first time domain unit is a time domain unit occupied by the first signal, and the first modulation symbol is a modulation symbol of the first modulation.

In some embodiments, the first signal is obtained by scrambling the binary sequence; wherein the sequence used for scrambling includes at least one of the following: a ZC sequence, a QPSK sequence, and a QAM sequence.

In some embodiments, the sending module 2110 is further used to send at least one of the following information: the number of the gold sequence, the number of the first m sequence, the number of the second m sequence, the number of the m sequence preferred pair, the number of the m sequence, the cyclic shift step, the numbering order of the m sequence in the m sequence set, and the number of the m sequence subset.

In some embodiments, the processing module 2130 is further used to perform at least one of the steps of modulation, scrambling, mapping, etc.

In some embodiments, the apparatus further includes a receiving module 2150, configured to receive a signal and/or data sent by a terminal device. Exemplarily, the receiving module 2150 is configured to receive a signal and/or data sent by a terminal device based on a synchronization result of the first signal. Exemplarily, the receiving module 2150 is configured to receive an RRM measurement result fed back by a terminal device.

In summary, the device provided in the embodiment of the present application provides a low-complexity and low-featured solution for sending synchronization signals and measurement signals through gold sequences and m sequences. Since the gold sequence and m sequence have good autocorrelation and cross-correlation characteristics, the first signal generated by the gold sequence and m sequence still has such good characteristics, which helps to improve the reliability and efficiency of downlink synchronization and RRM measurement. Moreover, a large number of gold sequences and m sequences can be obtained through cyclic shift, which can provide available gold sequences and m sequences for a large number of cells to generate the first signal.

FIG22 shows a block diagram of a signal transmission device provided by an exemplary embodiment of the present application, and the device can be implemented as a terminal device as shown in FIG18, FIG19, or FIG20, or implemented as a part of a terminal device as shown in FIG18, FIG19, or FIG20. The device includes a receiving module 2210. Optionally, the device also includes a processing module 2230 and/or a sending module 2250.

The receiving module 2210 is used to receive a first signal, where the first signal is generated based on a binary sequence and is used for radio resource management RRM measurement and/or downlink synchronization.

In some embodiments, the binary sequence is associated with a cell identity.

In some embodiments, the binary sequence includes a gold sequence, and different cell identifiers correspond to different gold sequences.

In some embodiments, the sequence element numbered n in the gold sequence is determined according to the sequence element numbered a in the first m sequence and the sequence element numbered b in the second m sequence; wherein the first m sequence is one m sequence in a preferred pair of m sequences, and the second m sequence is the other m sequence in the preferred pair of m sequences.

In some embodiments, the apparatus further comprises a processing module 2230, configured to determine a sequence element numbered n in the gold sequence.

In some embodiments, the sequence element numbered n in the gold sequence is a first product, and the first product is the product of a first difference and a second difference; wherein the first difference is the difference between a value 1 and the second product, and the second product is the product of a value 2 and a sequence element numbered a in the first m sequence; and the second difference is the difference between a value 1 and a third product, and the third product is the product of a value 2 and a sequence element numbered b in the second m sequence.

In some embodiments, the sequence element numbered n in the gold sequence is a modulo-2 result of the sum of the sequence element numbered a in the first m sequence and the sequence element numbered b in the second m sequence.

In some embodiments, a is determined according to at least one of the following: n, parameter m ₀ , and a first length value; b is determined according to at least one of the following: n, parameter m ₁ , and the first length value; wherein n is greater than or equal to 0 and less than the first length value, the first length value is a length value of the first m-sequence and the second m-sequence, the parameter m ₀ represents a cyclic offset when the first m-sequence is used to generate the gold sequence, and the parameter m ₁ represents a cyclic offset when the second m-sequence is used to generate the gold sequence.

In some embodiments, a is determined according to a first modulo result, the second modulo result is the modulo result of the first sum value and the first length value, the first sum value is the sum of n and the parameter _m0 ; b is determined according to a second modulo result, the second modulo result is the modulo result of the second sum value and the first length value, the second sum value is the sum of n and the parameter _m1 .

In some embodiments, the numbering of the first m-sequence is agreed upon by a communication protocol, or indicated by the network device, or determined according to rules agreed upon by a communication protocol; the numbering of the second m-sequence is agreed upon by a communication protocol, or indicated by the network device, or determined according to rules agreed upon by a communication protocol.

In some embodiments, the processing module 2230 is further used to determine a and/or b.

In some embodiments, the gold sequence is a first gold sequence, which is obtained by performing modulo-2 addition of cyclic shift sequences of a first m-sequence and a second m-sequence, and the first m-sequence and the second m-sequence constitute an m-sequence preferred pair.

In some embodiments, the processing module 2230 is further configured to perform cyclic shift.

In some embodiments, the gold sequence is a second gold sequence, which is obtained by performing modulo-2 addition of a cyclic shift sequence of a first m sequence and a cyclic shift sequence of a second m sequence, and the first m sequence and the second m sequence constitute an m sequence preferred pair.

In some embodiments, the gold sequence is a third gold sequence, and the third gold sequence is cyclically shifted according to the first gold sequence. The first gold sequence is obtained by performing modulo-2 addition of cyclic shift sequences of the first m sequence and the second m sequence, and the first m sequence and the second m sequence constitute an m sequence preferred pair.

In some embodiments, the binary sequence includes an m-sequence, and different cell identifiers correspond to different m-sequences.

In some embodiments, the m-sequence includes two m-sequences in an m-sequence set, the two m-sequences include a first m-sequence and a second m-sequence, the first m-sequence is one m-sequence in a preferred pair of m-sequences, and the second m-sequence is the other m-sequence in the preferred pair of m-sequences.

In some embodiments, the first signal includes a first sub-signal and a second sub-signal, the first sub-signal is generated according to the first m-sequence, and the second sub-signal is generated according to the second m-sequence.

In some embodiments, the sequence element numbered _n1 in the sequence of the first sub-signal is determined according to the sequence element numbered a in the first m-sequence; the sequence element numbered _n2 in the sequence of the second sub-signal is determined according to the sequence element numbered b in the second m-sequence.

In some embodiments, the processing module 2230 is further configured to determine a sequence element numbered _n1 in the sequence of the first sub-signal and/or a sequence element numbered _n2 in the sequence of the second sub-signal.

In some embodiments, the sequence element numbered _n1 in the sequence of the first sub-signal is the first difference, and the sequence element numbered _n2 in the sequence of the second sub-signal is the second difference; wherein the first difference is the difference between the value 1 and the second product, and the second product is the product of the value 2 and the sequence element numbered a in the first m-sequence; and the second difference is the difference between the value 1 and the third product, and the third product is the product of the value 2 and the sequence element numbered b in the second m-sequence.

In some embodiments, the numbering of the m-sequence included in the binary sequence is agreed upon by a communication protocol, or is indicated by the network device, or is determined according to a rule agreed upon by a communication protocol.

In some embodiments, the numbering of the m-sequence preferred pairs is agreed upon by a communication protocol, or is indicated by the network device, or is determined according to a rule agreed upon by a communication protocol.

In some embodiments, a is determined according to at least one of the following: n ₁ , parameter m ₀ , and a first length value; b is determined according to at least one of the following: n ₁ , parameter m ₁ , and the first length value; wherein n is greater than or equal to 0 and less than the first length value, the first length value is a length value of the first m-sequence and the second m-sequence, the parameter m ₀ represents a cyclic offset when the first m-sequence is used to generate a sequence of the first sub-signal, and the parameter m ₁ represents a cyclic offset when the second m-sequence is used to generate a sequence of the first sub-signal.

In some embodiments, the parameter _m0 is determined according to the first sub-identifier, and the parameter _m1 is determined according to the second sub-identifier; or, the parameter _m0 is determined according to the second sub-identifier, and the parameter _m1 is determined according to the first sub-identifier; or, the parameter _m0 is determined according to the first sub-identifier and the second sub-identifier, and the parameter _m1 is determined according to the first sub-identifier; or, the parameter _m0 is determined according to the first sub-identifier, and the parameter _m1 is determined according to the first sub-identifier and the second sub-identifier.

In some embodiments, the processing module 2230 is further configured to determine the parameter m ₀ and/or the parameter m ₁ .

In some embodiments, the first sub-identifier and the second sub-identifier are determined according to a cell identifier and/or a cyclic shift step size.

In some embodiments, the processing module 2230 is further configured to determine the first sub-identifier and/or the second sub-identifier.

In some embodiments, the parameter _m0 is determined according to the modulo result of the first sub-identifier and parameter G, and the parameter _m1 is determined according to the modulo result of the second sub-identifier and parameter F; or, the parameter _m1 is determined according to the modulo result of the first sub-identifier and parameter G, and the parameter _m0 is determined according to the modulo result of the second sub-identifier and parameter F.

In some embodiments, the parameter _m0 is determined according to the quotient of the first sub-identifier and parameter B and the second sub-identifier, and the parameter _m1 is determined according to the modulus result of the first sub-identifier and the parameter B; or, the parameter _m1 is determined according to the quotient of the first sub-identifier and parameter B and the second sub-identifier, and the parameter _m0 is determined according to the modulus result of the first sub-identifier and the parameter B; wherein the parameter B is less than the first length value.

In some embodiments, the parameter _m0 is less than or equal to the first length value, and the parameter _m1 is less than or equal to the first length value.

In some embodiments, the m-sequence is an m-sequence in an m-sequence subset, and the number of the m-sequence in the m-sequence subset is determined according to a cell identifier; wherein each m-sequence in the m-sequence subset corresponds one-to-one to each cell identifier in the communication system.

In some embodiments, the number of the m-sequence in the m-sequence set is equal to the cell identifier.

In some embodiments, the number of m-sequences in the m-sequence set is determined according to the number of shift register stages and/or the cyclic shift step size.

In some embodiments, the numbering order of the m-sequences in the m-sequence set is agreed upon by a communication protocol, or is indicated by the network device, or is a default order, or is determined by a terminal device.

In some embodiments, the numbering sequence of the m-sequences in the m-sequence set is determined according to the following order: the order of primitive polynomial coefficients from high power to low power; the order of primitive polynomial coefficients from low power to high power; the order of binary numbers of primitive polynomial coefficients from small to large; the order of binary numbers of primitive polynomial coefficients from large to small; the order of cyclic offsets from small to large; the order of cyclic offsets from large to small.

In some embodiments, each cyclic shift sequence in the m-sequence set is arranged in order of cyclic offset from small to large. or, each cyclic shift sequence in the m-sequence set is arranged after its corresponding basic m-sequence in descending order according to the cyclic offset; or, all cyclic shift sequences in the m-sequence set are arranged after all basic m-sequences in descending order according to the cyclic offset; or, all cyclic shift sequences in the m-sequence set are arranged after all basic m-sequences in descending order according to the cyclic offset.

In some embodiments, the time domain resources occupied by the first signal are continuous or discontinuous.

In some embodiments, the time domain resources occupied by the first signal include at least two groups of time domain units, there is a time domain interval or there is no time domain interval between the at least two groups of time domain units, and each group of time domain units in the at least two groups of time domain units is continuous or discontinuous.

In some embodiments, the first signal is obtained by a first modulation according to the binary sequence, and the first modulation includes one of the following: OOK modulation, PSK modulation, BPSK modulation, and FSK modulation.

In some embodiments, a first modulation symbol is mapped to a first time domain unit, or multiple first modulation symbols are mapped to a first time domain unit; wherein the first time domain unit is a time domain unit occupied by the first signal, and the first modulation symbol is a modulation symbol of the first modulation.

In some embodiments, the first signal is obtained by scrambling the binary sequence; wherein the sequence used for scrambling includes at least one of the following: a ZC sequence, a QPSK sequence, and a QAM sequence.

In some embodiments, the processing module 2230 is further used to perform at least one of the steps of modulation, scrambling, mapping, etc.

In some embodiments, the apparatus further includes a sending module 2250, configured to send a signal and/or data to a network device. Exemplarily, the sending module 2250 is configured to send a signal and/or data to a network device based on a synchronization result of the first signal. Exemplarily, the sending module 2250 is configured to feed back an RRM measurement result to the network device.

In some embodiments, the receiving module 2210 is further used to receive at least one of the following information: the number of the gold sequence, the number of the first m sequence, the number of the second m sequence, the number of the m sequence preferred pair, the number of the m sequence, the cyclic shift step, the numbering order of the m sequence in the m sequence set, and the number of the m sequence subset.

In summary, the device provided in the embodiment of the present application provides a low-complexity and low-featured feasible solution for downlink synchronization and RRM measurement through gold sequences and m sequences. Since the gold sequence and m sequence have good autocorrelation and cross-correlation characteristics, the first signal generated by the gold sequence and m sequence still has such good characteristics, which helps to improve the reliability and efficiency of downlink synchronization and RRM measurement. Moreover, a large number of gold sequences and m sequences can be obtained through cyclic shift, which can provide available gold sequences and m sequences for a large number of cells to generate the first signal.

FIG23 shows a schematic diagram of the structure of a communication device 2300 provided by an exemplary embodiment of the present application, including a receiver 2310 and a transmitter 2320. The communication device 2300 can be used to execute at least part of the steps executed by the terminal device shown in FIG18 or FIG19 or FIG20.

The receiver 2310 and the transmitter 2320 may be implemented as a communication component, which may be a communication chip, and which may be referred to as a transceiver.

In some embodiments, the receiver 2310 may be used to implement the functions and steps of the above-mentioned receiving module 2210. Optionally, the receiver 2310 may be implemented as a first receiver 2311 and/or a second receiver 2312.

In some embodiments, the transmitter 2320 may be used to implement the functions and steps of the above-mentioned sending module 2250. Optionally, the transmitter 2320 may be implemented as a first transmitter 2321 and/or a second transmitter 2322.

Optionally, the communication device 2300 may further include a processor 2330. The processor 2330 includes one or more processing cores, and the processor 2330 executes various functional applications and information processing by running software programs and modules. Optionally, the processor 2330 may be used to implement the functions and steps of the processing module 2230 described above.

Optionally, the communication device 2300 may further include a memory 2340. The memory 2340 may be used to store at least one instruction, and the processor 2310 may be used to execute the at least one instruction to implement the various steps in the above method embodiment. In addition, the memory 2340 may be implemented by any type of volatile or non-volatile storage device or a combination thereof, and the volatile or non-volatile storage device includes but is not limited to: a magnetic disk or optical disk, an electrically erasable programmable read-only memory (EEPROM), an erasable programmable read-only memory (EPROM), a static random access memory (SRAM), a read-only memory (ROM), a magnetic memory, a flash memory, and a programmable read-only memory (PROM).

Optionally, the communication device 2300 may further include a bus (not shown in the figure). Optionally, the memory 2340 is connected to the processor 2330 via a bus.

In some embodiments, the receiver 2310 receives signals/data independently, or the processor 2330 controls the receiver 2310 to receive signals/data, or the processor 2330 requests the receiver 2310 to receive signals/data, or the processor 2330 cooperates with the receiver 2310 to receive signals/data.

In some embodiments, the transmitter 2320 independently sends signals/data, or the processor 2330 controls the transmitter 2320 to send signals/data, or the processor 2330 requests the transmitter 2320 to send signals/data, or the processor 2330 cooperates with the transmitter 2320 to send signals/data.

In some embodiments, the first receiver 2311 is implemented as a wake-up receiver (WUR), and/or the second receiver Device 2312 is implemented as a main receiver.

In some embodiments, receiver 2310 is implemented as a combined receiver of a WUR and a main receiver.

In some embodiments, the first transmitter 2321 is implemented as a main transmitter, and/or the second transmitter 2322 is implemented as a backscatter transmitter.

In some embodiments, transmitter 2320 is implemented as a combination transmitter of a main transmitter and a backscatter transmitter.

In some embodiments, the processor 2330 and the receiver 2310 may be implemented as one module, or the processor 2330 may be implemented as a part of the receiver 2310 .

In some embodiments, the processor 2330 and the transmitter 2320 may be implemented as one module, or the processor 2330 may be implemented as a part of the transmitter 2320 .

In some embodiments, the communication device 2300 includes one or more processors 2330, and different processors are used to execute the same steps or different steps in the above-mentioned processing-related steps.

FIG24 shows a schematic diagram of the structure of a communication device 2400 provided by an exemplary embodiment of the present application, including: a processor 2401, a receiver 2402, a transmitter 2403, a memory 2404, and a bus 2405. The communication device 2400 may be used to execute at least some of the steps executed by the terminal device shown in FIG18, FIG19, or FIG20, or may be used to execute at least some of the steps executed by the network device shown in FIG10, FIG11, FIG12, or FIG14.

The processor 2401 includes one or more processing cores, and the processor 2401 executes various functional applications and information processing by running software programs and modules. In some embodiments, the processor 2401 can be used to implement the functions and steps of the processing module 2130 and/or the processing module 2230 described above.

The receiver 2402 and the transmitter 2403 may be implemented as a communication component, which may be a communication chip, and the communication component may be referred to as a transceiver. In some embodiments, the receiver 2402 may be used to implement the functions and steps of the above-mentioned receiving module 2150 and/or receiving module 2210, and the transmitter 2403 may be used to implement the functions and steps of the above-mentioned sending module 2110 and/or sending module 2250.

The memory 2404 is connected to the processor 2401 via a bus 2405 .

The memory 2404 may be used to store at least one instruction, and the processor 2401 may be used to execute the at least one instruction to implement each step in the above method embodiment.

In addition, the memory 2404 can be implemented by any type of volatile or non-volatile storage device or a combination thereof, and the volatile or non-volatile storage device includes but is not limited to: magnetic disk or optical disk, EEPROM, EPROM, SRAM, ROM, magnetic storage, flash memory, PROM.

In some embodiments, the receiver 2402 receives signals/data independently, or the processor 2401 controls the receiver 2402 to receive signals/data, or the processor 2401 requests the receiver 2402 to receive signals/data, or the processor 2401 cooperates with the receiver 2402 to receive signals/data.

In some embodiments, the transmitter 2403 independently sends signals/data, or the processor 2401 controls the transmitter 2403 to send signals/data, or the processor 2401 requests the transmitter 2403 to send signals/data, or the processor 2401 cooperates with the transmitter 2403 to send signals/data.

In an exemplary embodiment of the present application, a computer-readable storage medium is further provided, wherein at least one program is stored in the computer-readable storage medium, and the at least one program is loaded and executed by the processor to implement the signal transmission method provided by the above-mentioned various method embodiments.

In an exemplary embodiment of the present application, a chip is also provided, which includes a programmable logic circuit and/or program instructions. When the chip runs on a communication device, it is used to implement the signal transmission methods provided by the above-mentioned various method embodiments.

In an exemplary embodiment of the present application, a computer program product is further provided. When the computer program product is executed on a processor of a computer device, the computer device executes the above signal transmission method.

In an exemplary embodiment of the present application, a computer program is further provided. The computer program includes computer instructions. A processor of a computer device executes the computer instructions, so that the computer device executes the above-mentioned signal transmission method.

A person skilled in the art will understand that all or part of the steps to implement the above embodiments may be accomplished by hardware or by instructing related hardware through a program, and the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a disk or an optical disk, etc.

The above are only optional embodiments of the present application and are not intended to limit the present application. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application should be included in the protection scope of the present application.

Claims (84)

A signal transmission method, characterized in that the method is performed by a network device, and the method comprises: A first signal is sent, where the first signal is generated based on a binary sequence, and the first signal is used for radio resource management RRM measurement and/or downlink synchronization. The method according to claim 1, characterized in that the binary sequence is associated with a cell identifier. The method according to claim 1 or 2 is characterized in that the binary sequence includes a gold sequence, and different cell identifiers correspond to different gold sequences. The method according to claim 3 is characterized in that the sequence element numbered n in the gold sequence is determined according to the sequence element numbered a in the first m-sequence and the sequence element numbered b in the second m-sequence; wherein the first m-sequence is one m-sequence in a preferred pair of m-sequences, and the second m-sequence is the other m-sequence in the preferred pair of m-sequences. The method according to claim 4 is characterized in that the sequence element numbered n in the gold sequence is the first product, and the first product is the product of the first difference and the second difference; wherein the first difference is the difference between the value 1 and the second product, and the second product is the product of the value 2 and the sequence element numbered a in the first m sequence; the second difference is the difference between the value 1 and the third product, and the third product is the product of the value 2 and the sequence element numbered b in the second m sequence. The method according to claim 4 is characterized in that the sequence element numbered n in the gold sequence is the modulo-2 result of the sum of the sequence element numbered a in the first m sequence and the sequence element numbered b in the second m sequence. The method according to any one of claims 4 to 6, characterized in that a is determined according to at least one of the following: n, parameter _m0 , and a first length value; b is determined according to at least one of the following: n, parameter _m1 , and the first length value; wherein n is greater than or equal to 0 and less than the first length value, the first length value is a length value of the first m-sequence and the second m-sequence, the parameter _m0 represents a cyclic offset when the first m-sequence is used to generate the gold sequence, and the parameter _m1 represents a cyclic offset when the second m-sequence is used to generate the gold sequence. The method according to claim 7 is characterized in that a is determined according to a first modulo result, the second modulo result is the modulo result of the first sum value and the first length value, and the first sum value is the sum of n and the parameter _m0 ; b is determined according to a second modulo result, the second modulo result is the modulo result of the second sum value and the first length value, and the second sum value is the sum of n and the parameter _m1 . The method according to any one of claims 4 to 8 is characterized in that the numbering of the first m-sequence is agreed upon by a communication protocol, or is indicated by the network device, or is determined according to a rule agreed upon by a communication protocol; the numbering of the second m-sequence is agreed upon by a communication protocol, or is indicated by the network device, or is determined according to a rule agreed upon by a communication protocol. The method according to any one of claims 4 to 8 is characterized in that the numbering of the m-sequence preferred pairs is agreed upon by a communication protocol, or is indicated by the network device, or is determined according to a rule agreed upon by a communication protocol. The method according to any one of claims 3 to 10 is characterized in that the gold sequence is a first gold sequence, the first gold sequence is obtained by performing modulo-2 addition of cyclic shift sequences of a first m-sequence and a second m-sequence, and the first m-sequence and the second m-sequence constitute an m-sequence preferred pair. The method according to any one of claims 3 to 10 is characterized in that the gold sequence is a second gold sequence, the second gold sequence is obtained by performing modulo-2 addition of a cyclic shift sequence of a first m-sequence and a cyclic shift sequence of a second m-sequence, and the first m-sequence and the second m-sequence constitute an m-sequence preferred pair. The method according to any one of claims 3 to 10 is characterized in that the gold sequence is a third gold sequence, the third gold sequence is obtained by cyclic shifting the first gold sequence, the first gold sequence is obtained by performing modulo-2 addition of cyclic shift sequences of a first m-sequence and a second m-sequence, and the first m-sequence and the second m-sequence constitute an m-sequence preferred pair. The method according to claim 1 or 2 is characterized in that the binary sequence includes an m-sequence, and different cell identifiers correspond to different m-sequences. The method according to claim 14 is characterized in that the m-sequence includes two m-sequences in an m-sequence set, the two m-sequences include a first m-sequence and a second m-sequence, the first m-sequence is one m-sequence in a preferred pair of m-sequences, and the second m-sequence is the other m-sequence in the preferred pair of m-sequences. The method according to claim 15 is characterized in that the first signal includes a first sub-signal and a second sub-signal, the first sub-signal is generated according to the first m-sequence, and the second sub-signal is generated according to the second m-sequence. The method according to claim 16 is characterized in that the sequence element numbered _n1 in the sequence of the first sub-signal is determined according to the sequence element numbered a in the first m-sequence; and the sequence element numbered _n2 in the sequence of the second sub-signal is determined according to the sequence element numbered b in the second m-sequence. The method according to claim 17 is characterized in that the sequence element numbered _n1 in the sequence of the first sub-signal is the first difference, and the sequence element numbered _n2 in the sequence of the second sub-signal is the second difference; wherein the first difference is the difference between the value 1 and the second product, and the second product is the product of the value 2 and the sequence element numbered a in the first m-sequence; the second difference is the difference between the value 1 and the third product, and the third product is the product of the value 2 and the sequence element numbered b in the second m-sequence. The method according to any one of claims 14 to 18 is characterized in that the numbering of the m-sequence included in the binary sequence is agreed upon by a communication protocol, or is indicated by the network device, or is determined according to a rule agreed upon by a communication protocol. The method according to any one of claims 15 to 18 is characterized in that the numbering of the m-sequence preferred pairs is agreed upon by a communication protocol, or is indicated by the network device, or is determined according to a rule agreed upon by a communication protocol. The method according to claim 17 or 18 is characterized in that a is determined according to at least one of the following: n ₁ , parameter m ₀ , and a first length value; b is determined according to at least one of the following: n ₁ , parameter m ₁ , and the first length value; wherein n is greater than or equal to 0 and less than the first length value, the first length value is a length value of the first m-sequence and the second m-sequence, the parameter m ₀ represents a cyclic offset when the first m-sequence is used to generate a sequence of the first sub-signal, and the parameter m ₁ represents a cyclic offset when the second m-sequence is used to generate a sequence of the first sub-signal. The method according to claim 7, 8 or 21 is characterized in that the parameter _m0 is determined according to the first sub-identifier, and the parameter _m1 is determined according to the second sub-identifier; or, the parameter _m0 is determined according to the second sub-identifier, and the parameter _m1 is determined according to the first sub-identifier; or, the parameter _m0 is determined according to the first sub-identifier and the second sub-identifier, and the parameter _m1 is determined according to the first sub-identifier; or, the parameter _m0 is determined according to the first sub-identifier, and the parameter _m1 is determined according to the first sub-identifier and the second sub-identifier. The method according to claim 22 is characterized in that the first sub-identifier and the second sub-identifier are determined according to the cell identifier and/or the cyclic shift step size. The method according to claim 22 or 23 is characterized in that the parameter _m0 is determined according to the modulo result of the first sub-identifier and parameter G, and the parameter _m1 is determined according to the modulo result of the second sub-identifier and parameter F; or, the parameter _m1 is determined according to the modulo result of the first sub-identifier and parameter G, and the parameter _m0 is determined according to the modulo result of the second sub-identifier and parameter F. The method according to claim 22 or 23 is characterized in that the parameter _m0 is determined according to the quotient of the first sub-identifier and parameter B and the second sub-identifier, and the parameter _m1 is determined according to the modulus result of the first sub-identifier and the parameter B; or, the parameter _m1 is determined according to the quotient of the first sub-identifier and parameter B and the second sub-identifier, and the parameter _m0 is determined according to the modulus result of the first sub-identifier and the parameter B; wherein the parameter B is less than the first length value. The method according to any one of claims 7 or 8 or 21 to 25 is characterized in that the parameter _m0 is less than or equal to the first length value, and the parameter _m1 is less than or equal to the first length value. The method according to claim 14 is characterized in that the m-sequence is an m-sequence in an m-sequence subset, and the number of the m-sequence in the m-sequence subset is determined according to a cell identifier; wherein each m-sequence in the m-sequence subset corresponds one-to-one to each cell identifier in the communication system. The method according to claim 27 is characterized in that the number of the m-sequence in the m-sequence set is equal to the cell identifier. The method according to claim 15, 27 or 28, characterized in that the number of m-sequences in the m-sequence set is determined according to the number of shift register stages and/or the cyclic shift step size. The method according to claim 15 or 27 or 28 or 29 is characterized in that the numbering order of the m-sequences in the m-sequence set is agreed upon by a communication protocol, or is indicated by the network device, or is a default order, or is determined by a terminal device. The method according to claim 30 is characterized in that the numbering sequence of the m-sequences in the m-sequence set is determined according to the following order: the order of primitive polynomial coefficients from high power to low power; the order of primitive polynomial coefficients from low power to high power; the order of binary numbers of primitive polynomial coefficients from small to large; the order of binary numbers of primitive polynomial coefficients from large to small; the order of cyclic offsets from small to large; the order of cyclic offsets from large to small. The method according to claim 30 or 31 is characterized in that each cyclic shift sequence in the m-sequence set is arranged after its corresponding basic m-sequence from small to large according to the cyclic offset; or, each cyclic shift sequence in the m-sequence set is arranged after its corresponding basic m-sequence from large to small according to the cyclic offset; or, all cyclic shift sequences in the m-sequence set are arranged after all basic m-sequences from small to large according to the cyclic offset; or, all cyclic shift sequences in the m-sequence set are arranged after all basic m-sequences from large to small according to the cyclic offset. The method according to any one of claims 1 to 32, characterized in that the method further comprises: At least one of the following information is sent: the number of the gold sequence, the number of the first m sequence, the number of the second m sequence, the number of the m sequence preferred pair, the number of the m sequence, the cyclic shift step, the numbering order of the m sequences in the m sequence set, and the number of the m sequence subset. The method according to any one of claims 1 to 33 is characterized in that the time domain resources occupied by the first signal are continuous or discontinuous. The method according to claim 34 is characterized in that the time domain resources occupied by the first signal include at least two groups of time domain units, there is a time domain interval or there is no time domain interval between the at least two groups of time domain units, and each group of time domain units in the at least two groups of time domain units is continuous or discontinuous. The method according to any one of claims 1 to 35 is characterized in that the first signal is obtained by a first modulation according to the binary sequence, and the first modulation includes one of the following: OOK modulation, PSK modulation, BPSK modulation, and FSK modulation. The method according to claim 36 is characterized in that a first modulation symbol is mapped to a first time domain unit, or a plurality of first modulation symbols are mapped to a first time domain unit; wherein the first time domain unit is a time domain unit occupied by the first signal, and the first modulation symbol is a modulation symbol of the first modulation. The method according to any one of claims 1 to 37 is characterized in that the first signal is obtained by scrambling the binary sequence; wherein the sequence used for scrambling includes at least one of the following: a ZC sequence, a QPSK sequence, and a QAM sequence. A signal transmission method, characterized in that the method is performed by a terminal device, and the method comprises: A first signal is received, where the first signal is generated based on a binary sequence, and the first signal is used for radio resource management RRM measurement and/or downlink synchronization. The method according to claim 39 is characterized in that the binary sequence is associated with a cell identifier. The method according to claim 39 or 40 is characterized in that the binary sequence includes a gold sequence, and different cell identifiers correspond to different gold sequences. The method according to claim 41, characterized in that the sequence element numbered n in the gold sequence is determined according to the sequence element numbered a in the first m sequence and the sequence element numbered b in the second m sequence; The first m-sequence is one m-sequence in a preferred m-sequence pair, and the second m-sequence is the other m-sequence in the preferred m-sequence pair. The method according to claim 42 is characterized in that the sequence element numbered n in the gold sequence is the first product, and the first product is the product of the first difference and the second difference; wherein the first difference is the difference between the value 1 and the second product, and the second product is the product of the value 2 and the sequence element numbered a in the first m sequence; the second difference is the difference between the value 1 and the third product, and the third product is the product of the value 2 and the sequence element numbered b in the second m sequence. The method according to claim 42 is characterized in that the sequence element numbered n in the gold sequence is the modulo-2 result of the sum of the sequence element numbered a in the first m sequence and the sequence element numbered b in the second m sequence. The method according to any one of claims 42 to 44 is characterized in that a is determined according to at least one of the following: n, parameter _m0 , and a first length value; b is determined according to at least one of the following: n, parameter _m1 , and the first length value; wherein n is greater than or equal to 0 and less than the first length value, the first length value is a length value of the first m-sequence and the second m-sequence, the parameter _m0 represents a cyclic offset when the first m-sequence is used to generate the gold sequence, and the parameter _m1 represents a cyclic offset when the second m-sequence is used to generate the gold sequence. The method according to claim 45 is characterized in that a is determined according to a first modulo result, the second modulo result is the modulo result of the first sum value and the first length value, and the first sum value is the sum of n and the parameter _m0 ; b is determined according to a second modulo result, the second modulo result is the modulo result of the second sum value and the first length value, and the second sum value is the sum of n and the parameter _m1 . The method according to any one of claims 42 to 46 is characterized in that the numbering of the first m-sequence is agreed upon by a communication protocol, or indicated by a network device, or determined by the terminal device according to rules agreed upon by a communication protocol; the numbering of the second m-sequence is agreed upon by a communication protocol, or indicated by a network device, or determined by the terminal device according to rules agreed upon by a communication protocol. The method according to any one of claims 42 to 46 is characterized in that the numbering of the m-sequence preferred pairs is agreed upon by a communication protocol, or is indicated by the network device, or is determined by the terminal device according to rules agreed upon by a communication protocol. The method according to any one of claims 41 to 48 is characterized in that the gold sequence is a first gold sequence, the first gold sequence is obtained by performing modulo-2 addition of cyclic shift sequences of a first m-sequence and a second m-sequence, and the first m-sequence and the second m-sequence constitute an m-sequence preferred pair. The method according to any one of claims 41 to 48 is characterized in that the gold sequence is a second gold sequence, the second gold sequence is obtained by performing modulo-2 addition of a cyclic shift sequence of a first m sequence and a cyclic shift sequence of a second m sequence, and the first m sequence and the second m sequence constitute an m sequence preferred pair. The method according to any one of claims 41 to 48 is characterized in that the gold sequence is a third gold sequence, the third gold sequence is obtained by cyclic shifting the first gold sequence, the first gold sequence is obtained by modulo-2 addition of cyclic shift sequences of a first m-sequence and a second m-sequence, and the first m-sequence and the second m-sequence constitute an m-sequence preferred pair. The method according to claim 39 or 40 is characterized in that the binary sequence includes an m-sequence, and different cell identifiers correspond to different m-sequences. The method according to claim 52, characterized in that the m-sequence comprises two m-sequences in an m-sequence set, The two m-sequences include a first m-sequence and a second m-sequence, wherein the first m-sequence is one m-sequence in a preferred pair of m-sequences, and the second m-sequence is the other m-sequence in the preferred pair of m-sequences. The method according to claim 53 is characterized in that the first signal includes a first sub-signal and a second sub-signal, the first sub-signal is generated according to the first m-sequence, and the second sub-signal is generated according to the second m-sequence. The method according to claim 54 is characterized in that the sequence element numbered _n1 in the sequence of the first sub-signal is determined according to the sequence element numbered a in the first m-sequence; and the sequence element numbered _n2 in the sequence of the second sub-signal is determined according to the sequence element numbered b in the second m-sequence. The method according to claim 55 is characterized in that the sequence element numbered _n1 in the sequence of the first sub-signal is the first difference, and the sequence element numbered _n2 in the sequence of the second sub-signal is the second difference; wherein the first difference is the difference between the value 1 and the second product, and the second product is the product of the value 2 and the sequence element numbered a in the first m-sequence; the second difference is the difference between the value 1 and the third product, and the third product is the product of the value 2 and the sequence element numbered b in the second m-sequence. According to any one of the methods described in claims 52 to 56, the numbering of the m-sequence included in the binary sequence is agreed upon by a communication protocol, or is indicated by the network device, or is determined according to rules agreed upon by a communication protocol. The method according to any one of claims 53 to 56 is characterized in that the numbering of the m-sequence preferred pairs is agreed upon by a communication protocol, or is indicated by the network device, or is determined according to rules agreed upon by a communication protocol. The method according to claim 55 or 56 is characterized in that a is determined according to at least one of the following: n ₁ , parameter m ₀ , and a first length value; b is determined according to at least one of the following: n ₁ , parameter m ₁ , and the first length value; wherein n is greater than or equal to 0 and less than the first length value, the first length value is the length value of the first m-sequence and the second m-sequence, the parameter m ₀ represents a cyclic offset when the first m-sequence is used to generate a sequence of the first sub-signal, and the parameter m ₁ represents a cyclic offset when the second m-sequence is used to generate a sequence of the first sub-signal. The method according to claim 45, 46 or 59 is characterized in that the parameter _m0 is determined according to the first sub-identifier, and the parameter _m1 is determined according to the second sub-identifier; or, the parameter _m0 is determined according to the second sub-identifier, and the parameter _m1 is determined according to the first sub-identifier; or, the parameter _m0 is determined according to the first sub-identifier and the second sub-identifier, and the parameter _m1 is determined according to the first sub-identifier; or, the parameter _m0 is determined according to the first sub-identifier, and the parameter _m1 is determined according to the first sub-identifier and the second sub-identifier. The method according to claim 60 is characterized in that the first sub-identifier and the second sub-identifier are determined according to the cell identifier and/or the cyclic shift step size. The method according to claim 60 or 61 is characterized in that the parameter _m0 is determined according to the modulo result of the first sub-identifier and parameter G, and the parameter _m1 is determined according to the modulo result of the second sub-identifier and parameter F; or, the parameter _m1 is determined according to the modulo result of the first sub-identifier and parameter G, and the parameter _m0 is determined according to the modulo result of the second sub-identifier and parameter F. The method according to claim 60 or 61 is characterized in that the parameter _m0 is determined according to the quotient of the first sub-identifier and parameter B and the second sub-identifier, and the parameter _m1 is determined according to the modulus result of the first sub-identifier and the parameter B; or, the parameter _m1 is determined according to the quotient of the first sub-identifier and parameter B and the second sub-identifier, and the parameter _m0 is determined according to the modulus result of the first sub-identifier and the parameter B; wherein the parameter B is less than the first length value. The method according to any one of claims 45 or 46 or 59 to 63 is characterized in that the parameter _m0 is less than or equal to the first length value, and the parameter _m1 is less than or equal to the first length value. The method according to claim 64 is characterized in that the m-sequence is an m-sequence in an m-sequence subset, and the number of the m-sequence in the m-sequence subset is determined according to a cell identifier; wherein each m-sequence in the m-sequence subset corresponds one-to-one to each cell identifier in the communication system. The method according to claim 65 is characterized in that the number of the m-sequence in the m-sequence set is equal to the cell identifier. The method according to claim 53, 65 or 66 is characterized in that the number of m-sequences in the m-sequence set is determined according to the number of shift register levels and/or the cyclic shift step size. The method according to claim 53 or 65 or 66 or 67 is characterized in that the numbering order of the m-sequences in the m-sequence set is agreed upon by a communication protocol, or indicated by a network device, or is a default order, or is determined by the terminal device. The method according to claim 68 is characterized in that the numbering sequence of the m-sequences in the m-sequence set is determined according to the following order: the order of primitive polynomial coefficients from high power to low power; the order of primitive polynomial coefficients from low power to high power; the order of binary numbers of primitive polynomial coefficients from small to large; the order of binary numbers of primitive polynomial coefficients from large to small; the order of cyclic offsets from small to large; the order of cyclic offsets from large to small. The method according to claim 68 or 69 is characterized in that each cyclic shift sequence in the m-sequence set is arranged after the corresponding basic m-sequence in descending order according to the cyclic offset; or each cyclic shift sequence in the m-sequence set is arranged after the corresponding basic m-sequence in descending order according to the cyclic offset; or all cyclic shift sequences in the m-sequence set are arranged after the corresponding basic m-sequence in descending order according to the cyclic offset. The cyclic shift sequences are arranged after all the basic m-sequences in descending order according to the cyclic offset; or, all the cyclic shift sequences in the m-sequence set are arranged after all the basic m-sequences in descending order according to the cyclic offset. The method according to any one of claims 39 to 70, characterized in that the method further comprises: Receive at least one of the following information: the number of the gold sequence, the number of the first m sequence, the number of the second m sequence, the number of the m sequence preferred pair, the number of the m sequence, the cyclic shift step, the numbering order of the m sequence in the m sequence set, and the number of the m sequence subset. The method according to any one of claims 39 to 71 is characterized in that the time domain resources occupied by the first signal are continuous or discontinuous. The method according to claim 72 is characterized in that the time domain resources occupied by the first signal include at least two groups of time domain units, there is a time domain interval or there is no time domain interval between the at least two groups of time domain units, and each group of time domain units in the at least two groups of time domain units is continuous or discontinuous. The method according to any one of claims 39 to 73 is characterized in that the first signal is obtained by a first modulation according to the binary sequence, and the first modulation includes one of the following: OOK modulation, PSK modulation, BPSK modulation, and FSK modulation. The method according to claim 74 is characterized in that a first modulation symbol is mapped to a first time domain unit, or a plurality of first modulation symbols are mapped to a first time domain unit; wherein the first time domain unit is a time domain unit occupied by the first signal, and the first modulation symbol is a modulation symbol of the first modulation. The method according to any one of claims 39 to 75 is characterized in that the first signal is obtained by scrambling the binary sequence; wherein the sequence used for scrambling includes at least one of the following: a ZC sequence, a QPSK sequence, and a QAM sequence. A signal transmission device, characterized in that the device comprises: The sending module is used to send a first signal, where the first signal is generated based on a binary sequence and is used for radio resource management RRM measurement and/or downlink synchronization. A signal transmission device, characterized in that the device comprises: The receiving module is used to receive a first signal, where the first signal is generated based on a binary sequence and is used for radio resource management RRM measurement and/or downlink synchronization. A communication device, characterized in that the communication device comprises: A processor; a receiver and/or transmitter connected to the processor; a memory for storing executable instructions of the processor; wherein the communication device is used to implement the signal transmission method as described in any one of claims 1 to 38, or any one of claims 39 to 76. A communication device, characterized in that the communication device comprises: a receiver and/or a transmitter; wherein the communication device is used to implement the signal transmission method as described in any one of claims 39 to 76. A computer-readable storage medium, characterized in that executable instructions are stored in the readable storage medium, and the executable instructions are loaded and executed by a processor to implement the signal transmission method as described in any one of claims 1 to 38, or any one of claims 39 to 76. A chip, characterized in that the chip includes a programmable logic circuit or a program, and the chip is used to implement the signal transmission method as described in any one of claims 1 to 38, or any one of claims 39 to 76. A computer program product, characterized in that the computer program product includes computer instructions, the computer instructions are stored in a computer-readable storage medium, a processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the signal transmission method as described in any one of claims 1 to 38, or any one of claims 39 to 76. A computer program, characterized in that the computer program includes computer instructions, and the processor of a computer device executes the computer instructions, so that the computer device executes the signal transmission method as described in any one of claims 1 to 38, or any one of claims 39 to 76.