Wake-up signal transmission method and apparatus, device, and medium

Abstract

The present application relates to the field of communications, and discloses a wake-up signal (WUS) transmission method and apparatus, a device, and a medium. The method is executed by a network device. The method comprises: sending a WUS, wherein the WUS is used for waking up at least one terminal device, the WUS is generated on the basis of a first sequence or the WUS comprises the first sequence, and the type of the first sequence comprises at least one of the following: an m sequence, a Gold sequence, and a Walsh sequence. Low-power-consumption terminal device wake-up is realized by means of a low-complexity WUS sequence, making WUS transmission possible in some communication scenarios in which OFDM waveforms are difficult to be applied.

Description

Wake-up signal transmission method, device, equipment and medium Technical Field

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

[0002] To achieve energy conservation in terminal devices, a wake-up receiver can be introduced into traditional terminal devices. When the traditional receiver is not needed, it is turned off. When the traditional receiver needs to be turned on, the network device sends a wake-up signal to the wake-up receiver to turn it on.

[0003] However, due to the low complexity of the wake-up receiver, it is difficult to receive or process common Orthogonal Frequency-Division Multiplexing (OFDM) signals. Therefore, the wake-up signal is not suitable for OFDM waveforms, and the common ZC sequence used to generate OFDM signals is no longer applicable. There is currently no feasible solution for designing the wake-up signal.

[0004] Summary of the Invention

[0005] This application provides a method, apparatus, device, and medium for transmitting a wake-up signal. The technical solution at least includes:

[0006] According to one aspect of an embodiment of the present application, a method for transmitting a wake-up signal is provided, the method being performed by a network device, the method comprising:

[0007] Send a wake-up signal, the WUS is used to wake up at least one terminal device; wherein, the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence includes at least one of the following: m sequence; Gold sequence; Walsh sequence.

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

[0009] A wake-up signal is received, where the WUS is used to wake up at least one terminal device; wherein the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence includes at least one of the following: m sequence; Gold sequence; Walsh sequence.

[0010] According to another aspect of an embodiment of the present application, a device for transmitting a wake-up signal is provided, the device including:

[0011] A sending module is used to send a wake-up signal, and the WUS is used to wake up at least one terminal device; wherein the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence includes at least one of the following: m sequence; Gold sequence; Walsh sequence.

[0012] According to another aspect of an embodiment of the present application, a device for transmitting a wake-up signal is provided, the device including:

[0013] A receiving module is used to receive a wake-up signal, and the WUS is used to wake up at least one terminal device; wherein the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence includes at least one of the following: m sequence; Gold sequence; Walsh sequence.

[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] The communication device is used to implement the above-mentioned method for transmitting the wake-up signal.

[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] The communication device is used to implement the above-mentioned method for transmitting the wake-up signal.

