Signal transmission method and apparatus, and device and medium

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

[0001] The present application relates to the field of communications, and in particular to a signal transmission method, apparatus, device, and medium. Background Art

[0002] Due to their low complexity, some communications devices struggle to receive or process common Orthogonal Frequency-Division Multiplexing (OFDM) signals. The ZC sequence commonly used to generate OFDM signals is no longer suitable. Furthermore, for some communications devices, receiving OFDM signals is not an optimal option due to operating frequency band limitations.

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

[0004] Summary of the Invention

[0005] This application provides a signal transmission method, apparatus, device, and medium. The technical solution at least includes:

[0006] 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:

[0007] 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.

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

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

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

[0011] 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.

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

[0013] 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.

[0014] According to one aspect of an embodiment of the present application, a communication device is provided, the communication device including:

[0015] a processor; a receiver and / or a transmitter connected to the processor; a memory for storing executable instructions for the processor;

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

[0017] 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;

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

[0019] 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.

[0020] According to one aspect of the present application, a computer program product is provided, which includes computer instructions, wherein the computer instructions are stored in a computer-readable storage medium, and 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 described in the above aspect.

[0021] 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, is used to implement the signal transmission method as described in the above aspects.

[0022] According to one aspect of the present application, a computer program is provided, which includes computer instructions. 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.

[0023] The technical solutions provided by the embodiments of the present application may have the following beneficial effects:

[0024] 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 containing 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, RRM measurement, etc. in the millimeter wave frequency band. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] 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. For ordinary technicians in this field, other drawings can be obtained based on these drawings without any creative work.

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

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

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

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

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

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

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

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

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

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

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

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

[0038] FIG13 shows a schematic diagram of cyclic shift provided by an exemplary embodiment of the present application;

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

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

[0041] FIG16 shows a schematic diagram of time domain resource mapping provided by an exemplary embodiment of the present application;

[0042] FIG17 shows a schematic diagram of time domain resource mapping provided by an exemplary embodiment of the present application;

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

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

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

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

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

[0048] FIG23 shows a schematic structural diagram of a communication device provided by an exemplary embodiment of the present application;

[0049] FIG24 shows a schematic structural diagram of a communication device provided by an exemplary embodiment of the present application. DETAILED DESCRIPTION

[0050] To make the objectives, technical solutions, and advantages of the present application more clear, the embodiments of the present application will be further described in detail below with reference to the accompanying drawings. Exemplary embodiments will be described in detail herein, with examples 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 embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Instead, they are merely examples of devices and methods consistent with certain aspects of the present application, as detailed in the appended claims.

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

[0052] It should be understood that although the terms first, second, third, etc. may be used in this application to describe various information, such information should not be limited to these terms. These terms are only used to distinguish information of the same type from each other. For example, without departing from the scope of this application, first information may also be referred to as second information, and similarly, second information may also be referred to as 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".

[0053] 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.

[0054] The network device 110 in the present application provides wireless communication functions, and the network device 110 includes but is not limited to: Evolved Node B (eNB), Radio Network Controller (RNC), Node B (NB), Base Station Controller (BSC), Base Transceiver Station (BTS), Home Base Station (e.g., Home Evolved Node B, or Home Node B, HNB), Baseband Unit (BBU), Access Point (AP) in Wireless Fidelity (Wi-Fi) system, Wireless Relay Node, Wireless Backhaul Node, Transmission Point (TP) or Transmission and Reception Point (TRP), etc., and can also be the Next Generation Node B (NGNB) in the 5th 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 transmission point, such as a baseband unit (BBU) or 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 slice, etc., or a reader / writer of a radio frequency identification (RFID) system.

[0055] The terminal device 120 and / or terminal device 130 in this 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, and user device. The terminals include, but are 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 (MIDs), augmented reality (AR) terminals, virtual reality (VR) terminals, and mixed reality (MR) terminals, wearable devices, handles, wireless terminals in industrial control, wireless terminals in self-driving, wireless terminals in remote medical care, wireless terminals in smart grids, wireless terminals in transportation safety, wireless terminals in smart cities, wireless terminals in smart homes, wireless terminals in remote medical surgery, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loops (WLANs), and wireless terminals in industrial control. Loop (WLL) stations, personal digital assistants (PDA), TV set-top boxes (STB), customer premises equipment (CPE), etc.

[0056] 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.

[0057] In some embodiments, there are two communication scenarios between the network device 110 and the terminal device 120: uplink communication scenario and 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.

[0058] 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.

[0059] In some embodiments, there are two communication scenarios between terminal device 120 and terminal device 130: a first sideline communication scenario and a second sideline communication scenario. The first sideline communication refers to sending signals to terminal device 130, while the second sideline communication refers to sending signals to terminal device 120.

[0060] 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.

