Wake-up information transmission method and communication apparatus

Abstract

Disclosed in the present application are a wake-up information transmission method and a communication apparatus. The method comprises: receiving a first signal, wherein the first signal is modulated on the basis of a first sequence, the first sequence carries wake-up information and / or bit information, and the bit information is part of the wake-up information. Using the method can improve reliability and resist fading.

Description

Wake-up Information Transmission Method and Communication Device

[0001] This application claims priority to Chinese Patent Application No. 202410980481.0, filed on July 19, 2024, entitled "Wake-up Information Transmission Method and Communication Device", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communications, and in particular to a wake-up information transmission method and communication device. Background Technology

[0003] Wake-up signaling (WRF) technology is an advanced technology in the communications field used to optimize power consumption and improve device responsiveness. As an energy-saving solution, WRF addresses the growing energy consumption issues of smart devices and IoT terminals. It allows devices to remain in sleep mode most of the time, activating only when a specific wake-up signal is received.

[0004] Existing Low Power Wake-Up Systems (LP-WUS) map bit information onto the baseband signal through OOK modulation, thereby enabling the transmitted signal to carry LP-WUS bit information. However, this method of directly carrying bit information via OOK is unreliable and difficult to resist fading. Summary of the Invention

[0005] This application provides a wake-up information transmission method and communication device, which can improve reliability and resist fading.

[0006] In a first aspect, some embodiments of this application provide a wake-up information transmission method. This wake-up information transmission method may include: receiving a first signal, the first signal being modulated based on a first sequence, the first sequence carrying wake-up information and / or bit information, the bit information being a portion of the wake-up information.

[0007] By using the above method, the wake-up information is carried by the first sequence, resulting in a more uniform spectrum for the transmitted wake-up signal and thus combating fading. Furthermore, the ON signal in OOK is modulated using the first sequence, and then OOK modulates the first signal, ensuring that the first signal carries the wake-up information, thereby improving reliability.

[0008] In one possible implementation, the first sequence is generated by cyclically shifting the m-sequence, the cyclic shift length of which is determined based on the number of bits of the wake-up message and / or the number of resource blocks (RBs) and / or the number of bits carrying bit information.

[0009] In one possible implementation, the cyclic shift of the m-sequence is associated with wake-up information and / or bit information.

[0010] In one possible implementation, the first sequence is any one or two sequences in the synchronization signal, or the first sequence is generated based on the sequences in the synchronization signal.

[0011] In one possible implementation, the m-sequence generated after cyclic shifting corresponds one-to-one with the wake-up information and / or bit information.

[0012] In one possible implementation, the synchronization signal is either PSS or SSS.

[0013] In one possible implementation, the first sequence includes multiple root sequences of the ZC sequence, or the first sequence includes N sequences generated based on the root sequences of the ZC sequence, or the first sequence includes the root sequence and the N sequences generated based on the root sequences of the ZC sequence.

[0014] In one possible implementation, the root sequence of the ZC sequence corresponds one-to-one with the wake-up information and / or bit information, or the N sequences generated from the root sequence of the ZC sequence correspond one-to-one with the wake-up information and / or bit information, or the first sequence includes the root sequence and the N sequences generated based on the root sequence of the ZC sequence, which correspond one-to-one with the wake-up information and / or bit information.

[0015] In one possible implementation, the first sequence is a plurality of sequences associated with the access preamble.

[0016] In one possible implementation, multiple sequences associated with the access preamble correspond one-to-one with wake-up information and / or bit information.

[0017] In one possible implementation, the first sequence is a sequence generated based on the Gold sequence and the number of wake-up information bits and / or the number of bits carrying bit information and / or the location of RBs and / or the number of resource elements (REs).

[0018] In one possible implementation, the terminal device includes a master receiver and a low-power wake-up receiver, receiving a first signal, including: receiving the first signal through the low-power wake-up receiver; the method further includes: waking up the wake-up master receiver in the terminal device if the subgroup indicated by the wake-up information includes the terminal device, or the wake-up information indicates the terminal device.

[0019] Secondly, some embodiments of this application provide a wake-up information transmission method. This wake-up information transmission method may include: sending a first signal, the first signal being modulated using a first sequence, the first sequence carrying wake-up information and / or bit information, the bit information being a portion of the wake-up information.

[0020] In one possible implementation, the first sequence is generated by cyclically shifting the m-sequence, the cyclic shift length of which is determined based on the number of bits of the wake-up message and / or the number of RBs and / or the number of bits carrying the bit information.

[0021] In one possible implementation, the cyclic shift of the m-sequence is associated with wake-up information and / or bit information.

[0022] In one possible implementation, the cyclic shift of the m-sequence corresponds one-to-one with the wake-up information and / or bit information.

[0023] In one possible implementation, the first sequence is any one or two sequences in the synchronization signal, or the first sequence is generated based on the sequences in the synchronization signal.

[0024] In one possible implementation, the synchronization signal is either PSS or SSS.

[0025] In one possible implementation, the first sequence includes multiple root sequences of the ZC sequence, or the first sequence includes N sequences generated based on the root sequences of the ZC sequence, or the first sequence includes the root sequence and the N sequences generated based on the root sequences of the ZC sequence.

[0026] In one possible implementation, the root sequence of the ZC sequence corresponds one-to-one with the wake-up information and / or bit information, or the N sequences generated from the root sequence of the ZC sequence correspond one-to-one with the wake-up information and / or bit information, or the first sequence includes the root sequence and the N sequences generated based on the root sequence of the ZC sequence, which correspond one-to-one with the wake-up information and / or bit information.

[0027] In one possible implementation, the first sequence is a plurality of sequences associated with the access preamble.

[0028] In one possible implementation, multiple sequences associated with the access preamble correspond one-to-one with wake-up information and / or bit information.

[0029] In one possible implementation, the first sequence is a sequence generated based on the Gold sequence and the number of wake-up information bits and / or the number of bits carrying bit information and / or the position of RB and / or the number of RE.

[0030] Thirdly, embodiments of this application provide a communication device, including a function / unit for performing the communication method in the first aspect and any possible implementation thereof, or including a function / unit for performing the communication method in the second aspect and any possible implementation thereof.

[0031] Fourthly, embodiments of this application provide a communication device, including a processor, a memory, and a communication interface; the communication interface is used to realize communication between the processor and the memory, the memory stores one or more computer programs, the one or more computer programs include instructions, when the instructions are executed by the processor, causing the communication device to perform the wake-up information transmission method in the first aspect and any possible implementation thereof, or to perform the wake-up information transmission method in the second aspect and any possible implementation thereof.

[0032] Fifthly, embodiments of this application provide a chip applied to a terminal device / network device. The chip system includes a processor and an interface. The interface is used to receive or output signals and transmit them to the processor. The processor is used to implement the wake-up information transmission method in the first aspect and any possible implementation thereof, or to implement the wake-up information transmission method in the second aspect and any possible implementation thereof.

[0033] Sixthly, this application provides a computer-readable storage medium storing a computer program that, when invoked by a computer, causes the computer to execute the wake-up information transmission method in the first aspect and any possible implementation thereof, or to execute the wake-up information transmission method in the second aspect and any possible implementation thereof.

[0034] In a seventh aspect, this application provides a computer program product that, when run on a computer, causes the computer to execute the wake-up information transmission method in the first aspect and any possible implementation thereof, or to execute the wake-up information transmission method in the second aspect and any possible implementation thereof.

[0035] Eighthly, embodiments of this application provide a communication system including a terminal device, a first satellite, and a second satellite, wherein the terminal device, the first satellite, and the second satellite are operating in the communication system.

[0036] Understandably, the beneficial effects that the communication devices, chips, computer-readable storage media, computer program products and communication systems provided above can be referenced to the beneficial effects in the first aspect and any of its possible implementations, which will not be repeated here. Attached Figure Description

[0037] Figure 1A is a schematic diagram of the hardware architecture of a terminal device provided in an embodiment of this application;

[0038] Figure 1B is a schematic diagram of an OOK modulation provided in an embodiment of this application;

[0039] Figure 1C is a schematic diagram of another OOK modulation provided in an embodiment of this application;

[0040] Figure 1D is a schematic diagram of another OOK modulation provided in an embodiment of this application;

[0041] Figure 1E is a schematic diagram of another OOK modulation provided in an embodiment of this application;

[0042] Figure 2A is a schematic diagram of adjusting the OOK ON symbol using a sequence according to an embodiment of this application;

[0043] Figure 2B is a schematic diagram of another method for adjusting the OOK ON symbol using a sequence, provided in an embodiment of this application.

[0044] Figure 3 is a schematic diagram of the architecture of a communication system provided in an embodiment of this application;

[0045] Figure 4 is a flowchart illustrating a wake-up information transmission method provided in an embodiment of this application;

[0046] Figure 5A is a schematic diagram of an OOK ON symbol carrying sequence provided in an embodiment of this application;

[0047] Figure 5B is a schematic diagram of another OOK ON symbol carrying sequence provided in an embodiment of this application;

[0048] Figure 5C is a schematic diagram of another OOK ON symbol carrying sequence provided in an embodiment of this application;

[0049] Figure 6A is a schematic diagram of a cyclic shift of an m-sequence provided in an embodiment of this application;

[0050] Figure 6B is a schematic diagram of frequency domain division provided in an embodiment of this application;

[0051] Figure 7 is a schematic diagram of the structure of a communication device provided in an embodiment of this application;

[0052] Figure 8 is a schematic diagram of another communication device provided in an embodiment of this application;

[0053] Figure 9 is a schematic diagram of the structure of a chip provided in an embodiment of this application. Detailed Implementation

[0054] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. In the description of the embodiments of this application, unless otherwise stated, " / " means "or," for example, A / B can mean A or B; "and / or" in the text is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone. Furthermore, in the description of the embodiments of this application, "multiple" refers to two or more than two.

[0055] It should be understood that the terms "first," "second," etc., in the specification, claims, and drawings of this application are used to distinguish different objects, not to describe a specific order. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to imply non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the listed steps or units, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to these processes, methods, products, or apparatuses.

[0056] In this application, the reference to "embodiment" means that a specific feature, structure, or characteristic described in connection with an embodiment may be included in at least one embodiment of this application. The appearance of this phrase in various places throughout the specification does not necessarily refer to the same embodiment, nor is it a mutually exclusive, independent, or alternative embodiment. It will be explicitly and implicitly understood by those skilled in the art that the embodiments described in this application can be combined with other embodiments.