[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 wake-up 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, the computer instructions are stored in a computer-readable storage medium, a processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes to implement the wake-up signal transmission method as 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 wake-up signal transmission method as described in the above aspect.

[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 wake-up 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 WUS is generated based on a binary sequence, it is very easy to combine with non-OFDM waveforms such as OOK waveforms, PSK waveforms, and FSK waveforms. This provides the possibility of transmitting WUS in some communication scenarios where OFDM waveforms are difficult to use, thereby achieving energy saving in terminal equipment through WUS. 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 flow chart showing a method for transmitting a wake-up signal according to an exemplary embodiment of the present application;

[0036] FIG11 is a schematic flow chart showing a method for transmitting a wake-up signal according to an exemplary embodiment of the present application;

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

[0038] FIG13 is a schematic flow chart showing a method for transmitting a wake-up signal according to an exemplary embodiment of the present application;

[0039] FIG14 is a schematic flow chart showing a method for transmitting a wake-up signal according to an exemplary embodiment of the present application;

[0040] FIG15 is a schematic diagram showing a flow chart of a method for transmitting a wake-up signal according to an exemplary embodiment of the present application;

[0041] FIG16 is a schematic flow chart showing a method for transmitting a wake-up signal according to an exemplary embodiment of the present application;

[0042] FIG17 is a schematic diagram showing a flow chart of a method for transmitting a wake-up signal according to an exemplary embodiment of the present application;

[0043] FIG18 shows a structural block diagram of a device for transmitting a wake-up signal provided by an exemplary embodiment of the present application;

[0044] FIG19 shows a structural block diagram of a device for transmitting a wake-up signal provided by an exemplary embodiment of the present application;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0061] Low-power devices:

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

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

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

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

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

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

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

[0069] (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.

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

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

[0072] (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.

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

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

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

[0076] (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.

[0077] (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.

[0078] (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.

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

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

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

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

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

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

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

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

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

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

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

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

[0091] Wake-Up Receiver (WUR):

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

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

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

[0095] Therefore, WUS plays an important role in achieving energy conservation and requires appropriate design. However, due to the extremely low device complexity of WUS, it is difficult to support the reception of OFDM waveforms and the common Orthogonal Frequency-Division Multiplexing (OFDM) waveforms, which means that it is difficult to use OFDM-based wake-up signals to achieve energy conservation.

[0096] Therefore, there is no specific and feasible solution on how to achieve the transmission of WUS.

[0097] To this end, the present application provides a method, apparatus, device, and medium for transmitting a wake-up signal, which supports network devices to send a WUS generated based on a binary sequence to achieve energy saving of terminal devices.

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

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

[0108] m-sequence:

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

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

[0111] 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…ar-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).

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

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

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

[0115] 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. i If 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.

[0116] 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。

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

[0118] 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) (4)

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

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

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

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

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

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

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

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

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

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

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

[0130] Gold Sequence:

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

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

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

[0134] Walsh Sequence:

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

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

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

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

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

[0140] FIG10 is a flow chart showing a method for transmitting a wake-up signal according to an exemplary embodiment of the present application. The method is executed by a network device and includes:

[0141] Step 1010: Send WUS, where WUS is used to wake up at least one terminal device; wherein the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence includes at least one of the following: m sequence; Gold sequence; Walsh sequence.

[0142] Since m-sequences, Gold sequences, and Walsh sequences all include sequence elements with only two values, the first sequence also includes sequence elements with only two values. For example, the first sequence includes only "0" and "1," or the first sequence includes only "+1" and "-1."

[0143] In some embodiments, the WUS is carried in a coded manner, for example, the first sequence is carried in a coded channel.

[0144] In some embodiments, the WUS is sent in a sequence, such as directly sending a first sequence in a channel.

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

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

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

[0148] To sum up, the method provided in the embodiment of the present application is very easy to combine with non-OFDM waveforms such as OOK waveform, PSK waveform, FSK waveform, etc., because WUS is generated according to a binary sequence. It provides the possibility of transmitting WUS for some communication scenarios where OFDM waveforms are difficult to use, thereby achieving energy saving of terminal equipment through WUR.

[0149] In some embodiments, the WUS carries identification (ID) information, which includes UE ID information and / or UE group ID information. If the WUS carries UE ID information, it means that the WUS is used to wake up the UE corresponding to the UE ID. If the WUS carries UE group ID information, it means that the WUS is used to wake up the UE group corresponding to the UE group ID. It should be noted that if any UE in a UE group needs to be woken up, the UE group ID information should be carried in the WUS.

[0150] If WUS is carried in an encoded manner, then the bits of the identification information only need to be encoded in an encoding manner as shown in Figure 7, so that WUS can carry the identification information. After receiving the WUS, the receiving end can decode it to obtain the identification information, thereby determining whether the WUS is used to wake itself up.

[0151] If the WUS is sent in a sequence, since the identification information cannot be carried by encoding, if you want to distinguish different identification information by sequence, you should correspond to a first sequence for each identification. In other words, the identification information and the first sequence should be matched one by one. Only then can the receiving end clearly identify the corresponding identification information after receiving the first sequence, and thus determine whether the WUS is used to wake itself up.

[0152] If the identification information includes UE group ID information, that is, when one first sequence corresponds to one UE group, the number of first sequences is related to the number of UE groups. For example, the UEs in the communication system are divided into 1 group, or 2 groups, or 4 groups, or 8 groups, or 16 groups, and so on, and a group of UEs corresponds to the same first sequence. This solution is not only applicable to waking up UEs in the Radio Resource Control (RRC) connected state, but is also particularly applicable to waking up UEs in the RRC idle state or the RRC inactive state. This is because it is difficult for network equipment to send a WUS corresponding to a UE ID one-to-one to a UE in the RRC idle state or the RRC inactive state. The division of UE group IDs facilitates UEs in the RRC idle state or the RRC inactive state to receive the WUS in a timely manner.

[0153] Optionally, when dividing the UE groups, the UEs in the communication system are randomly divided into several UE groups.

[0154] Optionally, UEs in the communication system are divided into several UE groups according to service types. For example, UEs with the same or similar services are divided into the same UE group to avoid negative impacts between different services.

[0155] Optionally, UEs in the communication system are divided into several UE groups according to the traffic busyness, for example, UEs with busy traffic are divided into the same UE group, and UEs with sparse traffic are divided into the same UE group.

[0156] If the identification information includes UE ID information, that is, one first sequence corresponds to one UE, the number of first sequences is related to the number of UEs. Therefore, this solution requires supporting more first sequences to correspond to more UEs. Generally, a cell has many users residing or having established RRC connections with the network. This solution is applicable to waking up UEs in RRC connected state as well as UEs in RRC idle state or RRC inactive state.

[0157] In some embodiments, the first sequence is associated with a cell identifier (Cell ID). Using different first sequences in different cells, particularly adjacent cells, is supported to avoid inter-cell interference. Otherwise, if the first sequences are not differentiated between cells, a WUS sent by cell 1 and received by a UE in cell 2 may cause the UE in cell 2 to be mistakenly awakened.

[0158] In some embodiments, the first sequence is associated with a Tracking Area ID (TA ID). Considering that the network device cannot clearly identify the resident cell of a UE in an RRC idle state or an RRC inactive state, but can know the TA in which the UE is located, it supports distinguishing the first sequence by the TA ID, that is, supporting UEs in different TAs to use different first sequences to wake up UEs in an RRC idle state or an RRC inactive state. Moreover, when the first sequence corresponds to a UE group ID, the UE groups that need to be awakened in different TAs may be different. If the first sequence is not distinguished between TAs, the UE groups in the TA may be woken up by mistake.

[0159] In some embodiments, the first sequence is associated with a Radio Access Network Area ID (RAN Area ID). Considering that a UE in an RRC inactive state may update the RAN area to a network device, it is supported to distinguish the first sequence by the RAN area ID, that is, to support UEs in different RAN areas using different first sequences to achieve wake-up of UEs in an RRC inactive state. In addition, when the first sequence corresponds to a UE group ID, the UE groups that need to be awakened in different RAN areas may be different. If the first sequence is not distinguished between RAN areas, the UE groups in the RAN area may be mistakenly awakened.

[0160] Based on the above, it can be understood that a first sequence that can be used to distinguish different UEs and / or different UE groups within the communication system must be designed to implement a solution for waking up the UEs through the sequence. This first sequence can be associated with one or more of a cell ID, a TA ID, and a RAN area ID. For ease of explanation, in this application, cells, TAs, and RAN areas are collectively referred to as regions, and region identifiers include at least one of the following: cell ID, TA ID, and RAN area ID. It is understood that a region in this application can be a cell, a TA, or a RAN area.

[0161] Therefore, the following discusses how to generate enough first sequences to meet the wake-up requirements in the communication system, and discusses the correspondence / mapping relationship between the first sequences and the first areas, so that the UE receiving the WUS can clearly identify the wake-up object of the WUS.

[0162] The first sequence in this application is a binary sequence, such as an m-sequence, a gold sequence, a Walsh sequence, and the like.

[0163] Taking the first sequence including the m-sequence as an example, based on step 1010, the relevant content of how to generate the WUS based on the m-sequence is further introduced.

[0164] FIG11 is a flow chart showing a method for transmitting a wake-up signal according to an exemplary embodiment of the present application. The method is executed by a network device and includes:

[0165] Step 1110: Send WUS, where WUS is used to wake up at least one terminal device; wherein the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence is an m-sequence.

[0166] In some embodiments, the first sequence is one of a first number of m-sequences; wherein the first number of m-sequences includes the first m-sequence and / or the second m-sequence.

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

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

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

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

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

[0172] 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 12 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.

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

[0174] 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, which will not be described further below.

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

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

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

[0178] 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 wake-up signal. Exemplarily, the cyclic offset is set to be greater than a first threshold value, which is agreed upon by the communication protocol, or indicated by the network device, or determined according to the chip length of the m-sequence.

[0179] After understanding how the first m-sequence and the second m-sequence are generated, we can consider designing a method for generating the first sequence based on the first m-sequence and the second m-sequence.

[0180] In some embodiments, the first sequence includes all m-sequences used to generate the WUS corresponding to the region where the terminal device is located. This can also be understood as the first sequence being the m-sequences used by all WUSs received by all terminal devices in the same region. Therefore, the first sequence can be considered a regional-level m-sequence set, and the m-sequence used by the WUS sent by the network device to the terminal device is associated with the region where the terminal device is located.

[0181] In some embodiments, the total number of m-sequences corresponding to a region is preconfigured or agreed upon by a communication protocol. That is, the total number of m-sequences included in the first sequence is preconfigured or agreed upon by a communication protocol.

[0182] In some embodiments, the number of m-sequences used to generate the first sequence is preconfigured or agreed upon by a communication protocol.

[0183] The embodiment of the present application provides two methods to generate a first sequence using an m-sequence.

[0184] Method 1: First, determine X first m-sequences corresponding to a region. Then, generate Y second m-sequences based on these X first m-sequences. The first sequence corresponding to this region is generated from these X first m-sequences and Y second m-sequences. Alternatively, the first sequence corresponding to this region can be generated from only X first m-sequences, or even only Y second m-sequences.

[0185] Method 2: First, construct a large m-sequence set, which includes several first m-sequences and second m-sequences. Then, divide the m-sequence set into several m-sequence subsets, and map each m-sequence subset to the first sequence of a region. Of course, the m-sequence set can also include only several first m-sequences, or even only several second m-sequences.

[0186] Next, the first method is introduced, which generates a first sequence corresponding to a region according to X first m-sequences.

[0187] The first sequence corresponding to a region can be generated based on only X first m-sequences, Y second m-sequences, or X first m-sequences and Y second m-sequences. Regardless of the generation method, determining the X first m-sequences is paramount. Because the second m-sequence is a cyclic shift of the first m-sequence, once the X first m-sequences are determined, the Y second m-sequences can be derived naturally based on the cyclic shift step size or cyclic offset.

[0188] Therefore, we will first discuss how to determine the X first m-sequences. In some embodiments, the value of X is determined by a communication protocol, configured by a network device, or determined by a terminal device. For example, the value of X is adjusted by the network device or the terminal device based on one or more of the following factors: terminal device capabilities, network device capabilities, communication system capacity, communication requirements, the total number of area identifiers, the number of terminal devices in the same area, etc. The total number of area identifiers can be the total number of cell IDs, the total number of TA IDs, or the total number of RAN area IDs.

[0189] In some embodiments, the X first m-sequences are agreed upon by a communication protocol, or configured by a network device, or determined by a terminal device.

[0190] In some embodiments, the X first m-sequences are X of the N first m-sequences, where N is an integer greater than or equal to 1, and 1≤X≤N. The N first m-sequences are determined according to the number r of shift register stages.

[0191] Since there is an upper limit to the number of primitive polynomials that can be generated with different series, there is also an upper limit to the number of first m-sequences that correspond one-to-one with these primitive polynomials. The upper limit on the number of first m-sequences for different series r can be found in Table 1. Therefore, the value of N here can be equal to or less than the upper limit on the number of primitive polynomials. For example, when the series r = 5, a maximum of six fifth-degree primitive polynomials can be generated, meaning a maximum of six fifth-order first m-sequences can be generated. Therefore, the value of N can be less than or equal to 6.

[0192] Optionally, the X first m-sequences are any X of the N first m-sequences. Optionally, the X first m-sequences are X default sequences of the communication system from the N first m-sequences. Optionally, the X first m-sequences are X of the N first m-sequences indicated by the network device. Optionally, the X first m-sequences are X selected from the N first m-sequences according to a specific rule.

[0193] The specific rules mentioned in this application may be rules agreed upon in the communication protocol, rules configured by the network device, default rules, and so on.

[0194] Since the X first m-sequences are among the N first m-sequences, we first need to introduce the design of the N first m-sequences, and then introduce how to determine / indicate / select the X first m-sequences.

[0195] First, the design of N first m-sequences is introduced.

[0196] It is understood that in order to facilitate the distinction between each first m-sequence, the N first m-sequences should each have a one-to-one corresponding number or index. The embodiment of the present application uses numbering as an example for illustration. For example, the N first m-sequences are numbered 0, 1, 2..., N-1, or the N first m-sequences are numbered 1, 2..., N, and so on. Other numbering schemes that can distinguish each first m-sequence are also applicable to the embodiment of the present application. The embodiment of the present application uses the numbering of 0, 1, 2..., N-1 as an example.

[0197] In some embodiments, the numbering order of the N first m-sequences is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or configured by a network device.

[0198] In some embodiments, the numbering order of the N first m-sequences is arranged from small to large according to the numbering value, or arranged from large to small according to the numbering value.

[0199] In some embodiments, the numbering order of the N first m-sequences is arranged according to the coefficients of the primitive polynomial that generates the first m-sequences. Exemplarily, the numbering order of the N first m-sequences is arranged in the order of the coefficients of the primitive polynomial from high power to low power. Exemplarily, the numbering order of the N first m-sequences is arranged in the order of the coefficients of the primitive polynomial from low power to high power. Exemplarily, the coefficients of the primitive polynomial are represented by binary numbers, and the numbering order of the N first m-sequences is arranged in the order of the binary numbers corresponding to the primitive polynomial from small to large. Exemplarily, the numbering order of the N first m-sequences is arranged in the order of the binary numbers corresponding to the primitive polynomial from large to small.

[0200] In some embodiments, N first m-sequences are first arranged according to a specific rule and then assigned numbers to form N first m-sequences numbered in the order of 0, 1, 2 . . . , N-1.

[0201] For example, the N first m-sequences are arranged in ascending order according to the binary numbers corresponding to the primitive polynomials, and then assigned numbers. Then, the binary number corresponding to the first m-sequence numbered 0 is the smallest of all the binary numbers corresponding to the N first m-sequences, and the binary number corresponding to the first m-sequence numbered N-1 is the largest of all the binary numbers.

[0202] In some embodiments, the N first m-sequences are first assigned numbers and then arranged according to a specific rule. Therefore, the numbering order of the N first m-sequences may be disrupted, for example, not in the order from 0 to N-1.

[0203] For example, the network device indicates that the numbering order of the N first m-sequences is 2, 0, N-1, ..., 1, which means that the first m-sequence numbered 2 is ranked first among the N first m-sequences, and the first m-sequence numbered 1 is ranked Nth among the N first m-sequences.

[0204] In some embodiments, the design of the numbering sequence can be understood as the case where the first m-sequence has both logical and physical numbering. The logical numbering refers to the logical order of the numbers in the first m-sequence, which can be understood as the numbers 0, 1, 2…, N-1 or 1, 2…, N in the embodiments of this application; the physical numbering refers to the position of the numbers in the first m-sequence in the memory, or the position in the agreed mapping relationship, which can be understood as the numbering sequence in the embodiments of this application (for example, 2, 0, N-1…, 1).

[0205] If the numbering order of the N first m-sequences is arranged in ascending order according to the number value, it can be understood that the logical number of the first m-sequence is the same as the physical number.

[0206] If the numbering order of the N first m-sequences is not arranged in ascending order of number value, it can be understood that the logical numbering of the first m-sequences is different from the physical numbering. The reason why the numbering order of the N first m-sequences is disrupted is to take into account the correlation between the m-sequences. For example, by changing the numbering order of the first m-sequences, the first m-sequences with relatively good correlations can be arranged adjacent to each other. When the network device determines the first sequence by configuring the first starting information, it is easy to make the WUS sequence set corresponding to a region have good correlation. By appropriately configuring the X first m-sequences corresponding to different adjacent regions (for example, indicating different first starting information to different regions), the network device can also make the WUS sequence sets corresponding to adjacent regions have good correlation. In addition, data storage may be affected by factors such as memory allocation method and memory management of the operating system. The numbering order of the N first m-sequences may also need to be adjusted according to the storage situation. Therefore, there is a possibility of adjusting the numbering order of the N first m-sequences according to actual conditions, that is, adjusting the physical numbering of the first m-sequences.

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

[0208] Next, it is introduced how to determine, indicate or select X first m-sequences from the N first m-sequences mentioned above.

[0209] In some embodiments, the X first m-sequences are randomly selected by the network device from the N first m-sequences. Alternatively, the X first m-sequences are selected by the network device from the N first m-sequences according to a specific rule, where the specific rule is determined by the communication protocol or autonomously by the communication device. Alternatively, the X first m-sequences are the default first m-sequences from the N first m-sequences. For example, the X first m-sequences are the first m-sequences with a default number of 1 (or other values), or the first m-sequences ranked in the last X positions (or other positions), or the first m-sequences with even numbers, etc.

[0210] In some embodiments, the X first m-sequences are indicated by a network device. Exemplarily, the network device indicates the numbers of the X first m-sequences via signaling. The signaling may be, for example, one or more of system information, RRC signaling, a Media Access Control (MAC) control element (CE), downlink control information (DCI), and the like.

[0211] Considering the value of X, we will discuss how to determine the X first m-sequences in two cases:

[0212] 1. Case where X = 1: If X = 1, it means that the first sequence corresponding to one region is generated according to one basic m-sequence.

[0213] In some embodiments, the first m-sequence is determined or selected based on the area identifier of the terminal device. Exemplarily, the number of the first m-sequence used to generate the first sequence is determined based on the cell ID, TA ID, or RAN area ID of the terminal device. The number of the first m-sequence refers to the number of the first m-sequence among the N first m-sequences.

[0214] In some embodiments, the number of the first m-sequence used to generate the first sequence is equal to the area identifier of the terminal device. For example, the TA ID of the terminal device is 5, and the first m-sequence included in the first sequence is the first m-sequence numbered 5 among the N first m-sequences.

[0215] In some embodiments, the number of the first m-sequence used to generate the first sequence is determined according to a mathematical operation result of the area identifier of the terminal device.

[0216] Exemplarily, the number of the first m-sequence used to generate the first sequence is equal to the modulo product of the terminal device's region identifier and N. N here refers to the number of N first m-sequences, which is determined by the number of shift register stages r. The value of N can be equal to or less than the upper limit of the number of primitive polynomials. Exemplarily, if the terminal device's region identifier is 16 and the stage r = 6, a maximum of 6 primitive polynomials can be generated. Let N be 6, and 16 mod 6 = 4. Therefore, the first m-sequence used to generate the first sequence is the first m-sequence numbered 4 among the N first m-sequences.

[0217] Exemplarily, the number of the first m-sequence used to generate the first sequence is equal to an integer multiple of the area identifier of the terminal device, or equal to the rounded-up result of the quotient of the area identifier of the terminal device and N, or equal to the rounded-down result of the quotient of the area identifier of the terminal device and N, and so on.

[0218] In some embodiments, the network device indicates the number of the first m-sequence used to generate the first sequence, or the communication protocol stipulates the number of the first m-sequence used to generate the first sequence.

[0219] 2. Case X>1: If X>1, it means that the first sequence corresponding to a region is generated based on multiple basic m-sequences.

[0220] In some embodiments, the X first m-sequences are determined based on the first sequence information. Optionally, at least part of the first sequence information is indicated by the network device, and / or at least part of the first sequence information is agreed upon by the communication protocol, and / or at least part of the first sequence information is determined by the terminal device.

[0221] In some embodiments, the first sequence information includes at least one of the following information:

[0222] First starting information, used to indicate the starting position of the X first m-sequences in the N first m-sequences;

[0223] First length information, used to indicate the value of X;

[0224] First end information, used to indicate the end position of the X first m-sequences in the N first m-sequences;

[0225] A first bitmap, where each bit corresponds one-to-one to the N first m-sequences;

[0226] The numbers of the X first m-sequences;

[0227] The total number of sequences in the first sequence, S;

[0228] The number of the WUS sequence in the first sequence;

[0229] Cyclic shift step size N CS , which can also be called the cyclic shift factor;

[0230] The numbering order of the N first m-sequences;

[0231] Cycle offset C.

[0232] Among them, the first sequence can be understood as the WUS sequence set corresponding to the area where the terminal device is located.

[0233] In some embodiments, the first sequence information includes first start information and first length information. Alternatively, the first sequence information includes first start information, first length information, and the numbering order of the N first m-sequences. For example, N = 9, and the communication protocol stipulates that the numbering order of the N first m-sequences is 0, 1, 2, ..., 8. The network device indicates that the first start information = 2 and the first length information = 3. Then, the X first m-sequences include first m-sequences numbered 2, 3, and 4. This method requires fewer indication bits, making it easier to determine the X consecutive first m-sequences.

[0234] In some embodiments, the first start information and the first length information may also be represented by a coded value, such as a start and length indicator value (SLIV).

[0235] In some embodiments, the first sequence information includes first start information and first end information. Alternatively, the first sequence information includes first start information, first end information, and the numbering order of the N first m-sequences.

[0236] In some embodiments, the first sequence information includes first length information and first end information. Alternatively, the first sequence information includes first length information, first end information, and the numbering order of the N first m-sequences.

[0237] In some embodiments, the first sequence information includes numbers of the X first m-sequences. Exemplarily, the network device generates the first sequence based on the first m-sequences numbered 2, 6, and 9. The network device may also indicate to the terminal device that the X first m-sequences are numbered 2, 6, and 9, so that the terminal device generates the first sequence based on the first m-sequences numbered 2, 6, and 9.

[0238] In some embodiments, the first sequence information includes a first bit map. Alternatively, the first sequence information includes a first bit map and a numbering order of N first m-sequences. When the bit value is the first value, it indicates that the first m-sequence corresponding to the bit is indicated as one of the X first m-sequences, and when the bit value is the second value, it indicates that the first m-sequence corresponding to the bit is not indicated as one of the X first m-sequences. The first value is "1" and the second value is "0", or the first value is "0" and the second value is "1". Of course, the first value and the second value can also be other values, as long as the first value and the second value are different.

[0239] In some embodiments, the first sequence information includes a cyclic shift step size and the numbering order of the N first m-sequences. Alternatively, the first sequence information includes a cyclic shift step size and first starting information. Alternatively, the first sequence information includes the first starting information and the numbering order of the N first m-sequences.

[0240] In some embodiments, the first sequence information includes first starting information, a cyclic shift step, and the numbering order of the N first m-sequences. Alternatively, the first sequence information includes the first starting information, the cyclic shift step, and the total number of sequences in the first sequence. Alternatively, the first sequence information includes the first starting information, the numbering order of the N first m-sequences, and the total number of sequences in the first sequence. Alternatively, the first sequence information includes the cyclic shift step, the numbering order of the N first m-sequences, and the total number of sequences in the first sequence.

[0241] In some embodiments, the first sequence information includes first starting information, a cyclic shift step, a numbering order of the N first m-sequences, and a total number of sequences in the first sequence.

[0242] Exemplarily, a first m-sequence numbered u is determined according to the first starting information, assuming that the length of the first m-sequence numbered u is L, a cyclic offset is determined according to the cyclic shift step, and the first m-sequence numbered u is cyclically shifted according to the determined cyclic offset to obtain m sequences (including the first m sequence numbered u itself). Is it less than the total number of sequences S in the first sequence? This means that the first sequence has not been constructed yet. It means that the first sequence has been constructed, and the X first m-sequences include the first m-sequence numbered u. For example, according to the numbering order of N first m-sequences, the first m-sequence numbered d that immediately follows the first m-sequence numbered u is determined. Assuming that the length of the first m-sequence numbered d is also L, the first m-sequence numbered d is cyclically shifted according to the determined cyclic offset to obtain m-sequences (including the first m-sequence numbered d). Is it less than the total number of sequences S in the first sequence? Then it means that the first sequence has been constructed, and the X first m-sequences include the first m-sequences numbered u and d. This indicates that the first sequence has not been constructed yet. Continue to perform cyclic shift on the first m-sequence immediately following the first m-sequence numbered d, and repeat the above steps until the total number of m-sequences obtained after cyclic shift is equal to the total number S of sequences in the first sequence.

[0243] In the embodiment of the present application, the lengths of the N first m-sequences are all equal for illustrative purposes. Therefore, the lengths of the X first m-sequences used to generate the first sequence are also equal. Of course, this does not exclude the case where the lengths of the N first m-sequences are unequal.

[0244] Optionally, the network device determines and indicates to the terminal device: first starting information, cyclic shift step size, numbering order of the N first m-sequences, and the total number of sequences in the first sequence are agreed upon by the communication protocol.

[0245] Optionally, the network device determines and indicates to the terminal device: first starting information, cyclic shift step, numbering order of the N first m-sequences, and the total number of sequences in the first sequence.

[0246] Optionally, the network device determines and indicates to the terminal device: first starting information, a numbering order of the N first m-sequences, and a cyclic shift step size and a total number of sequences in the first sequence agreed upon by a communication protocol.

[0247] Optionally, the network device determines and indicates to the terminal device: first starting information. The cyclic shift step size and the total number of sequences in the first sequence are agreed upon by the communication protocol. The numbering order of the N first m-sequences is determined by the network device and the terminal device, respectively, according to rules agreed upon in the communication protocol.

[0248] Optionally, the network device determines and indicates to the terminal device: first starting information. The total number of sequences in the first sequence is agreed upon in the communication protocol. The cyclic shift step size and the numbering order of the N first m-sequences are determined by the network device and the terminal device, respectively, according to rules agreed upon in the communication protocol.

[0249] For example, the communication protocol stipulates N CS =2, and it is agreed that the total number of sequences included in the first sequence corresponding to one region is S=64. The network device determines and indicates to the terminal device that the numbering order of the N first m-sequences is 3, 7, 1, 20, 5, 6, 4, 2. Assume that the length of the N first m-sequences is L=63. The network device determines and indicates to the terminal device the first starting information = 2. The network device and the terminal device each determine the first m-sequence numbered 7 based on the first starting information. After cyclic shift, the first m-sequence numbered 7 is obtained. m-sequences (including the first m-sequence numbered 7 itself). Obviously, 31 < 64. Then, based on the numbering order of the N first m-sequences, the first m-sequence numbered 1 is determined. After cyclic shifting the first m-sequence numbered 1, 31 m-sequences are obtained (including the first m-sequence numbered 1 itself). Obviously, 31 * 2 < 64. Repeat the above steps and continue to cyclically shift the first m-sequence numbered 0 once to obtain 2 m-sequences (including the first m-sequence numbered 0 itself). 31 * 2 + 2 = 64. Therefore, the X first m-sequences include the first m-sequences numbered 7, 1, and 0. The Y second m-sequences include all the second m-sequences of the first m-sequences numbered 7 and 1, as well as one second m-sequence of the first m-sequence numbered 0.

[0250] The above example involves determining the cyclic offset according to the cyclic shift step size. The following formula (9) exemplarily provides a design:

[0251] In some embodiments, the cyclic shift step size is agreed upon by a communication protocol, and / or indicated by a network device, and / or determined by a terminal device. Exemplarily, the cyclic shift step size is associated with a cell radius, which can also be understood as being associated with a coverage radius of the network device, with the network device and the terminal device determining the cyclic shift step size based on the cell radius. Exemplarily, the cyclic shift step size is associated with an area identifier, with the network device and the terminal device determining the cyclic shift step size based on the area identifier.

[0252] In some embodiments, the first sequence information includes first starting information, a cyclic offset, the numbering order of the N first m-sequences, and the total number of sequences in the first sequence. The principle behind this is similar to the aforementioned "first sequence information includes first starting information, a cyclic shift step, the numbering order of the N first m-sequences, and the total number of sequences in the first sequence" scenario, except that the cyclic offset can be determined directly from the first sequence information, rather than using the cyclic shift step.

[0253] In some embodiments, the first sequence information includes first starting information, a cyclic offset set, the numbering order of the N first m-sequences, and the total number of sequences in the first sequence. The reason for supporting the first sequence information to include the cyclic offset set is that the number of second m-sequences that can be generated by the first m-sequence affects the number of first m-sequences in the first sequence. If more cyclic offsets are used to cyclically shift the first m-sequences, the number of first m-sequences required to form the first sequence will be smaller. Optionally, different cyclic offset sets can be configured for different first m-sequences to achieve more flexible cyclic shifting.

[0254] Regarding Y second m-sequences:

[0255] After obtaining X first m-sequences according to the above method, Y second m-sequences can be determined by combining the cyclic shift step length. For example, if the length of the first m-sequence is L, according to the cyclic shift step length, a first m-sequence can generate at most Second m-sequences, therefore, X first m-sequences can generate at most A second m-sequence. or,

[0256] Regardless of whether the first sequence information is indicated by the network device, agreed upon by the communication protocol, or determined by the terminal device, when the first sequence information includes the total number S of sequences in the first sequence, the terminal device should ensure that X+Y=S when obtaining the first sequence.

[0257] In some embodiments, the value of Y is determined by a communication protocol, configured by a network device, or autonomously determined by a terminal device. For example, the value of Y is adjusted by the network device or the terminal device based on one or more of the following factors: the capabilities of the terminal device, the capabilities of the network device, the capacity of the communication system, the communication demand, the total number of area identifiers, the number of terminal devices in the same area, and the like.

[0258] After determining X first m-sequences and Y second m-sequences, the first sequence can be generated. Next, the sequence arrangement within the first sequence is described.

[0259] In some embodiments, the first sequence is generated based on X first m-sequences and Y second m-sequences. That is, in the binary sequence used to generate the first sequence, the number of first m-sequences is X, and the number of second m-sequences is Y. Here, X is an integer greater than or equal to 0, Y is an integer greater than or equal to 0, and X and Y cannot be 0 at the same time. It can also be understood that the first sequence corresponding to the area where the terminal device is located is generated by X first m-sequences and several shifted sequences thereof.

[0260] Permutations of X first m-sequences within the first sequence:

[0261] In some embodiments, the numbering order of the X first m-sequences corresponding to the first sequence follows their numbering order among the N first m-sequences. That is, the numbering order of the X first m-sequences when generating the first sequence is the same as the numbering order of the X first m-sequences among the N first m-sequences. For example, if the numbering order of the N first m-sequences is 5, 1, 0, 4, 3, 2, 7, 8, 6, and the X first m-sequences include first m-sequences numbered 4, 3, 2, and 7, then when generating the first sequence, the X first m-sequences are still arranged in the numbering order of 4, 3, 2, and 7.

[0262] In some embodiments, the numbering order of the X first m-sequences corresponding to the first sequence is determined according to at least one of the following: the corresponding primitive polynomial coefficients, the binary numbers of the corresponding primitive polynomial coefficients, and the numbering values ​​of the first m-sequences.

[0263] In some embodiments, the numbering order of the X first m-sequences corresponding to the first sequence is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device.

[0264] In some embodiments, the numbering order of the X first m-sequences corresponding to the first sequence is different from the numbering order of the X first m-sequences in the N first m-sequences. For example, the X first 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, if the numbering order of the N first m-sequences is 5, 1, 0, 4, 3, 2, 7, 8, 6, and the X first m-sequences include first m-sequences numbered 4, 3, 2, and 7, then the X first m-sequences in the first sequence are arranged in the order of 2, 3, 4, and 7.

[0265] Permutation of Y second m-sequences within the first sequence:

[0266] In some embodiments, the numbering order of the Y second m-sequences within the first sequence is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device.

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

[0268] In some embodiments, the Y second m-sequences are arranged in the first sequence by first numbering the corresponding first m-sequences and then by cyclic offset from smallest to largest. Alternatively, the Y second m-sequences are arranged by first numbering the corresponding first m-sequences and then by cyclic offset from largest to smallest. Exemplarily, the Y second m-sequences include: y1 second m-sequences obtained by cyclic shifting the first m-sequence numbered H1, y2 second m-sequences obtained by cyclic shifting the first m-sequence numbered H2, and y3 second m-sequences obtained by cyclic shifting the first m-sequence numbered H3. H1<H2<H3. Therefore, the Y second m-sequences are arranged in the following order: y1 second m-sequences arranged by cyclic offset from smallest to largest, y2 second m-sequences arranged by cyclic offset from smallest to largest, and y3 second m-sequences arranged by cyclic offset from smallest to largest. Y1, y2, and y3 are all equal, or y1, y2, and y3 are unequal.

[0269] In some embodiments, the Y second m-sequences are numbered in the first sequence by first arranging the corresponding primitive polynomial coefficients from high to low power, and then arranging them from small to large according to the cyclic offset. Alternatively, the Y second m-sequences are numbered by first arranging the corresponding primitive polynomial coefficients from high to low power, and then arranging them from large to small according to the cyclic offset. Alternatively, the Y second m-sequences are numbered by first arranging the corresponding primitive polynomial coefficients from low to high power, and then arranging them from small to large according to the cyclic offset. Alternatively, the Y second m-sequences are numbered by first arranging the corresponding primitive polynomial coefficients from low to high power, and then arranging them from large to small according to the cyclic offset.

[0270] In some embodiments, the Y second m-sequences are numbered in the first sequence by first sorting the binary numbers of the corresponding primitive polynomial coefficients from small to large, and then sorting them by cyclic offset from small to large. Alternatively, the Y second m-sequences are numbered by first sorting the binary numbers of the corresponding primitive polynomial coefficients from small to large, and then sorting them by cyclic offset from large to small. Alternatively, the Y second m-sequences are numbered by first sorting the binary numbers of the corresponding primitive polynomial coefficients from large to small, and then sorting them by cyclic offset from small to large. Alternatively, the Y second m-sequences are numbered by first sorting the binary numbers of the corresponding primitive polynomial coefficients from large to small, and then sorting them by cyclic offset from large to small.

[0271] In some embodiments, the Y second m-sequences are numbered 0, 1, 2, ..., Y, or 1, 2, ..., Y-1, etc. Other numbering schemes that can distinguish the first m-sequences are also applicable to the embodiments of the present application.

[0272] Permutations of X first m-sequences and Y second m-sequences within the first sequence:

[0273] In some embodiments, X first m-sequences are arranged first in the first sequence, and then Y second m-sequences are arranged, and the Y second m-sequences are arranged after the X first m-sequences. For example, assuming that the X first m-sequences are represented by M 1,1 ,M 1,2 …,M 1,X Assume that Y second m-sequences are represented as M 2,1 ,M 2,2 …,M 2,Y Then, the order of the m sequences in the first sequence is M 1,1 ,M 1,2 …,M 1,X ,M 2,1 ,M 2,2 …,M 2,Y ; or, M 1,X ,M 1,X-1 …,M 1,1 ,M 2,Y ,M 2,Y-1 …,M 2,1 .

[0274] In some embodiments, Y second m-sequences are arranged first within the first sequence, and then X first m-sequences are arranged, and the X first m-sequences are arranged after the Y second m-sequences.

[0275] In some embodiments, X first m-sequences and Y second m-sequences are arranged crosswise. Exemplarily, X first m-sequences are arranged first in the first sequence (they can 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 order of cyclic offset from small to large. Alternatively, X first m-sequences are arranged first in the first sequence, and each second m-sequence is arranged after its corresponding first m-sequence in order of cyclic offset from large to small. Exemplarily, assuming that the X first m-sequences are represented by M 1,0 ,M 2,0 ,M 3,0 , each first m sequence generates two second m sequences, M 1,0 The corresponding second m-sequence is denoted as M 1,1 ,M 1,2 ;M 2,0 The corresponding second m-sequence is denoted as M 2,1 ,M 2,2 ;M 3,0 The corresponding second m-sequence is denoted as M 3,1 ,M 3,2 Then, the order of the m sequences in the first sequence is M 1,0 ,M 1,1 ,M 1,2 ,M 2,0 ,M 2,1 ,M 2,2 ,M 3,0 ,M 3,1 ,M 3,2 That is to say, after each first m-sequence, the corresponding second m-sequence is arranged.

[0276] After sorting the X first m-sequences and / or Y second m-sequences based on the above method, a first sequence corresponding to the required number (for example, S) can be obtained. The number of each sequence in the first sequence can correspond to the number of the WUS sequence, that is, the number of each sequence in the first sequence corresponds one-to-one to the number of the WUS sequence. For example, the m-sequence numbered 0 in the first sequence corresponds to the WUS sequence numbered 0; the m-sequence numbered 1 in the first sequence corresponds to the WUS sequence numbered 1; and so on. For example, the m-sequence numbered 0 in the first sequence corresponds to the WUS sequence numbered 1; the m-sequence numbered 1 in the first sequence corresponds to the WUS sequence numbered 2; and so on.

[0277] The numbering order of the X first m-sequences and the Y second m-sequences can be the same or different. For example, both the first m-sequences and the second m-sequences are arranged according to their numbering values. For example, the first m-sequences are arranged according to primitive polynomial coefficients, and the second m-sequences are arranged according to cyclic offsets. For other possibilities, please refer to the above content and will not be elaborated on here.

[0278] The numbering value range of the X first m-sequences and the numbering value range of the Y second m-sequences can be completely the same, partially the same, or completely different. For details, please refer to the relevant content in the second method below, "First, introduce the design of the m-sequence set."

[0279] Method 1 can be used to determine the first sequence corresponding to a region. Therefore, whether different regions can use the same first sequence is a matter for further discussion.

[0280] In some cases, terminal devices in different areas are configured with different time-frequency resources, and can support completely or partially identical first sequences corresponding to different areas. In some cases, terminal devices in different areas are configured with the same time-frequency resources, and can support completely or partially identical first sequences corresponding to different areas.

[0281] Whether different regions use the same first sequence, combined with the generation of the first m-sequence and the second m-sequence, can have the following three situations:

[0282] 1. Different regions correspond to the same first m-sequence and the same second m-sequence. For example, this is achieved by indicating the same first sequence information to different regions, or by agreeing by a communication protocol that different regions use the same first sequence information.

[0283] 2. Different regions correspond to the same first m-sequence and different second m-sequences, that is, the basic m-sequences corresponding to different regions are the same, but the shift sequences are different. For example, this is achieved by corresponding different first sequence information for different regions. Exemplarily, the network device indicates the same first starting information, and the communication protocol stipulates that the cyclic shift step sizes corresponding to different regions are different. Then, the second m-sequences corresponding to different regions are naturally different. Exemplarily, the communication protocol stipulates that different regions use the same basic m-sequence, and the network device indicates the cyclic shift step sizes for different regions separately, or the terminal device autonomously determines the cyclic shift step size. Then, the second m-sequences corresponding to different regions are naturally different.

[0284] 3. Different regions correspond to different first m-sequences and different second m-sequences. In other words, different regions correspond to different basic m-sequences. For example, this is achieved by corresponding different first sequence information to different regions. Exemplarily, the network device indicates different first starting information to different regions, so that different regions use different basic m-sequences, and the communication protocol specifies the cyclic shift step lengths corresponding to different regions. Regardless of whether different regions use the same cyclic shift step length, since the first m-sequences used in each region are different, the second m-sequences obtained after cyclic shift will naturally not be exactly the same. Exemplarily, the network device indicates different first starting information and different cyclic shift step lengths to different regions, so that different regions correspond to different basic m-sequences and second m-sequences. For another example, the basic m-sequences corresponding to different regions are determined based on the region identifier or the calculation result of the region identifier, so different regions can naturally correspond to different first m-sequences and second m-sequences.

[0285] Next, the second method is introduced, which generates a first sequence corresponding to a region based on the m-sequence subset.

[0286] The m-sequence subset is a subset of the m-sequence set, wherein the m-sequence set includes the first m-sequence and / or the second m-sequence.

[0287] In some embodiments, the m-sequence set includes a first m-sequence and a second m-sequence, and the m-sequence subset includes the first m-sequence and / or the second m-sequence.

[0288] In some embodiments, within the m-sequence set, the number of first m-sequences is determined by the number of shift register stages r, and the number of second m-sequences is determined by the cyclic shift step size. The relationship between the number of stages r and the number of first m-sequences can be found in Table 1 above. The number of second m-sequences can be found in the "Related Concepts of Cyclic Shift" section above.

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

[0290] In some embodiments, an m-sequence subset is a subset of an m-sequence set. Optionally, an m-sequence subset is any subset of an m-sequence set. It is understood that any set is a subset of itself, and therefore, an m-sequence subset may also be the m-sequence set itself. Optionally, an m-sequence subset is a subset selected from an m-sequence set according to a specific rule. Optionally, an m-sequence subset is a subset of an m-sequence set that is defaulted by the communication system.

[0291] In some embodiments, the m-sequence subset is determined or selected by the terminal device from the m-sequence set. Alternatively, the m-sequence subset is indicated by the network device.

[0292] Next, we first introduce the design of the m-sequence set and then introduce how the m-sequence subset is determined, selected, or indicated.

[0293] First, the design of the m-sequence set is introduced. It is understood that for easy distinction, each m-sequence in the m-sequence set should have a one-to-one corresponding number or index. The embodiment of the present application uses numbering as an example for description.

[0294] Considering that an m-sequence set may contain both the first m-sequence and the second m-sequence, two numbering methods are provided here:

[0295] 1. Numbering does not distinguish between the first m-sequence and the second m-sequence. Assume that the m-sequence set includes W m-sequences, then the m-sequence set corresponds to W numbers, and the W m-sequences correspond one-to-one to the W numbers.

[0296] 2. Numbering to distinguish the first and second m-sequences. Assume that the m-sequence set contains W m-sequences, including W1 first m-sequences and W2 second m-sequences, where W = W1 + W2. Then, the number of each m-sequence consists of two parts: one part distinguishes the first and second m-sequences, and the other part indicates the number within the first or second m-sequence. The combination of these two parts forms the number that distinguishes the W m-sequences.

[0297] The order of m-sequence numbers within an m-sequence set:

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

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

[0300] 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 indicated by a network device.

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

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

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

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

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

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

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

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

[0309] In some embodiments, within an m-sequence set, all first m-sequences are arranged first (they may be arranged according to binary numbers and / or primitive polynomial coefficients and / or serial values, as described above), and then all second m-sequences are arranged (they may be arranged according to the cyclic offset and / or the serial order of the first m-sequences and / or the binary numbers and / or primitive polynomial coefficients and / or serial values, as described above), with all second m-sequences following all first m-sequences.

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

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

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

[0313] Then, it is introduced how the m-sequence subset is determined, selected or indicated.

[0314] In some embodiments, the number of m-sequences in the m-sequence subset is preconfigured or agreed upon in a communication protocol. Optionally, the number of first m-sequences in the m-sequence subset is preconfigured or agreed upon in a communication protocol. Optionally, the number of second m-sequences in the m-sequence subset is preconfigured or agreed upon in a communication protocol.

[0315] In some embodiments, the m-sequence subset is randomly selected by the terminal device from the m-sequence set. Alternatively, the m-sequence subset is a default subset of the m-sequence set. For example, the m-sequence subset is a subset consisting of m-sequences with odd numbers by default, or a subset consisting of m-sequences with numbers from 1 to 64 by default, or a subset consisting of m-sequences with the last several digits by default, etc.

[0316] In some embodiments, the m-sequence set is divided into at least one m-sequence subset, and each m-sequence subset has a one-to-one corresponding set number.

[0317] In some embodiments, the m-sequence subset is indicated by a network device. Exemplarily, the network device indicates the set number of the m-sequence subset via signaling, wherein the signaling is, for example, one or more of system information, RRC signaling, MAC CE, DCI, etc.

[0318] In some embodiments, the m-sequence subset used to generate the first sequence is determined or selected based on the region identifier of the terminal device. Exemplarily, the set number of the m-sequence subset is determined according to the region identifier of the terminal device.

[0319] In some embodiments, the set number of the m-sequence subset used to generate the first sequence is equal to the region identifier of the terminal device. For example, if the region identifier of the terminal device is 20, the m-sequence subset used to generate the first sequence is the m-sequence subset numbered 20 in the m-sequence set.

[0320] In some embodiments, the set number of the m-sequence subset used to generate the first sequence is determined according to a mathematical operation result of the area identifier of the terminal device.

[0321] Exemplarily, the m-sequence set is divided into x m-sequence subsets (x ≥ 1), and the set number of the m-sequence subset used to generate the first sequence is equal to the modulo result of the terminal device's region identifier and x. Exemplarily, the terminal device's region identifier is 18, x = 5, and 18 mod 5 = 3. Then, the m-sequence subset used to generate the first sequence is the m-sequence subset numbered 3 in the m-sequence set.

[0322] Exemplarily, the set number of the m-sequence subset used to generate the first sequence is equal to an integer multiple of the area identifier of the terminal device, or equal to the rounded-up result of the quotient of the area identifier of the terminal device and x, or equal to the rounded-down result of the quotient of the area identifier of the terminal device and x, and so on.

[0323] After sorting the m-sequences in the m-sequence set based on the above method, an m-sequence subset can be obtained. Based on the total number S of sequences in the m-sequence subset and the first sequence, the first sequence corresponding to the required number can be obtained. The first sequence includes all or part of the m-sequences in the m-sequence subset. The number of each sequence in the first sequence can correspond to the number of the WUS sequence, that is, the number of each sequence in the first sequence corresponds one-to-one with the number of the WUS sequence. For example, the m-sequence numbered 0 in the first sequence corresponds to the WUS sequence numbered 0; the m-sequence numbered 1 in the first sequence corresponds to the WUS sequence numbered 1; and so on. For example, the m-sequence numbered 0 in the first sequence corresponds to the WUS sequence numbered 1; the m-sequence numbered 1 in the first sequence corresponds to the WUS sequence numbered 2; and so on.

[0324] The WUS sequence number may also correspond to the UE ID in a one-to-one manner. For example, a WUS sequence numbered 0 corresponds to a UE ID valued at 0, a WUS sequence numbered 1 corresponds to a UE ID valued at 1, and so on. For example, a WUS sequence numbered 0 corresponds to a UE ID valued at 1, a WUS sequence numbered 1 corresponds to a UE ID valued at 2, and so on.

[0325] The WUS sequence number may also correspond one-to-one with the UE group ID. For example, a WUS sequence numbered 0 corresponds to a UE group ID valued at 0, a WUS sequence numbered 1 corresponds to a UE group ID valued at 1, and so on. For example, a WUS sequence numbered 0 corresponds to a UE group ID valued at 1, a WUS sequence numbered 1 corresponds to a UE group ID valued at 2, and so on.

[0326] The m-sequence subset corresponding to a region can be determined by the second method. Therefore, whether different regions can use the same m-sequence subset is a matter for further discussion.

[0327] Similar to Solution 1, this embodiment of the present application supports different regions corresponding to completely identical m-sequence subsets, partially identical m-sequence subsets, or completely different m-sequence subsets. Whether the m-sequence subsets are identical can be determined by whether the set numbers are identical, or by whether the m-sequence numbers within the m-sequence subsets are consistent.

[0328] If different regions correspond to different m-sequence subsets, different first sequences can be generated for different regions, so that terminal devices in different regions correspond to different first sequences, thereby avoiding false wake-up and WUS conflicts between regions as much as possible.

[0329] For example, assuming that region A corresponds to the m-sequence subset {0, 2, 4, 6, 8} with a set number of 2, it means that the first sequence used by region A includes m-sequences with sequence numbers 0, 2, 4, 6, and 8. Assuming that region B corresponds to the m-sequence subset {1, 5, 7} with a set number of 5, it means that the first sequence used by region B includes m-sequences with sequence numbers 1, 5, and 7. It can be seen that the m-sequence subset corresponding to region A is different from the m-sequence subset corresponding to region B, and the first sequences generated according to different m-sequence subsets are naturally different. When sending WUS to terminal devices in region A and terminal devices in region B, the possibility of conflict and interference is significantly reduced.

[0330] After understanding how the first sequence is generated, we can further consider how to generate the WUS sequence sent by the network device. The embodiment of the present application provides two solutions for generating the WUS sequence.

[0331] Solution 1: Based on Method 1 or Method 2 described above, the network device generates a first sequence. When a UE needs to be awakened, the network device selects a WUS sequence corresponding to the UE to be awakened from the first sequence and sends the WUS sequence. When a UE group needs to be awakened, the network device selects a WUS sequence corresponding to the UE group to be awakened from the first sequence and sends the WUS sequence.

[0332] It can be seen that in solution 1, the network device actually generates a set of WUS sequences for each area, and then selects the corresponding WUS sequence from the first sequence to send according to the wake-up requirement.

[0333] Solution 2: The network device first determines the number of the WUS sequence to be sent in the first sequence according to the wake-up requirement, and then generates the WUS sequence according to the above-mentioned method 1 or method 2.

[0334] As can be seen, in Solution 2, the network device only needs to immediately generate the WUS sequence to be sent. When a UE needs to be awakened, only the WUS sequence corresponding to the UE to be awakened needs to be generated. When a UE group needs to be awakened, only the WUS sequence corresponding to the UE group to be awakened needs to be generated.

[0335] Next, we will first introduce the method 1 for generating WUS sequence:

[0336] The generation of the first sequence may refer to the aforementioned method 1 (generating a first sequence corresponding to a region based on X first m-sequences) or method 2 (generating a first sequence corresponding to a region based on an m-sequence subset).

[0337] In some embodiments, after the network device generates a first sequence corresponding to a region, the first sequence is stored in a memory, which may be local or non-local, such as a server, a cloud platform, a virtualization center, etc.

[0338] In some embodiments, the network device randomly selects a sequence from the first sequence based on the UE ID or UE group ID as the WUS sequence. Alternatively, the network device assigns a WUS sequence to the UE ID or UE group ID in the first sequence according to a specific rule. If the identification information includes the UE ID, then the WUS sequences corresponding to different UE IDs should be different. If the identification information includes the UE group ID, then the WUS sequences corresponding to different UE group IDs should also be different to avoid false wakeups.

[0339] Next, we introduce the second method for generating WUS sequences:

[0340] The network device may also generate the WUS sequence required for this wake-up immediately before sending the WUS, without having to generate the WUS sequence corresponding to all areas in advance. Therefore, it is first necessary to clarify which one of the first sequences the WUS sequence corresponds to. Optionally, the network device indicates to the terminal device the WUS sequence corresponding to different areas according to the number 1 in the first sequence. S Alternatively, the communication protocol stipulates that the WUS sequences corresponding to different regions are generated according to the number 1 in the first sequence. S Alternatively, the terminal device autonomously determines the WUS sequence corresponding to different areas according to the rules agreed upon in the communication protocol. S The m-sequence is generated.

[0341] In some embodiments, the i-th sequence in the first sequence is determined based on at least one of the following: first starting information, a cyclic shift step, and a value of i; wherein the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

[0342] Combined I S and other first sequence information, such as one or more of the first starting information, the cyclic shift step, the numbering order of the N first m-sequences, etc., it can be determined that the WUS sequence is generated based on which basic m-sequence.

[0343] Exemplarily, the first sequence information includes number 1 S and the numbering order of the N first m sequences. The network device is based on I S A WUS sequence to be sent is determined. If the WUS sequence is a basic m-sequence, the WUS sequence may be directly generated according to stored and / or configured sequence information.

[0344] Exemplarily, the first sequence information includes number 1S , cyclic shift step, and the numbering order of the N first m-sequences. The network device is based on I S A WUS sequence to be sent is determined. If the WUS sequence is a cyclic shift sequence, the WUS sequence may be directly generated according to stored and / or configured sequence information and cyclic shift step size.

[0345] The embodiment of the present application supports formulating the above-mentioned second method for generating the WUS sequence.

[0346] Assume that combined with I S The basic m-sequence determined by the first sequence information and other first sequence information is the third m-sequence, that is, the WUS sequence is generated according to the third m-sequence.

[0347] In some embodiments, the sequence element numbered n in the WUS sequence is determined based on the sequence element numbered n' in the third m-sequence. It can also be understood that the value of the nth bit in the WUS sequence is determined based on the value of the n'th bit in the third m-sequence.

[0348] In some embodiments, n′ is determined according to at least one of the following: n, cyclic shift step size, number I S , a first length value. The first length value is the length value of the third m-sequence. n is greater than or equal to 0 and less than the first length value.

[0349] In some embodiments, n′ is determined based on a first modulo result. The first modulo result is a modulo result of the first sum value and the first length value. The first sum value is the sum of n and a target cyclic offset. The target cyclic offset is the cyclic offset of the target sequence relative to the third m-sequence.

[0350] In some embodiments, the target cyclic offset is equal to the first product. The first product is determined according to the cyclic shift step size and the target number. The target number is the target sequence generated in the third m sequence. The target sequence is used to generate the WUS sequence, and the WUS sequence can be obtained after the target sequence is modulated.

[0351] In some embodiments, the first product = cyclic shift step length * target number. Exemplarily, the order of numbering of the N first m-sequences is 5, 1, 0, 4, 3, 2, 7, 8, 6. If the first starting information indicates e=3, it means that the first sequence corresponding to the area is generated according to the first m-sequence numbered 0 and several first m-sequences thereafter. Assume that it is determined according to the cyclic shift step length that each first m-sequence can generate 12 m-sequences (including the first m-sequence itself). If the number IS of the WUS sequence in the first sequence is 30, then, considering that the first m-sequences numbered 0 and 4 generate a total of 12*2=24 m-sequences, 30-24=6, the WUS sequence should be the cyclic shift sequence of the first m-sequence numbered 3. That is The target sequence can be found by cyclically shifting the first m-sequence ranked 5th among the N first m-sequences. The first m-sequence ranked 5th is the first m-sequence numbered 3. In addition to the first m-sequence numbered 3 itself, the first m-sequence numbered 3 should be cyclically shifted 5 more times according to the cyclic shift step to obtain the 30th m-sequence. Therefore, the target sequence is the 5-shifted sequence of the first m-sequence numbered 3. The cyclic offset of the target sequence relative to the first m-sequence numbered 3 is C = N CS *(6-1).

[0352] In some embodiments, the sequence element numbered n in the WUS sequence 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 n' in the first m-sequence. Alternatively, the value of the nth bit in the WUS sequence is equal to 1 minus the second product, and the second product is equal to 2 multiplied by the value of the n'th bit in the third m-sequence.

[0353] For example, the WUS sequence can be expressed as formula (10). W (n) represents the WUS sequence, x0(n) represents the third m sequence used to generate the WUS sequence, N CS represents the cyclic shift step size, I s Indicates the number of the WUS sequence in the first sequence, and L indicates the sequence length of x0(n). Target number d W (n) = 1-2x0((n+N CS *I m )mod L) (10)

[0354] In some embodiments, formula (10) is applicable to the case where the WUS sequence is obtained through BPSK modulation.

[0355] In some embodiments, the sequence element numbered n in the WUS sequence is the sequence element numbered n' in the first m-sequence. It can also be understood that the value of the nth bit in the WUS sequence is equal to the value of the n'th bit in the third m-sequence.

[0356] For example, the WUS sequence can be expressed as formula (11). W (n) represents the WUS sequence, x0(n) represents the third m sequence used to generate the WUS sequence, N CS represents the cyclic shift step size, I s Indicates the number of the WUS sequence in the first sequence, and L indicates the sequence length of x0(n). Target number d W (n) = x0((n+N CS *I m )mod L) (11)

[0357] In some embodiments, formula (11) is applicable to the case where the WUS sequence is obtained through OOK modulation.

[0358] [Example] Assume that the order of the N first m-sequences is 5, 1, 0, 4, 3, 2, 7, 8, 6, the first starting information indicates e = 3, and the cyclic shift step size is N CS =3, the length of each first m-sequence is equal, both L = 127. Then, a first m-sequence can generate a total of There are m-sequences (including the first m-sequence itself). The total number of sequences in the first sequence is S (S≥1), and the numbers or indexes of the S sequences range from 0 to S-1.

[0359] 【1】Assume that the WUS sequence is numbered 1 in the first sequence s =5<42, then the target sequence can be found by cyclically shifting a basic m-sequence. The WUS sequence is generated based on the cyclic shift sequence of the first m-sequence numbered 0. The first m-sequence numbered 0 is the first m-sequence indicated by the first start information.

[0360] The above process can be expressed by the formula: Therefore, the target sequence can be found by performing a cyclic shift on the first m-sequence ranked at position 3 among the N first m-sequences, and the first m-sequence ranked at position 3 is numbered 0.

[0361] At this time, the target number Target loop offset = N CS *I m =3*4.

[0362] If calculated by formula (10), we can get dW (n)=1-2x0((n+3*4)mod 127).

[0363] If calculated by formula (11), we can get d W (n)=x0((n+3*4)mod 127).

[0364] Here, x0(n) represents the first m-sequence numbered 0, n′=(n+3*4) mod 127, and the cyclic offset of the target sequence relative to x0(n) is 12.

[0365] 【2】Assume that the WUS sequence is numbered 1 in the first sequence s =50>42, then the WUS sequence is obtained by cyclic shifting the first m-sequence numbered 4. The first m-sequence numbered 4 is immediately after the first m-sequence numbered 0 indicated by the first start information.

[0366] The above process can be expressed by the formula: Therefore, the target sequence can be found by performing a cyclic shift on the first m-sequence ranked at the 4th position among the N first m-sequences, and the first m-sequence ranked at the 4th position is the first m-sequence numbered 4.

[0367] At this time, the target number Target loop offset = N CS *I m =3*7.

[0368] If calculated by formula (10), we can get d W (n)=1-2x0((n+3*7)mod 127).

[0369] If calculated by formula (11), we can get d W (n)=x0((n+3*7)mod 127).

[0370] Here, x0(n) represents the first m-sequence numbered 4, n′=(n+3*7) mod 127, and the cyclic offset of the target sequence relative to x0(n) is 21.

[0371] In summary, the method provided in the embodiment of the present application provides a low-complexity and low-featured solution for sending a WUS sequence through an m-sequence. It supports both selecting a first m-sequence to form a first sequence and constructing an m-sequence set to form a first sequence, providing a flexible construction scheme for the first sequence corresponding to a region. It supports both selecting an m-sequence as a WUS sequence in the generated first sequence and the numbering of the WUS sequence in the first sequence corresponding to the cyclic shift step size and the WUS sequence in the first sequence. S The WUS sequence is generated based on the information.

[0372] In addition, the m-sequence has good autocorrelation and cross-correlation characteristics. The WUS sequence generated by the m-sequence still has such good characteristics, which helps to improve the transmission accuracy and reliability of the wake-up signal and ensure the reliability, success rate and efficiency of the wake-up.

[0373] Moreover, an m-sequence can be cyclically shifted to obtain more m-sequences, which can provide a large number of optional WUS sequences for a region. This supports providing WUS sequences for a large number of terminal devices in the communication system, avoiding false wake-up and wake-up conflicts in the communication system.

[0374] Taking the case where the first sequence includes a gold sequence as an example, the following further introduces how to generate a WUS based on the gold sequence based on step 1010 .

[0375] FIG13 is a schematic flow chart of a method for transmitting a wake-up signal provided by an exemplary embodiment of the present application. The method is executed by a terminal device and includes:

[0376] Step 1310: Send a WUS, where the WUS is used to wake up at least one terminal device; wherein the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence is a gold sequence.

[0377] In some embodiments, the first sequence includes all gold sequences used to generate the WUS corresponding to the region where the terminal device is located. This can also be understood as the gold sequences used by all WUS received by all terminal devices in the same region belonging to the first sequence. Therefore, the first sequence can be considered a regional-level gold sequence set, and the gold sequence used by the WUS sent by the network device to the terminal device is associated with the region where the terminal device is located.

[0378] In some embodiments, the total number of gold sequences corresponding to a region is preconfigured or agreed upon in a communication protocol. That is, the total number of gold sequences included in the first sequence is preconfigured or agreed upon in a communication protocol.

[0379] In some embodiments, the number of gold sequences used to generate the first sequence is preconfigured or agreed upon in a communication protocol.

[0380] In some embodiments, the first sequence is one of a second number of gold sequences; wherein the second number of gold sequences includes a first m-sequence and / or a second m-sequence. The second number of gold sequences is generated based on at least one preferred m-sequence pair. The relevant information about the preferred m-sequence pairs has been described above. Based on two different primitive polynomials, both of order r, at most one preferred m-sequence pair can be obtained. A gold sequence can be obtained by performing modulo-2 addition on the preferred m-sequence pair. Therefore, each cyclic shift of the preferred m-sequence pair yields a new gold sequence.

[0381] In some embodiments, the second number is agreed upon by a communication protocol, configured by a network device, or autonomously determined by a terminal device. Exemplarily, the second number is adjusted by the network device or the terminal device based on one or more of the following factors: terminal device capabilities, network device capabilities, communication system capacity, communication requirements, the total number of area identifiers, the number of terminal devices in the same area, and the like.

[0382] Similar to the case of generating a WUS sequence according to an m sequence, the embodiment of the present application provides two methods for generating a first sequence according to a gold sequence.

[0383] Method 1: First, determine Z gold sequence families corresponding to a region, and generate the first sequence corresponding to the region from the Z gold sequence families. In this case, the first number of gold sequences are all or part of the sequences in the Z gold sequence families.

[0384] Method 2: First, a large gold sequence set is constructed, including several gold sequence families. Then, the gold sequence set is divided into several gold sequence subsets, and a gold sequence subset is mapped to the first sequence of a certain region. In this case, the first number of gold sequences is all or part of the sequences in a gold sequence subset.

[0385] The embodiments of the present application involve the concept of gold sequence families. Here, how to generate a gold sequence family is introduced.

[0386] As can be seen from the foregoing, the gold sequence is obtained by adding a preferred m-sequence pair modulo 2. In the embodiment of the present application, the two m-sequences included in a preferred m-sequence pair are referred to as the fourth m-sequence and the fifth 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 and describe, and do not imply restrictions on the order, naming, etc. of the m-sequences. For example, the fourth m-sequence is any one m-sequence in the preferred m-sequence pair, and the fifth m-sequence is the other m-sequence in the preferred m-sequence pair.

[0387] Gold sequence family generation method 1: the fourth m sequence remains unchanged, and the fifth m sequence is cyclically shifted

[0388] Assuming the number of shift registers is r, if the fourth m-sequence remains unchanged, the fifth m-sequence can get at most 2 after cyclic shift. r -1 gold sequence, plus the fourth m sequence and the fifth m sequence itself, then, through method 1, at most 2 r -1+2=2 r +1 gold sequence.

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

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

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

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

[0393] Assuming that the number of optimal pairs of m sequences is k, then the upper limit of the number of gold sequences that can be generated by method 1 is k*(2 r +1). Wherein, k 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 number of stages is r.

[0394] Gold sequence family generation method 2: the fourth m sequence is cyclically shifted, and the fifth m sequence is also cyclically shifted

[0395] Assuming the number of shift registers is r, if the fourth m-sequence remains unchanged, the fifth m-sequence can get at most 2 after cyclic shift. r -1 gold sequence.

[0396] Assuming the number of shift registers is r, if the fifth m-sequence remains unchanged, the fourth m-sequence can get at most 2 after cyclic shift. r -1 gold sequence.

[0397] Then, the fourth m sequence is cyclically shifted, and the fifth m sequence is cyclically shifted, and at most (2 r -1)*(2 r -1) gold sequence.

[0398] 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 -1) second gold sequences. For example, if r=5, the fourth m-sequence and the fifth m-sequence are cyclically shifted respectively, and a maximum of 961 second gold sequences can be obtained.

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

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

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

[0402] Assuming that the number of optimal pairs of m sequences is k, then the upper limit of the number of gold sequences that can be generated by method 2 is k*(2 r -1)*(2 r -1). Wherein, k 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 number of stages is r.

[0403] Method 3 for generating gold sequence family: cyclic shift of the first gold sequence

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

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

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

[0407] 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)*(2 r -1) third gold sequence.

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

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

[0410] Assuming that the number of optimal pairs of m sequences is k, then the upper limit of the number of gold sequences that can be generated by method 3 is k*(2 r +1)*(2 r -1). Wherein, k 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 number of stages is r.

[0411] It should be noted that Mode 1, Mode 2, and Mode 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. First sequences comprising different types of gold sequence families can coexist in a communication system. For example, the first sequence corresponding to cell A includes the first and third gold sequence families, while the first sequence corresponding to cell B includes the second gold sequence family.

[0412] It can be seen that, compared to Method 1, when the number of levels is the same, Methods 2 and 3 can obtain more sequences. When the first sequence is expected to contain more gold sequences, 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 the complexity of generating the first sequence is expected to be lower, Method 1 is more suitable.

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

[0414] After understanding how to generate the gold sequence family, we can consider how to generate the first sequence based on the gold sequence family.

[0415] Next, we will first introduce method 1, which generates the first sequence corresponding to a region based on Z gold sequence families.

[0416] It can be understood that the Z gold sequence families mean corresponding Z pairs of m sequence preferred pairs.

[0417] In some embodiments, the value of Z is determined by a communication protocol, configured by a network device, or autonomously determined by a terminal device. For example, the value of X is adjusted by the network device or the terminal device based on one or more of the following factors: the capabilities of the terminal device, the capabilities of the network device, the capacity of the communication system, communication requirements, the total number of area identifiers, the number of terminal devices in the same area, and the like.

[0418] In some embodiments, the Z gold sequence families are agreed upon by a communication protocol, or indicated by a network device, or determined by a terminal device.

[0419] In some embodiments, the Z gold sequence families are Z of the M gold sequence families, where M is an integer greater than or equal to 1, and 1≤Z≤M. The M gold sequence families are determined according to the number of shift register stages r, specifically, according to the number of preferred pairs of m sequences corresponding to the number of shift register stages r.

[0420] Since there is an upper limit on the number of m-sequence pairs that can be generated at different levels, there is also an upper limit on the number of gold sequence families that correspond one-to-one to each m-sequence pair. The value of M can be equal to or less than the upper limit on the number of m-sequence pairs. For example, if three m-sequence pairs are found according to Equation (8) when the level is r, then the value of M can be less than or equal to 3.

[0421] Optionally, the Z gold sequence families are any Z gold sequence families from the M gold sequence families. Optionally, the Z gold sequence families are Z gold sequence families selected from the M gold sequence families according to a specific rule. Optionally, the Z gold sequence families are Z default gold sequence families of the M gold sequence families used by the communication system. Optionally, the Z gold sequence families are Z gold sequence families indicated by the network device from the M gold sequence families.

[0422] Since the Z gold sequence families are among the M gold sequence families, we first need to introduce the design of the M gold sequence families, and then introduce how to determine / indicate / select these Z gold sequence families.

[0423] First, the design of the M gold sequence families is introduced. It is understood that in order to facilitate the distinction between the various gold sequence families, the M gold sequence families should have corresponding numbers or indexes, and the embodiment of the present application uses the numbering as an example for description.

[0424] 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 the gold sequence families are also applicable to the embodiments of the present application.

[0425] In some embodiments, the M gold sequence families are first arranged according to a specific rule and then assigned numbers.

[0426] In some embodiments, the M gold sequence families are first arranged according to the numbers of the m sequence preference pairs, and then M numbers are allocated.

[0427] Assume that M pairs of m-sequences are selected from N m-sequences according to formula (8). It is understood that the N m-sequences have one-to-one corresponding sequence numbers, 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. For details, please refer to the relevant content in the "Design of N First m-Sequences" above, which will not be repeated here.

[0428] Then, the numbering of all m-sequences included in the M-pair of m-sequence preferred pairs can be consistent with or inconsistent with their numbering in the N m-sequences. For example, after selecting the M-pair of m-sequence preferred pairs from the N m-sequences, all m-sequences included in the M-pair of m-sequence preferred pairs are renumbered starting from 0 or 1. Whether or not all m-sequences included in the M-pair of m-sequence preferred pairs continue to use their numbering in the N m-sequences is supported by the embodiments of the present application, as long as each m-sequence has a one-to-one corresponding numbering.

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

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

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

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

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

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

[0435] In some embodiments, numbers are first assigned to the M gold sequence families, and then the M gold sequence families are arranged according to a specific rule. Therefore, the numbering order of the M gold sequence families may be disrupted, for example, not in the order from 0 to M-1.

[0436] For example, the M gold sequence families are numbered in the order of 2, 0, M-1…, 1, which means that the gold sequence family numbered 2 is ranked first among the M gold sequence families, and the gold sequence family numbered 1 is ranked Mth among the M gold sequence families.

[0437] In some embodiments, the numbering order of the M gold sequence families is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device.

[0438] In some embodiments, the numbering order of the M gold sequence families is determined according to at least one of the following: 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.

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

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

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

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

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

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

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

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

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

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

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

[0450] 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}.

[0451] 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}.

[0452] 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}.

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

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

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