[0061] 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 for Microwave Access (WiMAX) communication system, 5G mobile communication system, New Radio (NR) system, NR system evolution system, LTE on unlicensed spectrum (LTE-U) system, NR on unlicensed spectrum (NR-based access to unlicensed spectrum) system. Unlicensed spectrum, NR-U) system, terrestrial communication network (Terrestrial Networks, TN) system, non-terrestrial communication network (Non-Terrestrial Networks, NTN) system, wireless local area network (Wireless Local Area Networks, WLAN), wireless fidelity (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, can also be applied to the subsequent evolution system of the 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.Among them, the 5G mobile communication system may include non-standalone networking (NSA) and / or standalone networking (SA).

[0062] The technical solutions 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, the IoT network can include, for example, the Internet of Vehicles. Among them, the communication mode in the Internet of Vehicles 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.

[0063] 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.

[0064] Low-power devices:

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

[0066] A 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.

[0067] 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.

[0068] 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:

[0069] (1) Passive devices; Passive devices do not require built-in batteries. When a passive device approaches 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 network device antenna. Therefore, the passive device antenna generates an induced current through electromagnetic induction, and the induced current drives the low-power chip circuit of the passive device. This realizes the demodulation of the forward link signal and the modulation of the backward 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.

[0070] 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 components 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.

[0071] 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.

[0072] (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 the demodulation of the forward link signal and the modulation of the backward link signal. For the backscatter link, the semi-passive device can use backscattering to transmit the signal. The semi-passive device can also have the ability to actively transmit, that is, in addition to communicating through backscattering, the backward link can also use active transmission to communicate.

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

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

[0075] (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 realize the demodulation of the forward link signal and the 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 the reverse link transmission is realized by backscattering, thereby achieving the effect of zero power consumption. The active device can also have the ability to actively transmit, that is, in addition to communicating by backscattering, the reverse link can also use active transmission to communicate.

[0076] Despite having built-in batteries, these active devices have extremely low power consumption and complexity, allowing the battery capacity to be set within a narrow range, resulting in lower cost and size. The built-in battery in the active device can also serve as an energy storage unit, storing ambient energy collected by the energy harvesting module. This reduces the maintenance cycle of the active device, or even makes it maintenance-free.

[0077] Active devices use built-in batteries to increase their communication range, for example, by increasing the read / write distance of electronic tags, thereby improving communication reliability. Therefore, active devices are used in scenarios where communication distance and read latency are relatively high.

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

[0079] (1) Low-power devices based on backscattering: These devices use the backscattering method described above for uplink data transmission. These devices do not have an active transmitter for active transmission, but only a backscattering transmitter. Therefore, when these devices transmit uplink data, they need network equipment to provide a carrier. These devices use backscattering based on the carrier to achieve uplink data transmission.

[0080] (2) Low-power devices based on active transmitters: These devices use active transmitters with active transmission capabilities for uplink data transmission. Therefore, when sending uplink data, these devices can use their own active transmitters 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 and ultra-low-power FSK transmitters. Based on current implementations, when transmitting a 100-microwatt signal, the overall power consumption of these transmitters can be reduced to 400-600 microwatts.

[0081] (3) Low-power devices with both backscatter and active transmitters: These devices can support both backscatter and active transmitters. They can determine whether to use backscatter or active transmitters based on different situations (such as different power levels, different available environmental energy levels), or based on the scheduling of network devices.

[0082] 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 that is a low-power device.

[0083] The terminal device 140, which is a low-power device, includes an energy harvesting module 321. Optionally, in addition to the energy harvesting module 321, the terminal device 140 also includes a backscatter communication module 322. Optionally, in addition to the energy harvesting 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 harvesting module 321, the terminal device 140 also includes a sensor module 324. Optionally, in addition to the energy harvesting module 321, the terminal device 140 also includes a memory (not shown in the figure). Optionally, in addition to the energy harvesting module 321, the terminal device 140 also includes one or more of the backscatter communication module 322, the logic processing module 323, the sensor module 324 and the memory.

[0084] 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., to provide energy for driving the various modules 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 the 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 in itself (such as an identity identifier or pre-written information, such as the production date, brand, manufacturer, etc. of the product). The sensor module 324 can include various sensors, and the terminal device 140 can report the data collected by various sensors based on a low-power 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.

[0085] 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. The hardware design can be very simple, making the terminal device 140 very low in cost and small in size.

[0086] It should be understood that the modules included in the terminal device 140 shown in FIG2 are merely examples and not limiting.

[0087] Figure 3 shows a schematic diagram of radio frequency power harvesting (RFP) performed by energy harvesting module 321. RF energy harvesting is based on the principle of electromagnetic induction. The RF module (RF) uses electromagnetic induction, connected in parallel with a capacitor (C) and a load resistor (RL), to harvest electromagnetic wave energy from space. This energy is used to power low-power devices, such as demodulators, modulators, sensors, and memory readers. This allows low-power devices to be powered without traditional batteries.

[0088] Figure 4 shows a schematic diagram of backscatter communication module 322 performing backscatter communication. Terminal device 140 receives wireless signal carrier 131 transmitted by network device 110's transmitter (TX) module 111 using amplifier (AMP) 112. Terminal device 140 modulates wireless signal carrier 131, loads the information to be transmitted using logic processing module 323, and harvests radio frequency energy using energy harvesting module 321. Terminal device 140 radiates modulated reflected signal 132 using antenna 316. This information transmission process is called backscatter communication. Network device 110's receiver (RX) module 113 receives modulated reflected signal 132 using low-noise amplifier (LNA) 114. Backscatter and load modulation are closely related. Load modulation achieves modulation by adjusting and controlling the circuit parameters of the terminal device 140's oscillator circuit according to the data stream's rhythm, causing parameters such as the impedance of the terminal device 140 to change accordingly.

[0089] Load modulation technology mainly includes resistive load modulation and capacitive load modulation. Figure 5 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 code 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. For example, 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 resonant frequency of the circuit can be changed by turning the capacitor on and off, realizing frequency shift keying (FSK), that is, the operating frequency of the backscattered signal of the terminal device is adjusted to achieve signal modulation and transmission.

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

[0091] 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 PAs and RF filters; (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 require its own energy consumption.

[0092] 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.

[0093] 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 working environments and natural environments; (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 temperatures), and intelligent control of various facilities in agricultural greenhouses (automatic irrigation and fertilization).

[0094] Wake-Up Receiver (WUR):

[0095] 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, and it mainly receives energy-saving signals based on envelope detection. Therefore, the energy-saving signals received by WUR are different from the conventional PDCCH-based signals in terms of modulation mode, waveform, etc. The energy-saving signal is mainly an envelope signal that performs ASK modulation on the carrier signal. The demodulation of the envelope signal can also be completed based on the energy provided by the wireless radio frequency signal to drive the low-power circuit, so it can be passive. WUR can also be powered by the UE. Regardless of the power supply method, WUR greatly reduces power consumption compared to the traditional receiver of the 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 the UE as an additional module of the traditional receiver of the UE, or it can be a separate module of the UE, such as a wake-up function module.

[0096] The block diagram of the receiver system including WUR is shown in Figure 6. WUR receives energy-saving signals. If the UE needs to turn on the main transceiver (Main Radio) 101, the network device can turn on the UE's main transceiver 101 by sending a wake-up signal (Wake Up Signal, WUS). Otherwise, the UE's main transceiver 101 may be in an off state. Therefore, the UE can use WUR 103 to monitor WUS, and the UE can always use WUR 103 when there is no business or no paging message. Only when there is business, the UE receives WUS and wakes up the main transceiver 101 for data transmission and reception. Therefore, compared with the traditional UE's mode of always using the main transceiver, WUR 103 can significantly reduce the overall power consumption of the UE and achieve energy saving on the UE side.

[0097] On the one hand, the WUR can be used as an auxiliary receiver for 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 the WUR can also be used as a receiver of a low-power device to receive downlink signals (such as control signaling and downlink data sent by a network device). For example, the terminal device 140 shown in FIG2 receives downlink signals through a low-power receiver (similar to the WUR), so that the terminal device 140 can achieve energy saving.

[0098] Figure 7 is a schematic diagram of the encoding methods used by the communication devices shown in Figures 1, 2, and 6. The signals transmitted by the communication devices shown in Figures 1, 2, and 6 can use different forms of codes to represent binary "1" and "0," that is, use different pulse signals to represent "0" and "1." Several encoding methods are described here:

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

[0100] Manchester encoding: Manchester encoding is also known as split-phase coding. In Manchester encoding, a binary value is represented by a change in level (rising or falling) during half a bit period within the bit length. A negative transition during half a bit period represents a binary "1," and a positive transition during half a bit period represents a binary "0." Manchester encoding is often used for data transmission from low-power devices to network devices when using carrier load modulation or backscatter modulation, as it facilitates detection of data transmission errors. This is because Manchester encoding does not allow for a "no change" state within the bit length. When multiple low-power devices simultaneously transmit data bits with different values, the received rising and falling edges cancel each other, resulting in an uninterrupted carrier signal throughout the entire bit length. Since this state is not allowed, network devices can use this error to determine the specific location of the collision. Figure 6 shows a schematic diagram of the levels of the binary data 101100101001011 encoded using the Manchester method.

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

[0102] Differential Binary Phase (DBP) encoding: In DBP encoding, any edge within half a bit period represents a binary "0," while the absence of an edge represents a binary "1." Furthermore, the voltage level is inverted at the beginning of each bit period. This makes it easier for the receiver to reconstruct the bit clock. Figure 6 shows a voltage level diagram for the binary data 101100101001011 encoded using the DBP method.

[0103] Miller encoding: In Miller encoding, any edge within half a bit period represents a binary "1," while a constant level throughout the next bit period represents a binary "0." The level transition at the beginning of a bit period makes it easier for the receiver to reconstruct the bit clock. Figure 6 shows a schematic diagram of the levels of the binary data 101100101001011 encoded using the Miller method.

[0104] 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.

[0105] 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.

[0106] Downlink synchronization:

[0107] To establish a connection with a network device, a terminal device must synchronize time and / or frequency with the network device. Downlink synchronization is the process by which a terminal device maintains time and / or frequency synchronization with the network device based on the downlink signal sent by the network device. The downlink signal used to achieve downlink synchronization is called a synchronization signal.

[0108] Radio Resource Management (RRM) measurements:

[0109] RRM manages channel interference and radio resources in wireless communication systems, aiming to ensure high-quality service quality for terminal devices within limited bandwidth. RRM is implemented through RRM measurement and reporting by terminal devices. Terminal devices measure and report downlink signals sent by network devices, enabling network devices to promptly adjust one or more parameters, such as channel, power, bandwidth, and beam, enabling wireless networks to quickly adapt to environmental changes and maintain high service quality within the communication system. The downlink signals used for RRM measurements can be referred to as measurement signals, reference signals, or other such signals.

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

[0111] 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 for 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 for RRM measurement.

[0112] When a terminal device containing WUR performs downlink synchronization and RRM measurement, the 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.

[0113] Exemplarily, the 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 the WUR is lower than that of the main transceiver, performing RRM measurements through the WUR can significantly reduce the overall power consumption of the UE. Exemplarily, the WUR replaces part of the RRM measurement tasks, and the main transceiver undertakes another part of the RRM measurement tasks, reducing the duration and number of RRM measurements performed by the main transceiver, thereby saving the power consumption of the main transceiver.

[0114] Exemplarily, the WUR receives a synchronization signal and performs downlink synchronization. Since the master transceiver does not need to perform downlink synchronization, the master transceiver's power consumption can be saved. After waking up the master transceiver, the master transceiver can directly transmit and receive data based on the WUR's downlink synchronization results, thereby reducing service latency. Exemplarily, the WUR receives a synchronization signal and performs coarse synchronization, waking up the master transceiver to further perform fine synchronization, reducing the duration and steps required for the master transceiver to perform downlink synchronization, thereby saving the master transceiver's power consumption and reducing service latency.

[0115] However, the low-complexity nature of low-power receivers and WURs makes it difficult to support reception of common Orthogonal Frequency-Division Multiplexing (OFDM) waveforms. Therefore, for low-power devices and terminal devices containing WURs, if they wish to perform downlink synchronization and RRM measurements using low-power receivers and WURs, this is difficult to achieve using OFDM-based signals.

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

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

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

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

[0120] m-sequence:

[0121] An m-sequence is the longest code sequence generated by a multi-stage shift register or its delay element through linear feedback. It is also known as 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 a bit and the feedback function adds one bit, the shift register moves to the next state.

[0122] In a binary shift register, if r is the number of stages of the shift register, there are 2 stages of the r-stage shift register. r states, excluding the all-0 state, there are 2 r -1 state, so the maximum length of the code sequence it can generate is 2 r -1 bit, that is, the longest period generated by an r-stage linear feedback shift register is equal to 2 r -1.

[0123] First, let's introduce the linear feedback shift register. Figure 8 shows the general structure of the linear feedback shift register. Assume that the initial state of the shift register is (a0a1…a r-2 a r-1 ). After one shift linear feedback, the input of the first stage on the left side of the shift register is shown in the following formula (1).

[0124] 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).

[0125] Here, e = r + f - 1 ≥ r, and f = 1, 2, 3, .... Thus, the input to the first stage of the shift register is affected by the feedback logic and the initial state of the shift register. Equation (2) is called the recursive relation for an r-stage linear feedback shift register.

[0126] Referring to the recursive relationship described in formula (2), depending on the initial state, the r-level shift register can generate 2 r -1 non-constant zero sequence. Therefore, the maximum length of the code sequence that can be generated by an r-level linear feedback shift register is 2 r -1 bit, that is, the longest period of the sequence generated by an r-level linear feedback shift register is equal to 2 r -1.

[0127] 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. iIf it exists, it means c i =1, otherwise c i =0, the value of x itself has no practical meaning. i The value of determines the feedback link of the shift register. r =1, therefore, f(x) is an r-degree polynomial with a constant term of 1.

[0128] 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 factored; (2) f(x) is divisible by (x p +1), where p = 2 r -1; (3) f(x) cannot divide (x q +1), where q<p.

[0129] 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-degree primitive polynomial to generate the m-sequence. In other words, f(x) must not be factorized any further and must be divisible by (x 15 +1), and f(x) cannot divide (x q +1), q<15.

[0130] First, (x 15 +1) factorization, as shown in the following formula (4), so that (x 15 +1) are reduced polynomials, and then find f(x). 15 +1=(x+1)(x 2 +x+1)(x 4 +x+1)(x 4 +x 3 +1)(x 4 +x 3 +x 2 +x+1) Formula (4)

[0131] Among them, (x 15 +1) has 3 fourth-order factors. But (x 4 +x 3 +x 2 +x+1) can divide (x 5 +1), so (x 4 +x 3 +x 2+x+1) is not a primitive polynomial. Therefore, we can find two 4th-degree primitive polynomials: (x 4 +x+1) and (x 4 +x 3 +1), any of the polynomials can generate an m-sequence.

[0132] For example, f(x)=x 4 +x+1 as an example, the m-sequence generator is shown in Figure 9. The modulo-2 sum of a0 and a3 becomes the new most significant bit, a3, after the sequence is right-shifted, and the least significant bit, a0, is output. Assume the initial state of the four-stage shift register is "1000," c4 = c1 = c0 = 1, and c3 = c2 = 0. After 15 cycles, the least significant bit of each shift output forms the m-sequence, resulting in the m-sequence "100110101111000."

[0133] The m-sequence is balanced. In one cycle of the m-sequence, the number of "1"s and "0"s is roughly equal. More precisely, the number of "1"s is one more than the number of "0"s.

[0134] The run distribution of the m-sequence also has characteristics. The 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 of the total number of runs in the m-sequence. -h , and in a run of length h, half are runs of consecutive "1s" and half are runs of consecutive "0s." For example, in the m-sequence "100110101111000," there are 8 runs. Of these, there is one run of length 4, namely 1111. There is one run of length 3, namely 000. There are two runs of length 2, namely 11 and 00. There are four runs of length 1, namely two "1s" and two "0s."

[0135] The sequence obtained by adding an m-sequence modulo 2 to its shifted sequence is still a shifted sequence of the m-sequence. This property is called the shift-and-add property of m-sequences, also known as linear superposition. The term "shifted sequence" refers to the basic m-sequence. The sequence obtained by cyclically shifting the basic m-sequence is also called a shifted sequence. For more information, see the "Cyclic Shift" section below.

[0136] The m-sequence has a good autocorrelation property. Assume that the autocorrelation function of the m-sequence is defined as Equation (5). Where A is the number of elements in a period of the m-sequence that are identical to its j-th shifted sequence, D is the number of elements in a period of the m-sequence that are different from its j-th shifted sequence, and L is the period of the m-sequence.

[0137] Formula (5) can also be rewritten as Formula (6).

[0138] According to the shift-add characteristic of m sequence, is still an element of the m-sequence. Therefore, the numerator of formula (6) is equal to the difference between the number of "0" and the number of "1" in one period of the m-sequence.

[0139] 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".

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

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

[0142] Gold Sequence:

[0143] Gold sequences are code sequences obtained from optimal pairs of m-sequences. First, we introduce optimal pairs of m-sequences. 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 satisfies Equation (8).

[0144] Two m-sequences that satisfy equation (8) are called a preferred m-sequence pair. A gold sequence is constructed by adding the m-sequences modulo 2. Furthermore, each cyclic shift of one m-sequence yields a new gold sequence. Therefore, compared to m-sequences, a significant advantage of gold sequences is that they can yield more independent code sequences.

[0145] Gold sequences have good cross-correlation properties and still possess similar properties to m-sequences, such as excellent balance, run-length distribution, and autocorrelation. Furthermore, the maximum cross-correlation value between the gold sequences obtained from a pair of optimal m-sequences will not exceed the maximum cross-correlation value between the pair of optimal m-sequences.

[0146] Walsh Sequence:

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

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

[0149] 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 can be obtained: (1,1,1,1), (1,-1,1,-1), (1,1,-1,-1), (1,-1,-1,1).

[0150] Walsh sequences are orthogonal sequences, meaning that all elements in a Walsh sequence are orthogonal and do not interfere with each other. Each Walsh sequence is a binary sequence whose length is a power of 2, such as 2, 4, 8, 16, and so on. Walsh sequences are symmetric, meaning that the positive and negative versions of a Walsh sequence are identical, just in reverse order. Walsh sequences also exhibit good cross-correlation properties.

[0151] 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 equipment (such as terminal equipment, network equipment), and this application does not limit its specific implementation method. Communication protocol agreement can also be understood as pre-defined by the communication protocol.

[0152] FIG10 is 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 includes:

[0153] 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.

[0154] The first signal involved in this application can be used for both downlink synchronization and RRM measurement. Therefore, the first signal can also be referred to as 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.

[0155] A binary sequence includes only sequence elements with two possible values. Therefore, the sequence of the first signal also includes only sequence elements with two possible values. For example, the sequence of the first signal includes only "0" and "1", or the sequence of the first signal includes only "+1" and "-1".

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

[0157] In some embodiments, the modulation mode 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.

[0158] It should be noted that the types of binary sequences provided in this 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 this application.

[0159] 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.

[0160] 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, RRM measurement and other requirements in the millimeter wave frequency band.

[0161] Next, taking the generation of the first signal based on the gold sequence as an example, the generation of the first signal based on the gold sequence is further introduced based on step 1010.

[0162] FIG11 is 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 includes:

[0163] 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.

[0164] 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 preferred m-sequences are referred to as the first m-sequence and the second m-sequence. It will be understood that in this application, the names such as "first," "second," "third," "fourth," and "fifth" are only used to distinguish the descriptions and do not mean to restrict the order, naming, etc. of the m-sequences. For example, the first m-sequence is any one m-sequence in the preferred m-sequence pair, and the second m-sequence is the other m-sequence in the preferred m-sequence pair.

[0165] This application provides three ways to generate gold sequences:

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

[0167] Assuming 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 sequence, plus the first m sequence and the second m sequence itself, then, at most 2 can be obtained through method 1. r -1+2=2 r +1 gold sequence.

[0168] For the sake of distinction, the gold sequences generated by method 1 can be referred to as the first gold sequence family, and the gold sequences included in the first gold sequence family are called first gold sequences. The first gold sequence family includes at most 2 r +1 first gold sequence. For example, if r=5, a maximum of 33 first gold sequences can be obtained through method 1.

[0169] 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 contain, but it does not mean that the first gold sequence family must contain 2 r +1 first gold sequence.

[0170] 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 L0 of the first m-sequence, the length L1 of the second m-sequence, the cyclic offset, and the cyclic shift step.

[0171] 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.

[0172] Assuming that the number of optimal pairs of m sequences is M, then 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 aforementioned formula (8), and represents the number of optimal pairs of m sequences that can be found when the stage is r.

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

[0174] Assuming 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 sequence.

[0175] Assuming the number of shift register stages is r, if the second m sequence remains unchanged, after the first m sequence is cyclically shifted, the cyclic shift sequences of the fifth m sequence and the fourth m sequence are added modulo 2, and at most 2 r -1 gold sequence.

[0176] Then, the first m sequence is cyclically shifted, and the second m sequence is cyclically shifted, and the cyclic shift sequence of the fourth m sequence and the cyclic shift sequence of the fifth m sequence are added modulo 2, and at most (2 r -1)*(2 r -1) gold sequence.

[0177] For the sake of distinction, the gold sequences generated by method 2 can be referred to as the second gold sequence family, and the gold sequences included in the second gold sequence family are called second gold sequences. The second gold sequence family includes at most (2 r -1)*(2 r For example, if r=5, the first m-sequence and the second m-sequence are cyclically shifted respectively, and a maximum of 961 second gold sequences can be obtained.

[0178] 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 sequence.

[0179] 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 L0 of the first m-sequence, the length L1 of the second m-sequence, the cyclic offset, and the cyclic shift step.

[0180] 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.

[0181] Assuming that the number of optimal pairs of m sequences is M, then the upper limit of the number of gold sequences that can be generated by method 2 is M*(2 r -1)*(2 r -1). Wherein, M is determined according to the number of shift register stages r and the aforementioned formula (8), and represents the number of optimal pairs of m sequences that can be found when the stage is r.

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

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

[0184] After a gold sequence is cyclically shifted, it can get up to 2 r -1 gold sequence. Then, 2 r After cyclic shift of +1 gold sequence, we can get (2 r +1)*(2 r -1) gold sequence.

[0185] For the sake of distinction, the 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 called third gold sequences. The third gold sequence family includes at most (2 r +1)*(2 r For example, if r=5, a maximum of 33 first gold sequences can be obtained through method 1, and a maximum of 33*31=1023 third gold sequences can be obtained through method 3.

[0186] It should be noted that (2 r +1)*(2 r -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 (2 r +1)*(2r -1) third gold sequence.

[0187] 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 L0 of the fourth m-sequence, the length L1 of the fifth m-sequence, the cyclic offset, and the cyclic shift step.

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

[0189] Assuming that the number of optimal pairs of m sequences is M, then the upper limit of the number of gold sequences that can be generated by method 3 is M*(2 r +1)*(2 r -1). Wherein, M is determined according to the number of shift register stages r and the aforementioned formula (8), and represents the number of optimal pairs of m sequences that can be found when the stage is r.

[0190] It should be noted that Method 1, Method 2, and Method 3 can be used individually or in combination. In other words, the first, second, and third gold sequence families do not conflict with each other. Different types of gold sequences can coexist in a communication system. For example, the first signal corresponding to cell A is generated according to the first gold sequence, while the first signal corresponding to cell B is generated according to the second gold sequence.

[0191] It can be seen that, compared to Method 1, with the same number of levels, Methods 2 and 3 can obtain more sequences. When it is desired to provide one-to-one correspondence for first signals to more cells, Methods 2 and 3 are more suitable. However, it is clear that Method 3 is more complex than Method 2, and Method 2 is more complex than Method 1. Therefore, if lower complexity is desired when generating the first signal, Method 1 is more suitable.

[0192] In this 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 preferred m-sequence pair.

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

[0194] 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 based on the shift register level r and / or the sequence preference pair m. Optionally, the gold sequence set includes several gold sequence families.

[0195] In some embodiments, the gold sequence corresponding to the first signal is a gold sequence from a family of several gold sequences, wherein the gold sequence set is determined based on the number of shift register stages r and / or the preferred pair of sequences m.

[0196] 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,

[0197] 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.

[0198] The target gold sequence is generated based on the first and second m-sequences—that is, based on a preferred m-sequence pair. Therefore, determining the preferred target m-sequence pair used to generate the target gold sequence—that is, determining the target gold sequence family to which the target gold sequence belongs—is a challenge. The gold sequence family to which the target gold sequence belongs is called the target gold sequence family. The preferred m-sequence pair that generates the target gold sequence family is called the target m-sequence preferred pair.

[0199] The target m-sequence optimal pair is one of the M pairs of m-sequence optimal pairs. If you want to determine the target m-sequence optimal pair, you first need to understand how to generate the M pairs of m-sequence optimal pairs.

[0200] The preferred pairs of M pairs of m-sequences are determined according to the number of shift register stages. For example, when the number of shift register stages is r, a maximum of N first m-sequences can be generated, and the preferred pairs of M pairs of m-sequences are determined from the N first m-sequences according to formula (8).

[0201] As mentioned above, M pairs of m sequence pairs can generate M gold sequence families. For details, refer to the gold sequence generation methods 1, 2, and 3 described above. It is understood that for easy identification, these M gold sequence families should have corresponding numbers or indexes. This embodiment of the application uses numbering as an example for explanation.

[0202] This section involves the numbering order of the M gold sequence families. This concept is briefly introduced here.

[0203] In some embodiments, the numbering order of the M gold sequence families is determined by a network device, or by a communication protocol agreement, or 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 preferred m-sequence pair, the level r, the number of gold sequences within the gold sequence family, the length of the gold sequence within the gold sequence family, the number of the gold sequence family, the number of the gold sequence within 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.

[0204] 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.

[0205] 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 in the order of arrangement. For example, M gold sequence families are formed with the numbering sequence 0, 1, 2, ..., M-1.

[0206] In some embodiments, numbers are first assigned to M gold sequence families, and then the M gold sequence families are arranged according to a specific rule. The numbering order of the M gold sequence families is shuffled, for example, M gold sequence families are numbered in the order of 2, 0, M-1, ..., 1.

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

[0208] Then, the numbering of all m-sequences included in the M-pair m-sequence preferred pair may be consistent with or inconsistent with their numbering in the N m-sequences. For example, after selecting the M-pair m-sequence preferred pair from the N m-sequences, all m-sequences included in the M-pair m-sequence preferred pair continue to use their numbering in the N m-sequences. For another example, after selecting the M-pair m-sequence preferred pair from the N m-sequences, all m-sequences included in the M-pair m-sequence preferred pair are renumbered starting from 0 or 1. Regardless of whether all m-sequences included in the M-pair m-sequence preferred pair 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 numbering.

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

[0210] Illustratively, the number of a preferred m-sequence pair is the number of the first m-sequence in the preferred m-sequence pair. Optionally, the first m-sequence is any m-sequence in the preferred m-sequence pair, or the first m-sequence is an m-sequence with a smaller number in the preferred m-sequence pair, or the first m-sequence is an m-sequence with a larger number in the preferred m-sequence pair, and so on.

[0211] For example, the number of a preferred m-sequence pair is the product of the numbers of the two m-sequences included in the preferred m-sequence pair. For example, if a preferred m-sequence pair includes m-sequences numbered 2 and 4, the number of the preferred m-sequence pair is 8.

[0212] Illustratively, the number of a preferred m-sequence pair is the sum, difference, or modulo result of the numbers of the two m-sequences included in the preferred m-sequence pair.

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

[0214] In some embodiments, the M gold sequence families are arranged in ascending order according to the numbering 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. For example, M=5, the M-pairs of m-sequence preferred pairs are numbered 1, 3, 5, 7, and 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.

[0215] In some embodiments, the M gold sequence families are arranged in descending order according to the numbering 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. For example, M=5, the M-pairs of m-sequence preferred pairs are numbered 9, 7, 5, 3, and 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.

[0216] 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 arranged from large to small according to the numbering values ​​of the gold sequence families.

[0217] 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.

[0218] In some embodiments, the numbering order of the M gold sequence families is consistent with the numbering order of their 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.

[0219] In some embodiments, the M gold sequence families are numbered in ascending order according to the numbers of the M pairs of m-sequence preferred pairs. For example, if 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.

[0220] In some embodiments, the M gold sequence families are numbered in descending order according to the numbers of the M-pair m-sequence preferred pairs. For example, if M=5 and the M-pair m-sequence preferred pairs are numbered 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.

[0221] In some embodiments, the M gold sequence families are numbered in ascending order based on the product of the numbers of the two m-sequences included in each of the M preferred m-sequence pairs. For example, if preferred m-sequence pair A includes m-sequences numbered 2 and 3, then the product of the numbers of the two m-sequences included in preferred m-sequence pair A is 6. If preferred m-sequence pair B includes m-sequences numbered 0 and 5, then the product of the numbers of the two m-sequences included in preferred m-sequence pair B is 0. Therefore, the gold sequence family corresponding to preferred m-sequence pair A is arranged after the gold sequence family corresponding to preferred m-sequence pair B.

[0222] 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-sequences.

[0223] In some embodiments, the M gold sequence families are numbered in ascending order based on the sum of the numbers of the two m-sequences included in each of the M preferred m-sequence pairs. For example, if a preferred m-sequence pair A includes m-sequences numbered 2 and 3, then the sum of the numbers of the two m-sequences included in the preferred m-sequence pair A is 5. If a preferred m-sequence pair C includes m-sequences numbered 0 and 1, then the sum of the numbers of the two m-sequences included in the preferred m-sequence pair C is 1. The gold sequence family corresponding to the preferred m-sequence pair A is then arranged after the gold sequence family corresponding to the preferred m-sequence pair C.

[0224] 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.

[0225] In some embodiments, the numbering order of the M gold sequence families is first arranged based on the m-sequence with the smaller number in the preferred pair, and then arranged based on the m-sequence with the 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 the larger number in the preferred pair, and then arranged based on the m-sequence with the smaller number in the preferred pair.

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

[0227] For example, 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 number values) are first arranged from small to large, 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 sequences F in each preferred pair (i.e., the m-sequences with larger number values) are arranged from small to large, 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}.

[0228] For example, 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 sequence F in each preferred pair is arranged from large to small, the arrangement order of the M pairs of m-sequence preferred pairs can be obtained as: {4, 6}, {1, 5}, {1, 2}, {0, 3}, {0, 1}.

[0229] For example, 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 the preferred pairs of M pairs of m sequences can be obtained as follows: {4, 6}, {1, 5}, {0, 3}, {1, 2}, {0, 1}.

[0230] For example, assuming that the preferred pairs of M pairs of m sequences are {0, 1}, {1, 2}, {0, 3}, {4, 6}, {1, 5}, if the sequence F numbers in each preferred pair are arranged from small to large, the order of the preferred pairs of M pairs of m sequences can be obtained as: {0, 1}, {1, 2}, {0, 3}, {1, 5}, {4, 6}.

[0231] 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.

[0232] 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.

[0233] For example, if the m-sequence pair C is {0,1}, then the first m-sequence in the m-sequence 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 pair D is {2,1}, then the first m-sequence in the m-sequence 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.

[0234] For example, the preferred pairs of M pairs of m-sequences are {0, 1}, {2, 1}, {0, 3}, {4, 6}, and {1, 5}. If the numbers of the first m-sequences in each preferred pair are arranged from small to large, and there are two pairs of preferred m-sequences whose first m-sequences are both numbered 0, and then the numbers of the second m-sequences are arranged from small to large, the order of the preferred pairs of M pairs of m-sequences can be obtained as follows: {0, 1}, {0, 3}, {1, 5}, {2, 1}, and {4, 6}.

[0235] For example, the preferred pairs of M pairs of m-sequences are {0, 1}, {2, 1}, {0, 3}, {4, 6}, and {1, 5}. If the numbers of the second m-sequences in each preferred pair are arranged from large to small, and there are two pairs of preferred pairs of m-sequences whose second m-sequences are both numbered 1, and then the numbers of the first m-sequences are arranged from large to small, the order of the preferred pairs of M pairs of m-sequences can be obtained as follows: {4, 6}, {1, 5}, {0, 3}, {2, 1}, and {0, 1}.

[0236] It can be understood that when arranging according to the first m-sequence and the second m-sequence 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 the primitive polynomial coefficients, the binary numbers of the primitive polynomial coefficients, etc. For details, please refer to the arrangement rules described above.

[0237] 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 specific rules, agreed upon by the communication protocol, or indicated by the network device.

[0238] Illustratively, 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.

[0239] Optionally, the numbering rules within different gold sequence families may be the same or different. Here, taking different numbering rules as an example, the M gold sequence families are first numbered 0, 1, 2, ..., 8 according to the numbering of the m sequence preferred pairs. The gold sequences within the gold sequence family numbered 0 are arranged in ascending order of cyclic offset, and the gold sequences within the remaining numbered gold sequence families are arranged in descending order of cyclic offset. If the numbering rules are the same, for example, the numbering order within the M gold sequence families is either arranged in ascending order of cyclic offset or in descending order of cyclic offset.

[0240] In some embodiments, the design of the numbering order can be understood as a situation where the gold sequence family has both logical and physical numbers. Among them, the logical number refers to the order of the gold sequence family numbers in the data logic, such as the numbers 0, 1, 2…, M-1, or the numbers 1, 2…, M in the embodiment of the present application; the physical number refers to the position of the gold sequence family numbers 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 number and the physical number of the gold sequence family can be the same or different. The reason why the numbering order is disrupted is to take into account the correlation between the gold sequences. 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 adjacent cells can also have 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 number of the gold sequence.

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

[0242] 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.

[0243] It is 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 based on the first signal. Different first signals can be achieved 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 size, and the cell identifier.

[0244] In some embodiments, the target gold sequence family is numbered based on the cell identifier. Because different cells correspond to different cell identifiers, this design naturally implements a mapping between cells and target gold sequence families, enabling each cell to have a corresponding target gold sequence family for generating the first signal, thereby supporting downlink synchronization and RRM measurements in each cell.

[0245] 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.

[0246] In some embodiments, the communication protocol specifies a rule for determining the number of the target gold sequence family based on the cell identifier. For example, the communication protocol specifies a mathematical operation rule between each cell identifier and the target gold sequence family.

[0247] For example, the target gold sequence family number is equal to the cell identifier For example, the target gold sequence family number is equal to the cell identifier The modulo result of M, that is, Exemplarily, the number of the target gold sequence family is determined according to the quotient of the cell identifier and M, for example,

[0248] 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 via at least one of a broadcast message, a system message, RRC signaling, a MAC CE, and the like.

[0249] The network device may directly indicate the target gold sequence family number or information used to determine the target gold sequence family number. For example, the network device may indicate to the terminal device at least one of the following information: the target gold sequence number among 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 target gold sequence family number based on the received information or determine the target gold sequence family number based on the received information.

[0250] 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 a network device. Alternatively, the network device can indicate different information for determining the target gold sequence family numbers to different cells to achieve 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 downlink synchronization and RRM measurement in each cell.

[0251] In some embodiments, the number of the target gold sequence family is determined based on the number of the target gold sequence in the M*Q gold sequences. SSDetermine, where Q represents the number of gold sequences included in each gold sequence family. Optionally, the number of the target gold sequence in the M*Q gold sequences is I SS Determined by the network equipment, or agreed upon by the communication protocol, or determined by the terminal equipment.

[0252] In some embodiments, the number of the target gold sequence family is determined according to at least one of the following: SS , the first starting value e, Q, and the numbering order of the M gold sequence families.

[0253] The first starting value e indicates the starting position of the gold sequence family used to determine the target gold sequence within the M gold sequence families. For example, the M gold sequence families are numbered 5, 1, 0, 4, 3, 2, 7, 8, and 6. If the first starting value e = 3, then when determining the target gold sequence, consideration begins with the third-ranked gold sequence family, i.e., the gold sequence family numbered 0.

[0254] For example, 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 fifth among the M gold sequence families, that is, the gold sequence family numbered 3.

[0255] After finding the target gold sequence family / target m-sequence preferred pair according to the previous content, the target gold sequence can be generated based on the target m-sequence preferred pair.

[0256] Assume that the target m-sequence preferred pair includes a first m-sequence and a second m-sequence, wherein 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.

[0257] In some embodiments, the sequence element numbered n in the target gold sequence is determined based on the sequence element numbered a in the first m-sequence and the sequence element numbered b in the second m-sequence. Alternatively, the value of the nth bit in the target gold sequence is determined based on the value of the ath bit in the first m-sequence and the value of the bth bit in the second m-sequence.

[0258] In some embodiments, a is determined based on at least one of the following: n, parameter m0, and a first length value. b is determined based on at least one of the following: n, parameter m1, and a first length value. Parameter m0 represents a cyclic offset of a first m-sequence when generating a target gold sequence, and parameter m1 represents a cyclic offset of a second m-sequence when generating a target gold sequence.

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

[0260] In some embodiments, a is determined based on a first modulo result, which is a modulo result of the first sum value and the first length value, and the first sum value is the sum of n and a parameter m0.

[0261] In some embodiments, b is determined based on a second modulo result, which is a 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.

[0262] In some embodiments, the sequence element numbered n in the target gold sequence is the first product. This can also be understood as the value of the nth bit in the target gold sequence being 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.

[0263] For example, the target gold sequence can be expressed as formula (9). SS (n) represents the target gold sequence, x0(n) represents the first m sequence used to generate the target gold sequence, x1(n) represents the second m sequence used to generate the target gold sequence, and L represents the first length value. SS (n)=[1-2x0((n+m0)mod L)]·[1-2x1((n+m1)mod L)] (9)

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

[0265] In some embodiments, the sequence element numbered n in the target gold sequence is the modulo-2 sum of the sequence element numbered a in the first m-sequence and the sequence element numbered b in the second m-sequence. Alternatively, the value of the nth bit in the target gold sequence is equal to the modulo-2 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.

[0266] For example, the target gold sequence can be expressed as formula (10). SS (n) represents the target gold sequence, x0(n) represents the first m sequence used to generate the target gold sequence, x1(n) represents the second m sequence used to generate the target gold sequence, and L represents the first length value. SS (n)=[x0((n+m0)mod L)+x1((n+m1)mod L)]mod 2 (10)

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

[0268] In some embodiments, the parameters m0 and m1 are based on the cell identifier Sure.

[0269] 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

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

[0271] In some embodiments, in,

[0272] According to the above formula, it can be seen that a pair of first sub-identifier and second sub-identifier can be uniquely determined based on 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 a pair of first m-sequence and second m-sequence are uniquely determined according to the above method, and when the first m-sequence, second m-sequence, parameter m0, and parameter m1 are all uniquely determined, the target gold sequence d can naturally be uniquely generated. SS (n), achieving a one-to-one correspondence between the cell identifier and the target gold sequence. The target gold sequence is the sequence used to generate the first signal. Therefore, a one-to-one correspondence between the cell identifier and the first signal is also achieved, thereby supporting the terminal device to perform RRM measurement and synchronization of the corresponding cell based on the first signal.

[0273] In some embodiments, the number of the first m-sequence is specified by a communication protocol, or indicated by a network device, or determined according to rules specified 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.

[0274] In some embodiments, the number of the second m-sequence is specified by a communication protocol, or is indicated by a network device, or is determined according to rules specified 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.

[0275] 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.

[0276] Regarding the determination of parameters m0 and m1, the present embodiment provides two calculation methods:

[0277] Calculation method 1:

[0278] In some embodiments, the parameter m0 is determined based on a modulo result of the first sub-identifier and the parameter G, and the parameter m1 is determined based on a modulo result of the second sub-identifier and the parameter F.

[0279] 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,

[0280] 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, Wherein, q1 is a positive integer, and q2 is a positive integer.

[0281] 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.

[0282] 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.

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

[0284] In some embodiments, assuming 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. For example, if 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.

[0285] 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.

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

[0287] 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 register stages is r, the optimal number of m-sequence pairs is M = 2, then, In this case, the first m-sequence x0(n) and the second m-sequence x1(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 and F = 8. Assume that the length of the target gold sequence is L = 63 and k = 3.

[0288] Then, according to Can get

[0289] according to

[0290] If calculated by formula (9), we can get d SS (n)=[1-2x0((n+2)mod 63)]·[1-2x1((n+0)mod 63)], 0≤n<63.

[0291] If calculated by formula (10), we can get d SS (n)=[x0((n+2)mod 63)+x1((n+0)mod 63)]mod 2, 0≤n<63.

[0292] 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 that the target gold sequence family number is 15, L=63, k=3, q1=3, q2=4. Assume that a gold sequence family includes Q=12 gold sequences. The network device indicates that the second starting information = 2. Therefore, the target gold sequence family is the gold sequence family ranked 2+1=3rd among the M gold sequence families. In this case, the first m-sequence x0(n) and the second m-sequence x1(n) correspond to the gold sequence family ranked 3rd among the M gold sequence families.

[0293] Then, according to Can get

[0294] According to F=k, We can get F=3,

[0295] according to

[0296] If calculated by formula (9), we can get d SS (n)=[1-2x0((n+30)mod 63)]·[1-2x1((n+1)mod 63)], 0≤n<63.

[0297] If calculated by formula (10), we can get d SS (n)=[x0((n+30)mod 63)+x1((n+1)mod 63)]mod 2, 0≤n<63.

[0298] Calculation method 2:

[0299] 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.

[0300] In some embodiments, the parameter m0 is determined according to the quotient of the first sub-identifier and the parameter B and the second sub-identifier, and the parameter m1 is determined according to the modulo result of the first sub-identifier and the parameter B.

[0301] For example, Optional, B is a positive integer, f1 is a positive integer, f2 is a positive integer. Optional, Optionally, B is smaller than the first length value, that is, B<L.

[0302] 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.

[0303] 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 register stages is r, the optimal number of m-sequence pairs is M = 6, then, At this time, the first m-sequence x0(n) and the second m-sequence x1(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, f1=15, f2=5, B=112, and k=2.

[0304] Then, according to Can get

[0305] according to

[0306] If calculated by formula (9), we can get d SS (n)=[1-2x0((n+20)mod 127)]·[1-2x1((n+53)mod 127)], 0≤n<127.

[0307] If calculated by formula (10), we can get d SS (n)=[x0((n+20)mod 127)+x1((n+53)mod 127)]mod 2, 0≤n<127.

[0308] 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 target gold sequence family number = 15, k = 3. Assume that a gold sequence family includes Q = 12 gold sequences, If the network device indicates that the second starting information is 2, then the target gold sequence family is the gold sequence family ranked 2+1=3rd among the M gold sequence families. The first m-sequence x0(n) and the second m-sequence x1(n) correspond to the gold sequence family ranked 3rd among the M gold sequence families. Assume that the target gold sequence length L = 63, f1 = 10, f2 = 3, and B = 56.

[0309] Then, according to Can get

[0310] according to

[0311] If calculated by formula (9), we can get d SS (n)=[1-2x0((n+13)mod 63)]·[1-2x1((n+54)mod 63)], 0≤n<63.

[0312] If calculated by formula (10), we can get d SS (n)=[x0((n+13)mod 63)+x1((n+54)mod 63)]mod 2, 0≤n<63.

[0313] 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 based on the first sub-identifier and the second sub-identifier, and parameter m0 is determined based on the first sub-identifier. For example, parameter m1 is determined based on the quotient of the first sub-identifier and parameter B and the second sub-identifier, and parameter m0 is determined based on the modulo result of the first sub-identifier and parameter B. For example,

[0314] 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-sequences in the m-sequence set, and the number of the m-sequence subset.

[0315] In summary, the method provided by the embodiments of the present application uses gold sequences to provide a low-complexity, feasible solution for transmitting synchronization signals and measurement signals. Because gold sequences have excellent autocorrelation and cross-correlation properties, the first signal generated using the gold sequence also exhibits these excellent properties, helping to improve the reliability and efficiency of downlink synchronization and RRM measurements. Furthermore, by cyclically shifting the preferred m-sequence pair, a large number of gold sequences can be obtained, providing a large number of cells with available gold sequences for generating the first signal.

[0316] Next, taking the generation of the first signal based on the m-sequence as an example, the generation of the first signal based on the m-sequence is further described based on step 1010 .

[0317] FIG12 is 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 includes:

[0318] 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.

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

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

[0321] Table 1 shows the upper limit of the number of first m-sequences that can be generated by shift registers of different series. 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.

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

[0323] 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.

[0324] 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 primary 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 shifted sequence, a bit-shifted sequence, a cyclically shifted sequence, an extended m-sequence, a secondary m-sequence, a secondary m-sequence, an auxiliary m-sequence, a second-level m-sequence, etc.

[0325] Here we introduce the relevant concepts of circular shift. As the name suggests, circular shift is to circularly shift the values ​​in a sequence. There are two common types of circular shift: circular left shift and circular right shift. Among them, circular left shift is to move the shifted high bit to the low bit of the sequence, and circular right shift is to move the shifted low bit to the high bit of the sequence. The number of bits or bits shifted out by a circular shift is called the cyclic offset of that circular shift, and the sequence obtained by the circular shift is called the shifted sequence. Taking the basic m-sequence "10110101" as an example, Figure 13 shows the process of circular shifting when the cyclic offset is 2 bits. The process of circular left shift is shown in Figure 12 (a), and the process of circular right shift is shown in Figure 12 (b). The circular shift in the embodiments of the present application can be a circular left shift or a circular right shift. The cyclic offset can also be called the cyclic shift amount.

[0326] According to the previous text, the longest period of the first m-sequence with a series number r is 2 r -1. If the circular offset of each circular shift is 1, then at most 2 r-2 second m-sequences. Therefore, when the cyclic shift of the first m-sequence is 1, a total of up to 2 r - 1 m-sequence (including the first m-sequence itself).

[0327] If the cyclic shift step size of the first m sequence is N CS , then the maximum we can get is m-sequences, which include a basic m-sequence and Cyclic shift sequence. In this application, Indicates rounding down. Indicates rounding up, which will not be further explained below.

[0328] Assuming that the number of levels is r, the number of the first m-sequences is N, and the N first m-sequences are shifted by the cyclic shift step N. CS After cyclic shift, the maximum value that can be obtained is m-sequences, including the N first m-sequences themselves and A second m-sequence.

[0329] It can be understood that according to the cyclic shift step size N CS The cyclic offset can be obtained, and the first m sequence is cyclically shifted according to the cyclic offset to obtain several second m sequences. And the cyclic shift step length N CS The smaller it is, the more second m-sequences can be obtained.

[0330] 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, and mod is the modulo operation. Theoretically, the cyclic offset C can be any integer between 0 and L.

[0331] However, in some cases, a cyclic offset that is too small can 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 set to be greater than a first threshold value, which is agreed upon by the communication protocol, indicated by the network device, or determined based on the chip length of the m-sequence.

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

[0333] In some embodiments, the target m-sequence is an m-sequence in a set of m-sequences. The m-sequence set is determined based on the number of shift register stages r. The m-sequence set includes a first m-sequence and / or a second m-sequence. Therefore, the target m-sequence may be the first m-sequence or the second m-sequence.

[0334] Next, we first introduce the m-sequence set:

[0335] Assuming that the number of shift register stages is r, there are X first m-sequences. Cyclic shifting is performed on each of the X first m-sequences according to the cyclic shift step size to obtain Y second m-sequences. The m-sequence set includes W m-sequences, where W ≤ X + Y. This embodiment of the present application is illustratively described using W = X + Y as an example.

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

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

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

[0339] In some embodiments, each m-sequence in the m-sequence set has a one-to-one corresponding number, and the number 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.

[0340] 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 number value of the first m-sequence.

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

[0342] 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 generated the first m-sequences. Exemplarily, all first m-sequences are arranged in order from higher to lower powers of the primitive polynomial coefficients. Exemplarily, all first m-sequences are arranged in order from lower to higher powers of the primitive polynomial coefficients.

[0343] 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 first m-sequences are arranged in ascending order according to the binary numbers corresponding to the primitive polynomials. Exemplarily, all first m-sequences are arranged in descending order according to the binary numbers corresponding to the primitive polynomials.

[0344] In some embodiments, the numbering order of the second m-sequences in the m-sequence set is determined based on at least one of the following: a cyclic offset, the numbering order of the corresponding first m-sequences, the corresponding primitive polynomial coefficients, the binary number of the corresponding primitive polynomial coefficients, and the number value of the second m-sequence.

[0345] In some embodiments, the second m-sequences in the m-sequence set are arranged from small to large according to the number values ​​of the second m-sequences, or arranged from large to small according to the number values ​​of the second m-sequences.

[0346] 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 ascending order of the cyclic offset. Exemplarily, the second m-sequences are arranged in descending order of the cyclic offset.

[0347] 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 numbered values, as described above), and then all second m-sequences are arranged (they may be arranged according to cyclic offsets and / or the numbering order of the first m-sequences and / or binary numbers and / or primitive polynomial coefficients and / or numbered values, as described above). All second m-sequences are arranged after all first m-sequences. For example, assuming that all first m-sequences are represented as M 1,1 ,M 1,2 …,M 1,X , assuming that the entire second m sequence is represented by M 2,1 ,M 2,2 …,M 2,Y , then the 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 …,M2,Y , or, M 1,X ,M 1,X-1 …,M 1,1 ,M 2,Y ,M 2,Y-1 …,M 2,1 .

[0348] In some embodiments, within an m-sequence set, all second m-sequences are arranged first (they may be arranged according to the order of cyclic offsets and / or the 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), with all first m-sequences following all second m-sequences.

[0349] In some embodiments, within an m-sequence set, the first m-sequence and the second m-sequence are arranged alternately. Exemplarily, X first m-sequences are arranged within the 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 after its corresponding first m-sequence in ascending order of cyclic offset. Exemplarily, X first m-sequences are arranged within the m-sequence set, and each second m-sequence is arranged after its corresponding first m-sequence in descending order of cyclic offset. Exemplarily, X first m-sequences are arranged within the m-sequence set, and each second m-sequence is arranged after its corresponding first m-sequence in ascending order of numbered values. Exemplarily, X first m-sequences are arranged within the m-sequence set, and each second m-sequence is arranged after its corresponding first m-sequence in descending order of numbered values.

[0350] The numbering order rules of the first m-sequence and the second m-sequence can be the same or different. Exemplarily, the first m-sequence and the second m-sequence are both arranged according to the numbering values. Exemplarily, the first m-sequence is arranged according to the coefficients of the primitive polynomial, and the second m-sequence is arranged according to the cyclic offset. Other possibilities are described above and will not be repeated here.

[0351] Then we introduce how to determine the target m sequence:

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

[0353] Optionally, the S m-sequences are randomly selected from the m-sequence set. Alternatively, the S m-sequences are the S default m-sequences in the m-sequence set. Alternatively, the S m-sequences are the S m-sequences in the m-sequence set specified 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.

[0354] For example, the S m-sequences are the m-sequences with odd default numbers in the m-sequence set. Another example is the S m-sequences are the m-sequences numbered from 0 to S-1 in the m-sequence set. Another example is the S m-sequences are the m-sequences that are ranked in the first S positions in the m-sequence set. Another example is the S m-sequences are the m-sequences that are ranked in the last S positions in the m-sequence set, and so on.

[0355] In some embodiments, when generating the first signal, the S m-sequences are numbered using their numbers in the m-sequence set. For example, if the S m-sequences are numbered from (W-1-S) to (W-1) in the m-sequence set, then the S m-sequences are numbered from (W-1-S) to (W-1) when generating the first signal. For example, if the S m-sequences are numbered from 1 to S in the m-sequence set, then the S m-sequences are numbered from 1 to S when generating the first signal.

[0356] In some embodiments, when generating the first signal, the S m-sequences are numbered differently from their numbers in the m-sequence set. For example, the S m-sequences are numbered (W-1-S) to (W-1) in the m-sequence set, and when generating the first signal, the S m-sequences are numbered 0 to S-1, or 1 to S.

[0357] In some embodiments, the order in which the S m-sequences are numbered when the first signal is generated follows their order in the m-sequence set. That is, the order in which the S m-sequences are numbered when the first signal is generated is the same as the order in which the S m-sequences are numbered in the m-sequence set.

[0358] In some embodiments, the order in which the S m-sequences are numbered when generating the first signal is different from the order in which the S m-sequences are numbered in the set of m-sequences. For example, the S m-sequences are arranged in ascending order of number value, or in descending order of number value, or in descending order of primitive polynomial coefficients from low to high power, or in descending order of primitive polynomial coefficients from high to low power, or in descending order of primitive polynomial binary numbers, or in descending order of primitive polynomial binary numbers, etc. For example, the order in which the S m-sequences are numbered is 0, 1, 2…, S-1, or the order in which the S m-sequences are numbered is S-1, S-2, S-3…, 1, 0.

[0359] By sorting the m-sequences in the m-sequence set and sorting the S m-sequences based on the above method, 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.

[0360] It is 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 perform RRM measurement and synchronization corresponding to each cell based on the first signal. Different first signals can be achieved by differing in at least one of the following aspects: the number of the target m-sequence, the cyclic shift step size, and the cell identifier.

[0361] In some embodiments, the target m-sequence is numbered based on the cell identifier. Because different cells correspond to different cell identifiers, this design naturally implements a mapping between cells and target m-sequences, enabling each cell to have a corresponding m-sequence to generate the first signal, thereby supporting downlink synchronization and RRM measurements in each cell.

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

[0363] In some embodiments, the communication protocol specifies a rule for determining the number of the target m-sequence based on the cell identifier. For example, the communication protocol specifies a mathematical operation rule between each cell identifier and the target m-sequence.

[0364] In some embodiments, the target m sequence is based on 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,

[0365] In some embodiments, the target m-sequence number and 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.

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

[0367] In some embodiments, the network device indicates the target m-sequence number to the terminal device. Exemplarily, the network device indicates the target m-sequence number to the terminal device via at least one of a broadcast message, a system message, an RRC signaling, a MAC CE, and the like.

[0368] The network device may directly indicate the target m-sequence number or information used to determine the target m-sequence number. For example, the network device may indicate at least one of the following information to the terminal device: the target m-sequence number among the S m-sequences, and the order of the S m-sequence numbers. The terminal device may directly obtain the target m-sequence number based on the received information, or may determine the target m-sequence number based on the received information.

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

[0370] 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-sequences in the m-sequence set, and the number of the m-sequence subset.

[0371] In summary, the method provided in the embodiments of the present application provides a low-complexity, feasible solution for transmitting synchronization and measurement signals using an m-sequence. Because the m-sequence has excellent autocorrelation and cross-correlation properties, the first signal generated using the gold sequence also possesses these excellent properties, helping to improve the reliability and efficiency of downlink synchronization and RRM measurements.

[0372] 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.

[0373] 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 need 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.

[0374] 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.

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

[0376] Another approach is to reduce the complexity of detecting the first signal by the terminal device by constructing a suitable binary sequence. This application provides a solution as shown in FIG14 , in which the first signal is generated by two binary sequences, each of which carries a portion of the cell identifier information.

[0377] FIG14 shows 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 includes:

[0378] 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.

[0379] Referring to the embodiment shown in FIG11 , the target m-sequence preferred pair is determined, and the specific steps are not repeated here.

[0380] Assume that the target m-sequence preferred pair includes a first m-sequence and a second m-sequence, wherein 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.

[0381] The first signal is generated by two binary sequences, where one binary sequence is a first m-sequence and the other binary sequence is a second m-sequence.

[0382] 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.

[0383] In some embodiments, the number of the first m-sequence is specified by a communication protocol, or indicated by a network device, or determined according to rules specified 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.

[0384] In some embodiments, the number of the second m-sequence is specified by a communication protocol, or is indicated by a network device, or is determined according to rules specified 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.

[0385] 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.

[0386] In some embodiments, the sequence element numbered n1 in the sequence of the first sub-signal is determined based on the sequence element numbered a in the first m-sequence. Alternatively, the value of the n1-th bit in the sequence of the first sub-signal is determined based on the value of the a-th bit in the first m-sequence.

[0387] In some embodiments, the sequence element numbered n2 in the sequence of the second sub-signal is determined based on the sequence element numbered b in the second m-sequence. Alternatively, the value of the n2-th bit in the sequence of the second sub-signal is determined based on the value of the b-th bit in the second m-sequence.

[0388] In some embodiments, a is determined based on at least one of the following: n1, parameter m0, and a first length value. b is determined based on at least one of the following: n1, parameter m1, and a first length value. Parameter m0 represents a cyclic offset of a first m-sequence when generating the first sub-signal, and parameter m1 represents a cyclic offset of a second m-sequence when generating the second sub-signal.

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

[0390] In some embodiments, a is determined based on a first modulo result, which is a modulo result of the first sum value and the first length value, and the first sum value is the sum of n1 and parameter m0.

[0391] In some embodiments, b is determined based on a second modulo result, which is a modulo result of the second sum value and the first length value, and the second sum value is the sum of n1 and parameter m1.

[0392] In some embodiments, the sequence element numbered n1 in the sequence of the first sub-signal is the first difference value. This can also be understood as the value of the n1th bit in the sequence of the first sub-signal being equal to the first difference value. The first difference value 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.

[0393] In some embodiments, the sequence element numbered n2 in the sequence of the second sub-signal is the second difference value. This can also be understood as the value of the n2th bit in the sequence of the second sub-signal being equal to the second difference value. The second difference value is the difference between the value 1 and the third product. The third product is the product of the value 2 and the sequence element numbered b in the second m-sequence.

[0394] For example, 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). SS1 (n1) represents the sequence of the first sub-signal, and x0(n) represents the first m-sequence used to generate the sequence of the first sub-signal. SS2 (n2) represents the sequence of the second sub-signal, x1(n) represents the second m-sequence used to generate the sequence of the second sub-signal. L represents the first length value. SS1 (n1)=[1-2x0((n1+m0)mod L)] (11) d SS2 (n2)=[1-2x1((n1+m1)mod L)] (12)

[0395] Optionally, n2=n1+L, that is, the numbers of the first m-sequence and the second m-sequence are consecutive. Optionally, n2>n1+L, that is, there is a number gap between the first m-sequence and the second m-sequence.

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

[0397] 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.

[0398] 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 n2-th bit in the sequence of the second sub-signal is equal to the value of the b-th bit in the second m-sequence.

[0399] For example, 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). SS1 (n1) represents the sequence of the first sub-signal, and x0(n) represents the first m-sequence used to generate the sequence of the first sub-signal. SS2 (n2) represents the sequence of the second sub-signal, x1(n) represents the second m-sequence used to generate the sequence of the second sub-signal. L represents the first length value. SS1 (n1)=[x0((n1+m0)mod L)] (13) d SS2 (n2)=[x1((n1+m1)mod L)] (14)

[0400] Optionally, n2=n1+L, that is, the numbers of the first m-sequence and the second m-sequence are consecutive. Optionally, n2>n1+L, that is, there is a number gap between the first m-sequence and the second m-sequence.

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

[0402] Referring to the embodiment shown in FIG11 , the parameter m0 and the parameter m1 can be determined by calculation method one or by calculation method two.

[0403] Calculation method 1:

[0404] In some embodiments, the parameter m0 is determined based on a modulo result of the first sub-identifier and the parameter G, and the parameter m1 is determined based on a modulo result of the second sub-identifier and the parameter F.

[0405] 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,

[0406] 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, Wherein, q1 is a positive integer, and q2 is a positive integer.

[0407] 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.

[0408] 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.

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

[0410] In some embodiments, assuming 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. For example, if 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.

[0411] 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.

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

[0413] Calculation method 2:

[0414] 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.

[0415] In some embodiments, the parameter m0 is determined according to the quotient of the first sub-identifier and the parameter B and the second sub-identifier, and the parameter m1 is determined according to the modulo result of the first sub-identifier and the parameter B.

[0416] For example, Optional, B is a positive integer, f1 is a positive integer, f2 is a positive integer. Optional, Optionally, B is smaller than the first length value, that is, B<L.

[0417] 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.

[0418] As can be seen from the above formula, a pair of first sub-identifiers and second sub-identifiers can be uniquely determined based on the cell identifier, and this pair of first sub-identifiers and second sub-identifiers 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-sequences and second m-sequences can be uniquely determined. When the first m-sequence and parameter m0 are both uniquely determined, the sequence of the first sub-signal can be uniquely generated. Similarly, when the second m-sequence and parameter m1 are both uniquely determined, the sequence of the second sub-signal can naturally be uniquely determined. 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 achieved, that is, a one-to-one correspondence between the cell identifier and the first sub-signal + the second sub-signal is achieved, thereby supporting the terminal device to perform RRM measurement and synchronization of the corresponding cell based on the first signal.

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

[0420] As mentioned above, if there are S cell identifiers in the system, S first signals must be designed to correspond to each of the S cells. If the solution described above where the first signal is generated by a gold sequence or an m-sequence is adopted, then S gold sequences or S m-sequences are required. This means that the UE may need to detect S subsequences.

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

[0422] Taking S=1008 as an example, if Z1*Z2=S, then Z1 and Z2 are divisors of S. Assuming Z1=3 and Z2=336, the UE only needs to detect the sequence 336+3=339 times at most, which is much less than 1008. This greatly reduces the number of detections and significantly reduces the UE's power consumption.

[0423] Furthermore, according to mathematical principles, the closer the values ​​of Z1 and Z2 are, the smaller the sum of Z1 and Z2. For example, if Z1 = 36 and Z2 = 28, the UE only needs to perform a maximum of 64 detections, which is far less than 339 and 1008 respectively. Therefore, considering the energy saving effect, it is possible to further design Z1 and Z2 with relatively close values ​​to significantly reduce UE power consumption.

[0424] The values ​​of Z1 and Z2 can be determined based on parameters m0 and m1, respectively. Parameters m0 and m1 represent the cyclic offsets of the first and second m-sequences used to generate the first signal. Therefore, by adjusting parameters m0 and m1, the number of first and second m-sequences, Z1, Z2, can be determined. Parameters m0 and m1 can be adjusted by one or more of the following parameters: G, F, B, q1, q2, f1, and f2. For details, refer to Calculation Methods 1 and 2 above.

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

[0426] according to Can get

[0427] according to

[0428] Then, d SS1 (n1)=[x0((n1+10)mod 63)], d SS2 (n2) = d SS2 (n1+63)=[x1((n1+0)mod 63)], 0≤n1<63.

[0429] Example 2: Assume that the total number of cell IDs is S = 1008, and the number or index 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, q1 = 2, q2 = 1. Assume that n2 = n1 + L, the sequence length of the first sub-signal = the sequence length of the second sub-signal = L = 63, and k = 3. Assume that the cell ID corresponding to the first signal sent this time is

[0430] according to Can get

[0431] according to

[0432] Then, d SS1 (n1)=[x0((n1+20)mod 63)], d SS2 (n2) = d SS2 (n1+63)=[x1((n1+1)mod 63)], 0≤n1<63.

[0433] Example 3: Assume that the total number of cell IDs is S = 1008, and the number or index of these 1008 cells ranges from 0 to 1007. Assume that n2 = n1 + L, the sequence length of the first sub-signal = the sequence length of the second sub-signal = L = 63, f1 = 10, f2 = 4, B = 20, k = 3. Assume that the cell ID corresponding to the first signal sent this time is

[0434] according to Can get

[0435] according to

[0436] Then, d SS1 (n1)=[x0((n1+14)mod 63)], d SS2 (n2) = d SS2 (n1+63)=[x1((n1+17)mod 63)], 0≤n1<63.

[0437] 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-sequences in the m-sequence set, and the number of the m-sequence subset.

[0438] 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 cell identification information, which can greatly reduce the number of first signals that the terminal device needs to detect. Moreover, 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. Moreover, 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.

[0439] The first signals shown in FIG. 11 , FIG. 12 , and FIG. 14 may be sent periodically or aperiodically.

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

[0441] In some embodiments, if the length of the binary sequence is L, the binary sequence corresponds to L modulation symbols after modulation.

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

[0443] In some embodiments, the first signal is a time domain signal. Optionally, the time domain resources occupied by the first signal are continuous or discontinuous. It can also be understood that the time domain units occupied by the first signal are continuous time domain units mapped after the binary sequence is modulated, or discontinuous time domain units mapped after the binary sequence is modulated.

[0444] 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.

[0445] Exemplarily, in the embodiments shown in Figures 11 and 12, when the length of the binary sequence is L, the binary sequence is modulated and mapped to a group of continuous or discontinuous time domain units, that is, L modulation symbols are mapped to a group of continuous or discontinuous time domain units.

[0446] For example, in the embodiment shown in FIG14 , when the first signal is generated by two binary sequences, each of which has a length of L, the two binary sequences are modulated and mapped to two time domain resource segments, each of which includes a group of time domain units. That is, 2*L modulation symbols are mapped to two groups of time domain units. Optionally, there may or may not be a time domain gap between the two time domain resources. Optionally, each group of time domain units may be continuous or discontinuous.

[0447] Exemplarily, the time domain units occupied by two time domain resources are exactly the same or partially overlap. 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 overlap. As shown in FIG15(a), 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 overlap. As shown in FIG15(b), 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 FIG15(c), binary sequence A and binary sequence B occupy different symbols.

[0448] Exemplarily, the first signal is divided into multiple 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 multiple time domain resources. Optionally, each time domain resource includes continuous time domain units or discontinuous time domain units.

[0449] The modulation modes of the first signal shown in FIG11 , FIG12 , and FIG14 include at least one of the following: OOK modulation; PSK modulation; BPSK modulation; FSK modulation.

[0450] Assuming the modulation mode is PSK modulation, then the sequence elements of the first signal whose values ​​are "1" and "0" correspond to phase continuity (+1) and phase jumps (0 or -1) in the PSK sequence, respectively. For example, the sequence elements of the first signal whose values ​​are "1" correspond to phase continuity (+1) in the PSK sequence, and the sequence elements of the first signal whose values ​​are "0" correspond to phase jumps (0 or -1) in the PSK sequence; or, the sequence elements of the first signal whose values ​​are "1" correspond to phase jumps (0 or -1) in the PSK sequence, and the sequence elements of the first signal whose values ​​are "0" correspond to phase continuity (+1) in the PSK sequence.

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

[0452] Assuming 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 the two carrier frequencies of the FSK sequence, respectively. For example, the sequence elements with values ​​of "1" in the sequence of the first signal correspond to carrier frequency 1 of the FSK sequence, and the sequence elements with values ​​of "0" in the sequence of the first signal correspond to carrier frequency 0 of the FSK sequence; or, the sequence elements with values ​​of "1" in the sequence of the first signal correspond to carrier frequency 0 of the FSK sequence, and the sequence elements with values ​​of "0" in the sequence of the first signal correspond to carrier frequency 1 of the FSK sequence.

[0453] Assuming 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.

[0454] In some embodiments, the network device has an OFDM transmitter, or when the first signal is transmitted in an in-band manner on an OFDM carrier, it may be considered to use an OFDM waveform to transmit the first signal.

[0455] 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.

[0456] OOK-1 method:

[0457] 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 the OOK sequence, one OOK symbol is mapped onto one OFDM symbol. Mapping the OFDM symbol to all 1s (or other non-zero values) in the frequency domain indicates that the OFDM symbol transmits a high-level OOK signal (a high level can represent either 1 or 0, depending on the definition or convention). Mapping the OFDM symbol to all 0s in the frequency domain indicates that the OFDM symbol transmits a low-level OOK signal (a low level can represent either 0 or 1, depending on the definition or convention).

[0458] For example, as shown in FIG16 , in the OOK-1 mode, OFDM symbols and OOK symbols correspond one to one, that is, each OFDM symbol carries 1 bit.

[0459] When mapping using OOK-1, if the length of the binary sequence is L, the binary sequence is modulated and mapped onto L OFDM symbols. That is, L OOK symbols are mapped onto L OFDM symbols. These L OFDM symbols can be continuous or discontinuous.

[0460] OOK-4 method:

[0461] As shown in Figure 17, 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 a total of M1 bits. After the M1 bits are upsampled by k1, a sequence of length k1M1 is generated. This sequence is transformed by the Discrete Fourier Transform (DFT) and then mapped to k1M1 resource elements (REs). It is multiplexed with other OFDM signals in the frequency domain (if any) in the frequency domain, and then transformed to the time domain by the Inverse Discrete Fourier Transform (IDFT). After filtering and shaping, it is finally sent through the transmitter. It can be seen that in the OOK-4 method, M1 OOK symbols can be mapped to one OFDM symbol, that is, each OFDM symbol carries M1 bits.

[0462] When mapping by 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 M1 bits. OFDM symbols are continuous or non-continuous.

[0463] Furthermore, 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 part of a time slot. symbols, or the end of a time slot symbols, or the middle of a time slot symbols, or discontinuous symbols within a time slot symbols.

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

[0465] When mapping is performed using the OOK-4 method, if the first signal is generated by two binary sequences, where the lengths of the two binary sequences are L1 and L2 respectively, L1 OOK symbols are mapped to OFDM symbols, L2 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 are continuous or non-continuous.

[0466] Furthermore, 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 part of a time slot. symbols, or the end of a time slot symbols, or the middle of a time slot symbols, or discontinuous symbols within a time slot symbols.

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

[0468] In some embodiments, the first signals shown in FIG. 11 , FIG. 12 , and FIG. 14 are scrambled sequences.

[0469] In some embodiments, after modulation, the binary sequence is scrambled to obtain the first signal. Exemplarily, the scrambling sequence is at least one of the following: a ZC sequence, a QPSK sequence, or a QAM sequence. For example, after modulation, the binary sequence is scrambled to obtain an OOK sequence, which is point-to-point multiplied with the ZC sequence used for scrambling to obtain the first signal.

[0470] 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.

[0471] In some embodiments, the lengths of the binary sequence and the scrambling sequence are equal or unequal. If the scrambling sequence is longer than the binary sequence, the scrambling sequence may be truncated for point-to-point multiplication. If the scrambling sequence is shorter than the binary sequence, the scrambling sequence may be repeated several times for point-to-point multiplication.

[0472] FIG18 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 terminal device and includes:

[0473] 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.

[0474] 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, or LP-RS.

[0475] A binary sequence includes only sequence elements with two possible values. Therefore, the sequence of the first signal also includes only sequence elements with two possible values. For example, the sequence of the first signal includes only "0" and "1", or the sequence of the first signal includes only "+1" and "-1".

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

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

[0478] It should be noted that the types of binary sequences provided in this 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 this application.

[0479] The terminal device that executes step 1810 can be the terminal device 120 or the terminal device 130 as shown in Figure 1, or it can be the terminal device 140 that is a low-power device as shown in Figure 2 (which can include a low-power receiver), or it can be the terminal device including WUR as shown in Figure 6, or it can be a terminal device operating in the millimeter wave frequency band, and so on.

[0480] In summary, the method provided in the embodiment of the present application is very easy to combine with non-OFDM waveforms such as OOK waveforms, PSK waveforms, and FSK waveforms because the first signal is generated according to a binary sequence. 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, RRM measurement, etc. in the millimeter wave frequency band.

[0481] FIG19 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 terminal device and includes:

[0482] 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.

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

[0484] 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 transmitting end and the first signal arriving at the receiving end 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 correlate the received first signal with 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 in the detection process should be generated locally by the terminal device.

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

[0486] Regardless of whether the network device and the terminal device use exactly the same method to determine the first signal corresponding to the same cell, the first signal determined by the network device and generated by the terminal device for the same cell should be the same. This ensures that after receiving the first signal, the terminal device can clearly identify which cell the first signal corresponds to.

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

[0488] In some embodiments, the terminal device determines the numbering order of the M gold sequence families based on 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.

[0489] In some embodiments, the terminal device determines a parameter m0, that is, a cyclic offset of the first m-sequence when generating a target gold sequence.

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

[0491] 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 in the m sequence set, and the number of the m sequence subset.

[0492] In summary, the method provided in the embodiments of the present application provides a low-complexity, feasible solution for transmitting synchronization and measurement signals using a gold sequence. Because the gold sequence has excellent autocorrelation and cross-correlation properties, the first signal generated using the gold sequence also possesses these excellent properties, helping to improve the reliability and efficiency of downlink synchronization and RRM measurements.

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

[0494] FIG20 shows a flow chart of a signal transmission method provided by an exemplary embodiment of the present application. The method is executed by a terminal device and includes:

[0495] 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.

[0496] For details about the m-sequence and the first signal, please refer to step 1210 and step 1410, which will not be described in detail here.

[0497] 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. The reason here can be referred to step 1910 and will not be repeated here.

[0498] 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.

[0499] Regardless of whether the network device and the terminal device use exactly the same method to determine the first signal corresponding to the same cell, the first signal determined by the network device and generated by the terminal device for the same cell should be the same. This ensures that after receiving the first signal, the terminal device can clearly identify which cell the first signal corresponds to.

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

[0501] 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.

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

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

[0504] 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 in the m sequence set, and the number of the m sequence subset.

[0505] In summary, the method provided in the embodiments of the present application uses m-sequences to provide a low-complexity, feasible solution for transmitting synchronization signals and measurement signals. Because m-sequences have excellent autocorrelation and cross-correlation properties, the first signal generated using the gold sequence also possesses these excellent properties, helping to improve the reliability and efficiency of downlink synchronization and RRM measurements. Furthermore, by constructing an m-sequence set, a large number of m-sequences can be obtained, providing available m-sequences for a large number of cells to generate the first signal.

[0506] FIG21 shows a block diagram of a signal transmission device according to an exemplary embodiment of the present application. The device can be implemented as a network device as shown in FIG10 , FIG11 , FIG12 , or FIG14 , or as a portion of a network device as shown in FIG10 , FIG11 , 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 .

[0507] The sending module 2110 is configured 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.

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

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

[0510] In some embodiments, the sequence element numbered n in the gold sequence is determined based on 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 m-sequence pair, and the second m-sequence is the other m-sequence in the preferred m-sequence pair.

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

[0512] 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 the 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 the sequence element numbered b in the second m-sequence.

[0513] 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.

[0514] In some embodiments, a is determined based on at least one of the following: n, parameter m0, and a first length value; b is determined based on 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 the 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.

[0515] In some embodiments, a is determined based on 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 based on 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.

[0516] 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 the 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 the communication protocol.

[0517] In some embodiments, the processing module 2130 is further configured to determine a and / or b.

[0518] In some embodiments, the gold sequence is a first gold sequence 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.

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

[0520] 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.

[0521] In some embodiments, the gold sequence is a third gold sequence, which is obtained by cyclic shifting the first gold sequence, and 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.

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

[0523] In some embodiments, the m-sequence includes two m-sequences in an m-sequence set, the two m-sequences including 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.

[0524] 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.

[0525] In some embodiments, the sequence element numbered n1 in the sequence of the first sub-signal is determined based on 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 based on the sequence element numbered b in the second m-sequence.

[0526] 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.

[0527] In some embodiments, the sequence element numbered n1 in the sequence of the first sub-signal is a first difference value, and the sequence element numbered n2 in the sequence of the second sub-signal is a second difference value; wherein the first difference value is the difference between the value 1 and the second product, 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 value is the difference between the value 1 and a third product, and the third product is the product of the value 2 and the sequence element numbered b in the second m-sequence.

[0528] In some embodiments, the numbering of the m-sequences 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 the communication protocol.

[0529] In some embodiments, the numbering of the preferred m-sequence 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.

[0530] In some embodiments, a is determined based on at least one of the following: n1, parameter m0, and a first length value; b is determined based on at least one of the following: n1, 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 the 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 a sequence of the first sub-signal, and the parameter m1 represents a cyclic offset when the second m-sequence is used to generate a sequence of the first sub-signal.

[0531] In some embodiments, the parameter m0 is determined based on the first sub-identifier, and the parameter m1 is determined based on the second sub-identifier; or, the parameter m0 is determined based on the second sub-identifier, and the parameter m1 is determined based on the first sub-identifier; or, the parameter m0 is determined based on the first sub-identifier and the second sub-identifier, and the parameter m1 is determined based on the first sub-identifier; or, the parameter m0 is determined based on the first sub-identifier, and the parameter m1 is determined based on the first sub-identifier and the second sub-identifier.

[0532] In some embodiments, the processing module 2130 is further configured to determine the parameter m0 and / or the parameter m1.

[0533] 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.

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

[0535] In some embodiments, the parameter m0 is determined based on the modulo result of the first sub-identifier and parameter G, and the parameter m1 is determined based on the modulo result of the second sub-identifier and parameter F; or, the parameter m1 is determined based on the modulo result of the first sub-identifier and parameter G, and the parameter m0 is determined based on the modulo result of the second sub-identifier and parameter F.

[0536] In some embodiments, the parameter m0 is determined based on the quotient of the first sub-identifier and parameter B and the second sub-identifier, and the parameter m1 is determined based on the modulus result of the first sub-identifier and the parameter B; or, the parameter m1 is determined based on the quotient of the first sub-identifier and parameter B and the second sub-identifier, and the parameter m0 is determined based on the modulus result of the first sub-identifier and the parameter B; wherein, the parameter B is less than the first length value.

[0537] 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.

[0538] 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.

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

[0540] 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.

[0541] 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.

[0542] In some embodiments, the numbering order 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; and the order of cyclic offsets from large to small.

[0543] In some embodiments, each cyclically shifted sequence in the m-sequence set is arranged after its corresponding basic m-sequence in ascending order of cyclic offset; or, each cyclically shifted sequence in the m-sequence set is arranged after its corresponding basic m-sequence in descending order of cyclic offset; or, all cyclically shifted sequences in the m-sequence set are arranged after all basic m-sequences in ascending order of cyclic offset; or, all cyclically shifted sequences in the m-sequence set are arranged after all basic m-sequences in descending order of cyclic offset.

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

[0545] 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 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.

[0546] 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.

[0547] 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.

[0548] 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.

[0549] In some embodiments, the sending module 2110 is further configured to send at least one of the following information: a gold sequence number, a first m-sequence number, a second m-sequence number, an m-sequence preferred pair number, an m-sequence number, a cyclic shift step, a numbering order of m-sequences within an m-sequence set, and an m-sequence subset number.

[0550] In some embodiments, the processing module 2130 is further configured to perform at least one of the steps of modulation, scrambling, and mapping.

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

[0552] In summary, the apparatus provided in the embodiments of the present application uses gold and m-sequences to provide a low-complexity, feasible solution for transmitting synchronization and measurement signals. Because gold and m-sequences possess excellent autocorrelation and cross-correlation properties, the first signal generated using these sequences also exhibits these excellent properties, helping to improve the reliability and efficiency of downlink synchronization and RRM measurements. Furthermore, a large number of gold and m-sequences can be obtained through cyclic shifting, enabling the provision of available gold and m-sequences for a large number of cells to generate the first signal.

[0553] FIG22 shows a block diagram of a signal transmission device according to an exemplary embodiment of the present application. The device can be implemented as a terminal device as shown in FIG18 , FIG19 , or FIG20 , or as a portion 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 .

[0554] The receiving module 2210 is configured 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.

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

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

[0557] In some embodiments, the sequence element numbered n in the gold sequence is determined based on 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 m-sequence pair, and the second m-sequence is the other m-sequence in the preferred m-sequence pair.

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

[0559] 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 the 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 the sequence element numbered b in the second m-sequence.

[0560] 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.

[0561] In some embodiments, a is determined based on at least one of the following: n, parameter m0, and a first length value; b is determined based on 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 the 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.

[0562] In some embodiments, a is determined based on 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 based on 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.

[0563] 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 the 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 the communication protocol.

[0564] In some embodiments, the processing module 2230 is further configured to determine a and / or b.

[0565] In some embodiments, the gold sequence is a first gold sequence 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.

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

[0567] 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.

[0568] In some embodiments, the gold sequence is a third gold sequence, which is obtained by cyclic shifting the first gold sequence, and 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.

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

[0570] In some embodiments, the m-sequence includes two m-sequences in an m-sequence set, the two m-sequences including 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.

[0571] 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.

[0572] In some embodiments, the sequence element numbered n1 in the sequence of the first sub-signal is determined based on 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 based on the sequence element numbered b in the second m-sequence.

[0573] 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.

[0574] In some embodiments, the sequence element numbered n1 in the sequence of the first sub-signal is a first difference value, and the sequence element numbered n2 in the sequence of the second sub-signal is a second difference value; wherein the first difference value is the difference between the value 1 and the second product, 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 value is the difference between the value 1 and a third product, and the third product is the product of the value 2 and the sequence element numbered b in the second m-sequence.

[0575] In some embodiments, the numbering of the m-sequences 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 the communication protocol.

[0576] In some embodiments, the numbering of the preferred m-sequence 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.

[0577] In some embodiments, a is determined based on at least one of the following: n1, parameter m0, and a first length value; b is determined based on at least one of the following: n1, 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 the 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 a sequence of the first sub-signal, and the parameter m1 represents a cyclic offset when the second m-sequence is used to generate a sequence of the first sub-signal.

[0578] In some embodiments, the parameter m0 is determined based on the first sub-identifier, and the parameter m1 is determined based on the second sub-identifier; or, the parameter m0 is determined based on the second sub-identifier, and the parameter m1 is determined based on the first sub-identifier; or, the parameter m0 is determined based on the first sub-identifier and the second sub-identifier, and the parameter m1 is determined based on the first sub-identifier; or, the parameter m0 is determined based on the first sub-identifier, and the parameter m1 is determined based on the first sub-identifier and the second sub-identifier.

[0579] In some embodiments, the processing module 2230 is further configured to determine the parameter m0 and / or the parameter m1.

[0580] 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.

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

[0582] In some embodiments, the parameter m0 is determined based on the modulo result of the first sub-identifier and parameter G, and the parameter m1 is determined based on the modulo result of the second sub-identifier and parameter F; or, the parameter m1 is determined based on the modulo result of the first sub-identifier and parameter G, and the parameter m0 is determined based on the modulo result of the second sub-identifier and parameter F.

[0583] In some embodiments, the parameter m0 is determined based on the quotient of the first sub-identifier and parameter B and the second sub-identifier, and the parameter m1 is determined based on the modulus result of the first sub-identifier and the parameter B; or, the parameter m1 is determined based on the quotient of the first sub-identifier and parameter B and the second sub-identifier, and the parameter m0 is determined based on the modulus result of the first sub-identifier and the parameter B; wherein, the parameter B is less than the first length value.

[0584] 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.

[0585] 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.

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

[0587] 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.

[0588] 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.

[0589] In some embodiments, the numbering order 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; and the order of cyclic offsets from large to small.

[0590] In some embodiments, each cyclically shifted sequence in the m-sequence set is arranged after its corresponding basic m-sequence in ascending order of cyclic offset; or, each cyclically shifted sequence in the m-sequence set is arranged after its corresponding basic m-sequence in descending order of cyclic offset; or, all cyclically shifted sequences in the m-sequence set are arranged after all basic m-sequences in ascending order of cyclic offset; or, all cyclically shifted sequences in the m-sequence set are arranged after all basic m-sequences in descending order of cyclic offset.

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

[0592] 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 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.

[0593] 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.

[0594] 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.

[0595] 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.

[0596] In some embodiments, the processing module 2230 is further configured to perform at least one of the steps of modulation, scrambling, and mapping.

[0597] In some embodiments, the apparatus further includes a sending module 2250 configured to send signals and / or data to a network device. Exemplarily, the sending module 2250 is configured to send signals and / or data to the network device based on the synchronization result of the first signal. Exemplarily, the sending module 2250 is configured to provide feedback of RRM measurement results to the network device.

[0598] In some embodiments, the receiving module 2210 is further configured to receive at least one of the following information: a gold sequence number, a first m-sequence number, a second m-sequence number, an m-sequence preferred pair number, an m-sequence number, a cyclic shift step, a numbering order of m-sequences within an m-sequence set, and an m-sequence subset number.

[0599] In summary, the apparatus provided in the embodiments of the present application provides a low-complexity, low-featured solution for downlink synchronization and RRM measurement using gold and m-sequences. Because gold and m-sequences possess excellent autocorrelation and cross-correlation properties, the first signal generated using these sequences also exhibits these excellent properties, helping to improve the reliability and efficiency of downlink synchronization and RRM measurements. Furthermore, a vast number of gold and m-sequences can be obtained through cyclic shifting, enabling the provision of available gold and m-sequences for a vast number of cells to generate the first signal.

[0600] 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 perform at least some of the steps performed by the terminal device shown in FIG18, FIG19 or FIG20.

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

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

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

[0604] Optionally, the communication device 2300 may further include a processor 2330. The processor 2330 includes one or more processing cores. 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.

[0605] 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. 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).

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

[0607] 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.

[0608] 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.

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

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

[0611] In some embodiments, the first transmitter 2321 is implemented as a primary transmitter, and / or the second transmitter 2322 is implemented as a backscatter transmitter.

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

[0613] 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 .

[0614] 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 .

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

[0616] Figure 24 shows a schematic structural diagram 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 Figure 18, Figure 19, or Figure 20, or may be used to execute at least some of the steps executed by the network device shown in Figure 10, Figure 11, Figure 12, or Figure 14.

[0617] 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.

[0618] Receiver 2402 and transmitter 2403 may be implemented as a communication component, which may be a communication chip and referred to as a transceiver. In some embodiments, receiver 2402 may be used to implement the functions and steps of receiving module 2150 and / or receiving module 2210 described above, and transmitter 2403 may be used to implement the functions and steps of transmitting module 2110 and / or transmitting module 2250 described above.

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

[0620] 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.

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

[0622] 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.

[0623] 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.

[0624] In an exemplary embodiment of the present application, a computer-readable storage medium is further provided, in which at least one program is stored. 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.

[0625] In an exemplary embodiment of the present application, a chip is further 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.

[0626] 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 is enabled to execute the above-mentioned signal transmission method.

[0627] 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.

[0628] Those skilled in the art will understand that all or part of the steps to implement the above embodiments may be accomplished by hardware, or may be accomplished by a program instructing the relevant hardware, 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.

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

Claims

1. A signal transmission method, characterized in that, the method is executed by a network device, and the method includes: sending a first signal, the first signal being generated based on a binary sequence, and the first signal being used for radio resource management (RRM) measurement and / or downlink synchronization.

2. The method according to claim 1, characterized in that, the binary sequence is associated with a cell identifier.

3. The method according to claim 1 or 2, characterized in that, the binary sequence includes a gold sequence, and different cell identifiers correspond to different gold sequences.

4. The method according to claim 3, 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 of the m-sequences in a preferred pair of m-sequences, and the second m-sequence is the other m-sequence in the preferred pair of m-sequences.

5. The method according to claim 4, characterized in that, the sequence element numbered n in the gold sequence is a first product, the first product being the product of a first difference and a second difference; wherein, the first difference is the difference between the value 1 and a 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 a third product, and the third product is the product of the value 2 and the sequence element numbered b in the second m-sequence.

6. The method according to claim 4, 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.

7. The method according to any one of claims 4 to 6, characterized in that, The a is determined according to at least one of the following: the n, the parameter m 0 , the first length value; the b is determined according to at least one of the following: the n, the parameter m 1 , 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, and the parameter m 0 represents the cyclic offset when the first m sequence is used to generate the gold sequence, and the parameter m 1 represents the cyclic offset when the second m sequence is used to generate the gold sequence.

8. The method according to claim 7, characterized in that, The a is determined according to the first modulo result, and the second modulo result is the modulo result of the first sum value and the first length value, where the first sum value is the sum of the n and the parameter m 0 ; The b is determined according to the second modulo result, and the second modulo result is the modulo result of the second sum value and the first length value, where the second sum value is the sum of the n and the parameter m 1 sum.

9. The method according to any one of claims 4 to 8, characterized in that, the number of the first m-sequence is agreed by a communication protocol, or indicated by the network device, or determined according to rules agreed by the communication protocol; the number of the second m-sequence is agreed by a communication protocol, or indicated by the network device, or determined according to rules agreed by the communication protocol.

10. The method according to any one of claims 4 to 8, characterized in that, the number of the preferred pair of m-sequences is agreed by a communication protocol, or indicated by the network device, or determined according to rules agreed by the communication protocol.

11. The method according to any one of claims 3 to 10, characterized in that, the gold sequence is a first gold sequence, and the first gold sequence is obtained by performing modulo-2 addition on the cyclic shift sequences of the first m-sequence and the second m-sequence, and the first m-sequence and the second m-sequence form a preferred pair of m-sequences.

12. The method according to any one of claims 3 to 10, characterized in that, The gold sequence is a second gold sequence, which is obtained by modulo-2 addition of a cyclic shift sequence of a first m-sequence and a cyclic shift sequence of a second m-sequence. The first m-sequence and the second m-sequence form a preferred pair of m-sequences.

13. The method according to any one of claims 3 to 10, wherein, the gold sequence is a third gold sequence, which is obtained by cyclic shifting of a first gold sequence. The first gold sequence is obtained by modulo-2 addition of a cyclic shift sequence of a first m-sequence and a cyclic shift sequence of a second m-sequence. The first m-sequence and the second m-sequence form a preferred pair of m-sequences.

14. The method according to claim 1 or 2, wherein, the binary sequence includes an m-sequence, and different cell identifiers correspond to different m-sequences.

15. The method according to claim 14, wherein, 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 of the m-sequences in a preferred pair of m-sequences, and the second m-sequence is the other m-sequence in the preferred pair of m-sequences.

16. The method according to claim 15, wherein, 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.

17. The method according to claim 16, wherein, The sequence element numbered n 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 n 1 in the sequence of the second sub-signal is determined according to the sequence element numbered b in the second m-sequence. 2 ​ 18. The method according to claim 17, wherein, The sequence element numbered n in the sequence of the first sub-signal is the first difference, and the sequence element numbered n 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. 1 The sequence element numbered n in the sequence of the first sub-signal is the first difference, and the sequence element numbered n in the sequence of the second sub-signal is the second difference; 2 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.

19. The method according to any one of claims 14 to 18, wherein, the number of the m-sequence included in the binary sequence is agreed upon by a communication protocol, or indicated by the network device, or determined according to rules agreed upon by the communication protocol.

20. The method according to any one of claims 15 to 18, wherein, the number of the preferred pair of m-sequences is agreed upon by a communication protocol, or indicated by the network device, or determined according to rules agreed upon by the communication protocol.

21. The method according to claim 17 or 18, wherein, The a is determined according to at least one of the following: the n 1 , the parameter m 0 , the first length value; the b is determined according to at least one of the following: the n 1 , the parameter m 1 , 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, and the parameter m 0 represents the cyclic offset when the first m-sequence is used to generate the sequence of the first sub-signal, and the parameter m 1 represents the cyclic offset when the second m-sequence is used to generate the sequence of the first sub-signal.

22. The method according to claim 7 or 8 or 21, wherein, The parameter m 0 is determined according to the first sub-identifier, the parameter m 1 is determined according to the second sub-identifier; or, the parameter m 0 is determined according to the second sub-identifier, the parameter m 1 is determined according to the first sub-identifier; or, the parameter m 0 is determined according to the first sub-identifier and the second sub-identifier, the parameter m 1 is determined according to the first sub-identifier; or, the parameter m 0 is determined according to the first sub-identifier, the parameter m 1 is determined according to the first sub-identifier and the second sub-identifier.

23. The method according to claim 22, wherein, the first sub-identifier and the second sub-identifier are determined according to the cell identifier and / or the cyclic shift step size.

24. The method according to claim 22 or 23, wherein, The parameter m 0 is determined according to the modulo result of the first sub-identifier and the parameter G, the parameter m 1 is determined according to the modulo result of the second sub-identifier and the parameter F; or, the parameter m 1 is determined according to the modulo result of the first sub-identifier and the parameter G, the parameter m 0 is determined according to the modulo result of the second sub-identifier and the parameter F.

25. The method according to claim 22 or 23, wherein, The parameter m 0 is determined according to the quotient of the first sub-identifier and the parameter B and the second sub-identifier, and the parameter m 1 is determined according to the modulo result of the first sub-identifier and the parameter B; or, the parameter m 1 is determined according to the quotient of the first sub-identifier and the parameter B and the second sub-identifier, and the parameter m 0 is determined according to the modulo result of the first sub-identifier and the parameter B; wherein, the parameter B is less than the first length value.

26. The method according to any one of claims 7 or 8 or 21 to 25, wherein, The parameter m 0 is less than or equal to the first length value, and the parameter m 1 is less than or equal to the first length value.

27. The method according to claim 14, wherein, the m-sequence is one of the m-sequences in an m-sequence subset. The number of the m-sequence in the m-sequence subset is determined according to the cell identifier; wherein, each m-sequence in the m-sequence subset corresponds one-to-one to each cell identifier in the communication system.

28. The method according to claim 27, wherein, The serial number of the m-sequence in the set of m-sequences is equal to the cell identifier.

29. The method according to claim 15 or 27 or 28, wherein, the number of m-sequences in the set of m-sequences is determined according to the number of shift register stages and / or the cyclic shift step size.

30. The method according to claim 15 or 27 or 28 or 29, wherein, the numbering order of the m-sequences in the set of m-sequences is agreed upon by the communication protocol, or indicated by the network device, or is the default order, or is determined by the terminal device.

31. The method according to claim 30, wherein, the numbering order of the m-sequences in the set of m-sequences is determined according to one of the following orders: the order of the primitive polynomial coefficients from the highest power to the lowest power; the order of the primitive polynomial coefficients from the lowest power to the highest power; the order of the binary numbers of the primitive polynomial coefficients from the smallest to the largest; the order of the binary numbers of the primitive polynomial coefficients from the largest to the smallest; the order of the cyclic offsets from the smallest to the largest; the order of the cyclic offsets from the largest to the smallest.

32. The method according to claim 30 or 31, wherein, each cyclic shift sequence in the set of m-sequences is arranged in ascending order of cyclic offset after its corresponding basic m-sequence; or each cyclic shift sequence in the set of m-sequences is arranged in descending order of cyclic offset after its corresponding basic m-sequence; or all cyclic shift sequences in the set of m-sequences are arranged in ascending order of cyclic offset after all basic m-sequences; or all cyclic shift sequences in the set of m-sequences are arranged in descending order of cyclic offset after all basic m-sequences.

33. The method according to any one of claims 1 to 32, wherein, the method further includes: transmitting at least one of the following information: the serial number of the gold sequence, the serial number of the first m-sequence, the serial number of the second m-sequence, the serial number of the preferred pair of m-sequences, the serial number of the m-sequence, the cyclic shift step size, the numbering order of the m-sequences in the set of m-sequences, the serial number of the m-sequence subset.

34. The method according to any one of claims 1 to 33, wherein, the time domain resources occupied by the first signal are continuous or discontinuous.

35. The method according to claim 34, wherein, 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 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.

36. The method according to any one of claims 1 to 35, wherein, the first signal is obtained by first modulation according to the binary sequence, and the first modulation includes one of the following: OOK modulation, PSK modulation, BPSK modulation, FSK modulation.

37. The method according to claim 36, wherein, 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.

38. The method according to any one of claims 1 to 37, wherein, the first signal is obtained by scrambling according to the binary sequence; wherein, the sequence for scrambling includes at least one of the following: ZC sequence, QPSK sequence, QAM sequence.

39. A signal transmission method, wherein, the method is executed by a terminal device, and the method includes: receiving a first signal, 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.

40. The method according to claim 39, wherein, the binary sequence is associated with a cell identifier.

41. The method according to claim 39 or 40, wherein, the binary sequence includes a gold sequence, and different cell identifiers correspond to different gold sequences.

42. The method according to claim 41, wherein, 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.

43. The method according to claim 42, wherein, 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 the value 1 and a 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 a third product, and the third product is the product of the value 2 and the sequence element numbered b in the second m sequence.

44. The method according to claim 42, wherein, the sequence element numbered n in the gold sequence is the modulo-two 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.

45. The method according to any one of claims 42 to 44, wherein, The a is determined according to at least one of the following: the n, the parameter m 0 and the first length value; the b is determined according to at least one of the following: the n, the parameter m 1 and the first length value; wherein, n is greater than or equal to 0 and less than the first length value, and the first length value is the length value of the first m-sequence and the second m-sequence, and the parameter m 0 represents the cyclic offset when the first m-sequence is used to generate the gold sequence, and the parameter m 1 represents the cyclic offset when the second m-sequence is used to generate the gold sequence.

46. The method according to claim 45, wherein, The a is determined according to the first modulo result, and 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 the n and the parameter m. 0 The b is determined according to the second modulo result, and 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 the n and the parameter m. 1 sum.

47. The method according to any one of claims 42 to 46, wherein, the number of the first m sequence is agreed by a communication protocol, or indicated by a network device, or determined by the terminal device according to rules agreed by the communication protocol; the number of the second m sequence is agreed by a communication protocol, or indicated by a network device, or determined by the terminal device according to rules agreed by the communication protocol.

48. The method according to any one of claims 42 to 46, wherein, The numbering of the preferred m - sequence pair is agreed upon by the communication protocol, or indicated by the network device, or determined by the terminal device according to the rules agreed upon by the communication protocol.

49. According to the method according to any one of claims 41 to 48, characterized in that, The gold sequence is a first gold sequence, which is obtained by modulo - 2 addition of the cyclic shift sequences of a first m - sequence and a second m - sequence, and the first m - sequence and the second m - sequence form a preferred m - sequence pair.

50. According to the method according to any one of claims 41 to 48, characterized in that, The gold sequence is a second gold sequence, which is obtained by modulo - 2 addition of the cyclic shift sequences of a first m - sequence and a second m - sequence, and the first m - sequence and the second m - sequence form a preferred m - sequence pair.

51. According to the method according to any one of claims 41 to 48, characterized in that, The gold sequence is a third gold sequence, which is obtained by cyclic shifting of a first gold sequence, and the first gold sequence is obtained by modulo - 2 addition of the cyclic shift sequences of a first m - sequence and a second m - sequence, and the first m - sequence and the second m - sequence form a preferred m - sequence pair.

52. According to the method according to claim 39 or 40, characterized in that, The binary sequence includes an m - sequence, and different cell identifiers correspond to different m - sequences.

53. According to the method according to claim 52, characterized in that, The m - sequence includes two m - sequences in the m - sequence set, the two m - sequences include a first m - sequence and a second m - sequence, the first m - sequence is one of the m - sequences in the preferred m - sequence pair, and the second m - sequence is the other m - sequence in the preferred m - sequence pair.

54. According to the method according to claim 53, 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.

55. According to the method according to claim 54, characterized in that, The sequence element numbered n 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 n 1 in the sequence of the second sub-signal is determined according to the sequence element numbered b in the second m-sequence. 2 ​ 56. According to the method according to claim 55, characterized in that, The sequence element numbered n in the sequence of the first sub-signal 1 is the first difference, and the sequence element numbered n in the sequence of the second sub-signal 2 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.

57. According to the method according to any one of claims 52 to 56, characterized in that, The numbering of the m - sequence included in the binary 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.

58. According to the method according to any one of claims 53 to 56, characterized in that, The numbering of the preferred m - sequence pair 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.

59. According to the method according to claim 55 or 56, characterized in that, The a is determined according to at least one of the following: the n 1 , the parameter m 0 , the first length value; the b is determined according to at least one of the following: the n 1 , the parameter m 1 , 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, and the parameter m 0 represents the cyclic offset when the first m-sequence is used to generate the sequence of the first sub-signal, and the parameter m 1 represents the cyclic offset when the second m-sequence is used to generate the sequence of the first sub-signal.

60. According to the method according to claim 45 or 46 or 59, characterized in that, The parameter m 0 is determined according to the first sub-identifier, the parameter m 1 is determined according to the second sub-identifier; or, the parameter m 0 is determined according to the second sub-identifier, the parameter m 1 is determined according to the first sub-identifier; or, the parameter m 0 is determined according to the first sub-identifier and the second sub-identifier, the parameter m 1 is determined according to the first sub-identifier; or, the parameter m 0 is determined according to the first sub-identifier, the parameter m 1 is determined according to the first sub-identifier and the second sub-identifier.

61. According to the method according to claim 60, 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.

62. According to the method according to claim 60 or 61, characterized in that, The parameter m 0 is determined according to the modulo result of the first sub-identifier and the parameter G, the parameter m 1 is determined according to the modulo result of the second sub-identifier and the parameter F; or, the parameter m 1 is determined according to the modulo result of the first sub-identifier and the parameter G, the parameter m 0 is determined according to the modulo result of the second sub-identifier and the parameter F.

63. The method according to claim 60 or 61, characterized in that, The parameter m 0 is determined according to the quotient of the first sub-identifier and the parameter B and the second sub-identifier, the parameter m 1 is determined according to the modulo result of the first sub-identifier and the parameter B; or, the parameter m 1 is determined according to the quotient of the first sub-identifier and the parameter B and the second sub-identifier, the parameter m 0 is determined according to the modulo result of the first sub-identifier and the parameter B; wherein, the parameter B is less than the first length value.

64. The method according to any one of claims 45 or 46 or 59 to 63, characterized in that, The parameter m 0 is less than or equal to the first length value, and the parameter m 1 is less than or equal to the first length value.

65. The method according to claim 64, characterized in that, the m-sequence is an m-sequence in the m-sequence subset, and the number of the m-sequence in the m-sequence subset is determined according to the cell identifier; wherein, each m-sequence in the m-sequence subset corresponds to each cell identifier in the communication system one by one.

66. The method according to claim 65, characterized in that, the number of the m-sequence in the m-sequence set is equal to the cell identifier.

67. The method according to claim 53 or 65 or 66, characterized in that, the number of m-sequences in the m-sequence set is determined according to the number of stages of the shift register and / or the cyclic shift step size.

68. The method according to claim 53 or 65 or 66 or 67, characterized in that, the numbering order of the m-sequences in the m-sequence set is agreed by the communication protocol, or indicated by the network device, or is the default order, or determined by the terminal device.

69. The method according to claim 68, characterized in that, the numbering order of the m-sequences in the m-sequence set is determined according to one of the following orders: the order of the primitive polynomial coefficients from the highest power to the lowest power; the order of the primitive polynomial coefficients from the lowest power to the highest power; the order of the binary numbers of the primitive polynomial coefficients from the smallest to the largest; the order of the binary numbers of the primitive polynomial coefficients from the largest to the smallest; the order of the cyclic offsets from the smallest to the largest; the order of the cyclic offsets from the largest to the smallest.

70. The method according to claim 68 or 69, characterized in that, each cyclic shift sequence in the m-sequence set is arranged in ascending order of the cyclic offset after its corresponding basic m-sequence; or, each cyclic shift sequence in the m-sequence set is arranged in descending order of the cyclic offset after its corresponding basic m-sequence; or, all cyclic shift sequences in the m-sequence set are arranged in ascending order of the cyclic offset after all basic m-sequences; or, all cyclic shift sequences in the m-sequence set are arranged in descending order of the cyclic offset after all basic m-sequences.

71. The method according to any one of claims 39 to 70, characterized in that, the method further comprises: receiving 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 preferred pair of m-sequences, the number of the m-sequence, the cyclic shift step size, the numbering order of the m-sequences in the m-sequence set, the number of the m-sequence subset.

72. The method according to any one of claims 39 to 71, characterized in that, the time domain resources occupied by the first signal are continuous or discontinuous.

73. The method according to claim 72, characterized in that, The time-domain resources occupied by the first signal include at least two groups of time-domain units, and there is a time-domain interval or no time-domain interval between the at least two groups of time-domain units. Each group of time-domain units in the at least two groups of time-domain units is continuous or discontinuous.

74. The method according to any one of claims 39 to 73, wherein, the first signal is obtained by first modulation according to the binary sequence, and the first modulation includes one of the following: OOK modulation, PSK modulation, BPSK modulation, FSK modulation.

75. The method according to claim 74, wherein, one 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.

76. The method according to any one of claims 39 to 75, wherein, the first signal is obtained by scrambling according to the binary sequence; wherein, the sequence for scrambling includes at least one of the following: ZC sequence, QPSK sequence, QAM sequence.

77. A signal transmission device, wherein, the device includes: a sending module, configured to send a first signal, 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.

78. A signal transmission device, wherein, the device includes: a receiving module, configured to receive a first signal, 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.

79. A communication device, wherein, the communication device includes: 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 configured to implement the signal transmission method according to any one of claims 1 to 38, or any one of claims 39 to 76.

80. A communication device, wherein, the communication device includes: a receiver and / or a transmitter; wherein, the communication device is configured to implement the signal transmission method according to any one of claims 39 to 76.

81. A computer-readable storage medium, wherein, 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 according to any one of claims 1 to 38, or any one of claims 39 to 76.

82. A chip, wherein, the chip includes a programmable logic circuit or a program, and the chip is configured to implement the signal transmission method according to any one of claims 1 to 38, or any one of claims 39 to 76.

83. A computer program product, wherein, The computer program product includes computer instructions 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.

84. A computer program, characterized in that 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 any one of claims 1 to 38 or any one of claims 39 to 76.

Images