[0057] Paging, discontinuous reception (DRX) cycles, and paging occasions (POs) are all related to how network devices, when in an idle state, can notify a terminal device via paging when the network device needs to send service data to or report service data to the terminal device. This means the network device instructs the terminal device to switch from idle to connected state via a paging message. Upon receiving a paging message, the terminal device can enter connected state as instructed to send or receive service data.

[0058] Typically, idle terminal devices periodically wake up to listen for paging messages, checking for any paging messages indicating they should enter connected mode. This wake-up period is called the DRX cycle. The DRX cycle can be communicated to the terminal device by the network device via system messages. The location where the terminal device wakes up is called the paging occasion (PO). The terminal device can listen to the PDCCH at the PO to listen for paging messages.

[0059] The PO indicates the starting position of the terminal device listening to the PDCCH. The terminal device can determine the PDCCH search space based on the PO and detect the PDCCH in a blind detection manner within the PDCCH search space.

[0060] If the terminal device detects the PDCCH, it can receive the physical downlink shared channel (PDSCH) based on the indication information carried on the detected PDCCH. The PDSCH carries a paging message.

[0061] The probability of paging a UE is generally very low. This means that most POs (Points of Purchase) may be empty, meaning the network device does not send the corresponding PDCCH at the PO. However, the terminal still needs to listen for the PDCCH at each PO because it only knows whether the network device has sent the PDCCH after the blind detection is complete. This wastes the terminal's power consumption. To save terminal power consumption, a wake-up signal is introduced; the network device uses WUS (Wake-up Signal) to indicate whether the terminal needs to wake up to detect the PDCCH at the PO.

[0062] However, using the WUS signal to indicate whether the terminal needs to wake up and detect the PDCCH at the PO still cannot meet the needs of some terminals with high standby time requirements (such as IoT terminals). Therefore, based on WUS, the LP-WUS signal was introduced, and a low-power wake-up receiver was introduced to process the wake-up signal, thereby further reducing the power consumption of the terminal.

[0063] I. Low-power wake-up receiver

[0064] For wearable devices and IoT terminals, power consumption is crucial. Low-power wake-up receivers and wake-up signal technologies can achieve microwatt-level standby power consumption, significantly improving the battery life of terminal devices, and are widely applicable to smart wearable devices, IoT devices, smartphones, and other terminal types.

[0065] 5G terminal devices, based on existing communication units, introduce a low-power wake-up receiver to handle wake-up signals, which can reduce power consumption while maintaining low latency. The core principle of the low-power wake-up receiver is to remain in sleep mode most of the time, activating only when a specific wake-up signal is detected. This operating mode can significantly reduce unnecessary energy consumption, thereby extending the device's battery life. For ease of description, the terminal device can be divided into main communication and the low-power wake-up receiver, as shown in Figure 1A. When there is no service demand, the terminal device turns off main communication and only turns on the low-power wake-up receiver; when the network device needs to communicate with the terminal device, it can send a low-power wake-up signal. After successfully detecting the wake-up signal, the terminal device's low-power wake-up receiver triggers the main communication to open, establishing a communication connection with the network to complete service transmission and reception.

[0066] Low-power wake-up receivers involve two concepts: Low-Power Wake-Up Radio (LP-WUR) and Low-Power Wake-Up System (LP-WUS). LP-WUR focuses primarily on the low-power wake-up functionality of the wireless receiver, while LP-WUS includes more processing and control functions.

[0067] II. On / off switch control OOK

[0068] Amplitude Shift Keying (ASK) is a modulation method that represents digital signals by changing the amplitude of a carrier signal. In wireless communication, ASK transmits information by controlling the amplitude variation of the carrier signal. For example, in binary ASK, a larger amplitude can represent the digit "1", while a smaller amplitude or no signal represents the digit "0". OOK is a special case of ASK modulation; if one amplitude is 0 and the other is not zero, it is OOK. Binary on / off keying, also known as binary service keying 2ASK, uses a unipolar non-return-to-zero code sequence to control the on and off of a sinusoidal carrier.

[0069] As shown in Figure 1B, Vm(t) is the digital signal to be transmitted, Acos(2πfct) is the unmodulated carrier wave (baseband signal), and VAM(t) is the carrier signal modulated by OOK. In other words, the digital signal to be transmitted is converted into a communication signal by OOK modulation (the process of shifting the spectrum of the baseband signal to the radio frequency carrier).

[0070] This modulation can also map bit information to a baseband signal. In other words, through OOK modulation, bit information can be mapped into a baseband signal. As shown in Figure 1B, VAM(t) can be understood as mapping the bit information of Vm(t) into a baseband signal. After the baseband signal is modulated by OOK, the resulting VAM(t) contains the following bit information: 1100111010 (the bit information corresponding to Vm(t)).

[0071] The role of OOK has been introduced above. Below, we further describe two waveform generation methods based on OOK: as shown in Figures 1C and 1D. Figure 1C shows the OOK-based waveform generation method in the frequency domain, and Figure 1D shows the OOK-based waveform generation method in the time domain. However, to achieve a flatter signal spectrum during transmission, both methods in Figures 1C and 1D require the introduction of a superposition sequence to modulate the signal and generate the final transmitted signal. There are two modulation methods: Method 1 (as shown in Method 1 of Figure 1E): In the time domain, the superposition sequence is multiplied by the initial signal bit or its sampled signal; Method 2 (as shown in Method 2 of Figure 1E): In the frequency domain, the superposition sequence is modulated onto the OFDM subcarrier for transmission.

[0072] III. Bit Information of Low-Power Wake-up Signal

[0073] Currently, LP-WUS can indicate subgroups using a bitmap. Each subgroup includes one or more terminal devices. For example, there are three subgroups: subgroup A includes UE0, subgroup B includes UE1 and UE2, and subgroup C includes UE3. The LP-WUS information uses 3 bits.

[0074] If the LP-WUS information is [0 1 0], it instructs subgroup B, i.e., the network device, to wake up UE1 and UE2. UE0 in subgroup A and UE3 in subgroup C will also receive this LP-WUS, but since this LP-WUS does not instruct subgroups A and C, UE0 and UE3 will not be woken up. If the LP-WUS information is [0 1 1], it instructs subgroups B and C, i.e., the network device, to wake up UE1, UE2, and UE3. UE0 in subgroup A will also receive this LP-WUS, but since this LP-WUS does not instruct subgroup A, UE0 will not be woken up.

[0075] The Low Power Wake-up Signal (LP-WUS) can indicate a subgroup using codepoints. For example, consider three subgroups: Subgroup A includes UE0, Subgroup B includes UE1 and UE2, and Subgroup C includes UE3. The LP-WUS uses 3 bits of information.

[0076] If the LP-WUS information is [0 1], then subgroup B is indicated; if the LP-WUS information is [1 0], then subgroup C is indicated.

[0077] The following is a further introduction to how LP-WUS carries bit information:

[0078] As shown in Figure 2A, in each OFDM symbol, 2 bits can be carried through the OOK ON / OFF mode, and 4 bits can be carried through the superposition sequence of two OOK ON symbols. Assuming N bits of information, M=4 is used for Manchester-coded OOK-4 modulation, and a superposition sequence is selected from the four candidate superposition sequences on each OOK ON symbol. In each OFDM symbol, 2 bits can be transmitted through the OOK ON / OFF mode, and 4 bits can be transmitted through the superposition sequence of two OOK ON symbols. To transmit all N bits of information, an OFDM-based receiver requires an N / 6 OFDM symbol unit. In the unit of N / 6 OFDM symbols, all N information bits can be divided into two parts: bit block 1 and bit block 2. Bit block 1 (N / 6 * 2 = N / 3 bits) is modulated by the ON / OFF mode of N / 6 OFDM symbols, and bit block 2 (N / 6 * 4 = 2N / 3 bits) is modulated by the superposition sequence of OOK symbols in N / 6 OFDM symbols.

[0079] As shown in Figure 2B, in each OFDM symbol, the superimposed sequence on two OOK ON symbols can carry 4 bits, where assuming N bits of information, M=4 is used for Manchester-coded OOK-4 modulation, and a superimposed sequence is selected from 4 candidate superimposed sequences on each OOK ON symbol. Since the bit information bits are mapped to the superimposed OFDM sequence, in this case, the OFDM-based receiver can only obtain information from the superimposed sequence. To transmit all N bits of LP-WUS information, the OFDM-based receiver requires N / 4 OFDM symbol units.

[0080] The following describes the communication system involved in the embodiments of this application.

[0081] The method provided in this application can be applied to various communication systems, such as Internet of Things (IoT) systems, narrowband Internet of Things (NB-IoT) systems, long term evolution (LTE) systems, 5th generation (5G) communication systems, new radio (NR) systems, and new communication systems emerging in future communication development. IoT networks may include, but are not limited to, vehicle-to-everything (V2X) networks. Communication methods in V2X systems can be collectively referred to as vehicle-to-everything (V2X), where X can represent anything. For example, V2X may include: vehicle-to-vehicle (V2V) communication, vehicle-to-infrastructure (V2I) communication, vehicle-to-pedestrian (V2P) communication, or vehicle-to-network (V2N) communication, etc. In Figure 3 below, terminal devices (such as terminal device 3) can communicate with each other using device-to-device (D2D), machine-to-machine (M2M), or V2X technologies. The method provided in this application embodiment can also be applied to non-terrestrial network (NTN) communication (also known as non-terrestrial network communication).

[0082] The method provided in this application can be applied to wireless local area network (WLAN) systems, such as Wi-Fi. The method provided in this application can also be applied to the Institute of Electrical and Electronics Engineers (IEEE) 802.11 series protocols, such as the 802.11be protocol, the 802.11bn protocol, or next-generation protocols of the 802.11bn protocol, etc., and will not be listed individually.

[0083] The method provided in this application can be applied between two entities in a communication system, such as one entity sending information to or receiving information sent by the other entity. In a wireless communication system, communication devices are included, and these devices can communicate wirelessly using air interface resources. Air interface resources may include at least one of time-domain resources, frequency-domain resources, code resources, and spatial resources; this application does not limit this. For example, the aforementioned two entities may include a network device and a terminal device, or may include a chip that can be placed in a network device and a chip that can be placed in a terminal device, etc. Of course, as standards advance, other types of entities may emerge subsequently; this application does not limit this.