[0456] 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}.

[0457] 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 m-sequence pairs 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 is: {4, 6}, {1, 5}, {0, 3}, {2, 1}, and {0, 1}.

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

[0459] In some embodiments, the design of the numbering order can be understood as a situation where the gold sequence family has both logical numbers and physical numbers. Wherein, the logical number refers to the order of the numbers of the gold sequence family in 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 numbers of the gold sequence family in the memory, or the position in the agreed mapping relationship, such as the numbering order (such as 2, 0, M-1…, 1) in the embodiment of the present application. The logical number and the physical number of the gold sequence family may be the same or different. The reason is similar to that of the m sequence, which supports adjusting the numbering order according to factors such as correlation, storage mode, and memory management, so that the first sequence corresponding to a region has a better correlation, and also makes the first sequence of the adjacent region have a better correlation.

[0460] Then, it is introduced how the Z gold sequence families are determined, selected or indicated.

[0461] In some embodiments, the Z gold sequence families are Z randomly selected from the M gold sequence families. Alternatively, the Z gold sequence families are Z selected from the M gold sequence families according to a specific rule. Alternatively, the Z gold sequence families are the default Z gold sequence families from the M gold sequence families. Exemplarily, the Z gold sequence families are the gold sequence family numbered 1 (or other values), or the gold sequence family with the last three numbers (or other positions) in the sequence numbering, or the gold sequence family with an even number.