[0084] Figure 3 is a schematic diagram of the architecture of a communication system provided in an embodiment of this application. As shown in Figure 3, the communication system may include at least one network device and at least one terminal device, such as terminal device 1 to terminal device 4 in Figure 3. The terminal device and the network device can communicate via an air interface Uu link or via an NTN link, etc. The form of the terminal device shown in Figure 3 is only an example. In a specific implementation, the terminal device may also include IoT devices or IoT terminals in the Internet of Things (IoT). This application embodiment does not limit the specific form of the terminal device when it is applied to the IoT or the Internet.

[0085] Figure 3 exemplarily illustrates a network device and multiple terminal devices. In specific implementations, the communication system may include a greater number of network devices, and the coverage area of ​​each network device may include a greater or lesser number of terminal devices. This application embodiment does not limit this. The architecture shown in Figure 3 is merely an example and does not impose limitations on the network architecture applicable to this application. Any network architecture that allows any network-side device in a cellular network to communicate with or sense other devices is applicable to this application.

[0086] The following provides a detailed description of terminal equipment and network equipment.

[0087] A terminal device is a device with wireless transceiver capabilities. It can communicate with access network equipment (or access devices, or network devices as described below) in a radio access network (RAN). Terminal devices can also be referred to as user equipment (UE), access terminal, terminal, subscriber unit, user station, mobile station, remote station, remote terminal, mobile device, user terminal, user agent, or user device, etc. In one possible implementation, the terminal device can be deployed on land, including indoors or outdoors, handheld or vehicle-mounted; or it can be deployed on water, including ships; or it can be deployed in the air, such as on airplanes, balloons, or satellites. In another possible implementation, the terminal device can be a handheld device with wireless communication capabilities, vehicle-mounted device, wearable device, sensor, terminal in the Internet of Things (IoT), terminal in the Internet of Vehicles (IoV), drone, or any form of terminal device in a 5G network or future network; this application does not limit this. In another possible implementation, the terminal device can also be a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, a wireless terminal in industrial control, a wireless terminal in autonomous driving, a wireless terminal in telemedicine, a wireless terminal in a smart grid, a wireless terminal in a smart city, or a wireless terminal in a smart home, etc.

[0088] In this application embodiment, the device for implementing the functions of the terminal device can be the terminal device itself; it can also be a device capable of supporting the terminal device in implementing the functions, such as a chip system. The device can be installed in the terminal device or used in conjunction with the terminal device. In this application embodiment, the chip system can be composed of chips or can include chips and other discrete devices. For ease of description, when examples are mentioned below, the technical solutions provided in this application embodiment are described using the UE as an example to illustrate the device for implementing the functions of the terminal device.

[0089] A network device can be a device deployed in a radio access network to provide wireless communication services to terminal devices. This network device can also be called an access network device, access equipment, or RAN device, etc. For example, a network device can be a next-generation node B (gNB), a next-generation evolved node B (ng-eNB), or a network device in 6G communication, etc. A network device can be any device with wireless transceiver capabilities, including but not limited to the base stations mentioned above (including base stations deployed on satellites). This network device can also be a device with base station functionality in 6G. As an example, this network device can be an access node, wireless relay node, or wireless backhaul node in a wireless-fidelity (Wi-Fi) system. As another example, this network device can be a wireless controller in a cloud radio access network (CRAN) scenario. As yet another example, this network device can be a wearable device or vehicle-mounted device capable of providing wireless communication services. As yet another example, this network device can also be a small cell, a transmission reception point (TRP) (or a transmission point), etc. In systems using different wireless access technologies, the names of devices with network equipment functions may vary, and these will not be listed one by one in the embodiments of this application.

[0090] Network devices can be fixed or mobile. For example, a helicopter or drone can be configured to act as a mobile network device, and one or more cells can move according to the location of the mobile network device. In other examples, a helicopter or drone can be configured to be used as a device to communicate with another network device.

[0091] In this application embodiment, the device for implementing the function of the network device can be the network device itself; it can also be a device capable of supporting the network device in implementing the function, such as a chip system. The device can be installed in the network device or used in conjunction with the network device. For ease of description, when specific examples are mentioned below, the technical solution provided in this application embodiment will be described using a base station as an example.

[0092] The methods involved in this application are described below.

[0093] Figure 4 is a flowchart illustrating a wake-up information transmission method provided in an embodiment of this application. As shown in Figure 4, the method includes:

[0094] 401. The network device sends a first signal to the terminal device. The first signal is modulated based on a first sequence, which carries wake-up information and / or bit information, wherein the bit information is a portion of the wake-up information. Accordingly, the terminal device receives the first signal.

[0095] Optionally, the wake-up information is used to indicate the terminal device to be woken up.

[0096] Optionally, the wake-up information is used to indicate a subgroup to be woken up, which includes one or more terminal devices. The subgroup can be woken up by multiple different wake-up messages. For example, the wake-up message [1 0 0 0] indicates subgroup A.

[0097] Optionally, the first sequence can be a sequence that directly indicates the subgroup / terminal device, or the first sequence can be a sequence that maps the subgroup / terminal device. For example, the first sequence can be [1 0 0 0] to indicate subgroup A; or the first sequence can be a sequence that maps [1 0 0 0].

[0098] Optionally, the first sequence can be one or more. The wake-up information can be carried by one first sequence, or the wake-up information can be carried by multiple first sequences, that is, a first sequence carries part of the bit information of the wake-up information. In other words, the wake-up information carried in the first sequence can be: the first sequence carries the complete wake-up information, or the wake-up information is carried by multiple first sequences.

[0099] Optionally, the first signal may be modulated based on one or more first sequences.

[0100] Optionally, the first signal can be modulated based on OOK, which in turn is modulated based on one or more first sequences. If the OOK is modulated based on one first sequence, the first sequence carries the complete wake-up information; if the OOK is modulated based on multiple first sequences, each first sequence carries a portion of the wake-up information in the first sequence.

[0101] For example, as shown in Figure 5A, the portion marked 501 in Figure 5A represents the complete wake-up information, which is 8 bits in length. This wake-up information can be carried in a first sequence, which is on the ON symbol (high level) of OOK. That is, the first sequence on the ON symbol includes the complete wake-up information.

[0102] Optionally, Figure 5A is only an example. The first sequence can also be carried repeatedly on the empty ON symbol in Figure 5A, for example, the first sequence can also be carried on the second ON symbol.

[0103] For example, or as shown in Figures 5B and 5C, the wake-up information is split into four parts, each carried by a first sequence, including a portion of the wake-up information's bit information on an ON symbol. For instance, the wake-up information marked 502 in Figure 5B ([0 1 1 1 0 1 0 1]) is split into four parts: [0 1], [1 1], [0 1], and [0 1]. These four parts correspond to four first sequences, with the first sequence corresponding to [0 1] on the first ON symbol in OOK, the first sequence corresponding to [1 1] on the second ON symbol in OOK, and so on.

[0104] There are two scenarios for this method of splitting wake-up information:

[0105] Optionally, the first sequence is carried on I ON symbols of OOK, where I is the number of bits of wake-up information / 4.

[0106] For example, as shown in Figure 5B, the bit information marked 502 in Figure 5B is the wake-up information, which has 8 bits. Each high level in Figure 5B corresponds to an ON of OOK; each low level corresponds to an OFF of OOK. Each ON of OOK can carry 2 bits of information, so in this method, only two symbols are needed to carry 8 bits of information 501.

[0107] Optionally, the first sequence is carried on J ON symbols of OOK, where J is the number of bits of wake-up information / 2.

[0108] For example, as shown in Figure 5C, the bit information marked 503 in Figure 5C is the wake-up information, which has 8 bits. Each high level in Figure 5C corresponds to one ON of OOK; each low level corresponds to one OFF of OOK. The two ONs in this OOK can carry 2 bits of information, so in this method, 4 symbols are needed to carry the 8 bits of information 501.

[0109] In the two examples above (Figures 5B and 5C), each first sequence carries a portion of the wake-up information, and the complete wake-up information is carried through multiple first sequences. In the example of Figure 5B, the terminal device receives the wake-up information in two symbols; in the example of Figure 5C, the terminal device receives the wake-up information in four symbols. These symbols are OFDM symbols.

[0110] Optionally, in addition to the transmission methods described above, the first sequence can also be transmitted separately in the time domain. That is, the first part of the first sequence is transmitted the first time, the second part of the first sequence is transmitted the second time, and so on, until the complete first sequence is transmitted. This first sequence can carry the complete wake-up information or only a portion of the wake-up information.

[0111] Optionally, the first signal is used to wake up the terminal device. Since the first signal uses OOK modulation, and OOK is modulated using one or more first sequences in the manner described above, it can be understood that the first signal carries wake-up information. The terminal device indicated by the wake-up information carried by the first signal wakes up after detecting the first signal.

[0112] Optionally, the first signal is used to indicate whether the terminal device needs to be woken up at the PO to receive and detect the PDCCH. Typically, the network device can send this first signal before the PO when it needs to page the terminal device or when system messages change.

[0113] Optionally, the first signal may also have other specific functions, such as the terminal device using the wake-up signal to achieve downlink synchronization, cell confirmation, and sending downlink data, etc., which are not limited in this application.

[0114] Optionally, the first signal can be an LP-WUS signal.

[0115] Optionally, the wake-up information can be in the form of a bitmap or a codepoint, as described in the section on bit information of low-power wake-up signals above. This wake-up information can also be referred to as the bit information of LP-WUS; for ease of description, it will be referred to as wake-up information below.

[0116] Optionally, the network device sends a first signal to the terminal device, specifically: the network device sends a first signal to the terminal device for the same PO; correspondingly, the terminal device receives the first signal sent by the network device for the same PO. The first signal sent by the network device is specific to the PO; that is, the network device will send the same first signal to terminal devices with the same PO.