[0462] In some embodiments, the Z gold sequence families are indicated by a network device. Exemplarily, the network device indicates the numbers of the Z gold sequence families via signaling, wherein the signaling may be one or more of system information, RRC signaling, MAC CE, DCI, etc.

[0463] Considering the value of Z, we will discuss how to determine the Z gold sequence families in two cases:

[0464] 1. Case where Z = 1: If Z = 1, it means that the first sequence corresponding to a region is generated according to one gold sequence family.

[0465] In some embodiments, the gold sequence family is determined or selected based on the region identification of the terminal device. Exemplarily, the number of the gold sequence family is determined according to the region identification of the terminal device.

[0466] In some embodiments, the number of the gold sequence family corresponding to the first sequence is equal to the area identifier of the terminal device. For example, if the cell identifier of the terminal device is 5, the gold sequence family corresponding to the first sequence is the gold sequence family numbered 5 among the M gold sequence families.

[0467] In some embodiments, the number of the gold sequence family corresponding to the first sequence is determined according to a mathematical operation result of the area identifier of the terminal device.

[0468] Exemplarily, the number of the gold sequence family corresponding to the first sequence is equal to the modulo product of the terminal device's region identifier and M. Here, M refers to the number of M gold sequence families, which is determined by the number of shift register stages r. The value of M can be equal to or less than the upper limit of the number of preferred m-sequence pairs. Exemplarily, if the terminal device's region identifier is 9 and the number of stages is r, a maximum of four preferred m-sequence pairs can be generated. Let M be 4, and 9 mod 4 = 1. Then, the gold sequence family corresponding to the first sequence is the gold sequence family numbered 1 among the M gold sequence families.

[0469] Exemplarily, the number of the gold sequence family corresponding to the first sequence is equal to an integer multiple of the area identifier of the terminal device, or equal to the rounded-up result of the quotient of the area identifier of the terminal device and M, or equal to the rounded-down result of the quotient of the area identifier of the terminal device and M, and so on.

[0470] In some embodiments, the network device indicates the number of the gold sequence family used to generate the first sequence, or the communication protocol stipulates the number of the gold sequence family used to generate the first sequence.

[0471] 2. Case Z>1: If Z>1, it means that the first sequence corresponding to a region is generated according to multiple gold sequence families.

[0472] In some embodiments, the Z gold sequence families are determined based on the second sequence information. Optionally, at least part of the second sequence information is indicated by the network device, and / or at least part of the second sequence information is agreed upon by the communication protocol, and / or at least part of the second sequence information is determined by the terminal device.

[0473] In some embodiments, the second sequence information includes at least one of the following information:

[0474] The second starting information is used to indicate the starting position of the Z gold sequence families in the M gold sequence families;

[0475] Second length information, used to indicate the value of Z;

[0476] Second end information, used to indicate the end position of the Z gold sequence families in the M gold sequence families;

[0477] The second bitmap, where each bit corresponds to a family of M gold sequences.

[0478] The number of the Z gold sequence families;

[0479] The total number of sequences in the first sequence;

[0480] The number of the WUS sequence in the first sequence;

[0481] The cyclic shift step size, also known as the cyclic shift factor;

[0482] The numbering order of the M gold sequence families;

[0483] Cycle offset C.

[0484] Among them, the first sequence can be understood as the WUS sequence set corresponding to the area where the terminal device is located.

[0485] In some embodiments, the second sequence information includes second start information and second length information. Alternatively, the second sequence information includes the second start information, the second length information, and the numbering order of the M gold sequence families. For example, the terminal device determines M = 9 based on the number of shift register stages r, and the communication protocol stipulates that the numbering order of the M gold sequence families is 0, 1, 2, ..., 8. The network device indicates that the second start information = 2 and the second length information = 3. Therefore, the Z gold sequence families include the gold sequence families numbered 2, 3, and 4.

[0486] In some embodiments, the second start information and the second length information may also be represented by a coding value, such as SLIV.

[0487] In some embodiments, the second sequence information includes second start information and second end information. Alternatively, the second sequence information includes second start information, second end information, and the numbering sequence of the M gold sequence families. For example, the network device indicates M = 9, and the numbering sequence of the M gold sequence families is 2, 6, 5, 7, 1, 3, 8, 4, 0. The network device also indicates second start information = 3, and the communication protocol stipulates second end information = 7. Then, the Z gold sequence families include the gold sequence families numbered 5, 7, 1, 3, and 8.

[0488] In some embodiments, the second sequence information includes second length information and second end information. Alternatively, the second sequence information includes second length information, second end information, and the numbering sequence of the M gold sequence families. For example, the communication protocol stipulates that M = 8, and the numbering sequence of the M gold sequence families is 3, 7, 1, 0, 5, 6, 4, 2. If the network device indicates that the second length information = 3 and the second end information = 7, then the Z gold sequence families include the gold sequence families numbered 5, 6, and 4.

[0489] In some embodiments, the first sequence information includes the numbers of the Z gold sequence families. For example, the network device indicates to the terminal device that the Z gold sequence families are numbered 1, 6, and 9, and the terminal device generates the first sequence according to the gold sequence families numbered 1, 6, and 9.

[0490] In some embodiments, the second sequence information includes a second bit map. Alternatively, the second sequence information includes a second bit map and the numbering order of the M gold sequence families. When the bit value is the first value, it indicates that the gold sequence family corresponding to the bit is indicated as one of the Z gold sequence families. When the bit value is the second value, it indicates that the gold sequence family corresponding to the bit is not indicated as one of the Z gold sequence families. Among them, the first value is "1" and the second value is "0", or the first value is "0" and the second value is "1". Of course, the first value and the second value can also be other values. The embodiment of the present application is schematically illustrated by taking the first value "1" and the second value "0" as an example. For example, M=6, the numbering order of the M gold sequence families is 1, 0, 5, 4, 2, 3, and the second bit map includes 6 bits. These 6 bits correspond one-to-one to the M gold sequence families from low to high. Assuming the value of the second bitmap is 001101, it means that the Z gold sequence families include the gold sequence families numbered 5, 4, and 3. The second bitmap can be used to determine the Z discrete gold sequence families. Compared with the solution of determining the gold sequence families based on one or more of the second start information, the second length information, and the second end information, the design of the second bitmap has greater flexibility, but may require more bits for indication.

[0491] In some embodiments, the second sequence information includes a cyclic shift step size and a numbering order of the M gold sequence families. Alternatively, the second sequence information includes a cyclic shift step size and second starting information. Alternatively, the second sequence information includes the second starting information and a numbering order of the M gold sequence families.

[0492] In some embodiments, the second sequence information includes the second start information, the cyclic shift step size, the numbering order of M gold sequence families. Alternatively, the second sequence information includes the second start information, the cyclic shift step size, the total number of sequences in the first sequence. Alternatively, the second sequence information includes the second start information, the numbering order of M gold sequence families, the total number of sequences in the first sequence. Alternatively, the second sequence information includes the cyclic shift step size, the numbering order of M gold sequence families, the total number of sequences in the first sequence.

[0493] In some embodiments, the second sequence information includes the second start information, the cyclic shift step size, the numbering order of M gold sequence families, and the total number of sequences in the first sequence. Exemplarily, according to the second start information, the gold sequence family numbered u is determined, according to the cyclic shift step size, the cyclic offset of this gold sequence family is determined, and the first m-sequence preferred pair used to generate the gold sequence family numbered u is cyclically shifted according to the determined cyclic offset, and a total of R gold sequences are obtained. It is judged whether R is less than the total number S of sequences in the first sequence. If R < S, then continue to cyclically shift the second m-sequence preferred pair according to the cyclic offset. The second m-sequence preferred pair is the m-sequence preferred pair used to generate the gold sequence family numbered d, and the gold sequence family numbered d is immediately after the gold sequence family numbered u. And so on, until the total number of obtained gold sequences is greater than or equal to the total number S of sequences in the first sequence.

[0494] The principle of determining Z gold sequence families according to the second start information, the cyclic shift step size, the numbering order of M gold sequence families, and the total number of sequences in the first sequence is similar to the principle of determining X first m-sequences according to the first start information, the cyclic shift step size, the numbering order of N first m-sequences, and the total number of sequences in the first sequence shown in Embodiment of FIG. 10. The difference is that a gold sequence family is generated by an m-sequence preferred pair. During the cyclic shift process, only one m-sequence included in the m-sequence preferred pair can be cyclically shifted (corresponding to the method 1 of forming a gold sequence family), or two m-sequences included in the m-sequence preferred pair can be cyclically shifted (corresponding to the method 2 of forming a gold sequence family), or the gold sequence obtained after cyclic shift can be cyclically shifted (corresponding to the method 3 of forming a gold sequence family). Therefore, compared with the first m-sequence, more gold sequences can be obtained from one m-sequence preferred pair; compared with the total number of sequences generated according to X first m-sequences, it is more likely to obtain a larger total number of sequences according to Z gold sequence families.

[0495] In the embodiment of the present application, the lengths of the gold sequences in the Z gold sequence families are all equal as an example for schematic illustration. Of course, this does not exclude the case where the lengths of the Z gold sequence families are unequal.

[0496] In some embodiments, the cyclic shift step size N CS It is agreed by the communication protocol, and / or indicated by the network device, and / or determined by the terminal device. CS Associated with the cell radius, it can also be understood as the cyclic shift step size N CS Associated with the coverage radius of the network device, the terminal device determines the cyclic shift step size N according to the cell radius CS For example, the cyclic shift step size N CS Associated with the area identifier, the terminal device determines the cyclic shift step size N according to the area identifier CS .

[0497] For example, the number of shift register stages r=5, and the communication protocol stipulates N CS =2, and it is agreed that the total number of sequences included in the first sequence corresponding to a region is S=64. The network device indicates that the numbering order of the M gold sequence families is 3, 7, 1, 0, 5, 6, 4, 2. Assume that the length of each of the M gold sequence families is L=63. The network device indicates that the first starting information is 2. After receiving the instruction from the network device, the terminal device determines the gold sequence family numbered 7 based on the first starting information. Assume that the gold sequence family numbered 7 includes 2 r +1 = 33 gold sequences (including the m-sequence preferred pair itself). Obviously, 33 < 64. Then, based on the order of the numbering of the M gold sequence families, the gold sequence family numbered 1 is determined. After cyclic shifting, the gold sequence family numbered 1 can also produce a maximum of 33 gold sequences. Obviously, 33 * 2 > 64. Therefore, the Z gold sequence families include the gold sequence families numbered 7 and 1. The first sequence includes the gold sequence family numbered 7 and the 31 gold sequences in the gold sequence family numbered 1.

[0498] In some embodiments, the second sequence information includes the second starting information, the cyclic shift C, the numbering order of the M gold sequence families, and the total number of sequences in the first sequence. The principle of this case is the same as the above "the second sequence information includes the first starting information, the cyclic shift step N CS , the numbering order of the N first m sequences, and the total number of sequences in the first sequence S" are similar, except that there is no need to use the cyclic shift step size N CS Instead of determining the cyclic offset C, the cyclic offset C may be determined directly according to the second sequence information.

[0499] In some embodiments, the second sequence information includes second starting information, a cyclic offset set, the numbering order of the M gold sequence families, and the total number of sequences in the first sequence. Optionally, different cyclic offset sets can be configured for different gold sequence families to achieve more flexible cyclic shifting.

[0500] In some embodiments, the second sequence information includes the number of the WUS sequence sent by the terminal device in the first sequence. Alternatively, the second sequence information includes the number of the WUS sequence sent by the terminal device in the first sequence and the numbering order of the M gold sequence families. Exemplarily, the terminal device determines the WUS sequence to be sent based on the number of the WUS sequence to be sent in the first sequence, and then directly generates the WUS sequence according to the stored and / or configured sequence information.

[0501] In some embodiments, the second sequence information includes the number and cyclic offset of the WUS sequence sent by the terminal device in the first sequence. Alternatively, the second sequence information includes the number of the WUS sequence sent by the terminal device in the first sequence, the cyclic offset, and the numbering order of the M gold sequence families. Exemplarily, the terminal device determines the WUS sequence to be sent based on the number of the WUS sequence to be sent in the first sequence, and then directly generates the WUS sequence according to the stored and / or configured sequence information and cyclic offset.

[0502] In some embodiments, the second sequence information includes the number of the WUS sequence sent by the terminal device in the first sequence and the cyclic shift step. Alternatively, the second sequence information includes the number of the WUS sequence sent by the terminal device in the first sequence, the cyclic shift step, and the numbering order of the M gold sequence families. Exemplarily, the terminal device uniquely determines the WUS sequence to be sent based on the number of the WUS sequence to be sent in the first sequence, determines the cyclic offset based on the cyclic shift step, and then directly generates the WUS sequence according to the stored and / or configured sequence information and cyclic offset.

[0503] After determining the Z gold sequence families, the first sequence can be generated. Next, the sequence arrangement within the first sequence is described.

[0504] In some embodiments, the numbering order of the Z gold sequence families corresponding to the first sequence follows their numbering order within the M gold sequence families. That is, the numbering order of the Z gold sequence families when generating the first sequence is the same as the numbering order of the Z gold sequence families within the M gold sequence families. For example, the M gold sequence families are numbered 0, 1, 2…, 8. Assuming that the Z gold sequence families include gold sequence families numbered 2, 3, 4, and 5, then when generating the first sequence, the Z gold sequence families are still numbered 2, 3, 4, and 5.

[0505] In some embodiments, the numbering order of the Z gold sequence families when generating the first sequence is determined according to at least one of the following: the m-sequence preferred pair number, the corresponding primitive polynomial coefficient, and the binary number of the corresponding primitive polynomial coefficient.

[0506] In some embodiments, the numbering order of the Z gold sequence families when generating the first sequence is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device.

[0507] In some embodiments, the numbering order of the Z gold sequence families when generating the first sequence is different from the numbering order of the Z gold sequence families in the M gold sequence families. For example, the Z gold sequence families are arranged in ascending order of number values, or in descending order of number values, or in descending order of coefficients of primitive polynomials from low to high powers, or in descending order of coefficients of primitive polynomials from high to low powers, or in descending order of binary numbers of primitive polynomials, or in descending order of binary numbers of primitive polynomials, or in descending order of binary numbers of primitive polynomials, or in descending order of numbers of preferred pairs of m sequences, etc.

[0508] Then, the numbering order 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.

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

[0510] Optionally, the numbering rules within different gold sequence families may be the same or different. Here, taking different numbering rules as an example, the Z 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 Z gold sequence families is either arranged in ascending order of cyclic offset or in descending order of cyclic offset.

[0511] As can be seen from the foregoing, the first sequence includes all or part of the gold sequences in the Z gold sequence families.

[0512] If the first sequence includes some gold sequences from the Z gold sequence families, then the determination of this portion of gold sequences warrants further discussion. Optionally, this portion of gold sequences is randomly selected, or indicated by a network device, or agreed upon by a communication protocol, or determined by a terminal device. Optionally, this portion of gold sequences is determined based on at least one of the following: a region identifier, the numbering order of the gold sequence families, the numbering order of the gold sequences, or the second number (i.e., the number of gold sequences included in the first sequence described above).

[0513] Exemplarily, the first sequence includes some gold sequences in the Z gold sequence families, where the some gold sequences are gold sequences with earlier numbering in the Z gold sequence families, or gold sequences with smaller cyclic offsets.

[0514] Exemplarily, the first sequence includes some gold sequences in the Z gold sequence families, where the some gold sequences are gold sequences with later numbering in the Z gold sequence families, or gold sequences with larger cyclic offsets.

[0515] Exemplarily, the first sequence includes some gold sequences in the Z gold sequence families, and the some gold sequences are gold sequences numbered as odd or even in the Z gold sequence families.

[0516] After sorting the gold sequences of the Z gold sequence families based on the above method, a first sequence corresponding to the required number (for example, S) can be obtained. The number of each sequence in the first sequence can correspond to the number of the WUS sequence, that is, the number of each sequence in the first sequence corresponds to the number of the WUS sequence one by one. Exemplarily, the gold sequence numbered 0 in the first sequence corresponds to the WUS sequence numbered 0; the gold sequence numbered 1 in the first sequence corresponds to the WUS sequence numbered 1; and so on. Exemplarily, the gold sequence numbered 0 in the first sequence corresponds to the WUS sequence numbered 1; the gold sequence numbered 1 in the first sequence corresponds to the WUS sequence numbered 2; and so on.

[0517] The WUS sequence number may also correspond to the UE ID in a one-to-one manner. For example, a WUS sequence numbered 0 corresponds to a UE ID valued at 0, a WUS sequence numbered 1 corresponds to a UE ID valued at 1, and so on. For example, a WUS sequence numbered 0 corresponds to a UE ID valued at 1, a WUS sequence numbered 1 corresponds to a UE ID valued at 2, and so on.

[0518] The WUS sequence number may also correspond one-to-one with the UE group ID. For example, a WUS sequence numbered 0 corresponds to a UE group ID valued at 0, a WUS sequence numbered 1 corresponds to a UE group ID valued at 1, and so on. For example, a WUS sequence numbered 0 corresponds to a UE group ID valued at 1, a WUS sequence numbered 1 corresponds to a UE group ID valued at 2, and so on.

[0519] Method 1 can be used to determine the first sequence corresponding to a region. Therefore, whether different regions can use the same first sequence is a matter for further discussion.

[0520] Similar to the case where the first sequence is constructed using an m-sequence, the embodiment of the present application supports different regions corresponding to completely identical first sequences, partially identical first sequences, or completely different first sequences.

[0521] Whether different regions use the same first sequence, combined with the generation of Z gold sequence families, may have the following three situations:

[0522] 1. Different regions correspond to the same M gold sequence families and the same Z gold sequence families. This can be achieved, for example, by indicating the same second sequence information to different regions, or by agreeing by a communication protocol that different regions use the same second sequence information.

[0523] 2. Different regions correspond to the same M gold sequence families and different Z gold sequence families. For example, this is achieved by corresponding different second sequence information to different regions. Exemplarily, the network device indicates different second starting information for different regions, and the communication protocol stipulates that the cyclic shift step sizes for different regions are different, then the Z gold sequence families are naturally different. Exemplarily, the network device indicates the same second starting information, and the communication protocol stipulates that the values ​​of Z corresponding to different regions are different, then the Z gold sequence families corresponding to different regions are naturally different. Exemplarily, the communication protocol stipulates that different regions use the same m-sequence preferred pair, and the network device indicates the cyclic shift step sizes for different regions respectively, or the terminal device autonomously determines the cyclic shift step size, then the second gold sequence families corresponding to different regions are naturally different. Exemplarily, the network device indicates different second starting information and different cyclic shift step sizes to different regions, so that different regions correspond to different Z gold sequence families.

[0524] 3. Different regions correspond to different M gold sequence families and different Z gold sequence families. For example, different regions are assigned different numbers of shift register stages, so that each region corresponds to a different number of m-sequence optimization pairs, thereby achieving different M gold sequence families corresponding to different regions. The network device indicates different first starting information and different cyclic shift step sizes to different regions, so that different regions correspond to different Z gold sequence families.

[0525] Next, we introduce the second method, which generates the first sequence corresponding to a region based on the gold sequence subset.

[0526] A Gold sequence subset is a subset of a Gold sequence set. The Gold sequence set includes at least one Gold sequence family. A Gold sequence family is generated based on a preferred pair of m-sequences. For the design of a Gold sequence family, refer to Scheme 1.

[0527] In some embodiments, the gold sequence set includes at least one gold sequence family, and the gold sequence subset includes at least one gold sequence family.

[0528] In some embodiments, the number of gold sequence families in the gold sequence set is determined according to at least one of the following: the number of shift register stages r, the cyclic offset, the cyclic shift step, the length of the m-sequence, and the number of preferred pairs of m-sequences.

[0529] In some embodiments, the number of gold sequence families in the gold sequence set is determined according to the level r and the cyclic offset, or according to the level r and the cyclic shift step size, or according to the number of preferred m-sequence pairs.

[0530] In some embodiments, the gold sequence subset is a subset of the gold sequence set. Optionally, the gold sequence subset is any subset of the gold sequence set. It is understood that any set is a subset of itself, and therefore, the m-sequence subset may also be the m-sequence set itself. Optionally, the gold sequence subset is a subset selected from the gold sequence set according to a specific rule. Optionally, the gold sequence subset is a subset of the gold sequence set that is defaulted by the communication system.

[0531] In some embodiments, the gold sequence subset is determined or selected by the terminal device from the gold sequence set. Alternatively, the gold sequence subset is indicated by the network device.

[0532] Next, we first introduce the design of the gold sequence set and then how the gold sequence subset is determined, selected, or indicated.

[0533] First, the design of the gold sequence set is introduced. It is understood that, for easy distinction, each gold sequence family in the gold sequence set should have a one-to-one corresponding number or index. The embodiment of the present application uses the numbering as an example for explanation.

[0534] In some embodiments, all gold sequence families within the gold sequence set are first arranged according to a specific rule and then assigned numbers. Alternatively, all gold sequence families within the gold sequence set are first arranged randomly and then assigned numbers.

[0535] In some embodiments, all gold sequence families within a gold sequence set are first assigned numbers, and then all the gold sequence families are arranged according to a specific rule. Alternatively, all the gold sequence families within a gold sequence set are first assigned numbers, and then all the gold sequence families are randomly arranged. As a result, the order of the numbers within the resulting gold sequence set may be disrupted.

[0536] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is default, random, arranged according to a specific rule, agreed upon by a communication protocol, or indicated by a network device.

[0537] Illustratively, each gold sequence family in the gold sequence set has a one-to-one corresponding number, and the numbering order of the gold sequence families in the gold sequence set is arranged from small to large according to the number value, or from large to small according to the number value.

[0538] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is determined based on at least one of the following: the level r, the number of gold sequences within the gold sequence family, the length of the gold sequences within the gold sequence family, the number of the gold sequence family, the number of the gold sequences within the gold sequence family, the number of the corresponding m-sequences, the numbering order of the corresponding m-sequences, the corresponding primitive polynomial coefficients, the binary numbers of the corresponding primitive polynomial coefficients, and the cyclic offset.

[0539] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is arranged according to the numbers and / or numbering order of the m-sequences that generate the gold sequence families.

[0540] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is consistent with the numbering order of their corresponding m-sequence preferred pairs.

[0541] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is arranged in descending order according to the numbers of the preferred m-sequence pairs. Alternatively, the numbering order of the gold sequence families within the gold sequence set is arranged in ascending order according to the numbers of the preferred m-sequence pairs.

[0542] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is arranged in ascending order based on the product of the numbers of the two m-sequences respectively included in the m-sequence preferred pair. Alternatively, the numbering order of the gold sequence families within the gold sequence set is arranged in descending order based on the product of the numbers of the two m-sequences respectively included in the m-sequence preferred pair.

[0543] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is arranged in ascending order based on the sum of the numbers of the two m-sequences respectively included in each pair of m-sequence preferred pairs. Alternatively, the numbering order of the gold sequence families within the gold sequence set is arranged in descending order based on the sum of the numbers of the two m-sequences respectively included in each pair of m-sequence preferred pairs.

[0544] In some embodiments, the numbering order of the gold sequence families within the gold sequence set 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 gold sequence families within the gold sequence set 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.

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

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

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

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

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

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

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

[0552] 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}.

[0553] 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}.

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

[0555] Then, how the gold sequence subset is determined, selected, or indicated is introduced.

[0556] In some embodiments, the number of gold sequences in the gold sequence subset is preconfigured or agreed upon by a communication protocol.

[0557] In some embodiments, the gold sequence subset is a randomly selected subset from the gold sequence set. Alternatively, the gold sequence subset is a subset from the gold sequence set selected according to a specific rule. Alternatively, the gold sequence subset is a default subset from the gold sequence set. For example, the gold sequence subset is a subset consisting of gold sequences numbered with odd numbers, or a subset consisting of gold sequences numbered from 1 to 64, or a subset consisting of gold sequences arranged in the last several positions, etc.

[0558] In some embodiments, the gold sequence set is divided into x gold sequence subsets (x≥1), and each gold sequence subset has a one-to-one corresponding set number.

[0559] In some embodiments, the gold sequence subset is indicated by a network device. Exemplarily, the network device indicates the set number of the gold sequence subset via signaling, wherein the signaling may be one or more of system information, RRC signaling, MAC CE, DCI, etc.

[0560] In some embodiments, the gold sequence subset used to generate the first sequence is determined or selected based on the region identifier of the terminal device. Exemplarily, the set number of the gold sequence subset is determined according to the region identifier of the terminal device.