[0117] For example, consider the following three subgroups: Subgroup A (Terminal Device 1, Terminal Device 2), Subgroup B (Terminal Device 3), and Subgroup C (Terminal Device 4, Terminal Device 5). Assume the network device needs to wake up Terminal Device 4 and Terminal Device 5. The network device sends a first signal before the Point of Activation (PO) (the wake-up information of this first signal indicates Subgroup C). For the five terminal devices in these three subgroups, all detect the first signal before the PO. If all five terminal devices detect the first signal, they will determine whether to wake up based on the bit information of the first signal. Since the bit information of the first signal indicates Subgroup C, only Terminal Device 4 and Terminal Device 5 will wake up after detecting the first signal. Optionally, Terminal Device 1, Terminal Device 2, and Terminal Device 3 may not respond to the first signal.

[0118] Optionally, before receiving the first signal, the terminal device may be in an idle / inactive state. Optionally, the terminal device may also be in a connected state.

[0119] Optionally, the first sequence can also be used to modulate LPSS, or the first signal can be LPSS.

[0120] Optionally, the terminal device is pre-configured with sequence information related to the first signal, so that after receiving the first signal, the terminal device can determine the wake-up information carried by the first signal and decide whether to wake up based on the wake-up information.

[0121] Furthermore, the sequence information related to the first signal can specifically be information about a first sequence, which may include formulas, algorithms, and related parameters. This information about the first sequence enables the terminal device to demodulate the bit information (wake-up information) of the first signal from the first signal, thereby allowing the terminal device to determine whether it is awake. For example, based on the information about the first sequence, the terminal device determines [0 1 0] (the bit information of LP-WUS) from the first sequence.

[0122] Furthermore, the terminal device is pre-configured with the group number of the subgroup to which it belongs. For example, if the terminal device is configured to belong to subgroup A, and the first bit in the bitmap is 1, it indicates that the terminal device in subgroup A is to be woken up. Assuming the wake-up information is [1 0 0], after the terminal device determines this wake-up information, it determines that the subgroup to which the terminal device belongs is subgroup A based on the group number of the subgroup it belongs to, and the wake-up information [1 0 0] indicates that the terminal device in subgroup A is to be woken up, then the terminal device wakes up.

[0123] Optionally, a terminal device may belong to only one subgroup, meaning that the terminal devices included in the subgroup are not the same as those included in any other subgroup. This grouping method can also be called orthogonal grouping, where the terminals in any two subgroups are different.

[0124] Optionally, a terminal device can belong to multiple subgroups, meaning that two subgroups can also include one or more of the same terminal devices. This will not be elaborated upon here. This grouping method can also be called non-orthogonal grouping.

[0125] The above only introduced how to carry the first sequence in the OOK (Out of Memory) sequence. The following section introduces how to carry wake-up information in the first sequence, that is, how network devices ensure that the generated first sequence contains wake-up information. Five different methods for generating the first sequence are described below:

[0126] Method 1: Based on M-sequence

[0127] Case 1: The first sequence is generated by cyclically shifting the m sequence.

[0128] In one possible embodiment, for 11RBs (the number of RBs required for the wake-up message), a 127-length m-sequence is used, the first sequence being generated by cyclically shifting a 127-length m-sequence.

[0129] For example, as shown in Figure 6A (0 in Figure 6A can also be represented as -1, but for ease of description, this application uses 0 as an example), the sequence marked 601 in Figure 6A is the original m-sequence 601, with a step size of 31 (31 bits shifted together). The original m-sequence 601 is shifted once, that is, the first 31 bits [0 1 1 0...0 1 0] in the original m-sequence 601 are shifted to obtain the shifted m-sequence 602. The wake-up information corresponding to the shifted m-sequence 602 is [0 1]. That is, if the shifted m-sequence 602 is used as the first sequence to modulate the first signal, and then the network device sends the first signal to the terminal device, after the terminal device receives and demodulates the first signal, it can obtain the wake-up information. Then, based on the wake-up subgroup indicated by [0 1], the terminal device determines whether the terminal device is awake (determines whether the terminal device is in the subgroup indicated by [0 1]).

[0130] Alternatively, the original m-sequence 601 can be shifted twice, that is, the first 62 bits [0 1 1 0...0 1 0] and [0 1 0 1 0...0 0] in the original m-sequence 601 can be shifted to obtain the shifted m-sequence 603. The wake-up information corresponding to the shifted m-sequence 603 is [1 0]. That is, if the shifted m-sequence 603 is used as the first sequence to modulate the first signal, and then the network device sends the first signal to the terminal device, after the terminal device receives and demodulates the first signal, it can obtain the wake-up information. Then, based on the wake-up subgroup indicated by [1 0], the terminal device determines whether the terminal device is awake (determines whether the terminal device is in the subgroup indicated by [1 0]).

[0131] Optionally, the step size (length of the cyclic shift) mentioned above can be determined based on the number of bits of wake-up information carried. For example, if the first sequence needs to carry 2 bits of information (the number of bits of wake-up information is 2), then the length of the cyclic shift is floor(127 / 4) = 31, where floor represents rounding down. Alternatively, the length of the cyclic shift is ceil(127 / 4) = 32, where ceil represents rounding up.

[0132] Optionally, the cyclic shift of the m-sequence is related to the wake-up information and / or bit information. This cyclic shift, also known as the shift number, is related to the number of cyclic shifts in the m-sequence.

[0133] Optionally, the step size mentioned above can also be determined based on the number of bits of the carried bit information. This bit information is a portion of the wake-up information; for example, if the wake-up information is [1 0 0 1 1 0] (6 bits), this bit information is [1 0] (2 bits). See the descriptions of Figures 5A, 5B, and 5C above for details.

[0134] Optionally, the first sequence generated based on the m-sequence satisfies the following formula:

[0135] Where, d overlaid (m) is the first sequence. The step size is represented by ceil, which can also be replaced by floor. N is the number of bits for the wake-up information, and INDEX is the number of shifts, which means how many shifts are performed (or INDEX represents the bit information carried). Referring to the example in Figure 6A above, for the shifted m sequence 602, one shift was performed, and INDEX is 1. For the shifted m sequence 603, two shifts were performed, and INDEX is 2.

[0136] Optionally, INDEX is associated with the subgroup that requires wake-up information indication (in this case, the first sequence carries complete wake-up information). For example, assume N is 2. If the subgroup that needs indication is subgroup A ([0 0] corresponds to subgroup A), then INDEX is 0, which means that the m-sequence has not been cyclically shifted. This m-sequence can be the m-sequence marked 601 in Figure 6A.

[0137] Alternatively, if the subgroup to be indicated is subgroup B ([0 1] corresponds to subgroup B), then INDEX is 1, which means the m-sequence undergoes one cyclic shift. This m-sequence can be the m-sequence marked 602 in Figure 6A. Alternatively, if the subgroup to be indicated is subgroup C ([1 0] corresponds to subgroup C), then INDEX is 2, which means the m-sequence undergoes two cyclic shifts. This m-sequence can be the m-sequence marked 603 in Figure 6A.

[0138] Optionally, in this embodiment, the wake-up information represented by the first sequence (e.g., m-sequence 602 in Figure 6A) can be in the form of a bitmap, a codepoint, or other forms, and this application does not limit it in this regard.

[0139] For example, if it is in bitmap form, suppose there are the following subgroups: subgroup A, subgroup B, subgroup C, and subgroup D. If the terminal device demodulates the first signal and the wake-up information carried by the first signal is [1 0 0 0], then it indicates subgroup A. If the wake-up information carried by the first signal is [0 1 0 0], then it indicates subgroup B, and so on.

[0140] For example, if it is in the form of a codepoint, suppose there are the following subgroups: subgroup A, subgroup B, subgroup C, and subgroup D. If the terminal device demodulates the first signal and the wake-up information carried by the first signal is [0 0], then it indicates subgroup A. If the wake-up information carried by the first signal is [0 1], then it indicates subgroup B, and so on.

[0141] Optionally, the above description is based on the first sequence carrying complete wake-up information; the same applies to partial bit information within the wake-up information carried in the first sequence. This application will not elaborate further on this.

[0142] Case 2: The first sequence is the product of two m sequences.

[0143] In one possible embodiment, for 11RB, two 127-length m-sequences are cyclically shifted to generate two sequences, and then the two cyclically shifted m-sequences are multiplied together to obtain the first sequence. The number of bits N of the wake-up information is divided into two parts, N1 and N2. N1 + N2 = N.

[0144] For example, taking the wake-up signal as a bitmap and the first sequence carrying the complete wake-up signal as an example, the wake-up information is [1 0 0 1 0 1] (6 bits), which can be divided into two parts: [1 0] (2 bits) and [0 1 0 1] (4 bits). Alternatively, it can be divided into two parts: [1 0 0] (3 bits) and [1 0 1] (3 bits). This application does not restrict how it divides the signal.

[0145] For example, taking the wake-up signal as a bitmap and the first sequence carrying part of the wake-up signal's bit information as an example, the wake-up information is [1 0 0 1 0 1 0 1] (the number of bits in the wake-up information is 8). The first sequence A needs to carry part of the wake-up information's bit information: [1 0 0 1], and the first sequence B needs to carry another part of the wake-up information's bit information: [0 1 0 1]. [1 0 0 1] is divided into two parts: [1 0] (the number of bits is 2) and [0 1] (the number of bits is 2).

[0146] Optionally, the second sequence is generated based on N1 using Formula 1 above, and the third sequence is generated based on N2 using Formula 1 above. The second and third sequences are then multiplied to obtain the first sequence.

[0147] In one possible embodiment, the generation of the first sequence based on two m sequences satisfies the following formula:

[0148] The meanings of the parameters in Formula 2 can be found in the explanation in Formula 1 above. In Formula 2, x0 and x1 can be the same or different. INDEX1 and INDEX2 can also be the same or different.

[0149] Optionally, in this embodiment, the wake-up information represented by the first sequence can be in the form of a bitmap, a codepoint, or other forms, and this application does not limit this.

[0150] For example, the wake-up information is in the form of a bitmap. Suppose there are the following subgroups: subgroup A, subgroup B, subgroup C, subgroup D, subgroup F, and subgroup G. The subgroups that need to be woken up are subgroup A, subgroup D, and subgroup G, then the wake-up information is [1 0 0 1 0 1]. These 6 bits are divided into two parts: [1 0] and [0 1 0 1].

[0151] The method for generating the second sequence based on [1 0] is as follows: the step size of the m sequence is determined to be 127 / 4 = 31, and the original m sequence is shifted twice with a step size of 31 to obtain the cyclically shifted m sequence representing [1 0], which is the second sequence.