[0561] In some embodiments, the set number of the gold sequence subset used to generate the first sequence is equal to the region identifier of the terminal device. For example, if the region identifier of the terminal device is 20, the gold sequence subset used to generate the first sequence is the gold sequence subset numbered 20 in the gold sequence set.

[0562] In some embodiments, the set number of the gold sequence subset used to generate the first sequence is determined according to a mathematical operation result of the area identifier of the terminal device.

[0563] Exemplarily, the set number of the gold sequence subset used to generate the first sequence is equal to the modulo result of the terminal device's region identifier and x. Exemplarily, the terminal device's region identifier is 18, x is 5, and 18 mod 5 = 3. Therefore, the gold sequence subset used to generate the first sequence is the gold sequence subset numbered 3 in the gold sequence set.

[0564] Exemplarily, the set number of the gold sequence subset used to generate the first sequence is equal to an integer multiple of the area identifier of the terminal device, or equal to the rounded-up result of the quotient of the area identifier of the terminal device and x, or equal to the rounded-down result of the quotient of the area identifier of the terminal device and x, and so on.

[0565] After sorting the gold sequences in the gold sequence set based on the above method, a gold sequence subset can be obtained. According to the total number S of sequences in the gold sequence subset and the first sequence, the first sequence corresponding to the required number can be obtained. The first sequence includes all or part of the gold sequences in the gold sequence subset. The number of each sequence in the first sequence can correspond to the number of the WUS sequence, that is, the number of each sequence in the first sequence corresponds one-to-one with the number of the WUS sequence. Exemplarily, the gold sequence numbered 0 in the first sequence corresponds to the WUS sequence numbered 0; the gold sequence numbered 1 in the first sequence corresponds to the WUS sequence numbered 1; and so on. Exemplarily, the gold sequence numbered 0 in the first sequence corresponds to the WUS sequence numbered 1; the gold sequence numbered 1 in the first sequence corresponds to the WUS sequence numbered 2; and so on.

[0566] The WUS sequence number may also correspond to the UE ID in a one-to-one manner. For example, a WUS sequence numbered 0 corresponds to a UE ID valued at 0, a WUS sequence numbered 1 corresponds to a UE ID valued at 1, and so on. For example, a WUS sequence numbered 0 corresponds to a UE ID valued at 1, a WUS sequence numbered 1 corresponds to a UE ID valued at 2, and so on.

[0567] The WUS sequence number may also correspond one-to-one with the UE group ID. For example, a WUS sequence numbered 0 corresponds to a UE group ID valued at 0, a WUS sequence numbered 1 corresponds to a UE group ID valued at 1, and so on. For example, a WUS sequence numbered 0 corresponds to a UE group ID valued at 1, a WUS sequence numbered 1 corresponds to a UE group ID valued at 2, and so on.

[0568] Solution 2 can determine the gold sequence subset corresponding to a region. Therefore, whether to support the use of the same gold sequence subset in different regions is a matter for further discussion.

[0569] Similar to Solution 1, this embodiment of the present application supports different regions corresponding to completely identical, partially identical, or completely different gold sequence subsets. Whether the gold sequence subsets are identical can be determined by whether the set numbers are identical, or by whether the gold sequence numbers within the gold sequence subsets are consistent.

[0570] If different areas correspond to different gold sequence subsets, different first sequences can be generated for different areas, so that terminal devices in different areas can select WUS sequences in different first sequences, avoiding false wake-up, WUS conflicts and interference problems between areas as much as possible.

[0571] For example, assuming that cell A corresponds to the gold sequence subset {0, 2, 4, 6, 8} with a set number of 2, it means that the first sequence used by cell A includes the gold sequences with sequence numbers 0, 2, 4, 6, and 8. assuming that cell B corresponds to the gold sequence subset {1, 5, 7} with a set number of 5, it means that the first sequence used by cell B includes the gold sequences with sequence numbers 1, 5, and 7. It can be seen that the gold sequence subset corresponding to cell A is different from the gold sequence subset corresponding to cell B, and the first sequences generated according to different gold sequence subsets are naturally different. Therefore, the possibility of conflict and interference between terminal devices in cell A and terminal devices in cell B when sending WUS sequences is significantly reduced.

[0572] After understanding how the first sequence is generated, we can further consider how to generate the WUS sequence sent by the network device. The embodiment of the present application provides two solutions for generating the WUS sequence.

[0573] Solution 1: Based on Method 1 or Method 2 described above, the network device generates a first sequence. When sending a WUS sequence, it selects a sequence from the first sequence as the WUS sequence. As can be seen, in Solution 1, the network device actually generates a set of WUS sequences for each region and selects one from the generated set when sending a WUS sequence.

[0574] Solution 2: The network device first determines the number of the WUS sequence to be sent in the first sequence, and then generates the WUS sequence according to the above-mentioned method 1 or method 2. It can be seen that in solution 2, the network device actually only needs to generate the WUS sequence to be sent in real time.

[0575] Next, we will first introduce the method 1 for generating WUS sequence:

[0576] The generation of the first sequence may refer to the aforementioned method 1 (generating the first sequence corresponding to a region based on Z gold sequence families) or method 2 (generating the first sequence corresponding to a region based on a gold sequence subset).

[0577] In some embodiments, after the network device generates a first sequence corresponding to a region, the first sequence is stored in a memory, which may be local or non-local, such as a server, a cloud platform, a virtualization center, etc.

[0578] In some embodiments, different WUS sequences are selected for different regions, which can be selected randomly or according to specific rules. Different WUS sequences correspond to different regions, which can avoid problems such as false wake-up, WUS signal conflicts, and interference.

[0579] Next, we introduce the second method for generating WUS sequences:

[0580] The network device may also generate the WUS sequence required for this wake-up immediately before sending the WUS, without having to generate the WUS sequence corresponding to all areas in advance. Therefore, it is first necessary to clarify which one of the first sequences the WUS sequence corresponds to. Optionally, the network device indicates to the terminal device the WUS sequence corresponding to different areas according to the number 1 in the first sequence. S Alternatively, the communication protocol stipulates that the WUS sequences corresponding to different regions are generated according to the number 1 in the first sequence. S Alternatively, the terminal device autonomously determines the WUS sequence corresponding to different areas according to the rules agreed upon in the communication protocol. S The gold sequence is generated.

[0581] In some embodiments, the i-th sequence in the first sequence is determined based on at least one of the following: second starting information, a cyclic shift step, and a value of i; wherein the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

[0582] Combined I s and other second sequence information, such as one or more of the second starting information, the cyclic shift step, and the numbering order of the M gold sequence families, it is possible to determine which m-sequence preferred pair the WUS sequence corresponds to, that is, which gold sequence family it corresponds to.

[0583] Exemplarily, the second sequence information includes number 1 s , and the numbering order of the M gold sequence families. The network device is based on I S After determining the WUS sequence to be sent, the WUS sequence may be directly generated according to the stored and / or configured sequence information.

[0584] The embodiments of the present application support formulating the second scheme of the above-mentioned WUS sequence.

[0585] Assume that combined with I s The target m-sequence preferably pair determined with other second sequence information includes the fourth m-sequence and the fifth m-sequence, that is, the WUS sequence is generated according to the fourth m-sequence and the fifth m-sequence.

[0586] First, we introduce how to determine the optimal pair of target m-sequences.

[0587] In some embodiments, the numbering of the target m-sequence preferred pair is determined according to at least one of the following: s , second starting information, cyclic shift step size N CS , the numbering order of the M gold sequence families.

[0588] The position of the target gold sequence family in the M gold sequence families is the first one starting from the position indicated by the second start information. That is, the target gold sequence family is the first one among the M gold sequence families. The target gold sequence family is a set of 1000 bits. e is the value indicated by the second starting information, Q represents the number of gold sequences in a gold sequence family, and the WUS sequence is generated based on the gold sequence numbered IS in the first sequence. The target gold sequence family is the gold sequence family to which the target sequence belongs. The target sequence is used to generate the WUS sequence, which is then modulated to obtain the WUS sequence. Determining the target gold sequence family also determines the target m-sequence optimal pair.

[0589] For example, the numbering sequence is 0, 1, 2, 3, 4, 5, 6, 7, 8. Assume that the second start information indicates 1, I s =50, Q=12, then the position of the target gold sequence family is the fifth from the first in the M gold sequence families. It can also be understood that the target gold sequence family is the fifth from the first in the M gold sequence families. Therefore, it can be determined that the target gold sequence family is the gold sequence family numbered 4.

[0590] For example, the order of numbering the M gold sequence families is 5, 1, 0, 4, 3, 2, 7, 8, and 6. If the second starting information indicates 3, it means that the first sequence corresponding to the region is generated based on the gold sequence family numbered 0 and several subsequent gold sequence families. Assume that each pair of m sequences is determined to be a preferred pair based on the level r and can generate 17 gold sequences. If the WUS sequence is numbered 1 in the first sequence, s =30. Considering that the gold sequence numbered 0 includes 17 gold sequences, 30-17=13. The WUS sequence should be a gold sequence in the gold sequence family numbered 4. In other words, the target m-sequence optimal pair is the m-sequence optimal pair corresponding to the gold sequence family numbered 4. Therefore, the target sequence is the 13th gold sequence in the gold sequence family numbered 4.

[0591] In some embodiments, the number of the target m-sequence preferred pair and the number of the target gold sequence family are determined according to the region identifier. For example, the number of the target gold sequence family is determined according to the modulo result of the region identifier and M.

[0592] In some embodiments, the sequence element numbered n in the WUS sequence is determined based on the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence. Alternatively, the value of the nth bit in the WUS sequence is determined based on the value of the ath bit in the fourth m-sequence and the value of the bth bit in the fifth m-sequence. The fourth m-sequence and the fifth m-sequence constitute a preferred m-sequence pair, with the fourth m-sequence being one m-sequence in the preferred m-sequence pair and the fifth m-sequence being the other m-sequence in the preferred m-sequence pair.

[0593] In some embodiments, a is determined based on at least one of the following: n, parameter m0, and a second length value. b is determined based on at least one of the following: n, parameter m1, and a second length value. Parameter m0 represents the cyclic offset of the fourth m-sequence when generating the WUS sequence, and parameter m1 represents the cyclic offset of the fifth m-sequence when generating the WUS sequence. The second length value is the length of the fourth m-sequence, i.e., the length of the fifth m-sequence. n is greater than or equal to 0 and less than the second length value.

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

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

[0596] In some embodiments, the sequence element numbered n in the WUS sequence is the third product. This can also be understood as the value of the nth bit in the WUS sequence being equal to the third product. The third product is the product of the first difference and the second difference. The first difference is the difference between the value 1 and the fourth product, and the fourth product is the product of the value 2 and the sequence element numbered a in the fourth m-sequence. The second difference is the difference between the value 1 and the fifth product, and the fifth product is the product of the value 2 and the sequence element numbered b in the fifth m-sequence.

[0597] For example, the WUS sequence can be expressed as formula (12). W (n) represents a WUS sequence, x0(n) represents the fourth m-sequence used to generate the WUS sequence, x1(n) represents the fifth m-sequence used to generate the WUS sequence, and L represents the second length value. W(n)=[1-2x0((n+m0)mod L)]·[1-2x1((n+m1)mod L)] (12)

[0598] In some embodiments, formula (12) is applicable to the case where the WUS sequence is obtained through BPSK modulation.

[0599] In some embodiments, the sequence element numbered n in the WUS sequence is the modulo-2 sum of the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence. Alternatively, the value of the nth bit in the WUS sequence is equal to the modulo-2 sum of the value of the ath bit in the fourth m-sequence and the value of the bth bit in the fifth m-sequence.

[0600] For example, the WUS sequence can be expressed as formula (13). W (n) represents a WUS sequence, x0(n) represents the fourth m-sequence used to generate the WUS sequence, x1(n) represents the fifth m-sequence used to generate the WUS sequence, and L represents the second length value. W (n)=[x0((n+m0)mod L)+x1((n+m1)mod L)]mod 2 (13)

[0601] In some embodiments, formula (13) is applicable to the case where the WUS sequence is obtained through OOK modulation.

[0602] In some embodiments, the parameter m0 and the parameter m1 are determined according to at least one of the following: cell ID, TA ID, RAN area ID, UE ID, UE group ID.

[0603] In some embodiments, the parameter m0 is determined according to the area identifier, and the parameter m1 is determined according to the UE ID or the UE group ID.

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

[0605] Calculation method 1:

[0606] In some embodiments, parameter m0 is determined based on the modulo result of the area identifier and parameter F, and parameter m1 is determined based on the UE ID index. The area identifier is a cell ID, a TA ID, or a RAN area ID, and the UE ID index refers to the UE ID index within the area corresponding to the area identifier. For example, if the area corresponding to one area identifier includes 100 UEs, the UE ID index ranges from 0 to 99.

[0607] In some embodiments, the parameter m0 is determined according to the modulo operation result of the area identifier and the parameter F, and the parameter m1 is determined according to the index number of the UE group ID. The area identifier is the cell ID, or the TA ID, or the RAN area ID. The index number of the UE group ID refers to the index number of the UE group ID within the area corresponding to the area identifier. Exemplarily, there are 8 UE groups in total within the area corresponding to an area identifier, and the index number of the UE group ID ranges from 0 to 7.

[0608] In some embodiments, the parameter m0 is equal to the modulo operation result of the area identifier and the parameter F. If the area identifier is the cell identifier then If the area identifier is the TA identifier then If the area identifier is the RAN area identifier then

[0609] In some embodiments, the parameter m1 is equal to the index number I of the UE group ID UEGID , or the parameter m1 is equal to the index number I of the UE ID UEID .

[0610] [[ID=二十六]]In some embodiments, the parameter m0 is equal to an integer multiple of the modulo operation result of the area identifier and the parameter F. If the area identifier is the cell identifier then If the area identifier is the TA identifier then If the area identifier is the RAN area identifier then where q1 is a positive integer.

[0611] In some embodiments, the parameter m1 is equal to an integer multiple of the index number of the UE group ID, or the parameter m1 is equal to an integer multiple of the index number of the UE ID. Exemplarily, m1 = q2 * I UEID , or m1 = q2 * I UEGID , where q2 is a positive integer.

[0612] Optionally, the parameter m0 is less than the second length value, that is, m0 < L. Optionally, the parameter m1 is less than the second length value, that is, m1 < L.

[0613] Example 1: Assume that the communication protocol stipulates that F = 56, and the index number I of the UE group ID UEGID ranges from {0, 1, 2, 3, 4, 5, 6, 7}. Assume that the network device expects to wake up the UE group with the index number 5 in the cell with the cell identifier , that is, I UEGID= 5. The length of the WUS sequence is L.

[0614] according to mod F=9mod 56=9,m1=1 UEGID =5.

[0615] If calculated by formula (12), we can get d W (n)=[1-2x0((n+9)mod L)]·[1-2x1((n+5)mod L)], 0≤n <L,m0<L,m1<L。

[0616] If calculated by formula (13), we can get d W (n)=[x0((n+9)mod L)+x1((n+5)mod L)]mod 2,0≤n <L。

[0617] Among them, x0(n) and x1(n) are the optimal pairs of m sequences used to generate the target gold sequence family. Where M=2, which represents the number of optimal pairs of m sequences when the number of shift register stages is r. Therefore, x0(n) and x1(n) correspond to the gold sequence family numbered 4 among the M gold sequence families.

[0618] Example 2: Assume that the communication protocol stipulates F = 40, q1 = 2, q2 = 3, and the index number of the UE ID is I UEID The value range is 0 to 99. Assume that the network device expects to wake up the TA flag The UE with index number 21 in the area, i.e. UEID = 66. The length of the WUS sequence is L = 127.

[0619] according to m1=q2*I UEID =3*21=63.

[0620] If calculated by formula (12), we can get d W (n)=[1-2x0((n+16)mod 127)]·[1-2x1((n+63)mod 127)], 0≤n <L。

[0621] If calculated by formula (13), we can get d W (n)=[x0((n+16)mod 127)+x1((n+63)mod 127)]mod 2,0≤n <L。

[0622] Wherein, x0(n) and x1(n) are the preferred m-sequence pairs for generating the target gold sequence family. Assume that the network device indicates that the WUS sequence corresponds to the sequence numbered I in the first sequence.s a sequence of = 13, and indicates that the second starting information e = 2. If a family of gold sequences includes Q = 12 gold sequences, then, the target family of gold sequences is the gold sequence family ranked 2 + 1 = 3rd among M families of gold sequences.

[0623] Calculation method 2:

[0624] In some embodiments, the parameter m0 is determined according to the area identifier and the index number of the UE ID, and the parameter m1 is determined according to the index number of the UE ID.

[0625] In some embodiments, the parameter m0 is determined according to the quotient of the area identifier and the parameter B and the index number of the UE ID, and the parameter m1 is determined according to the modulo result of the index number of the UE ID and the parameter B.

[0626] Exemplarily, m1 = I UEID mod B. Optionally, B is a positive integer, f1 is a positive integer, and f2 is a positive integer. Optionally, f2I UEID < f1. Optionally, B < L.

[0627] Exemplarily, m1 = I UEID mod B. Optionally, B is a positive integer, f1 is a positive integer, and f2 is a positive integer. Optionally, f2I UEID < f1. Optionally, B < L.

[0628] Exemplarily, m1 = I UEID mod B. Optionally, B is a positive integer, f1 is a positive integer, and f2 is a positive integer. Optionally, f2I UEID < f1. Optionally, B < L.

[0629] In some embodiments, the parameter m0 is determined according to the area identifier and the index number of the UE group ID, and the parameter m1 is determined according to the index number of the UE group ID.

[0630] In some embodiments, the parameter m0 is determined according to the quotient of the area identifier and the parameter B and the index number of the UE group ID, and the parameter m1 is determined according to the modulo result of the index number of the UE group ID and the parameter B.

[0631] Exemplarily, m1 = I UEGID mod B. Optionally, B is a positive integer, f1 is a positive integer, and f2 is a positive integer. Optionally, f2I UEGID < f1. Optionally, B < L.

[0632] Exemplarily, m1 = I UEGID mod B. Optionally, B is a positive integer, f1 is a positive integer, and f2 is a positive integer. Optionally, f2I UEGID < f1. Optionally, B < L.

[0633] Exemplarily, m1 = I UEGID mod B. Optionally, B is a positive integer, f1 is a positive integer, and f2 is a positive integer. Optionally, f2I UEGID < f1. Optionally, B < L.

[0634] Optionally, the parameter m0 is less than the second length value, that is, m0 < L. Optionally, the parameter m1 is less than the second length value, that is, m1 < L.

[0635] Example 3: Assume that the communication protocol stipulates that B = 5, f1 = 26, f2 = 2, and the index number I of the UE ID UEID ranges from 0 to 99. Assume that the network device expects to wake up the UE with the index number 11 in the RAN area identifier of the area, that is, I UEID = 11. The length of the WUS sequence is L = 127.

[0636] According to m1 = I UEID mod B = 11 mod 5 = 1.

[0637] If calculated by Equation (12), d W (n) = [1 - 2x0((n + 48) mod 127)]·[1 - 2x1((n + 1) mod 127)], 0 ≤ n < L.

[0638] If calculated by Equation (13), d W (n) = [x0((n + 48) mod 127) + x1((n + 1) mod 127)] mod 2, 0 ≤ n < L.

[0639] Among them, x0(n) and x1(n) are the preferred pair of m-sequences for generating the target gold sequence family, where M = 2, indicating the number of preferred pairs of m-sequences when the number of shift register stages is r. Therefore, x0(n) and x1(n) correspond to the gold sequence family numbered 2 among the M gold sequence families.

[0640] Example 4: Assume that the communication protocol stipulates that B = 6, f1 = 16, f2 = 1, and the index number I of the UE group ID UEGIDThe value range is {0,1,2,3,4,5,6,7}. Assume that the network device expects to wake up the cell ID The UE group with index number 8 in the area, i.e. UEGID = 8. The length of the WUS sequence is L = 127.

[0641] according to m1=I UEGID mod B=8 mod 6=2.

[0642] If calculated by formula (12), we can get d W (n)=[1-2x0((n+8)mod 127)]·[1-2x1((n+2)mod 127)], 0≤n <L。

[0643] If calculated by formula (13), we can get d W (n)=[x0((n+8)mod 127)+x1((n+2)mod 127)]mod 2,0≤n <L。

[0644] Wherein, x0(n) and x1(n) are the preferred m-sequence pairs for generating the target gold sequence family. Assume that the network device indicates that the WUS sequence corresponds to the sequence numbered I in the first sequence. s =24 sequence, and indicates the second starting information e=3. If a gold sequence family includes Q=12 gold sequences, Then, the target gold sequence family is the gold sequence family ranked 3+2=5 among the M gold sequence families.

[0645] It should be noted that, regardless of calculation method 1 or calculation method 2, the calculation methods of m0 and m1 can be reversed. For example, parameter m0 is determined based on the index number of the UE ID or the index number of the UE group ID, and parameter m1 is determined based on the modulo result of the area identifier and parameter F. For example, parameter m0 is determined based on the index number of the UE ID or the index number of the UE group ID, and parameter m1 is determined based on the area identifier and the index number of the UE ID. For example, parameter m0 is determined based on the index number of the UE ID or the index number of the UE group ID, and parameter m1 is determined based on the quotient of the area identifier and parameter B, and the index number of the UE ID.

[0646] In summary, the method provided in the embodiment of the present application provides a low-complexity and low-featured solution for sending a WUS sequence through a gold sequence. It supports both selecting Z gold sequence families to form a first sequence and constructing a gold sequence set to form a first sequence, providing a flexible construction solution for the first sequence corresponding to a region. It supports both the selection of a gold sequence as a WUS sequence from the generated first sequence by a network device and the selection of a WUS sequence by a network device through a cyclic shift step size, the number I corresponding to the WUS sequence in the first sequence. S The WUS sequence is generated using information such as the gold sequence. Furthermore, the gold sequence has excellent autocorrelation and cross-correlation properties, and the WUS sequence generated using the gold sequence also exhibits these excellent properties, helping to improve the transmission accuracy and reliability of the wake-up signal, ensuring the reliability, success rate, and efficiency of wake-up. Compared to the solution that uses an m-sequence to form the first sequence, using the gold sequence can increase the number of sequences within the first sequence. In other words, it can provide more optional WUS sequences for a region, supporting wake-up services for a large number of terminal devices within the communication system.

[0647] When the total number of regions within a communication system is large and the range of region identifier values ​​is wide, the number of possible WUS sequences is also large, meaning that the terminal device needs to detect more WUSs. For example, when there are 1008 cells within the communication system, this means that there are 1008 WUSs corresponding to the 1008 cell identifiers. At this time, the terminal device may need to receive and detect 1008 WUS sequences, which will undoubtedly increase the power consumption of low-power devices. Therefore, based on Figures 11 and 13, it is possible to consider reducing the number of WUSs that the terminal device may need to detect to save power consumption.

[0648] One approach is to reduce the number of area 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.

[0649] Another approach is to reduce the complexity of WUS detection by the terminal device by constructing a suitable binary sequence. This application provides a solution as shown in Figure 14. The WUS is designed to be generated by two binary sequences, one of which carries the region identifier and the other carries the UE ID or UE group ID, to reduce the total number of WUSs that need to be detected.

[0650] FIG14 is a flow chart showing a method for transmitting a wake-up signal according to an exemplary embodiment of the present application. The method is executed by a network device and includes:

[0651] Step 1410: Send a WUS, where the WUS is used to wake up at least one terminal device; wherein the WUS is generated according to two m-sequences, or the WUS includes two m-sequences.

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

[0653] Assume that the target m-sequence preferred pair includes a fourth m-sequence and a fifth m-sequence. The fourth m-sequence is one m-sequence in the m-sequence preferred pair, and the fifth m-sequence is the other m-sequence in the m-sequence preferred pair.

[0654] The WUS is generated by two binary sequences, where one binary sequence is the fourth m-sequence and the other binary sequence is the fifth m-sequence.

[0655] In some embodiments, the WUS 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 the fourth m-sequence, and the sequence of the second sub-signal is generated according to the fifth m-sequence.

[0656] 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 fourth 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 fourth m-sequence.

[0657] 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 fifth 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 fifth m-sequence.

[0658] In some embodiments, a is determined based on at least one of the following: n1, parameter m0, and a second length value. b is determined based on at least one of the following: n1, parameter m1, and a second length value. Parameter m0 represents the cyclic offset of the fourth m-sequence when generating the first sub-signal, and parameter m1 represents the cyclic offset of the fifth m-sequence when generating the second sub-signal. The second length value is the length of the fourth m-sequence, i.e., the length of the fifth m-sequence. n is greater than or equal to 0 and less than the second length value.

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

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

[0661] 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 fourth product, and the fourth product is the product of the value 2 and the sequence element numbered a in the fourth m-sequence.

[0662] 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 n2-th 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 fifth product, and the fifth product is the product of the value 2 and the sequence element numbered b in the fifth m-sequence.