[0152] The method for generating the third sequence based on [0 1 0 1] is as follows: the step size of the m sequence is determined to be 127 / 16 = 8, and the original m sequence is shifted four times with a step size of 8 to obtain the cyclically shifted m sequence representing [0 1 0 1], which is the third sequence.

[0153] Multiply the second sequence and the third sequence to obtain the first sequence representing [1 0 0 1 0 1].

[0154] For example, the wake-up information is in the form of codepoints. Assume there are the following subgroups: subgroup A, subgroup B, subgroup C, subgroup D, subgroup F, and subgroup G. The subgroup to be woken up is subgroup G, so the wake-up information is [0 1 0 1]. These 4 bits are divided into two parts: [0 1] and [0 1]. At this point, N1 and N2 are the same, and INDEX1 and INDEX2 are the same, so the resulting second and third sequences are identical.

[0155] The method for generating the second sequence based on [0 1] is as follows: the step size of the m sequence is determined to be 127 / 4 = 31, and the original m sequence is shifted once with a step size of 31 to obtain the cyclically shifted m sequence representing [0 1], which is the second sequence. The method for generating the third sequence is similar to that for the second sequence. The two sequences are multiplied to obtain the first sequence representing [0 1 0 1].

[0156] Optionally, a first sequence can be obtained by multiplying an uncircularly shifted m-sequence with a circularly shifted m-sequence.

[0157] For example, the wake-up information is in the form of codepoints. Assume there are the following subgroups: subgroup A, subgroup B, subgroup C, and subgroup D. The subgroup to be woken up is subgroup A, so the wake-up information is [0 0 0 1]. These 4 bits are divided into two parts: [0 0] and [0 1]. The second sequence corresponding to the [0 0] part is an un-circularly shifted m-sequence.

[0158] Optionally, the first sequence can also be obtained by multiplying three or more m sequences. Similarly, if it is obtained by multiplying three m sequences, the number of bits of the wake-up information is divided into three parts, each part yields a sequence, and finally the three sequences are multiplied to obtain the first sequence.

[0159] For example, the wake-up information is [1 0 0 1 1 1]. This wake-up information is divided into three parts: [1 0], [0 1], and [1 1]. A sequence is obtained based on [1 0] (step size 31, INDEX 2), a sequence is obtained based on [0 1] (step size 31, INDEX 1), and a sequence is obtained based on [1 1] (step size 31, INDEX 3). These three sequences are then multiplied to obtain the first sequence. Dividing it into more parts can be done similarly, which will not be elaborated upon here.

[0160] Case 3: The first sequence is the sum of two m sequences.

[0161] This addition can be the superposition of two m-sequences in the frequency domain. For example, using two 63-length M-sequences, each carrying a portion of wake-up information, the frequency domain is divided into upper and lower parts, with the upper part occupying 63 REs and the lower part occupying 63 REs respectively. The two 63-length M-sequences are placed in the upper and lower parts respectively.

[0162] For example, as shown in Figure 6B, a block in Figure 6B is a RE, and two M sequences of length 63 are placed in the upper and lower parts respectively.

[0163] Alternatively, two m-sequences of different lengths can be used, in which case the REs of the upper and lower parts in the frequency domain can be different.

[0164] Optionally, the sequences in the upper and lower parts of the frequency domain are identical. In this case, the frequency domain is evenly divided into upper and lower parts, each carrying N bits of wake-up information. See Case Two above, which involves multiplying two m-sequences. Multiplying two 64-bit sequences generates 2^N sequences. Based on the subgroup to be indicated, one of these 2^N sequences is chosen as the first sequence, and then this first sequence is placed in the upper and lower parts of the frequency domain. Further details are omitted here.

[0165] In one possible embodiment, for 22RB, a 127-length m-sequence is used, the first sequence of which may be obtained by superimposing two 127-length m-sequences.

[0166] Optionally, the frequency domain can be divided into upper and lower parts, with the sequences in both parts being identical, and each part carrying N bits of wake-up information. That is, multiplying two 127-bit sequences can generate 2^N sequences. Based on the subgroup to be indicated, one of the 2^N sequences is taken as the first sequence, and then the upper and lower parts of the frequency domain are filled with this first sequence.

[0167] Optionally, for 22RB, a sequence of length 255 can be used directly. For details, please refer to the description in Method 1 above; this application will not elaborate further.

[0168] Optionally, this application does not limit the primitive polynomial used in this embodiment.

[0169] Optionally, for more RBs, such as 44 RBs, or fewer RBs, the same principle applies, which will not be elaborated here.

[0170] Method 2: Based on SSS and PSS

[0171] Case 1: The number of bits in the wake-up message is 1.

[0172] In other words, if it is a 1-bit wake-up message, then any two sequences in the PSS (PSS1 and PSS2) or any two sequences in the SSS (SSS1 and SSS2) are directly selected as the first sequence.

[0173] Optionally, the network device pre-configures PSS1 and PSS2 for the terminal device, or configures SSS1 and SSS2 to instruct the terminal device to wake up. During the actual wake-up process, the network device modulates the first signal using PSS1 or PSS2 (or SSS1 or SSS2) and sends the first signal to the terminal device. After receiving the first signal, the terminal device demodulates the first signal and determines whether the subgroup indicated by PSS1 or PSS2 (or SSS1 or SSS2) is the subgroup to which the terminal device belongs, or whether the indicated terminal device is the terminal device itself.

[0174] For example, the network device is configured to configure the terminal device as follows: PSS1 indicates subgroup A, PSS2 indicates subgroup B. If the terminal device demodulates the received first signal and finds that it has received PSS1, and the terminal device is located in subgroup A, then the terminal device wakes up. The same applies to SSS.

[0175] Optionally, the above example uses the first sequence carrying complete bit information, but the first sequence may also carry only part of the wake-up information bit information.

[0176] Optionally, the terminal device can determine whether it needs to wake up using predefined rules. For example, a predefined rule tells the terminal device to wake up if PSS1 is demodulated. This predefined rule can be a protocol.

[0177] Optionally, if it is a 1-bit wake-up message, then any sequence in PSS (PSS1) or any sequence in SSS (SSS1) can be directly selected as the first sequence. Taking PSS1 as an example, in the ON symbol of OOK, if it is PSS1, it represents 1; if the OFF symbol is empty, it represents 0.

[0178] Optionally, a frequency shift can be added to the PSS / SSS sequence to generate a new sequence. This new sequence is pre-configured by the network device to instruct the terminal device to wake up. Alternatively, it can be a predefined rule.

[0179] Case 2: The number of bits in the wake-up message is greater than or equal to 2.

[0180] Optionally, based on the PSS sequence, a new sequence is generated, and this new sequence is used as the first sequence. This new sequence can be generated using the following formula:

[0181] Where, d OVERLAID (n) represents the first sequence, where offset can take any integer value, and each value corresponds to 3 sequences. This process continues, generating the required number of sequences based on the number of possible offset values.

[0182] For example, if the wake-up message (or part of the wake-up message's bit information) is 6 bits, then 2 to the power of 6 first sequences need to be generated, that is, 64 first sequences are needed to give different instructions. Therefore, the offset needs to take 22 values ​​to generate 66 first sequences, covering 64 bitmaps corresponding to the 6 bits of information.

[0183] Optionally, when actually waking up a subgroup, the network device generates one of 64 sequences using Formula 3, and this sequence carries wake-up information.

[0184] Optionally, in this embodiment, the wake-up information (or part of the bit information of the wake-up information) represented by the first sequence can be in the form of a bitmap, a codepoint, or other forms, and this application does not limit this.

[0185] For example, in the form of a bitmap, assuming an offset of 1, the following three sequences are generated (all three sequences are generated using Formula 3 above): Sequence A, Sequence B, and Sequence C. Sequence A corresponds to [0 0 0 1], Sequence B corresponds to [0 0 1 0], and Sequence C corresponds to [0 0 1 1]. Assuming an offset of 2, the following three sequences are generated (all three sequences are generated using Formula 3 above): Sequence E, Sequence F, and Sequence G. Sequence E corresponds to [0 1 0 0], Sequence F corresponds to [0 1 0 1], and Sequence G corresponds to [0 1 1 0]. And so on. Since it's 4 bits, the offset needs to be 6 bits, which can generate 18 sequences to cover the 16 bitmaps corresponding to the above 4-bit information.

[0186] Suppose we have the following subgroups: subgroup A, subgroup B, subgroup C, and subgroup D. The subgroup that needs to be woken up is subgroup D. The wake-up message is [0 0 0 1]. At this time, the offset is 1 (because when the offset is 1, the information corresponding to sequence A is [0 0 0 1]).

[0187] Optionally, if the first sequence carries some bits of wake-up information, the same applies; this will not be elaborated upon here.

[0188] Optionally, both SSS and PSS are m-sequences.

[0189] Optionally, based on the SSS sequence. The generation formula for this SSS sequence is shown in Formula 4 below:

[0190] Among them, when When it is 0, It can be 0-355. That is to say, when When the value is 0, 356 sequences can be generated, covering 256 bitmaps corresponding to 8 bits of information (the same applies to codepoints). It can have three values ​​(0, 1, and 2), so the existing SSS can generate 1008 sequences, which means it can cover up to 512 bitmaps corresponding to 9 bits of information.

[0191] Optionally, the first few sequences in the SSS sequence can be selected based on the number of bits in the wake-up information (or the number of bits in a portion of the wake-up information). For example, if the wake-up information is 4 bits, then at least 16 sequences are needed to cover the 16 bitmaps corresponding to the 4-bit information.

[0192] Optional, according to =0, From 0 to 335, then =1, From 0 to 335, then It is 2. The 1008 sequences are sorted from 0 to 335. The top few sequences from the sorted 1008 SSS sequences can be selected based on the number of bits in the wake-up message (or the number of bits in a portion of the wake-up message).

[0193] For example, if it's in bitmap form and the wake-up message (or part of the wake-up message's bit information) is 4 bits, then 16 sequences from the SSS sequence are selected. That is, 16 sequences are selected. When it is 0, The sequence generated when the value is 0 is taken as sequence 1. When it is 0, When the value is 1, the generated sequence is used as sequence 2. When it is 0, The sequence generated when the value is 2 is used as sequence 3, and so on. Among them, the information corresponding to sequence 1 is [0 0 0 1], the information corresponding to sequence 2 is [0 0 1 0], the information corresponding to sequence 3 is [0 0 1 1], and so on.

[0194] Suppose we have the following subgroups: subgroup A, subgroup B, subgroup C, and subgroup D. The subgroup that needs to be woken up is subgroup D. Then the wake-up message is [0 0 0 1]. At this time, When it is 0, It is 0.

[0195] Optionally, multiple sequences in the SSS sequence can be selected at equal intervals based on the number of bits in the wake-up information.

[0196] Optional, according to =0, From 0 to 335, then =1, From 0 to 335, then It is 2. The 1008 sequences are sorted from 0 to 335. Based on the number of bits of the wake-up information (or the number of bits of partial wake-up information), multiple sequences from the 1008 SSS sequences are selected at equal intervals.

[0197] For example, if it's in bitmap form and the wake-up information is 4 bits, then 16 sequences need to be selected from 1008 SSS sequences to represent 16 different bitmaps. That is, selecting the first sequence ( When it is 0, (0), the 63rd sequence ( When it is 0, (62), the 126th sequence ( When it is 0, (125), and so on, until the 1008th sequence ( When it is 2, (335).

[0198] Optional, according to =0, The 336 sequences are sorted from 0 to 335. Based on the number of bits of the wake-up information (or the number of bits of partial wake-up information), multiple sequences from the 336 SSS sequences are selected at equal intervals.

[0199] Optional, according to =0, From 0 to 335, then =1, The 672 sequences are sorted from 0 to 335. Based on the number of bits of the wake-up information (or the number of bits of partial wake-up information), multiple sequences from the 672 SSS sequences are selected at equal intervals.

[0200] Optionally, based on the SSS sequence, a new sequence is generated, and this new sequence is used as the first sequence. This new sequence can be generated using the following formula:

[0201] In Formula 5, the offset can take any integer value, and each value corresponds to 1008 sequences. This process continues, generating the required number of sequences by considering the number of possible offset values.

[0202] In other words, the existing SSS can generate 1008 sequences, meaning it can cover a maximum of 512 bitmaps corresponding to 9 bits of information. If you want to cover more than 9 bits of information, you can generate more sequences than 1008 by changing the offset value. For example, when the offset takes one value, it can generate 1008 more sequences than the original 1008 sequences; when the offset takes two values, it can generate 2016 more sequences than the original 1008 sequences.

[0203] Optionally, a combination of PSS and SSS can be used. This combination can generate up to 1008+3 sequences. See the above description for details. Further details are omitted here.

[0204] Method 3: Based on ZC sequence

[0205] Optionally, the first sequence includes the root sequence of the ZC sequence, or the first sequence includes N sequences generated based on the root sequence of the ZC sequence, or the first sequence includes the root sequence and N sequences generated based on the root sequence of the ZC sequence.

[0206] Optionally, the root sequence of the ZC sequence corresponds to the wake-up information and / or bit information, or the N sequences generated from the root sequence of the ZC sequence correspond to the wake-up information and / or bit information, or the first sequence includes the root sequence and the N sequences generated based on the root sequence of the ZC sequence, which correspond to the wake-up information and / or bit information.

[0207] The following will be introduced in different situations:

[0208] Case 1: When the number of bits in the wake-up message (or the number of bits in a portion of the wake-up message) is less than or equal to 4 bits (a group has only one root sequence) or less than or equal to 5 bits (a group has two root sequences), the root sequence is used to carry the bit information.

[0209] Optionally, for a set with only one root sequence, select the first 2^N sequences to cover the 16 bitmaps corresponding to 4 bits of information (the same applies to codepoints).

[0210] Optionally, for a set with two root sequences, select the first 2^N sequences to cover the 32 bitmaps corresponding to 5 bits of information (the same applies to codepoints).

[0211] Alternatively, 2^N sequences can be selected uniformly from all root sequences. For details, please refer to the equally spaced selection method in Method Two above; this application will not elaborate further here.

[0212] Scenario 2: When the number of bits in the wake-up information (or the number of bits in a portion of the wake-up information) is greater than the number of bits in Scenario 1 above, the root sequence can be cyclically shifted. By using the root sequence and the cyclically shifted sequence, more sequences can be obtained, thereby covering multiple bitmaps (or codepoints) corresponding to the bit information.

[0213] Optionally, the cyclic shift can be generated based on the first M root sequences. Each root sequence is shifted to generate L sequences, resulting in a total of M*(L+1) sequences. To cover the bit information, M*(L+1) needs to be greater than or equal to 2 to the power of N.

[0214] Optionally, the number of cyclically shifted sequences to be generated can be distributed evenly among multiple root sequences. That is, the required sequences are evenly distributed among the root sequences. In other words, the number of sequences generated by cyclically shifting each root sequence is average.

[0215] Optionally, M root sequences are used first. If the M sequences cannot cover the bit information, L sequences are generated by shifting the first root sequence. If M+L sequences still cannot cover the bit information, 2L sequences are generated by shifting the first and second root sequences. This process continues until M+J*L sequences can cover the bit information. Here, J is the number of root sequences used.

[0216] In other words, when using the root sequence and the cyclically shifted sequence based on the root sequence to correspond to the wake-up information (or part of the wake-up information's bit information), the original root sequence is used first; when the original root sequence is insufficient to cover the wake-up information, cyclic shifting is performed according to the order of the root sequence.

[0217] For example, suppose we have the following root sequences: root sequence A, root sequence B, root sequence C, and root sequence D (in reality, there are M root sequences, but for simplicity, we'll only use four root sequences here). Each root sequence can be cyclically shifted to generate 6 sequences. The wake-up information consists of 4 bits, meaning 16 sequences are needed to cover the 16 possible bitmaps corresponding to 4 bits of information (the same applies to codepoints). We choose 4 root sequences, 6 sequences generated by cyclically shifting root sequence A, and 6 sequences generated by cyclically shifting root sequence B. This gives us a total of 16 sequences, which perfectly cover the 16 possible bitmaps corresponding to 4 bits of information.

[0218] Optionally, the first root sequence is first shifted to generate L sequences; if the L sequences cannot cover the bit information, the second root sequence is then shifted to generate L sequences; if 2L sequences cannot cover the bit information, the third root sequence is then shifted. This process continues until the bit information can be covered.

[0219] In other words, first select the root sequence and the sequence generated by cyclically shifting the root sequence, and then select the next root sequence and the sequence generated by cyclically shifting the next root sequence.

[0220] For example, suppose we have the following root sequences: root sequence A, root sequence B, root sequence C, and root sequence D (in reality, there are M root sequences, but for simplicity, we'll only use four root sequences here). Each root sequence can generate 6 sequences by cyclic shifting. The wake-up information consists of 4 bits, meaning 16 sequences are needed to cover the 16 possible bitmaps corresponding to 4 bits of information (the same applies to codepoints). Therefore, we select the 6 sequences generated by cyclic shifting root sequence A, the 6 sequences generated by cyclic shifting root sequence B, and the 6 sequences generated by cyclic shifting root sequence C. This gives us a total of 18 sequences, which can cover the 16 possible bitmaps corresponding to 4 bits of information.

[0221] Optionally, the above is generated according to the order of the root sequences (if the sequence generated after cyclically shifting the first root sequence is insufficient, a second root sequence is selected for cyclic shifting). Alternatively, any root sequence can be selected for cyclic shifting, and if the sequence generated after cyclic shifting the arbitrarily selected root sequence is insufficient, then other root sequences are selected for cyclic shifting. For example, the fourth and sixth root sequences are cyclically shifted to generate multiple sequences.

[0222] Optionally, the required sequence is evenly distributed among the root sequences based on the number of bits in the wake-up information (or the number of bits in a portion of the wake-up information). That is, the number of sequences generated by cyclic shifting each root sequence is average, and the number of sequences generated by cyclic shifting any two root sequences is the same (or nearly the same).

[0223] Optionally, for a set with only one root sequence, the number of sequences generated by cyclic shifting each root sequence is ceil(2). N / (M)), or floor(2) N / (M)).

[0224] Optionally, for a set with two root sequences, the number of sequences generated by cyclic shifting each root sequence is ceil(2). N / (M*2)), or floor(2) N / (M*2)).

[0225] Optionally, when making the selection, you can refer to the above description: first select the root sequence, then select the sequences generated by cyclic shifting each root sequence; or first select each root sequence and the cyclic shifted sequence generated by each root sequence, then select the next root sequence and the cyclic shifted sequence generated by it, and so on.

[0226] Optionally, the required number of sequences is determined based on the number of bits in the bit information, and multiple sequences that can cover the bit information are generated through cyclic shifting. That is, each root sequence is shifted to generate L sequences, resulting in a total of M*L sequences. To cover the bit information, this M*L needs to be greater than 2 to the power of N.

[0227] Optionally, the total required sequence can be generated by cyclically shifting each root sequence, or if cyclically shifting one root sequence is insufficient, another root sequence can be used for cyclical shifting. See the above for details, which will not be elaborated upon here.

[0228] Optionally, the network device configures the terminal device with the group number and root sequence number of the ZC sequence, as well as the cyclic shift interval. This allows the terminal device to determine the wake-up information after demodulating the first signal upon receiving it.

[0229] Optionally, network devices can be configured via SIB1 or RRC.

[0230] Optionally, the network device configures the terminal device with the root sequence number starting with the ZC sequence and the cyclic shift interval. Similarly, this allows the terminal device to determine the wake-up information after demodulating the first signal upon receiving it.

[0231] Understandably, in this embodiment, starting from the configured initial root sequence (the root sequence corresponding to the initial root sequence number), the initial root sequence is then cyclically shifted; after the cyclic shift is completed, the next root sequence is cyclically shifted, and then all sequences are matched with the information in order.

[0232] Method 4: Reusing PRACH sequence configuration

[0233] The first sequence consists of multiple sequences related to the access preamble. In other words, the wake-up information, or a portion of the bit information within the wake-up information, is represented by these multiple sequences related to the preamble.

[0234] Optionally, the existing PRACH sequence configuration can be reused. The 6 bits of bit information completely correspond to the 64 preamble sequences of PRACH, which just cover the 64 bitmaps (or codepoints) corresponding to the 6 bits of bit information.