[0663] For example, the sequence of the first sub-signal can be expressed as formula (14), and the sequence of the second sub-signal can be expressed as formula (15). SS1 (n1) represents the sequence of the first sub-signal, and x0(n) represents the fourth 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 fifth m-sequence used to generate the sequence of the second sub-signal. L represents the second length value. SS1 (n1)=[1-2x0((n1+m0)mod L)] (14) d SS2 (n2)=[1-2x1((n1+m1)mod L)] (15)

[0664] Optionally, n2=n1+L, that is, the numbers of the fourth m-sequence and the fifth m-sequence are consecutive. Optionally, n2>n1+L, that is, there is a numbering gap between the fourth m-sequence and the fifth m-sequence.

[0665] In some embodiments, equations (14) and (15) are applicable to the case where WUS is obtained through BPSK modulation.

[0666] In some embodiments, the sequence element numbered n1 in the sequence of the first sub-signal is the sequence element numbered a in the fourth 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 fourth m-sequence.

[0667] In some embodiments, the sequence element numbered n2 in the sequence of the second sub-signal is the sequence element numbered b in the fifth 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 fifth m-sequence.

[0668] For example, the sequence of the first sub-signal can be expressed as formula (16), and the sequence of the second sub-signal can be expressed as formula (17).SS1 (n1) represents the sequence of the first sub-signal, and x0(n) represents the fourth 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 fifth m-sequence used to generate the sequence of the second sub-signal. L represents the second length value. SS1 (n1)=[x0((n1+m0)mod L)] (16) d SS2 (n2)=[x1((n1+m1)mod L)] (17)

[0669] Optionally, n2=n1+L, that is, the numbers of the fourth m-sequence and the fifth m-sequence are consecutive. Optionally, n2>n1+L, that is, there is a numbering gap between the fourth m-sequence and the fifth m-sequence.

[0670] In some embodiments, equations (16) and (17) are applicable to the case where WUS is obtained through OOK modulation.

[0671] In the embodiment of the present application, the determination of the parameter m0 and the parameter m1 may refer to the calculation method 1 and the calculation method 2 shown in FIG11 .

[0672] Example 1: Assuming the communication protocol stipulates F = 56, the index number of the UE group ID is I UEGID The value range is {0,1,2,3,4,5,6,7}. Assume that the network device expects to wake up the cell ID The UE group with index number 5 in the cell, i.e. UEGID = 5. The length of the WUS sequence is L.

[0673] according to mod F=9mod 56=9,m1=1 UEGID =5.

[0674] If we calculate through formula (11) and (12), we can get d SS1 (n1)=[1-2x0((n+9)mod L)], d SS2 (n2)=[1-2x1((n+5)mod L)],0≤n <L,m0<L,m1<L。

[0675] If we calculate through formula (13) and (14), we can get d SS1 (n1) = [x0((n+9) mod L)], d SS2 (n2)=[x1((n+5)mod L)],0≤n <L。

[0676] Among them, x0(n) and x1(n) are the optimal pairs of m sequences used to generate the target gold sequence family. Where M=2, which represents the number of optimal pairs of m sequences when the number of shift register stages is r. Therefore, x0(n) and x1(n) correspond to the gold sequence family numbered 4 among the M gold sequence families.

[0677] Example 2: Assume that the communication protocol stipulates F = 40, q1 = 2, q2 = 3, and the index number of the UE ID is I UEID The value range is 0 to 99. Assume that the network device expects to wake up the TA flag The UE with index number 21 in the area, i.e. UEID = 66. The length of the WUS sequence is L = 127.

[0678] according to m1=q2*I UEID =3*21=63.

[0679] If we calculate through formula (11) and (12), we can get d SS1 (n1)=[1-2x0((n+16)mod 127)], d SS2 (n2)=[1-2x1((n+63)mod 127)],0≤n <L,m0<L,m1<L。

[0680] If we calculate through formula (13) and (14), we can get d SS1 (n1)=[x0((n+16)mod 127)], d SS2 (n2)=[x1((n+63)mod 127)],0≤n <L。

[0681] Wherein, x0(n) and x1(n) are the preferred m-sequence pairs for generating the target gold sequence family. Assume that the network device indicates that the WUS sequence corresponds to the sequence numbered I in the first sequence. s =13 sequence, and indicates the second starting information e=2. If a gold sequence family includes Q=12 gold sequences, Then, the target gold sequence family is the gold sequence family ranked 2+1=3 among the M gold sequence families.

[0682] In summary, the method provided in the embodiment of the present application generates a WUS through the design of two m-sequences, so that the two m-sequences carry the regional information and the information of the UE / UE group to be awakened respectively, which can greatly reduce the number of times the terminal device detects the WUS sequence. The reasons are as follows: Taking the awakening of the UE group as an example, assuming that there are Z1 regions and Z2 UE groups in the system, if the regional identifier and the UE group identifier are carried in a WUS sequence, then Z1*Z2 types of WUS sequences need to be designed to accurately wake up different UE groups in different regions, which means that the terminal device may detect up to Z1*Z2 times. However, if the regional identifier and the UE group identifier are carried in two WUS sequences, only Z1+Z2 types of WUS sequences need to be designed to accurately wake up different UE groups in different regions, and the terminal device may detect only Z1+Z2 times. Z1+Z2 is much smaller than Z1*Z2, so the number of WUS detections is greatly reduced, which is conducive to energy saving of the terminal device. Moreover, the closer Z1 is to Z2, the smaller the value of Z1+Z2. The network equipment can also appropriately allocate areas and UE groups to make the values ​​of Z1 and Z2 closer, further saving the power consumption of the terminal equipment.

[0683] The WUS involved in this application includes at least one of the following modulation modes: OOK modulation; PSK modulation; BPSK modulation; FSK modulation.

[0684] Assuming OOK modulation, the sequence elements with the values ​​"1" and "0" in the WUS sequence correspond to the high and low levels in the OOK sequence, respectively. For example, the sequence element with the value "1" in the WUS sequence corresponds to the high level in the OOK sequence, and the sequence element with the value "0" in the WUS sequence corresponds to the low level in the OOK sequence; or, the sequence element with the value "1" in the WUS sequence corresponds to the low level in the OOK sequence, and the sequence element with the value "0" in the WUS sequence corresponds to the high level in the OOK sequence.

[0685] Assuming the modulation mode is PSK modulation, then the sequence elements of the WUS sequence with the values ​​of "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 WUS sequence with the value of "1" correspond to phase continuity (+1) in the PSK sequence, and the sequence elements of the WUS sequence with the value of "0" correspond to phase jumps (0 or -1) in the PSK sequence; or, the sequence elements of the WUS sequence with the value of "1" correspond to phase jumps (0 or -1) in the PSK sequence, and the sequence elements of the WUS sequence with the value of "0" correspond to phase continuity (+1) in the PSK sequence.

[0686] Assuming BPSK modulation, the sequence elements of the WUS sequence with values ​​of "1" and "0" correspond to the positive level (+1) and negative level (-1) in the BPSK sequence, respectively. For example, the sequence element of the WUS sequence with a value of "1" corresponds to the positive level (+1) in the BPSK sequence, and the sequence element of the WUS sequence with a value of "0" corresponds to the negative level (-1) in the BPSK sequence; or, the sequence element of the WUS sequence with a value of "1" corresponds to the negative level (-1) in the BPSK sequence, and the sequence element of the WUS sequence with a value of "0" corresponds to the positive level (+1) in the BPSK sequence.

[0687] Assuming FSK modulation, the sequence elements with values ​​of "1" and "0" in the WUS sequence correspond to the two carrier frequencies of the FSK sequence. For example, the sequence element with a value of "1" in the WUS sequence corresponds to carrier frequency 1 of the FSK sequence, and the sequence element with a value of "0" in the WUS sequence corresponds to carrier frequency 0 of the FSK sequence; or, the sequence element with a value of "1" in the WUS sequence corresponds to carrier frequency 0 of the FSK sequence, and the sequence element with a value of "0" in the WUS sequence corresponds to carrier frequency 1 of the FSK sequence.

[0688] FIG15 is a schematic flow chart of a method for transmitting a wake-up signal provided by an exemplary embodiment of the present application. The method is executed by a terminal device and includes:

[0689] Step 1510: Receive a WUS, where the WUS is used to wake up at least one terminal device; wherein the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence includes at least one of the following: m sequence; Gold sequence; Walsh sequence.

[0690] Since m-sequences, Gold sequences, and Walsh sequences all include sequence elements with only two values, the first sequence also includes sequence elements with only two values. For example, the first sequence includes only "0" and "1," or the first sequence includes only "+1" and "-1."

[0691] In some embodiments, the WUS is carried in a coded manner, for example, the first sequence is carried in a coded channel.

[0692] In some embodiments, the WUS is sent in a sequence, such as directly sending a first sequence in a channel.

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

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

[0695] The terminal device that executes step 1510 can be a terminal device as shown in Figures 1, 2, and 6, or a terminal device operating in the millimeter wave (mmWave) frequency band, etc.

[0696] To sum up, the method provided in the embodiment of the present application is very easy to combine with non-OFDM waveforms such as OOK waveform, PSK waveform, FSK waveform, etc., because WUS is generated according to a binary sequence. It provides the possibility of transmitting WUS for some communication scenarios where OFDM waveforms are difficult to use, thereby achieving energy saving of terminal equipment through WUR.

[0697] FIG16 is a schematic flow chart of a method for transmitting a wake-up signal provided by an exemplary embodiment of the present application. The method is executed by a terminal device and includes:

[0698] Step 1610: Receive a WUS, where the WUS is used to wake up at least one terminal device; wherein the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence is an m-sequence.

[0699] For the relevant contents of WUS and the first sequence, please refer to step 1110 and step 1410, which will not be repeated here.

[0700] It should be noted that in order to accurately receive and detect WUS, the terminal device should also determine the first sequence corresponding to the area. Specifically, due to oscillator mismatch, Doppler frequency shift, noise interference, etc., the WUS sent from the transmitter and the WUS arriving at the receiver will inevitably produce deviations in the time domain and frequency domain. To ensure that the WUS detection result has a high accuracy, the terminal device needs to perform correlation detection on the received WUS and the local WUS, obtain clock information and / or frequency offset estimation results, calibrate the received WUS in the time domain based on the clock information, and calibrate the received WUS in the frequency domain based on the frequency offset estimation results, so as to accurately detect the WUS. The local WUS required in the detection process should be generated locally by the terminal device. However, the terminal device does not know which UEs or UE groups the network device expects to wake up, nor does it know whether the WUS received this time is used to wake itself up. Therefore, the terminal device needs to know all WUS sequences in the area so that when it receives a WUS, it can find a similar WUS locally for correlation detection. That is to say, the terminal device should clearly know the first sequence corresponding to the area in order to accurately detect the WUS when it receives it.

[0701] The method of generating the first sequence based on the m-sequence shown in Figures 11 and 14 is also applicable to the terminal device. That is, the network device and the terminal device should determine the first sequence respectively, and the network device side and the terminal device side should clearly define which m-sequences constitute the first sequence corresponding to the area. Regardless of whether the method adopted by the network device and the terminal device to determine the first sequence corresponding to the same area is exactly the same, the first sequence determined by the network device and generated by the terminal device for the same area should be the same, so as to ensure that the terminal device can clearly identify the wake-up object of the WUS after receiving the WUS. In addition, taking into account the RRC state of the UE, the network device is supported to flexibly adopt different methods to provide information to the UE to generate the first sequence. For example, the network device can configure one or more of the following information to the UE during the initial attachment process: first sequence information, second sequence information, UE group, so that the UE can also generate the first sequence in the RRC idle state and RRC inactive state. For example, for a UE in an RRC connected state, the network device can configure one or more of the following information to the terminal device through high-layer signaling: first sequence information, second sequence information, UE group. For a UE in an RRC inactive state, the network device may notify the terminal device through the RAN of one or more of the following information: first sequence information, second sequence information, and UE group.

[0702] In some embodiments, the terminal device determines X first m-sequences according to the area identifier or the first sequence information.

[0703] In some embodiments, the terminal device determines the X first m-sequences according to at least one of the following: first starting information, a cyclic shift step, a numbering order of the N first m-sequences, and a total number of sequences in the first sequence.

[0704] In some embodiments, the terminal device determines the numbering order of the N first m-sequences.

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

[0706] In some embodiments, the terminal device determines the number of first m-sequences in the m-sequence set according to the number of shift register stages, the number of first m-sequences, and the cyclic shift step size.

[0707] In some embodiments, the terminal device determines a numbering order of the first m-sequence and / or the second m-sequence within the m-sequence set.

[0708] In some embodiments, the terminal device determines the m-sequence subset according to the area identifier.

[0709] In summary, the method provided in the embodiment of the present application provides a low-complexity and low-featured solution for the transmission of WUS through an m-sequence. It supports both the formation of a first sequence by selecting a first m-sequence and the formation of a first sequence by constructing an m-sequence set, providing a flexible construction scheme for the first sequence corresponding to a region. In addition, the m-sequence has good autocorrelation and cross-correlation characteristics, and the WUS sequence generated by the m-sequence still has such good characteristics, which helps to improve the transmission accuracy and reliability of the wake-up signal and ensure the reliability, success rate and efficiency of the wake-up. In addition, an m-sequence can obtain more m-sequences through cyclic shift, which can provide a large number of optional WUS sequences for a region, support the provision of WUS sequences for a large number of terminal devices in the communication system, and avoid false wake-up and wake-up conflicts in the communication system.

[0710] FIG17 is a schematic flow chart of a method for transmitting a wake-up signal provided by an exemplary embodiment of the present application. The method is executed by a terminal device and includes:

[0711] Step 1710: Receive a WUS, where the WUS is used to wake up at least one terminal device; wherein the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence is a gold sequence.

[0712] For details about the gold sequence and WUS, please refer to step 1210 and will not be repeated here.

[0713] It should be noted that, in order to accurately receive and detect the WUS, the terminal device should also determine the first sequence corresponding to the area. The reason here can be referred to step 1610 and will not be repeated here.

[0714] The method of generating WUS based on the gold sequence shown in Figure 12 is also applicable to the terminal device. That is, the network device and the terminal device should respectively determine the gold sequence for generating the WUS. Regardless of whether the method adopted by the network device and the terminal device in determining the first sequence corresponding to the same area is exactly the same, the first sequence determined by the network device and generated by the terminal device for the same area should be the same, so as to ensure that the terminal device can clearly identify the wake-up object of the WUS after receiving the WUS. In addition, taking into account the RRC state of the UE, the network device is supported to flexibly adopt different methods to provide information to the UE to generate the first sequence. For example, the network device can configure one or more of the following information to the UE during the initial attachment (Attach) process: first sequence information, second sequence information, UE group, so that the UE can also generate the first sequence in the RRC idle state and RRC inactive state. For another example, for a UE in an RRC connected state, the network device can configure one or more of the following information to the terminal device through high-layer signaling: first sequence information, second sequence information, UE group. For a UE in an RRC inactive state, the network device may notify the terminal device through the RAN of one or more of the following information: first sequence information, second sequence information, and UE group.

[0715] In some embodiments, the terminal device determines Z gold sequence families according to the region identifier or the second sequence information.

[0716] In some embodiments, the terminal device determines the Z gold sequence families according to at least one of the following: the second starting information, the cyclic shift step, the numbering order of the M gold sequence families, and the total number of sequences in the first sequence.

[0717] In some embodiments, the terminal device determines the numbering order of the M gold sequence families.

[0718] In some embodiments, the terminal device determines the number of sequences in the gold sequence set according to the number of shift register stages.

[0719] In some embodiments, the terminal device determines the number of sequences in the gold sequence set based on at least one of the following: the number of shift register stages, the cyclic offset, the cyclic shift step, the length of the m-sequence, and the number of preferred pairs of m-sequences.

[0720] In some embodiments, the terminal device determines the numbering order of the gold sequence families within the m-sequence set.

[0721] In some embodiments, the terminal device determines the gold sequence subset according to the area identifier.

[0722] In some embodiments, the terminal device determines the preferred cyclic offsets m0 and m1 of the m-sequence according to the region identifier.

[0723] In summary, the method provided in the embodiment of the present application provides a low-complexity and low-featured solution for sending a WUS sequence through a gold sequence. It supports both selecting Z gold sequence families to form a first sequence and constructing a gold sequence set to form a first sequence, providing a flexible construction scheme for the first sequence corresponding to a region. In addition, the gold sequence has good autocorrelation and cross-correlation characteristics, and the WUS sequence generated by the gold sequence still has such good characteristics, which helps to improve the transmission accuracy and reliability of the wake-up signal and ensure the reliability, success rate and efficiency of the wake-up. Compared with the solution of using an m sequence to form the first sequence, the use of a gold sequence can increase the number of sequences in the first sequence, that is, it can provide more optional WUS sequences for a region, and support the provision of wake-up services for a large number of terminal devices in the communication system.

[0724] FIG18 shows a block diagram of a wake-up signal transmission apparatus according to an exemplary embodiment of the present application. The apparatus can be implemented as a network device as described in FIG10 , FIG11 , FIG12 , or FIG14 , or as a portion of a network device as described in FIG10 , FIG11 , FIG12 , or FIG14 . The apparatus includes a sending module 1810 . Optionally, the apparatus also includes a processing module 1830 and / or a receiving module 1850 .

[0725] The sending module 1810 is used to send a WUS, which is used to wake up at least one terminal device; wherein the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence includes at least one of the following: m sequence; Gold sequence; Walsh sequence.

[0726] In some embodiments, the first sequence is associated with at least one of the following identifiers: a cell identifier; a cell group identifier; a tracking area (TA) identifier; a RAN notification area identifier; a UE identifier; or a UE group identifier.

[0727] In some embodiments, the first sequence is generated based on a first number of m-sequences; wherein the first number of m-sequences includes a first m-sequence and / or a second m-sequence, and the second m-sequence is obtained by cyclic shifting the first m-sequence.

[0728] In some embodiments, among the first number of m-sequences, the number of the first m-sequences is X, and the number of the second m-sequences is Y; where X is an integer greater than or equal to 0, Y is an integer greater than or equal to 0, and X and Y are not both equal to 0.

[0729] In some embodiments, the X first m-sequences are X of N first m-sequences, where N is an integer greater than 1.

[0730] In some embodiments, the X first m-sequences are any X of N first m-sequences, where N is an integer greater than 1; or, the X first m-sequences are determined based on an area identifier, where the area identifier includes at least one of the following: a cell identifier, a cell group identifier, a tracking area (TA) identifier, and a RAN notification area identifier; or, the X first m-sequences are determined based on first sequence information.

[0731] In some embodiments, the first sequence information includes at least one of the following: first start information, used to indicate the starting position of the X first m-sequences in the N first m-sequences; first length information, used to indicate the value of X; first end information, used to indicate the ending position of the X first m-sequences in the N first m-sequences; the total number of sequences in the first sequence; the numbers of the X first m-sequences; the number of the WUS sequence in the first sequence; a cyclic shift step; the numbering order of the N first m-sequences; and a first bit map, wherein each bit of the first bit map corresponds one-to-one to the N first m-sequences.

[0732] In some embodiments, the sending module 1810 is further configured to indicate the first sequence information.

[0733] In some embodiments, the X first m-sequences are determined based on the first starting information and the first length information; or, the X first m-sequences are determined based on the first length information and the first end information; or, the X first m-sequences are determined based on the first starting information and the first end information; or, the X first m-sequences are determined based on at least one of the following: the first starting information, the cyclic shift step, the numbering order of the N first m-sequences, and the total number of sequences in the first sequence.

[0734] In some embodiments, the i-th sequence in the first sequence is determined based on at least one of the following: the first starting information, the cyclic shift step, and the value of i; wherein the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

[0735] In some embodiments, the numbering order of the N first m-sequences is agreed upon by a communication protocol, or is indicated by the network device, or is a default order, or is determined by the terminal device.

[0736] In some embodiments, the sending module 1810 is further configured to indicate a numbering order of the N first m-sequences.

[0737] In some embodiments, the numbering order of the N first m-sequences is determined according to the following order: the order of the numbers of the N first m-sequences from small to large; the order of the numbers of the N first m-sequences from large to small; the order of the primitive polynomial coefficients from high power to low power; the order of the primitive polynomial coefficients from low power to high power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small.

[0738] In some embodiments, the first sequence is generated according to an m-sequence subset, which is a subset of an m-sequence set; wherein the m-sequence set includes a first m-sequence and / or a second m-sequence, and the second m-sequence is obtained by cyclic shifting the first m-sequence.

[0739] In some embodiments, within the m-sequence set, the number of the first m-sequences is determined according to the order of the first m-sequences; within the m-sequence set, the number of the second m-sequences is determined according to at least one of the following: the number of the first m-sequences, the length of the first m-sequences, and the cyclic shift step size.

[0740] In some embodiments, the numbering order of the first 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 the terminal device.

[0741] In some embodiments, the sending module 1810 is further configured to indicate a numbering order of the first m-sequence in the m-sequence set.

[0742] In some embodiments, the numbering order of the first m-sequences in the m-sequence set is determined according to the following order: the order of the numbers of the first m-sequences in the m-sequence set from small to large; the order of the numbers of the first m-sequences in the m-sequence set from large to small; the order of the coefficients of primitive polynomials from high power to low power; the order of the coefficients of primitive polynomials from low power to high power; the order of the binary numbers of the coefficients of primitive polynomials from small to large; and the order of the binary numbers of the coefficients of primitive polynomials from large to small.

[0743] In some embodiments, the numbering order of the second 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 the terminal device.

[0744] In some embodiments, the sending module 1810 is further configured to indicate a numbering order of second m-sequences in the m-sequence set.

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

[0746] In some embodiments, each second m-sequence in the m-sequence set is arranged after its corresponding first m-sequence in numerical order; or, all second m-sequences in the m-sequence set are arranged after all first m-sequences in the m-sequence set in numerical order.

[0747] In some embodiments, the m-sequence subset is any subset of the m-sequence set; or, the m-sequence subset is determined according to an area identifier; or, the m-sequence subset is indicated by the network device.

[0748] In some embodiments, the sending module 1810 is further configured to indicate the m-sequence subset.

[0749] In some embodiments, the sequence element numbered n in the WUS sequence is determined based on the sequence element numbered n′ in the third m-sequence; wherein, n′ is determined based on at least one of the following: the n, the cyclic shift step, the number of the WUS sequence in the first sequence, and the first length value; the first length value is the length value of the third m-sequence, and the n is greater than or equal to 0 and less than the first length value.

[0750] In some embodiments, n′ is determined based on a first modulo result; wherein the first modulo result is a modulo result of a first sum value and the first length value; the first sum value is the sum of n and a first product; the first product is the product of the cyclic shift step and a target number, and the target number is the number of the target sequence for generating the WUS sequence in all m sequences generated by the third m sequence.

[0751] In some embodiments, the sequence element numbered n in the WUS sequence 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 n′ in the third m-sequence; or, the sequence element numbered n in the WUS sequence is the sequence element numbered n′ in the third m-sequence.

[0752] In some embodiments, the first sequence is generated based on a second number of gold sequences; wherein the second number of gold sequences is generated based on at least one preferred pair of m-sequences.

[0753] In some embodiments, the second number of gold sequences is all or part of the gold sequences in a family of Z gold sequences, where Z is an integer greater than or equal to 1.

[0754] In some embodiments, the Z gold sequence families are determined by the terminal device from M gold sequence families, where M is an integer greater than 1; or, the Z gold sequence families are indicated by the network device.

[0755] In some embodiments, the sending module 1810 is further configured to indicate the Z gold sequence families.

[0756] In some embodiments, the Z gold sequence families are any Z of the M gold sequence families, where M is an integer greater than 1; or, the Z gold sequence families are determined according to a region identifier; or, the Z gold sequence families are determined according to the second sequence information.

[0757] In some embodiments, the second sequence information includes at least one of the following: second start information, used to indicate the starting position of the Z gold sequence families in the M gold sequence families; second length information, used to indicate the value of Z; second end information, used to indicate the ending position of the Z gold sequence families in the M gold sequence families; the total number of sequences in the first sequence; the numbers of the Z gold sequence families; the number of the WUS sequence in the first sequence; a cyclic shift step; the numbering order of the M gold sequence families; and a second bit map, where each bit of the second bit map corresponds one-to-one to the M gold sequence families.

[0758] In some embodiments, the sending module 1810 is further configured to indicate the second sequence information.

[0759] In some embodiments, the Z gold sequence families are determined based on the second starting information and the second length information; or, the Z gold sequence families are determined based on the second length information and the second end information; or, the Z gold sequence families are determined based on the second starting information and the second end information; or, the Z gold sequence families are determined based on at least one of the following: the second starting information, the cyclic shift step size, the numbering order of the M gold sequence families, and the total number of sequences in the first sequence.