[0235] Optionally, the ON symbol in OOK is modulated using a preamble sequence.

[0236] Optionally, if the bit information is less than 6 bits, then any number of preamble sequences can be selected from the 64 preamble sequences of PRACH, or the first few preamble sequences can be selected. For example, if the bit information is 4 bits, then 16 preamble sequences in the sequence configuration of PRACH are multiplexed. These 16 preamble sequences can be any 16 of the 64 preamble sequences, or they can be the first 16 preamble sequences.

[0237] Optionally, if the bit information is greater than 6 bits, more preamble sequences can be generated using the method described in Scheme 3 above (since the preamble sequence is a ZC sequence, the method for generating a new sequence based on the original 64 preamble sequences can be found in Scheme 3) to cover the bitmap (or codepoint) corresponding to more bits of bit information.

[0238] Optionally, in addition to using Scheme 3 described above, another way to generate more preamble sequences is for the network device to configure the starting root sequence and the cyclic shift interval. Based on the configured starting root sequence and cyclic shift interval, the network device generates 64 preamble sequences. If the sum of these 64 preamble sequences (the original preamble sequence) and 64 preamble sequences (preamble sequences generated based on the existing principles) is insufficient (128 sequences cannot cover the wake-up information / partial bit information corresponding to the bitmap / codepoint), then another 64 preamble sequences are generated based on the existing principles, and so on.

[0239] Optionally, if a sequence with L=839 (e.g., the sequence in Tables 6.3.3.1-3) or 139 is selected, the preamble sequence needs to be truncated so that it can be placed into the ON symbol of OOK. Alternatively, a preamble sequence with L=127 can be selected. Or, a sequence with L=71 can be selected for repeated expansion, etc.

[0240] Method 5: Based on Gold Sequence

[0241] The first sequence is a sequence generated based on the Gold sequence and the number of bits of wake-up information and / or the number of bits carrying bit information and / or the position of RB and / or the number of RE.

[0242] Optionally, a 127-bit Gold sequence is generated based on the number of bits in the wake-up information and / or the number of bits carrying the bit information, and this 127-bit Gold sequence is the first sequence.

[0243] The generation of this Gold sequence satisfies the following formula: C (n) =(x1(n+N) c )+x2(n+N c ))mod2 x1(n+31)=(x1(n+3)+x1(n))mod2 Formula 6 x2(n+31)=(x2(n+3)+x2(n+2)+x2(n+1)+x2n)mod2

[0244] Among them, C (n) For the generated Gold sequence, the N c The initialization of x2(n) can be 1600, x1(0) = 1, x1(n) = 0, where n = 1, 2, ..., 30;

[0245] Optionally, the wake-up information (or a portion of the wake-up information's bits) can be directly represented by the x2 part. The generation formula based on x2 carrying this bit information can be the following formula seven (before using formula seven, the bit information needed to be divided into multiple parts due to the summation operator in the formula):

[0246] For example, consider the wake-up information. Assume the wake-up information is [1 0 0 1 0 1] (6 bits), and divide it into three parts: [1 0], [0 1], and [0 1]. When i=1, use [1 0]; when i=2, use [0 1]; when i=3, use [0 1]. Finally, use the summation operator to generate the first sequence carrying 6 bits of information.

[0247] It should be noted that this application does not restrict the method of partitioning. It can be partitioned evenly (e.g., each part after partitioning is 2 bits) or randomly (e.g., one part is 4 bits and the other part is 2 bits).

[0248] Optionally, the N-bit information of the wake-up message (or a portion of the wake-up message's bit information) can be divided into two parts: N1 bits and N2 bits. x1 is initialized to the value corresponding to N1 bits or the result of the conversion; x2 is initialized to the value corresponding to N2 bits or the result of the conversion. For example, if the wake-up message is [1 0 0 1 0 1], it can be divided into [1 0] and [0 1 0 1]. x1 is initialized to [0 1], and x2 is initialized to [0 1 0 1].

[0249] Optionally, the sequence form of DMRS can be used: c(i) is defined as above, and c(i) can be initialized as described above.

[0250] Optionally, the Gold sequence can be generated based on the position of the RB or based on the number of REs.

[0251] Optionally, c(i) is determined based on the existing scrambling ID and then scrambling the wake-up information (or a portion of the wake-up information's bits). For example,

[0252] In this formula, M is related to the number of bits in the wake-up information (or the number of bits in a portion of the wake-up information). The ID generation formula in the above formula can be replaced with the formula for generating the first sequence in each of the above methods.

[0253] Please refer to Figure 7, which shows a schematic diagram of the structure of a communication device 700 according to an embodiment of this application. The communication device shown in Figure 7 can be a terminal device / network device. It can also be a device in a terminal device / network device, or a device that can be used in conjunction with a terminal device / network device. Specifically, as shown in Figure 7, the communication device 700 may include a communication unit 701. The communication unit 701 is used for communication. Optionally, the communication unit 701 integrates a receiving unit and a transmitting unit. The communication unit 701 can also be called a transceiver unit. Alternatively, the communication unit 701 can be split into a receiving unit and a transmitting unit.

[0254] In one embodiment, the communication device 700 may be a terminal device, a device within a terminal device, or a device compatible with a terminal device, wherein:

[0255] The communication unit 701 is used to receive a first signal, the first signal being modulated based on a first sequence, the first sequence carrying wake-up information and / or bit information, the bit information being a portion of the wake-up information.

[0256] In one possible implementation, the first sequence is generated by cyclically shifting the m-sequence, the cyclic shift length of which is determined based on the number of bits of the wake-up message and / or the number of RBs and / or the number of bits carrying the bit information.

[0257] In one possible implementation, the cyclic shift of the m-sequence is associated with wake-up information and / or bit information.

[0258] In one possible implementation, the cyclic shift of the m-sequence corresponds one-to-one with the wake-up information and / or bit information.

[0259] In one possible implementation, the first sequence is any one or two sequences in the synchronization signal, or the first sequence is generated based on the sequences in the synchronization signal.

[0260] In one possible implementation, the synchronization signal is either PSS or SSS.

[0261] In one possible implementation, the first sequence includes multiple root sequences of the ZC sequence, or the first sequence includes N sequences generated based on the root sequences of the ZC sequence, where N is a positive integer greater than or equal to the number of bits of the wake-up information.

[0262] In one possible implementation, the root sequence of the ZC sequence corresponds one-to-one with the wake-up information and / or bit information, or the N sequences generated from the root sequence of the ZC sequence correspond one-to-one with the wake-up information and / or bit information, or the first sequence includes the root sequence and the N sequences generated based on the root sequence of the ZC sequence, which correspond one-to-one with the wake-up information and / or bit information.

[0263] In one possible implementation, the first sequence is a plurality of sequences associated with the access preamble.

[0264] In one possible implementation, multiple sequences associated with the access preamble correspond one-to-one with wake-up information and / or bit information.

[0265] In one possible implementation, the first sequence is a sequence generated based on the Gold sequence and the number of wake-up information bits and / or the number of bits carrying bit information and / or the position of RB and / or the number of RE.

[0266] In one possible implementation, the communication unit 701 is configured to establish a communication connection with the network device if the subgroup indicated by the wake-up information includes a terminal device, or if the wake-up information indicates a terminal device.

[0267] In one embodiment, the communication device 700 may be a network device, a device within a network device, or a device compatible with a network device, wherein:

[0268] The communication unit 701 is used to send a first signal, which is modulated based on a first sequence. The first sequence carries wake-up information and / or bit information, and the bit information is part of the wake-up information.

[0269] In one possible implementation, the first sequence is generated by cyclically shifting the m-sequence.

[0270] In one possible implementation, the cyclic shift length of the m-sequence is determined based on the number of bits of the wake-up message and / or the number of RBs and / or the number of bits carrying the bit information.

[0271] In one possible implementation, the cyclic shift of the m-sequence is associated with wake-up information and / or bit information.

[0272] In one possible implementation, the first sequence is any one or two sequences in the synchronization signal, or the first sequence is generated based on the sequences in the synchronization signal.

[0273] In one possible implementation, the synchronization signal is either PSS or SSS.

[0274] In one possible implementation, the first sequence includes multiple root sequences of the ZC sequence, or the first sequence includes N sequences generated based on the root sequences of the ZC sequence, where N is a positive integer greater than or equal to the number of bits of the wake-up information.

[0275] In one possible implementation, the root sequence of the ZC sequence corresponds to the wake-up information and / or bit information, or the N sequences generated from the root sequence of the ZC sequence correspond to the wake-up information and / or bit information, or the first sequence includes the root sequence and the N sequences generated from the root sequence of the ZC sequence corresponding to the wake-up information and / or bit information.

[0276] In one possible implementation, the first sequence is a plurality of sequences associated with the access preamble.

[0277] In one possible implementation, multiple sequences associated with the access preamble correspond to wake-up information and / or bit information.

[0278] In one possible implementation, the first sequence is a sequence generated based on the Gold sequence and the number of wake-up information bits and / or the number of bits carrying bit information and / or the position of RB and / or the number of RE.

[0279] Figure 8 shows a schematic diagram of another communication device. The communication device 800 can be a terminal device / network device as described in the above method embodiments, or it can be a chip, chip system, or processor that supports the terminal device / network device in implementing the above methods. This communication device can be used to implement the methods described in the above method embodiments; for details, please refer to the descriptions in the above method embodiments.

[0280] The communication device 800 may include one or more processors 801. The processor 801 may be a general-purpose processor or a dedicated processor, such as a baseband processor or a central processing unit (CPU). The baseband processor can be used to process communication protocols and communication data, while the CPU can be used to control the communication device (e.g., base station, baseband chip, terminal, terminal chip, DU or CU, etc.), execute software programs, and process data from the software programs.

[0281] Optionally, the communication device 800 may include one or more memories 802, which may store instructions 804 that can be executed on the processor 801, causing the communication device 800 to perform the methods described in the above method embodiments. Optionally, the memory 802 may also store data. The processor 801 and the memory 802 may be provided separately or integrated together.

[0282] Optionally, the communication device 800 may further include a transceiver 805 and an antenna 806. The transceiver 805, which may be referred to as a transceiver unit, transceiver, or transceiver circuit, is used to implement transceiver functions. The transceiver 805 may include a receiver and a transmitter. The receiver, which may be referred to as a receiver or receiving circuit, is used to implement a receiving function; the transmitter, which may be referred to as a transmitter or transmitting circuit, is used to implement a transmitting function. The communication unit 701 may be the transceiver 805.

[0283] In another possible design, the processor 801 may include a transceiver for implementing receive and transmit functions. For example, the transceiver may be a transceiver circuit, an interface, or an interface circuit. The transceiver circuit, interface, or interface circuit for implementing receive and transmit functions may be separate or integrated. The aforementioned transceiver circuit, interface, or interface circuit can be used for reading and writing code / data, or it can be used for transmitting or relaying signals.

[0284] In another possible design, the processor 801 may optionally store instructions 803, which, when executed on the processor 801, cause the communication device 800 to perform the methods described in the above method embodiments. Instructions 803 may be embedded in the processor 801; in this case, the processor 801 may be implemented in hardware.

[0285] In another possible design, the communication device 800 may include circuitry that can perform the functions of sending, receiving, or communicating as described in the foregoing method embodiments. The processor and transceiver described in this application embodiment can be implemented on integrated circuits (ICs), analog ICs, radio frequency integrated circuits (RFICs), mixed-signal ICs, application-specific integrated circuits (ASICs), printed circuit boards (PCBs), electronic devices, etc. The processor and transceiver can also be manufactured using various IC process technologies, such as complementary metal oxide semiconductors (CMOS), n-type metal-oxide-semiconductor (NMOS), p-type metal oxide semiconductors (PMOS), bipolar junction transistors (BJTs), bipolar CMOS (BiCMOS), silicon germanium (SiGe), gallium arsenide (GaAs), etc.

[0286] The communication device described in the above embodiments can be a terminal device / network device, but the scope of the communication device described in the embodiments of this application is not limited thereto, and the structure of the communication device is not limited to FIG8. The communication device can be a standalone device or can be part of a larger device. For example, the communication device can be:

[0287] (1) Independent integrated circuit IC, or chip, or chip system or subsystem;

[0288] (2) A collection of one or more ICs, optionally including a storage component for storing data and instructions;

[0289] (3) ASIC, such as modem (MSM);

[0290] (4) Modules that can be embedded in other devices;

[0291] (5) Receivers, terminals, smart terminals, cellular phones, wireless devices, handheld devices, mobile units, vehicle-mounted devices, network devices, cloud devices, artificial intelligence devices, etc.

[0292] (6) Others, etc.

[0293] For communication devices that can be chips or chip systems, please refer to the schematic diagram of the chip structure shown in Figure 9. The chip 900 shown in Figure 9 includes a processor 901 and an interface 902. Optionally, it may also include a memory 903. The number of processors 901 can be one or more, and the number of interfaces 902 can be multiple.

[0294] For cases where the chip is used to implement the terminal device or network device in the embodiments of this application:

[0295] The interface 902 is used to receive or output signals;

[0296] The processor 901 is used to perform data processing operations on terminal devices or network devices.

[0297] It is understood that some optional features in the embodiments of this application can be implemented independently in certain scenarios without relying on other features, such as the current solution on which they are based, to solve the corresponding technical problems and achieve the corresponding effects. Alternatively, they can be combined with other features as needed in certain scenarios. Accordingly, the communication device given in the embodiments of this application can also implement these features or functions, which will not be elaborated here.

[0298] It should be understood that the processor in the embodiments of this application can be an integrated circuit chip with signal processing capabilities. In implementation, the steps of the above method embodiments can be completed by integrated logic circuits in the processor's hardware or by instructions in software form. The processor described above can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components.

[0299] It is understood that the memory in the embodiments of this application can be volatile memory or non-volatile memory, or may include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0300] This application also provides a computer-readable medium storing a computer program or instructions, which, when executed by a communication device, implements the functions of any of the above method embodiments.

[0301] This application also provides a computer program product including instructions, which, when read and executed by a computer, causes the computer to perform the functions of any of the above method embodiments.

[0302] This application provides a communication system, which includes a terminal device and a network device; wherein the terminal device is used to execute the method executed by the terminal device in the above embodiments, and the network device is used to execute the method executed by the network device in the above embodiments.

[0303] In the above embodiments, implementation can be achieved, in whole or in part, through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented, in whole or in part, as a computer program product. The computer program product includes one or more computer instructions. When the computer instructions are loaded and executed on a computer, all or part of the processes or functions described in the embodiments of this application are generated. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another. For example, the computer instructions can be transmitted from one website, computer, server, or data center to another via wired (e.g., coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) means. The computer-readable storage medium can be any available medium accessible to a computer or a data storage device such as a server or data center that integrates one or more available media. The available media may be magnetic media (e.g., floppy disks, hard disks, magnetic tapes), optical media (e.g., high-density digital video discs (DVDs)), or semiconductor media (e.g., solid-state disks (SSDs)).

[0304] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for transmitting wake-up information, characterized in that, The method comprises: receiving a first signal, the first signal being modulated based on a first sequence, the first sequence carrying wake-up information and / or bit information, the bit information being part of the wake-up information.

2. The method of claim 1, wherein, The first sequence is generated by cyclic shift of an m-sequence, the length of the cyclic shift of the m-sequence being determined based on the number of bits of the wake-up information and / or the number of resource blocks (RBs) and / or the number of bits of the bit information.

3. The method of claim 2, wherein, The number of cyclic shifts of the m-sequence is related to the wake-up information and / or the bit information.

4. The method of claim 3, wherein, The m-sequences generated by the cyclic shifts are in one-to-one correspondence with the wake-up information and / or the bit information.

5. The method of claim 1, wherein, The first sequence is any one or both of the sequences in a synchronization signal, or the first sequence is generated based on the sequences in the synchronization signal.

6. The method of claim 5, wherein, The synchronization signal is a PSS or a SSS.

7. The method of claim 1, wherein, The first sequence comprises a root sequence of a ZC sequence, or the first sequence comprises N sequences generated based on the root sequence of the ZC sequence, or the first sequence comprises the root sequence and the N sequences generated based on the root sequence of the ZC sequence.

8. The method of claim 7, wherein, The root sequence of the ZC sequence is in one-to-one correspondence with the wake-up information and / or the bit information, or the N sequences generated based on the root sequence of the ZC sequence are in one-to-one correspondence with the wake-up information and / or the bit information, or the first sequence comprises the root sequence and the N sequences generated based on the root sequence of the ZC sequence are in one-to-one correspondence with the wake-up information and / or the bit information.

9. The method of claim 1, wherein, The first sequence is a plurality of sequences related to an access preamble.

10. The method of claim 9, wherein, The plurality of sequences related to the access preamble are in one-to-one correspondence with the wake-up information and / or the bit information.

11. The method of claim 1, wherein, The first sequence is a sequence generated based on a Gold sequence and the number of bits of the wake-up information and / or the number of bits carrying the bit information and / or the position of resource blocks (RBs) and / or the number of resource elements (REs).

12. The method according to any one of claims 1-11, characterized in that, A terminal device comprises a main receiver and a low-power wake-up receiver, and the receiving of the first signal comprises: receiving the first signal by the low-power wake-up receiver; The method further comprises: if the terminal device is included in a sub-group indicated by the wake-up information or the terminal device is indicated by the wake-up information, waking up the wake-up main receiver in the terminal device.

13. A method of transmitting wake-up information, the method comprising: The method comprises: sending a first signal, the first signal being modulated based on a first sequence, the first sequence carrying wake-up information and / or bit information, the bit information being part of the wake-up information.

14. The method of claim 13, wherein, The first sequence is generated by cyclic shift of an m-sequence, the length of the cyclic shift of the m-sequence being determined based on the number of bits of the wake-up information and / or the number of resource blocks (RBs) and / or the number of bits of the bit information.

15. The method of claim 14, wherein, The number of cyclic shifts of the m-sequence is related to the wake-up information and / or the bit information.

16. The method of claim 15, wherein, The m-sequences generated by the cyclic shifts are in one-to-one correspondence with the wake-up information and / or the bit information.

17. The method of claim 13, wherein, The first sequence is any one or both of the sequences in a synchronization signal, or the first sequence is generated based on the sequences in the synchronization signal.

18. The method of claim 17, wherein, The synchronization signal is a PSS or a SSS.

19. The method of claim 13, wherein, The first sequence comprises a plurality of root sequences of a ZC sequence, or the first sequence comprises N sequences generated based on root sequences of the ZC sequence, or the first sequence comprises the root sequences and the N sequences generated based on the root sequences of the ZC sequence.

20. The method of claim 19, wherein, The root sequences of the ZC sequence correspond to the wake-up information and / or the bit information one by one, or the N sequences generated based on the root sequences of the ZC sequence correspond to the wake-up information and / or the bit information one by one, or the first sequence comprises the root sequences and the N sequences generated based on the root sequences of the ZC sequence correspond to the wake-up information and / or the bit information one by one.

21. The method of claim 13, wherein, The first sequence is a plurality of sequences related to an access preamble.

22. The method of claim 21, wherein, The plurality of sequences related to the access preamble correspond to the wake-up information and / or the bit information one by one.

23. The method of claim 13, wherein, The first sequence is a sequence generated based on a Gold sequence and the number of wake-up information bits and / or the number of bits carrying bit information and / or the position of RB and / or the number of RE.

24. A communications device, characterized by The chip comprises a processor and a memory, the processor and the memory are coupled, and the processor is configured to implement the method in any one of claims 1-12 or 13-23.

25. A communications device, characterized by The chip comprises a processor and a memory, the processor and the memory are coupled, and the processor is configured to implement the method in any one of claims 1-12 or 13-23.

26. A communication system, characterized by The chip comprises a processor and a memory, the processor and the memory are coupled, and the processor is configured to implement the method in any one of claims 1-12 or 13-23.

27. A chip, characterized by The chip comprises a processor and a memory, the processor and the memory are coupled, and the processor is configured to implement the method in any one of claims 1-12 or 13-23.

28. A computer-readable storage medium, characterized in that, The computer readable storage medium stores a computer program, and the computer program, when invoked by the computer, causes the computer to execute the method in any one of claims 1-12 or 13-23.

29. A computer program product, characterised in that, The computer program product comprises a computer program, and the computer program, when executed by a processor, causes a communication device to execute the method in any one of claims 1-12 or 13-23.

Images