[0760] In some embodiments, the i-th sequence in the first sequence is determined based on at least one of the following: the second starting information, the cyclic shift step, and the value of i; wherein the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

[0761] In some embodiments, the numbering order of the M gold sequence families is agreed upon by a communication protocol, or is indicated by the network device, or is a default order, or is determined by the terminal device.

[0762] In some embodiments, the sending module 1810 is further configured to indicate a numbering order of the M gold sequence families.

[0763] In some embodiments, the numbering order of the M gold sequence families is determined according to the following order: the order of the numbers of the M gold sequence families from small to large; the order of the numbers of the M gold sequence families from large to small; the order of the primitive polynomial coefficients from high power to low power; the order of the primitive polynomial coefficients from low power to high power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small; the order of the numbering of the m-sequence preferred pairs from small to large; the order of the numbering of the m-sequence preferred pairs from large to small; the order of the cyclic offsets from small to large; and the order of the cyclic offsets from large to small.

[0764] In some embodiments, the first sequence is generated based on a gold sequence subset, which is a subset of a gold sequence set; wherein the gold sequence set includes at least one gold sequence family, and a gold sequence family is generated based on a pair of m-sequence preference pairs.

[0765] In some embodiments, the number of gold sequence families in the gold sequence set is determined according to at least one of the following: the level r, the cyclic offset, the cyclic shift step, the length of the m-sequence, and the number of preferred pairs of m-sequences.

[0766] In some embodiments, the numbering order of the gold sequence families within the gold 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 the terminal device.

[0767] In some embodiments, the sending module 1810 is further configured to indicate a numbering order of the gold sequence families within the gold sequence set.

[0768] In some embodiments, the numbering order of the gold sequence families within the gold sequence set is determined according to the following order: the order of the numbering of the gold sequence families within the gold sequence set from small to large; the order of the numbering of the gold sequence families within the gold sequence set from large to small; the order of the coefficients of primitive polynomials from high power to low power; the order of the coefficients of primitive polynomials from low power to high power; the order of the binary numbers of the coefficients of primitive polynomials from small to large; the order of the binary numbers of the coefficients of primitive polynomials from large to small; the order of the numbering of preferred m-sequence pairs from small to large; the order of the numbering of preferred m-sequence pairs from large to small; the order of cyclic offsets from small to large; and the order of cyclic offsets from large to small.

[0769] In some embodiments, the gold sequence subset is any subset of the gold sequence set; or, the gold sequence subset is determined according to a region identifier; or, the gold sequence subset is indicated by the network device.

[0770] In some embodiments, the sending module 1810 is further configured to indicate the gold sequence subset.

[0771] In some embodiments, the gold sequence family includes a first gold sequence family, the first gold sequence family includes a first gold sequence, the first gold sequence is obtained by performing modulo-2 addition of a cyclic shift sequence of a fourth m-sequence and a fifth m-sequence, and the cyclic shift sequence of the fourth m-sequence and the fifth m-sequence constitute an m-sequence preferred pair.

[0772] In some embodiments, the gold sequence family includes a second gold sequence family, the second gold sequence family includes a second gold sequence, the first gold sequence is obtained by performing modulo-2 addition of a cyclic shift sequence of a fourth m-sequence and a cyclic shift sequence of the fifth m-sequence, and the cyclic shift sequences of the fourth m-sequence and the fifth m-sequence constitute an m-sequence preferred pair.

[0773] In some embodiments, the gold sequence family includes a third gold sequence family, a third gold sequence of the third gold sequence family, the third gold sequence is obtained by cyclic shifting the first gold sequence, the first gold sequence is obtained by modulo-2 addition of cyclic shift sequences of a fourth m-sequence and a fifth m-sequence, and the cyclic shift sequences of the fourth m-sequence and the fifth m-sequence constitute an m-sequence preferred pair.

[0774] In some embodiments, the sequence element numbered n in the WUS sequence is determined based on the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence; wherein the fourth m-sequence is one m-sequence in a preferred pair of m-sequences, and the fifth m-sequence is the other m-sequence in the preferred pair of m-sequences.

[0775] In some embodiments, the sequence element numbered n in the WUS sequence is the third product, and the third product is the product of the first difference and the second difference; wherein the first difference is the difference between the value 1 and the fourth product, and the fourth product is the product of the value 2 and the sequence element numbered a in the fourth m-sequence; the second difference is the difference between the value 1 and the fifth product, and the fifth product is the product of the value 2 and the sequence element numbered b in the fifth m-sequence.

[0776] In some embodiments, the sequence element numbered n in the WUS sequence is a modulo-2 result of the sum of the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence.

[0777] In some embodiments, the WUS includes a first sub-signal and a second sub-signal, the sequence element numbered n1 in the sequence of the first sub-signal is determined based on the sequence element numbered a in the fourth 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 fifth m-sequence; wherein the fourth m-sequence is one m-sequence in a preferred pair of m-sequences, and the fifth m-sequence is the other m-sequence in the preferred pair of m-sequences.

[0778] In some embodiments, the sequence element numbered n in the sequence of the first sub-signal is the first difference value, and the sequence element numbered n2 in the sequence of the second sub-signal is the second difference value; wherein the first difference value is the difference between the value 1 and a fourth product, the fourth product is the product of the value 2 and the sequence element numbered a in the fourth m-sequence; and the second difference value is the difference between the value 1 and a fifth product, the fifth product is the product of the value 2 and the sequence element numbered b in the fifth m-sequence.

[0779] In some embodiments, the sequence element numbered n in the sequence of the first sub-signal is the sequence element numbered a in the fourth m-sequence, and the sequence element numbered n2 in the sequence of the second sub-signal is the sequence element numbered b in the fifth m-sequence.

[0780] In some embodiments, a is determined based on at least one of the following: n, parameter m0, and a second length value; b is determined based on at least one of the following: n, parameter m1, and the second length value; wherein n is greater than or equal to 0 and less than the second length value, and the second length value is the length value of the fourth m-sequence and the fifth m-sequence.

[0781] In some embodiments, a is determined based on a second modulo result, which is the modulo result of the second sum value and the second length value, and the second sum value is the sum of n and the parameter m0; b is determined based on a third modulo result, which is the modulo result of the third sum value and the second length value, and the third sum value is the sum of n and the parameter m1.

[0782] In some embodiments, the parameter m0 is determined according to the area identifier, and the parameter m1 is determined according to the index number of the UE ID; or, the parameter m0 is determined according to the area identifier, and the parameter m1 is determined according to the index number of the UE group ID; or, the parameter m0 is determined according to the area identifier and the index number of the UE ID, and the parameter m1 is determined according to the index number of the UE ID; or, the parameter m0 is determined according to the area identifier and the index number of the UE group ID, and the parameter m1 is determined according to the index number of the UE group ID; or, the parameter m1 is determined according to the area identifier, and the parameter m0 is determined according to the index number of the UE ID; or, the parameter m1 is determined according to the area identifier, and the parameter m0 is determined according to the index number of the UE group ID; or, the parameter m1 is determined according to the area identifier and the index number of the UE ID, and the parameter m0 is determined according to the index number of the UE ID; or, the parameter m1 is determined according to the area identifier and the index number of the UE group ID, and the parameter m0 is determined according to the index number of the UE ID.

[0783] In some embodiments, the total number of sequences in the first sequence is agreed upon by a communication protocol or configured by the network device.

[0784] In some embodiments, the sending module 1810 is further configured to indicate the total number of sequences in the first sequence.

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

[0786] In some embodiments, the apparatus further comprises a processing module 1830 configured to perform the above steps related to cyclic shifting and / or steps related to determination.

[0787] In some embodiments, the apparatus further includes a receiving module 1850 for receiving signals and / or data sent by the awakened terminal device.

[0788] In some embodiments, the sending module 1810 is configured to send at least one of the following information: first sequence information, second sequence information, an m-sequence subset number, a gold sequence subset number, and an m-sequence preferred pair number.

[0789] In summary, the apparatus provided in the embodiment of the present application provides a low-complexity and low-featured solution for sending a WUS sequence through a gold sequence. It supports both selecting Z gold sequence families to form a first sequence and constructing a gold sequence set to form a first sequence, providing a flexible construction solution for the first sequence corresponding to a region. It supports both the selection of a gold sequence as a WUS sequence in the generated first sequence by a network device and the selection of a WUS sequence by a network device through a cyclic shift step size and the number I corresponding to the WUS sequence in the first sequence. S The WUS sequence is generated using information such as the gold sequence. Furthermore, the gold sequence has excellent autocorrelation and cross-correlation properties, and the WUS sequence generated using the gold sequence also exhibits these excellent properties, helping to improve the transmission accuracy and reliability of the wake-up signal, ensuring the reliability, success rate, and efficiency of wake-up. Compared to the solution that uses an m-sequence to form the first sequence, using the gold sequence can increase the number of sequences within the first sequence. In other words, it can provide more optional WUS sequences for a region, supporting wake-up services for a large number of terminal devices within the communication system.

[0790] FIG19 shows a block diagram of a wake-up signal transmission apparatus according to an exemplary embodiment of the present application. The apparatus can be implemented as a terminal device as described in FIG15 , FIG16 , or FIG17 , or as a portion of a terminal device as described in FIG15 , FIG16 , or FIG17 . The apparatus includes a receiving module 1910 . Optionally, the apparatus also includes a processing module 1930 and / or a sending module 1950 .

[0791] Receiving module 1910 is used to receive WUS, which is used to wake up at least one terminal device; wherein, the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence includes at least one of the following: m sequence; Gold sequence; Walsh sequence.

[0792] In some embodiments, the first sequence is associated with at least one of the following identifiers: a cell identifier; a cell group identifier; a tracking area (TA) identifier; a RAN notification area identifier; a UE identifier; or a UE group identifier.

[0793] In some embodiments, the first sequence is generated based on a first number of m-sequences; wherein the first number of m-sequences includes a first m-sequence and / or a second m-sequence, and the second m-sequence is obtained by cyclic shifting the first m-sequence.

[0794] In some embodiments, among the first number of m-sequences, the number of the first m-sequences is X, and the number of the second m-sequences is Y; where X is an integer greater than or equal to 0, Y is an integer greater than or equal to 0, and X and Y are not both equal to 0.

[0795] In some embodiments, the X first m-sequences are X of N first m-sequences, where N is an integer greater than 1.

[0796] In some embodiments, the X first m-sequences are any X of N first m-sequences, where N is an integer greater than 1; or, the X first m-sequences are determined based on an area identifier, where the area identifier includes at least one of the following: a cell identifier, a cell group identifier, a tracking area (TA) identifier, and a RAN notification area identifier; or, the X first m-sequences are determined based on first sequence information.

[0797] In some embodiments, the first sequence information includes at least one of the following: first start information, used to indicate the starting position of the X first m-sequences in the N first m-sequences; first length information, used to indicate the value of X; first end information, used to indicate the ending position of the X first m-sequences in the N first m-sequences; the total number of sequences in the first sequence; the numbers of the X first m-sequences; the number of the WUS sequence in the first sequence; a cyclic shift step; the numbering order of the N first m-sequences; and a first bit map, wherein each bit of the first bit map corresponds one-to-one to the N first m-sequences.

[0798] In some embodiments, the receiving module 1910 is further configured to receive the first sequence information.

[0799] In some embodiments, the X first m-sequences are determined based on the first starting information and the first length information; or, the X first m-sequences are determined based on the first length information and the first end information; or, the X first m-sequences are determined based on the first starting information and the first end information; or, the X first m-sequences are determined based on at least one of the following: the first starting information, the cyclic shift step, the numbering order of the N first m-sequences, and the total number of sequences in the first sequence.

[0800] In some embodiments, the i-th sequence in the first sequence is determined based on at least one of the following: the first starting information, the cyclic shift step, and the value of i; wherein the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

[0801] In some embodiments, the numbering order of the N first m-sequences is agreed upon by a communication protocol, or is indicated by the network device, or is a default order, or is determined by the terminal device.

[0802] In some embodiments, the receiving module 1910 is further configured to receive a numbering order of the N first m-sequences.

[0803] In some embodiments, the numbering order of the N first m-sequences is determined according to the following order: the order of the numbers of the N first m-sequences from small to large; the order of the numbers of the N first m-sequences from large to small; the order of the primitive polynomial coefficients from high power to low power; the order of the primitive polynomial coefficients from low power to high power; the order of the binary numbers of the primitive polynomial coefficients from small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small.

[0804] In some embodiments, the first sequence is generated according to an m-sequence subset, which is a subset of an m-sequence set; wherein the m-sequence set includes a first m-sequence and / or a second m-sequence, and the second m-sequence is obtained by cyclic shifting the first m-sequence.

[0805] In some embodiments, within the m-sequence set, the number of the first m-sequences is determined according to the order of the first m-sequences; within the m-sequence set, the number of the second m-sequences is determined according to at least one of the following: the number of the first m-sequences, the length of the first m-sequences, and the cyclic shift step size.

[0806] In some embodiments, the numbering order of the first 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 the terminal device.

[0807] In some embodiments, the receiving module 1910 is further configured to receive a numbering order of a first m-sequence in the m-sequence set.

[0808] In some embodiments, the numbering order of the first m-sequences in the m-sequence set is determined according to the following order: the order of the numbers of the first m-sequences in the m-sequence set from small to large; the order of the numbers of the first m-sequences in the m-sequence set from large to small; the order of the coefficients of primitive polynomials from high power to low power; the order of the coefficients of primitive polynomials from low power to high power; the order of the binary numbers of the coefficients of primitive polynomials from small to large; and the order of the binary numbers of the coefficients of primitive polynomials from large to small.

[0809] In some embodiments, the numbering order of the second 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 the terminal device.

[0810] In some embodiments, the receiving module 1910 is further configured to receive a numbering order of a second m-sequence in the m-sequence set.

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

[0812] In some embodiments, each second m-sequence in the m-sequence set is arranged after its corresponding first m-sequence in numerical order; or, all second m-sequences in the m-sequence set are arranged after all first m-sequences in the m-sequence set in numerical order.

[0813] I...

Claims

1. A method for transmitting a wake-up signal, characterized in that, the method is executed by a network device, and the method includes: sending a wake-up signal WUS, where the WUS is used to wake up at least one terminal device; wherein, the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence includes at least one of the following: m-sequence; Gold sequence; Walsh sequence.

2. The method according to claim 1, characterized in that, the first sequence is associated with at least one of the following identifiers: cell identifier; cell group identifier; tracking area TA identifier; RAN notification area identifier; UE identifier; UE group identifier.

3. The method according to claim 1 or 2, characterized in that, the first sequence is generated according to a first number of m-sequences; wherein, the first number of m-sequences includes a first m-sequence and / or a second m-sequence, and the second m-sequence is obtained by cyclically shifting the first m-sequence.

4. The method according to claim 3, characterized in that, among the first number of m-sequences, the number of the first m-sequences is X, and the number of the second m-sequences is Y; wherein, X is an integer greater than or equal to 0, Y is an integer greater than or equal to 0, and X and Y are not both equal to 0.

5. The method according to claim 4, characterized in that, the X first m-sequences are X of N first m-sequences, and N is an integer greater than 1.

6. The method according to claim 4 or 5, characterized in that, the X first m-sequences are any X of N first m-sequences, and N is an integer greater than 1; or, the X first m-sequences are determined according to an area identifier, and the area identifier includes at least one of the following: cell identifier, cell group identifier, tracking area TA identifier, RAN notification area identifier; or, the X first m-sequences are determined according to first sequence information.

7. The method according to claim 6, characterized in that, the first sequence information includes at least one of the following: first start information, used to indicate the start position of the X first m-sequences among the N first m-sequences; first length information, used to indicate the value of X; first end information, used to indicate the end position of the X first m-sequences among the N first m-sequences; the total number of sequences in the first sequence; the numbers of the X first m-sequences; the number of the sequence of the WUS in the first sequence; cyclic shift step size; the number order of the N first m-sequences; first bit map, and each bit of the first bit map corresponds to one of the N first m-sequences.

8. The method according to claim 7, characterized in that, The X first m sequences are determined according to the first start information and the first length information; or, the X first m sequences are determined according to the first length information and the first end information; or, the X first m sequences are determined according to the first start information and the first end information; or, the X first m sequences are determined according to at least one of the following: the first start information, the cyclic shift step size, the numbering order of the N first m sequences, the total number of sequences in the first sequence.

9. The method according to claim 6 or 7, wherein, the first sequence information is agreed upon by a communication protocol, and / or indicated by the network device, and / or determined according to rules agreed upon by the communication protocol.

10. The method according to claim 7 or 8, wherein, the i-th sequence in the first sequence is determined according to at least one of the following: the first start information, the cyclic shift step size, the value of i; wherein the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

11. The method according to any one of claims 5 to 10, wherein, the numbering order of the N first m sequences is agreed upon by a communication protocol, or indicated by the network device, or is the default order, or is determined by the terminal device.

12. The method according to claim 11, wherein, the numbering order of the N first m sequences is determined according to one of the following orders: the order of the numbers of the N first m sequences from smallest to largest; the order of the numbers of the N first m sequences from largest to smallest; 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 smallest to largest; the order of the binary numbers of the primitive polynomial coefficients from largest to smallest.

13. The method according to claim 1 or 2, wherein, the first sequence is generated according to an m-sequence subset, and the m-sequence subset is a subset of an m-sequence set; wherein the m-sequence set includes a first m sequence and / or a second m sequence, and the second m sequence is obtained by cyclic shifting the first m sequence.

14. The method according to claim 13, wherein, within the m-sequence set, the number of the first m sequences is determined according to the order of the first m sequences; within the m-sequence set, the number of the second m sequences is determined according to at least one of the following: the number of the first m sequences, the length of the first m sequence, the cyclic shift step size.

15. The method according to claim 13 or 14, wherein, the numbering order of the first m sequences within the m-sequence set is agreed upon by a communication protocol, or indicated by the network device, or is the default order, or is determined by the terminal device.

16. The method according to claim 15, wherein, The numbering order of the first m-sequence in the set of m-sequences is determined according to one of the following orders: the order of the numbers of the first m-sequence in the set of m-sequences from smallest to largest; the order of the numbers of the first m-sequence in the set of m-sequences from largest to smallest; 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 smallest to largest; the order of the binary numbers of the primitive polynomial coefficients from largest to smallest.

17. According to the method described in any one of claims 13 to 16, wherein, the numbering order of the second m-sequence in the set of m-sequences is agreed upon by the communication protocol, or is indicated by the network device, or is the default order, or is determined by the terminal device.

18. According to the method described in claim 17, wherein, the numbering order of the second m-sequence in the set of m-sequences is determined according to one of the following orders: the order of the numbers of the first m-sequence in the set of m-sequences from smallest to largest; the order of the numbers of the first m-sequence in the set of m-sequences from largest to smallest; 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 smallest to largest; the order of the binary numbers of the primitive polynomial coefficients from largest to smallest; the order of the cyclic offsets from smallest to largest; the order of the cyclic offsets from largest to smallest.

19. According to the method described in any one of claims 13 to 18, wherein, each second m-sequence in the set of m-sequences is arranged after its corresponding first m-sequence in the numbering order; or all the second m-sequences in the set of m-sequences are arranged after all the first m-sequences in the set of m-sequences in the numbering order.

20. According to the method described in any one of claims 13 to 19, wherein, the subset of m-sequences is any subset of the set of m-sequences; or the subset of m-sequences is determined according to the area identifier; or the subset of m-sequences is indicated by the network device.

21. According to the method described in any one of claims 1 to 20, wherein, the sequence element numbered n in the sequence of the WUS is determined according to the sequence element numbered n' in the third m-sequence; wherein, the n' is determined according to at least one of the following: the n, the cyclic shift step size, the number of the sequence of the WUS in the first sequence, the first length value; the first length value is the length value of the third m-sequence, and the n is greater than or equal to 0 and less than the first length value.

22. According to the method described in claim 21, wherein, the n' is determined according to the first modulo result; wherein, the first 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 first product; the first product is the product of the cyclic shift step size and the target number, and the target number is the number of the target sequence generating the sequence of the WUS among all the m-sequences generated by the third m-sequence.

23. According to the method described in claim 21 or 22, It is characterized in that the sequence element numbered n in the sequence of WUS 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 n' in the third m sequence; or, the sequence element numbered n in the sequence of WUS is the sequence element numbered n' in the third m sequence.

24. The method according to claim 1 or 2, It is characterized in that the first sequence is generated according to a second quantity of gold sequences; wherein, the second quantity of gold sequences is generated according to at least one pair of preferably selected m sequences.

25. The method according to claim 24, It is characterized in that the second quantity of gold sequences is all or part of the gold sequences in Z gold sequence families, and Z is an integer greater than or equal to 1.

26. The method according to claim 25, It is characterized in that the Z gold sequence families are determined by the terminal device from M gold sequence families, where M is an integer greater than 1; or, the Z gold sequence families are indicated by the network device.

27. The method according to claim 25 or 26, It is characterized in that the Z gold sequence families are any Z of the M gold sequence families, where M is an integer greater than 1; or, the Z gold sequence families are determined according to a region identifier; or, the Z gold sequence families are determined according to second sequence information.

28. The method according to claim 27, It is characterized in that the second sequence information includes at least one of the following: second start information for indicating the start position of the Z gold sequence families in the M gold sequence families; second length information for indicating the value of Z; second end information for indicating the end position of the Z gold sequence families in the M gold sequence families; the total number of sequences in the first sequence; the numbers of the Z gold sequence families; the number of the sequence of WUS in the first sequence; cyclic shift step size; the numbering order of the M gold sequence families; a second bit map, where each bit of the second bit map corresponds one-to-one to the M gold sequence families.

29. The method according to claim 28, It is characterized in that the Z gold sequence families are determined according to the second start information and the second length information; or, the Z gold sequence families are determined according to the second length information and the second end information; or, the Z gold sequence families are determined according to the second start information and the second end information; or, the Z gold sequence families are determined according to at least one of the following: the second start information, the cyclic shift step size, the numbering order of the M gold sequence families, the total number of sequences in the first sequence.

30. The method according to claim 27 or 28 or 29, It is characterized in that the second sequence information is agreed upon by a communication protocol, and / or indicated by the network device, and / or determined according to rules agreed upon by the communication protocol.

31. The method according to claim 28 or 29, wherein, the i-th sequence in the first sequence is determined according to at least one of the following: the second starting information, the cyclic shift step size, and the value of i; wherein the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

32. The method according to any one of claims 26 to 31, wherein, the numbering order of the M gold sequence families is agreed upon by a communication protocol, or indicated by the network device, or is the default order, or is determined by the terminal device.

33. The method according to claim 32, wherein, the numbering order of the M gold sequence families is determined according to one of the following orders: the order of the numbers of the M gold sequence families from smallest to largest; the order of the numbers of the M gold sequence families from largest to smallest; 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 smallest to largest; the order of the binary numbers of the primitive polynomial coefficients from largest to smallest; the order of the numbers of the m-sequence preferred pairs from smallest to largest; the order of the numbers of the m-sequence preferred pairs from largest to smallest; the order of the cyclic offsets from smallest to largest; the order of the cyclic offsets from largest to smallest.

34. The method according to claim 1 or 2, wherein, the first sequence is generated according to a gold sequence subset, and the gold sequence subset is a subset of a gold sequence set; wherein the gold sequence set includes at least one gold sequence family, and one gold sequence family is generated based on a pair of m-sequence preferred pairs.

35. The method according to claim 34, wherein, the number of gold sequence families in the gold sequence set is determined according to at least one of the following: the series r, the cyclic offset, the cyclic shift step size, the length of the m-sequence, and the number of m-sequence preferred pairs.

36. The method according to claim 34 or 35, wherein, the numbering order of the gold sequence families in the gold sequence set is agreed upon by a communication protocol, or indicated by the network device, or is the default order, or is determined by the terminal device.

37. The method according to claim 36, wherein, the numbering order of the gold sequence families in the gold sequence set is determined according to one of the following orders: the order of the numbers of the gold sequence families in the gold sequence set from smallest to largest; the order of the numbers of the gold sequence families in the gold sequence set from largest to smallest; 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 smallest to largest; the order of the binary numbers of the primitive polynomial coefficients from largest to smallest; the order of the numbers of the m-sequence preferred pairs from smallest to largest; the order of the numbers of the m-sequence preferred pairs from largest to smallest; the order of the cyclic offsets from smallest to largest; the order of the cyclic offsets from largest to smallest.

38. The method according to any one of claims 34 to 37, characterized in that, the gold sequence subset is any subset of the gold sequence set; or, the gold sequence subset is determined according to a region identifier; or, the gold sequence subset is indicated by the network device.

39. The method according to any one of claims 25 to 38, characterized in that, the gold sequence family includes a first gold sequence family, the first gold sequence family includes a first gold sequence, the first gold sequence is obtained by modulo-2 addition of a cyclic shift sequence of a fourth m-sequence and a fifth m-sequence, and the fourth m-sequence and the fifth m-sequence form a preferred pair of m-sequences.

40. The method according to any one of claims 25 to 38, characterized in that, the gold sequence family includes a second gold sequence family, the second gold sequence family includes a second gold sequence, the first gold sequence is obtained by modulo-2 addition of a cyclic shift sequence of the fourth m-sequence and a cyclic shift sequence of the fifth m-sequence, and the fourth m-sequence and the fifth m-sequence form a preferred pair of m-sequences.

41. The method according to any one of claims 25 to 38, characterized in that, the gold sequence family includes a third gold sequence family, the third gold sequence family includes a third gold sequence, the third gold sequence 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 fourth m-sequence and a fifth m-sequence, and the fourth m-sequence and the fifth m-sequence form a preferred pair of m-sequences.

42. The method according to any one of claims 1 or 2 or 24 to 41, characterized in that, the sequence element numbered n in the sequence of the WUS is determined according to the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence; wherein, the fourth m-sequence is one of the m-sequences in the preferred pair of m-sequences, and the fifth m-sequence is the other m-sequence in the preferred pair of m-sequences.

43. The method according to claim 42, characterized in that, the sequence element numbered n in the sequence of the WUS is a third product, the third 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 fourth product, the fourth product is the product of the value 2 and the sequence element numbered a in the fourth m-sequence; the second difference is the difference between the value 1 and a fifth product, the fifth product is the product of the value 2 and the sequence element numbered b in the fifth m-sequence.

44. The method according to claim 42, characterized in that, the sequence element numbered n in the sequence of the WUS is the modulo-2 result of the sum of the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence.

45. The method according to any one of claims 1 or 2 or 24 to 41, characterized in that, The WUS includes a first sub-signal and a second sub-signal. The sequence element numbered n in the sequence of the first sub-signal is determined according to the sequence element numbered a in the fourth m-sequence. The sequence element numbered n in the sequence of the second sub-signal is determined according to the sequence element numbered b in the fifth m-sequence. Wherein, the fourth m-sequence is one m-sequence in the preferred pair of m-sequences, and the fifth m-sequence is the other m-sequence in the preferred pair of m-sequences. 1 The sequence element numbered n in the sequence of the first sub-signal is determined according to the sequence element numbered a in the fourth m-sequence. The sequence element numbered n in the sequence of the second sub-signal is determined according to the sequence element numbered b in the fifth m-sequence. 2 The sequence element numbered n in the sequence of the second sub-signal is determined according to the sequence element numbered b in the fifth m-sequence. Wherein, the fourth m-sequence is one m-sequence in the preferred pair of m-sequences, and the fifth m-sequence is the other m-sequence in the preferred pair of m-sequences.

46. The method according to claim 45, characterized in that, 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 2 is the second difference; wherein, the first difference is the difference between the value 1 and the fourth product, and the fourth product is the product of the value 2 and the sequence element numbered a in the fourth m-sequence; the second difference is the difference between the value 1 and the fifth product, and the fifth product is the product of the value 2 and the sequence element numbered b in the fifth m-sequence.

47. The method according to claim 45, wherein, The sequence element numbered n in the sequence of the first sub-signal is the sequence element numbered a in the fourth m-sequence, and the sequence element numbered n 2 in the sequence of the second sub-signal is the sequence element numbered b in the fifth m-sequence.

48. The method according to any one of claims 42 to 47, wherein, The a is determined according to at least one of the following: the n, the parameter m 0 , and a second length value; the b is determined according to at least one of the following: the n, the parameter m 1 , and the second length value; wherein, n is greater than or equal to 0 and less than the second length value, and the second length value is the length value of the fourth m-sequence and the fifth m-sequence.

49. The method according to claim 48, wherein, The a is determined according to a second modulo result, where the second modulo result is the modulo result of a second sum value and the second length value, and the second sum value is the sum of the n and the parameter m 0 ; the b is determined according to a third modulo result, where the third modulo result is the modulo result of a third sum value and the second length value, and the third sum value is the sum of the n and the parameter m 1 sum.

50. The method according to any one of claims 39 to 49, wherein, the number of the fourth 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 fifth m-sequence is agreed by a communication protocol, or indicated by the network device, or determined according to rules agreed by the communication protocol.

51. The method according to any one of claims 24 to 49, wherein, 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.

52. The method according to claim 48 or 49, wherein, The parameter m 0 is determined according to the area identifier, and the parameter m 1 is determined according to the index number of the UE ID; or, the parameter m 0 is determined according to the area identifier, and the parameter m 1 is determined according to the index number of the UE group ID; or, the parameter m 0 is determined according to the area identifier and the index number of the UE ID, and the parameter m 1 is determined according to the index number of the UE ID; or, the parameter m 0 is determined according to the area identifier and the index number of the UE group ID, and the parameter m 1 is determined according to the index number of the UE group ID; or, the parameter m 1 is determined according to the area identifier, and the parameter m 0 is determined according to the index number of the UE ID; or, the parameter m 1 is determined according to the area identifier, and the parameter m 0 is determined according to the index number of the UE group ID; or, the parameter m 1 is determined according to the area identifier and the index number of the UE ID, and the parameter m 0 is determined according to the index number of the UE ID; or, the parameter m 1 is determined according to the area identifier and the index number of the UE group ID, and the parameter m 0 is determined according to the index number of the UE group ID.

53. The method according to any one of claims 1 to 52, wherein, the method further comprises: transmitting at least one of the following information: first sequence information, second sequence information, the number of a subset of m-sequences, the number of a subset of gold-sequences, the number of a preferred pair of m-sequences.

54. The method according to any one of claims 1 to 53, wherein, the total number of sequences in the first sequence is agreed by a communication protocol, or configured by the network device.

55. The method according to any one of claims 1 to 54, wherein, the modulation mode of the WUS includes at least one of the following: OOK modulation; PSK modulation; BPSK modulation; FSK modulation.

56. A method for transmitting a wake-up signal, wherein, the method is executed by a terminal device, and the method comprises: receiving a wake-up signal WUS for waking up at least one terminal device; wherein, the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence includes at least one of the following: m-sequence; Gold sequence; Walsh sequence.

57. The method according to claim 56, wherein, the first sequence is associated with at least one of the following identifiers: cell identifier; cell group identifier; tracking area TA identifier; RAN notification area identifier; UE identifier; UE group identifier.

58. The method according to claim 56 or 57, wherein, the first sequence is generated according to a first number of m-sequences; wherein, the first number of m-sequences includes a first m-sequence and / or a second m-sequence, and the second m-sequence is obtained by circularly shifting the first m-sequence.

59. The method according to claim 58, wherein, in the first number of m-sequences, the number of the first m-sequence is X, and the number of the second m-sequence is Y; wherein, X is an integer greater than or equal to 0, Y is an integer greater than or equal to 0, and X and Y are not both equal to 0.

60. The method according to claim 59, wherein, the X first m-sequences are X of N first m-sequences, and N is an integer greater than 1.

61. The method according to claim 59 or 60, wherein, the X first m-sequences are any X of the N first m-sequences, N being an integer greater than 1; or, the X first m-sequences are determined according to a region identifier, the region identifier including at least one of the following: cell identifier, cell group identifier, tracking area (TA) identifier, RAN notification area identifier; or, the X first m-sequences are determined according to first sequence information.

62. The method according to claim 61, wherein, the first sequence information includes at least one of the following: first start information, used to indicate the start position of the X first m-sequences in the N first m-sequences; first length information, used to indicate the value of X; first end information, used to indicate the end position of the X first m-sequences in the N first m-sequences; the total number of sequences in the first sequence; the numbers of the X first m-sequences; the number of the sequence of the WUS in the first sequence; cyclic shift step size; the numbering order of the N first m-sequences; first bit map, each bit of the first bit map corresponding one-to-one to the N first m-sequences.

63. The method according to claim 62, wherein, the X first m-sequences are determined according to the first start information and the first length information; or, the X first m-sequences are determined according to the first length information and the first end information; or, the X first m-sequences are determined according to the first start information and the first end information; or, the X first m-sequences are determined according to at least one of the following: the first start information, the cyclic shift step size, the numbering order of the N first m-sequences, the total number of sequences in the first sequence.

64. The method according to claim 61 or 62, wherein, the first sequence information is agreed upon by a communication protocol, and / or indicated by a network device, and / or determined by a terminal device according to rules agreed upon by the communication protocol.

65. The method according to claim 62 or 63, wherein, the i-th sequence in the first sequence is determined according to at least one of the following: the first start information, the cyclic shift step size, the value of i; wherein, the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

66. The method according to any one of claims 60 to 65, wherein, the numbering order of the N first m-sequences is agreed upon by a communication protocol, or indicated by a network device, or is a default order, or is determined by the terminal device.

67. The method according to claim 66, wherein, The numbering order of the N first m-sequences is determined according to one of the following orders: the order of the numbers of the N first m-sequences from smallest to largest; the order of the numbers of the N first m-sequences from largest to smallest; 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 smallest to largest; the order of the binary numbers of the primitive polynomial coefficients from largest to smallest.

68. The method according to claim 56 or 57, wherein, the first sequence is generated according to an m-sequence subset, and the m-sequence subset is a subset of an m-sequence set; wherein, the m-sequence set includes a first m-sequence and / or a second m-sequence, and the second m-sequence is obtained by circularly shifting the first m-sequence.

69. The method according to claim 68, wherein, within the m-sequence set, the number of the first m-sequences is determined according to the order of the first m-sequences; within the m-sequence set, the number of the second m-sequences is determined according to at least one of the following: the number of the first m-sequences, the length of the first m-sequences, and the circular shift step.

70. The method according to claim 68 or 69, wherein, the numbering order of the first m-sequences within the m-sequence set is agreed upon by a communication protocol, or indicated by a network device, or is a default order, or is determined by the terminal device.

71. The method according to claim 70, wherein, the numbering order of the first m-sequences within the m-sequence set is determined according to one of the following orders: the order of the numbers of the first m-sequences within the m-sequence set from smallest to largest; the order of the numbers of the first m-sequences within the m-sequence set from largest to smallest; 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 smallest to largest; the order of the binary numbers of the primitive polynomial coefficients from largest to smallest.

72. The method according to any one of claims 68 to 71, wherein, the numbering order of the second m-sequences within the m-sequence set is agreed upon by a communication protocol, or indicated by a network device, or is a default order, or is determined by the terminal device.

73. The method according to claim 72, wherein, the numbering order of the second m-sequences within the m-sequence set is determined according to one of the following orders: the order of the numbers of the first m-sequences within the m-sequence set from smallest to largest; the order of the numbers of the first m-sequences within the m-sequence set from largest to smallest; 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 smallest to largest; the order of the binary numbers of the primitive polynomial coefficients from largest to smallest; the order of the circular offsets from smallest to largest; the order of the circular offsets from largest to smallest.

74. The method according to any one of claims 68 to 73, wherein, Each second m-sequence in the m-sequence set is arranged in order of number after its corresponding first m-sequence; or, all the second m-sequences in the m-sequence set are arranged in order of number after all the first m-sequences in the m-sequence set.

75. The method according to any one of claims 68 to 74, wherein, the m-sequence subset is any subset of the m-sequence set; or, the m-sequence subset is determined according to a region identifier; or, the m-sequence subset is indicated by a network device.

76. The method according to any one of claims 56 to 75, wherein, The sequence element numbered n in the sequence of the WUS is determined according to the sequence element numbered n' in the third m-sequence; wherein, the n' is determined according to at least one of the following: the n, the cyclic shift step size, the number of the sequence of the WUS in the first sequence, the first length value; the first length value is the length value of the third m-sequence, and the n is greater than or equal to 0 and less than the first length value.

77. The method according to claim 76, wherein, the n' is determined according to a first modulo result; wherein, the first 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 first product; the first product is the product of the cyclic shift step size and the target number, and the target number is the number of the target sequence that generates the sequence of the WUS among all the m-sequences generated by the third m-sequence.

78. The method according to claim 76 or 77, wherein, The sequence element numbered n in the sequence of the WUS 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 n' in the third m-sequence; or, the sequence element numbered n in the sequence of the WUS is the sequence element numbered n' in the third m-sequence.

79. The method according to claim 56 or 57, wherein, the first sequence is generated according to a second quantity of gold sequences; wherein, the second quantity of gold sequences is generated according to at least one pair of preferred m-sequence pairs.

80. The method according to claim 58, wherein, the second quantity of gold sequences is all or part of the gold sequences in Z gold sequence families, and Z is an integer greater than or equal to 1.

81. The method according to claim 80, wherein, the Z gold sequence families are determined by the terminal device from M gold sequence families, and M is an integer greater than 1; or, the Z gold sequence families are indicated by a network device.

82. The method according to claim 80 or 81, wherein, the Z gold sequence families are any Z of the M gold sequence families, and M is an integer greater than 1; or, the Z gold sequence families are determined according to a region identifier; or, the Z gold sequence families are determined according to second sequence information.

83. The method according to claim 82, wherein, The second sequence information includes at least one of the following: a second start information for indicating a start position of the Z gold sequence families in the M gold sequence families; a second length information for indicating a value of Z; a second end information for indicating an end position of the Z gold sequence families in the M gold sequence families; a total number of sequences in the first sequence; numbers of the Z gold sequence families; a number of the sequence of the WUS in the first sequence; a cyclic shift step; an order of numbers of the M gold sequence families; a second bit map, where each bit of the second bit map corresponds to one of the M gold sequence families.

84. The method according to claim 83, wherein, the Z gold sequence families are determined according to the second start information and the second length information; or the Z gold sequence families are determined according to the second length information and the second end information; or the Z gold sequence families are determined according to the second start information and the second end information; or the Z gold sequence families are determined according to at least one of the following: the second start information, the cyclic shift step, the order of numbers of the M gold sequence families, the total number of sequences in the first sequence.

85. The method according to claim 82 or 83 or 84, wherein, the second sequence information is agreed by a communication protocol, and / or indicated by a network device, and / or determined by the terminal device according to rules agreed by the communication protocol.

86. The method according to claim 83 or 84, wherein, the i-th sequence in the first sequence is determined according to at least one of the following: the second start information, the cyclic shift step, a value of i; wherein the value of i is greater than or equal to 0 and less than the total number of sequences in the first sequence.

87. The method according to any one of claims 81 to 86, wherein, the order of numbers of the M gold sequence families is agreed by a communication protocol, or indicated by a network device, or is a default order, or is determined by the terminal device.

88. The method according to claim 87, wherein, the order of numbers of the M gold sequence families is determined according to one of the following orders: an order from the smallest number to the largest number of the M gold sequence families; an order from the largest number to the smallest number of the M gold sequence families; an order of primitive polynomial coefficients from the highest power to the lowest power; an order of primitive polynomial coefficients from the lowest power to the highest power; an order of binary numbers of primitive polynomial coefficients from the smallest to the largest; an order of binary numbers of primitive polynomial coefficients from the largest to the smallest; an order from the smallest number to the largest number of numbers of m-sequence preferred pairs; an order from the largest number to the smallest number of numbers of m-sequence preferred pairs; an order from the smallest cyclic offset to the largest cyclic offset; an order from the largest cyclic offset to the smallest cyclic offset.

89. The method according to claim 56 or 57, wherein, The first sequence is generated according to a gold sequence subset, and the gold sequence subset is a subset of a gold sequence set; wherein, the gold sequence set includes at least one gold sequence family, and one gold sequence family is generated based on a pair of preferred m-sequence pairs.

90. The method according to claim 89, wherein, the number of gold sequence families in the gold sequence set is determined according to at least one of the following: the series r, the cyclic offset, the cyclic shift step, the length of the m-sequence, the number of preferred m-sequence pairs.

91. The method according to claim 89 or 90, wherein, the numbering order of the gold sequence families in the gold sequence set 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.

92. The method according to claim 91, wherein, the numbering order of the gold sequence families in the gold sequence set is determined according to one of the following orders: the order of the numbers of the gold sequence families in the gold sequence set from small to large; the order of the numbers of the gold sequence families in the gold sequence set from large to small; 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 small to large; the order of the binary numbers of the primitive polynomial coefficients from large to small; the order of the numbers of the preferred m-sequence pairs from small to large; the order of the numbers of the preferred m-sequence pairs from large to small; the order of the cyclic offsets from small to large; the order of the cyclic offsets from large to small.

93. The method according to any one of claims 89 to 92, wherein, the gold sequence subset is any subset of the gold sequence set; or, the gold sequence subset is determined according to the area identifier; or, the gold sequence subset is indicated by the network device.

94. The method according to any one of claims 80 to 93, wherein, the gold sequence family includes a first gold sequence family, the first gold sequence family includes a first gold sequence, and the first gold sequence is obtained by modulo 2 addition of the cyclic shift sequences of the fourth m-sequence and the fifth m-sequence, and the fourth m-sequence and the fifth m-sequence form a preferred m-sequence pair.

95. The method according to any one of claims 80 to 93, wherein, the gold sequence family includes a second gold sequence family, the second gold sequence family includes a second gold sequence, and the first gold sequence is obtained by modulo 2 addition of the cyclic shift sequence of the fourth m-sequence and the cyclic shift sequence of the fifth m-sequence, and the fourth m-sequence and the fifth m-sequence form a preferred m-sequence pair.

96. The method according to any one of claims 80 to 93, wherein, The gold sequence family includes a third gold sequence family, and the third gold sequence family includes a third gold sequence. The third gold sequence is obtained by circularly shifting a first gold sequence. The first gold sequence is obtained by modulo-2 addition of the circularly shifted sequences of a fourth m-sequence and a fifth m-sequence. The fourth m-sequence and the fifth m-sequence form a preferred pair of m-sequences.

97. The method according to any one of claims 56 or 57 or 79 to 96, wherein, the sequence element numbered n in the sequence of the WUS is determined according to the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence; wherein, the fourth m-sequence is one of the m-sequences in the preferred pair of m-sequences, and the fifth m-sequence is the other m-sequence in the preferred pair of m-sequences.

98. The method according to claim 97, wherein, the sequence element numbered n in the sequence of the WUS is a third product, and the third 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 fourth product, and the fourth product is the product of the value 2 and the sequence element numbered a in the fourth m-sequence; the second difference is the difference between the value 1 and a fifth product, and the fifth product is the product of the value 2 and the sequence element numbered b in the fifth m-sequence.

99. The method according to claim 97, wherein, the sequence element numbered n in the sequence of the WUS is the modulo-2 result of the sum of the sequence element numbered a in the fourth m-sequence and the sequence element numbered b in the fifth m-sequence.

100. The method according to any one of claims 56 or 57 or 79 to 96, wherein, The WUS includes a first sub-signal and a second sub-signal. The sequence element numbered n in the sequence of the first sub-signal is determined according to the sequence element numbered a in the fourth m-sequence. The sequence element numbered n in the sequence of the second sub-signal is determined according to the sequence element numbered b in the fifth m-sequence. Wherein, the fourth m-sequence is one of the m-sequences in the preferred pair of m-sequences, and the fifth m-sequence is the other m-sequence in the preferred pair of m-sequences. 1 The sequence element numbered n in the sequence of the first sub-signal is determined according to the sequence element numbered a in the fourth m-sequence. The sequence element numbered n in the sequence of the second sub-signal is determined according to the sequence element numbered b in the fifth m-sequence. 2 The sequence element numbered n in the sequence of the second sub-signal is determined according to the sequence element numbered b in the fifth m-sequence. Wherein, the fourth m-sequence is one of the m-sequences in the preferred pair of m-sequences, and the fifth m-sequence is the other m-sequence in the preferred pair of m-sequences.

101. The method according to claim 100, 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 2 is the second difference; wherein, the first difference is the difference between the value 1 and the fourth product, and the fourth product is the product of the value 2 and the sequence element numbered a in the fourth m-sequence; the second difference is the difference between the value 1 and the fifth product, and the fifth product is the product of the value 2 and the sequence element numbered b in the fifth m-sequence.

102. The method according to claim 100, wherein, The sequence element numbered n in the sequence of the first sub-signal is the sequence element numbered a in the fourth m-sequence, and the sequence element numbered n in the sequence of the second sub-signal 2 is the sequence element numbered b in the fifth m-sequence.

103. The method according to any one of claims 97 to 102, wherein, The a is determined according to at least one of the following: the n, the parameter m 0 and the second length value; the b is determined according to at least one of the following: the n, the parameter m 1 and the second length value; wherein, n is greater than or equal to 0 and less than the second length value, and the second length value is the length value of the fourth m-sequence and the fifth m-sequence.

104. The method according to claim 103, wherein, The a is determined according to a second modulo result, where the second modulo result is the modulo result of a second sum value and the second length value, and the second sum value is the sum of the n and the parameter m 0 ; the b is determined according to a third modulo result, where the third modulo result is the modulo result of a third sum value and the second length value, and the third sum value is the sum of the n and the parameter m 1 sum.

105. The method according to any one of claims 94 to 104, wherein, the number of the fourth m-sequence is agreed upon by the communication protocol, or indicated by the network device, or determined according to the rules agreed upon by the communication protocol; the number of the fifth m-sequence is agreed upon by the communication protocol, or indicated by the network device, or determined according to the rules agreed upon by the communication protocol.

106. The method according to any one of claims 79 to 104, wherein, the number of the preferred pair of m-sequences 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.

107. The method according to claim 103 or 104, wherein, The parameter m 0 is determined according to the area identifier, the parameter m 1 is determined according to the index number of the UE ID; or, the parameter m 0 is determined according to the area identifier, the parameter m 1 is determined according to the index number of the UE group ID; or, the parameter m 0 is determined according to the area identifier and the index number of the UE ID, the parameter m 1 is determined according to the index number of the UE ID; or, the parameter m 0 is determined according to the area identifier and the index number of the UE group ID, the parameter m 1 is determined according to the index number of the UE group ID; or, the parameter m 1 is determined according to the area identifier, the parameter m 0 is determined according to the index number of the UE ID; or, the parameter m 1 is determined according to the area identifier, the parameter m 0 is determined according to the index number of the UE group ID; or, the parameter m 1 is determined according to the area identifier and the index number of the UE ID, the parameter m 0 is determined according to the index number of the UE ID; or, the parameter m 1 is determined according to the area identifier and the index number of the UE group ID, the parameter m 0 is determined according to the index number of the UE group ID.

108. The method according to any one of claims 56 to 107, wherein, the method further includes: receiving at least one of the following information: first sequence information, second sequence information, the number of the m-sequence subset, the number of the gold sequence subset, the number of the preferred pair of m-sequences.

109. The method according to any one of claims 56 to 108, characterized in that, the total number of sequences in the first sequence is agreed upon by a communication protocol or configured by a network device.

110. The method according to any one of claims 56 to 109, characterized in that, the modulation mode of the WUS includes at least one of the following: OOK modulation; PSK modulation; BPSK modulation; FSK modulation.

111. A transmission device for a wake-up signal, characterized in that, the device includes: a sending module for sending a wake-up signal WUS for waking up at least one terminal device; wherein, the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence includes at least one of the following: m sequence; Gold sequence; Walsh sequence.

112. A transmission device for a wake-up signal, characterized in that, the device includes: a receiving module for receiving a wake-up signal WUS for waking up at least one terminal device; wherein, the WUS is generated according to a first sequence, or the WUS includes the first sequence; the type of the first sequence includes at least one of the following: m sequence; Gold sequence; Walsh sequence.

113. A communication device, characterized in that, 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 used to implement the wake-up signal transmission method according to any one of claims 1 to 55 or any one of claims 56 to 110.

114. A communication device, characterized in that, the communication device includes: a receiver and / or a transmitter; wherein, the communication device is used to implement the wake-up signal transmission method according to any one of claims 56 to 110.

115. A computer-readable storage medium, characterized in that, executable instructions are stored in the readable storage medium, and the executable instructions are loaded and executed by a processor to implement the wake-up signal transmission method according to any one of claims 1 to 55 or any one of claims 56 to 110.

116. A chip, characterized in that, the chip includes a programmable logic circuit or a program, and the chip is used to implement the wake-up signal transmission method according to any one of claims 1 to 55 or any one of claims 56 to 110.

117. A computer program product, characterized in that, the computer program product includes computer instructions, the computer instructions are stored in a computer-readable storage medium, a processor of a computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions so that the computer device executes the wake-up signal transmission method according to any one of claims 1 to 55 or any one of claims 56 to 110.

118. A computer program, characterized in that, The computer program includes computer instructions, and a processor of the computer device executes the computer instructions, so that the computer device executes the method for transmitting a wake-up signal according to any one of claims 1 to 55, or any one of claims 56 to 110.

Images