Signal sending method, signal receiving method, communication node, and storage medium

Abstract

The present application provides a signal sending method, a signal receiving method, a communication node, and a storage medium. The method comprises: sending a first signal, the first signal occupying at least one time domain symbol in a time domain, wherein a second signal is a signal that is sent in one time domain symbol by the first signal, and the second signal is generated at least by means of a first processing process. When the first signal is used as a wake-up signal, a shorter wake-up period can be configured for the wake-up signal on the basis of the occupied time domain symbol, thereby reducing the delay of the wake-up signal while meeting power consumption requirements of a user equipment.

Description

Signal sending method, signal receiving method, communication node and storage medium Technical Field

[0001] The present application relates to the field of wireless communication technology, and in particular to a signal sending method, a signal receiving method, a communication node, and a storage medium. Background Art

[0002] For communication systems, in addition to latency, reliability, and availability, the energy efficiency of user equipment is also crucial. Currently, user equipment may need to be charged weekly or daily depending on personal usage time. Generally speaking, user equipment may consume tens of milliwatts of power in the idle or inactive state of Radio Resource Control (RRC), and hundreds of milliwatts of power in the RRC connected state. Therefore, extending the battery life of user equipment is a necessary condition for improving energy efficiency and user experience. The power consumption of the user equipment depends in part on the length of the wake-up cycle of the wake-up signal configured for it, such as the paging cycle. In related technologies, in order to meet power consumption requirements, extended discontinuous reception (eDRX) technology is used to save power, but it will result in high delay of the wake-up signal.

[0003] Summary of the Invention

[0004] Embodiments of the present application provide a signal sending method, a signal receiving method, a communication node, and a storage medium.

[0005] In a first aspect, an embodiment of the present application provides a method for sending a signal, including:

[0006] Sending a first signal, where the first signal occupies at least one time domain symbol in the time domain;

[0007] The second signal is a signal of the first signal sent in one of the time domain symbols, and the second signal is generated at least through the first processing process.

[0008] In a second aspect, an embodiment of the present application provides a method for receiving a signal, including:

[0009] receiving a first signal, where the first signal occupies at least one time domain symbol in the time domain;

[0010] The second signal is a signal received in one of the time domain symbols of the first signal, and the second signal is generated at least through a first processing process.

[0011] In a third aspect, an embodiment of the present application provides a communication node, comprising: a memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, it implements the signal sending method provided in the first aspect of the embodiment of the present application and the signal receiving method provided in the second aspect of the embodiment of the present application.

[0012] In a fourth aspect, an embodiment of the present application provides a storage medium, which stores a computer program. When the computer program is executed by a processor, it implements the signal sending method provided in the first aspect of the embodiment of the present application and the signal receiving method provided in the second aspect of the embodiment of the present application.

[0013] The technical solution provided by the embodiments of the present application includes transmitting a first signal, the first signal occupying at least one time domain symbol in the time domain; wherein a second signal is a signal transmitted in one of the time domain symbols of the first signal, and the second signal is generated by at least a first processing process. Because the first signal occupies at least one time domain symbol in the time domain, when the first signal is used as a wake-up signal, a shorter wake-up period can be configured for the wake-up signal based on the occupied time domain symbols, thereby reducing the wake-up signal delay while meeting the power consumption requirements of the user equipment. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] FIG1 is a schematic structural diagram of a wireless communication system provided in an embodiment of the present application;

[0015] FIG2 is a schematic diagram of a flow chart of a signal sending method provided in an embodiment of the present application;

[0016] FIG3 is a schematic diagram of a signal generation process provided by an embodiment of the present application;

[0017] FIG4 is another schematic diagram of a signal generation process provided by an embodiment of the present application;

[0018] FIG5 is a schematic diagram of a method for indicating the time domain position of a wake-up signal resource within a wake-up signal transmission period provided by an embodiment of the present application;

[0019] FIG6 is another schematic diagram of a method for indicating the time domain position of a wake-up signal resource within a wake-up signal transmission period provided by an embodiment of the present application;

[0020] FIG7 is another schematic diagram of a method for indicating the time domain position of a wake-up signal resource within a wake-up signal transmission period provided by an embodiment of the present application;

[0021] FIG8 is another schematic diagram of a method for indicating the time domain position of a wake-up signal resource within a wake-up signal transmission period provided by an embodiment of the present application;

[0022] FIG9 is another schematic diagram of a method for indicating the time domain position of a wake-up signal resource within a wake-up signal transmission period provided by an embodiment of the present application;

[0023] FIG10 is a schematic diagram of a second sub-information generation process provided in an embodiment of the present application;

[0024] FIG11 is another schematic diagram of a second sub-information generation process provided in an embodiment of the present application;

[0025] FIG12 is another schematic diagram of a second sub-information generation process according to an embodiment of the present application;

[0026] FIG13 is another schematic diagram of a second sub-information generation process according to an embodiment of the present application;

[0027] FIG14 is another schematic diagram of a second sub-information generation process provided in an embodiment of the present application;

[0028] FIG15 is another schematic diagram of a second sub-information generation process according to an embodiment of the present application;

[0029] FIG16 is another schematic diagram of a second sub-information generation process according to an embodiment of the present application;

[0030] FIG17 is another schematic diagram of a second sub-information generation process according to an embodiment of the present application;

[0031] FIG18 is another schematic diagram of a second sub-information generation process according to an embodiment of the present application;

[0032] FIG19 is another schematic diagram of a second sub-information generation process according to an embodiment of the present application;

[0033] FIG20 is another schematic diagram of a second sub-information generation process provided in an embodiment of the present application;

[0034] FIG21 is another schematic diagram of a second sub-information generation process provided in an embodiment of the present application;

[0035] FIG22 is a schematic diagram of a flow chart of a signal receiving method provided in an embodiment of the present application;

[0036] Figure 23 is a structural diagram of a communication node provided in an embodiment of the present application. DETAILED DESCRIPTION

[0037] It should be understood that the specific embodiments described herein are only used to explain the present application and are not intended to limit the present application. The embodiments of the present application will be described in detail below with reference to the accompanying drawings.

[0038] To meet battery life requirements, the 3rd Generation Partnership Project (3GPP) is considering introducing an ultra-low power wake-up (LP-WUS) mechanism in the Rel-18 standard. This mechanism involves the user using a separate receiver to receive a low-power wake-up signal, which is used to wake up the main wireless device for data transmission and reception. When the user device does not detect the low-power wake-up signal, the main receiver is in a deep sleep state, which can further reduce the power consumption of the user device. The power consumption of the user device depends in part on the length of the wake-up cycle of the wake-up signal configured for it, such as the paging cycle. To meet power consumption requirements, the related technology uses eDRX technology to save power, but this will result in high latency of the wake-up signal.

[0039] Among them, eDRX technology is a technology introduced by 3GPP Rel.13. eDRX has a longer paging cycle than discontinuous reception (DRX), which enables user equipment to better save power consumption, but it also causes longer downlink data delays. In eDRX technology, the relevant modules can usually only monitor the paging channel according to the DRX cycle within the paging time window (PTW) to receive downlink services; outside the PTW, they are in a sleep state, do not monitor the paging channel, and cannot receive downlink services. In other words, eDRX technology presents itself as the module constantly turning the receiver on and off. When the receiver is turned on, it can receive data, but when the receiver is turned off, it cannot receive data. The eDRX wake-up cycle consists of two complete periods: turning the receiver off and on.

[0040] Based on this, the technical solution provided by the embodiment of the present application is that the first signal occupies at least one time domain symbol in the time domain, the second signal is a signal sent by the first signal in a time domain symbol, and the second signal is generated by at least the first processing process. Therefore, when the first signal is used as a wake-up signal, a shorter wake-up period can be configured for the wake-up signal, thereby reducing the wake-up signal delay while meeting the power consumption requirements of the user device.

[0041] The signal sending and receiving methods provided in the embodiments of the present application can be applied to various wireless communication systems, such as long term evolution (LTE) systems, fourth-generation mobile communication technology (4G) systems, fifth-generation mobile communication technology (5G) systems, LTE and 5G hybrid architecture systems, 5G New Radio (NR) systems, and new communication systems emerging in future communication developments, such as sixth-generation mobile communication technology (6G) systems.

[0042] Exemplarily, the communication system used in the embodiment of the present application is shown in Figure 1. The communication system may include a first node 110 and a second node 120. The first node 110 may be a base station (BS) or a relay node that performs a relay function. The second node 120 may be a user terminal (UE) or an intermediate node that performs a relay function. The above-mentioned base station may include an evolved NodeB (eNB or eNodeB) in Long Term Evolution Advanced (LTEA), a transmission reception point (TRP), a base station or gNB in ​​a 5G mobile communication system, a base station in a future mobile communication system, or an access node in a Wireless Fidelity (WiFi) system. The base station may also include various macro base stations, micro base stations, home base stations, wireless remote stations, routers, WIFI devices, or various network-side devices such as primary cells and collaborative cells (secondary cells), and location management function (LMF) devices. It may also be a module or unit that performs part of the functions of the base station, for example, it may be a centralized unit (CU) or a distributed unit (DU). It should be noted that the embodiments of the present application do not limit the specific forms of the first node 110 and the second node 120.

[0043] FIG2 is a flow chart of a method for transmitting a signal according to an embodiment of the present application. The method for transmitting a signal may be applied to, but not limited to, the first node 110 in the communication system shown in FIG1 . As shown in FIG2 , the method may include, but is not limited to, the following S201:

[0044] S201. Send a first signal, where the first signal occupies at least one time domain symbol in the time domain; wherein a second signal is a signal of the first signal sent in one of the time domain symbols, and the second signal is generated by at least a first processing process.

[0045] Optionally, the above-mentioned time domain symbols may include one of the following: On-Off Keying (OOK) symbols, Multi-Carrier On-Off Keying (MC-OOK) symbols, Frequency-shift keying (FSK) symbols, Multi-Carrier Frequency-shift keying (MC-FSK) symbols, and Orthogonal Frequency Division Multiplexing (OFDM) symbols.

[0046] When OOK occupies multiple subcarriers in the frequency domain, it is also called MC-OOK, which is an implementation of OOK. Therefore, the following embodiments do not distinguish between OOK and MC-OOK, and the two concepts are interchangeable.

[0047] Optionally, the first signal is generated based on the first information, that is, the first signal carries the first information. The first information may include at least one of the following: wake-up signal information, first sequence information, and second sequence information.

[0048] Optionally, the wake-up signal information may be at least one of the following: resource configuration information occupied by the wake-up signal, modulation and coding information of the wake-up signal, structure information of the wake-up signal, and transmit power configuration information of the wake-up signal.

[0049] Among them, the wake-up signal information, namely WUS (Wake-Up Signal), is mainly used to allow the user equipment to detect the WUS signal before the user equipment paging message arrives when entering the idle (RRC_IDLE) mode and / or inactive (RRC_INACTIVE) mode and / or connected (RRC_CONNECTED) mode, so that the user equipment turns on the receiver to receive the paging message, thereby avoiding the user equipment detecting the paging message when there is no user equipment paging message, resulting in a large amount of power consumption. At the same time, in the connected (RRC_CONNECTED) mode, the user equipment can also determine whether there is a scheduling arrival by detecting the WUS signal. When the user equipment detects the WUS signal, the user equipment turns on the receiver to receive the Physical Downlink Control Channel (PDCCH), thereby avoiding the user equipment detecting the PDCCH when there is no user equipment scheduling information, resulting in a large amount of power consumption. That is, the wake-up signal information is an important energy-saving mechanism.

[0050] Furthermore, the wake-up signal information may also include cyclic redundancy check (CRC) information, wherein the CRC information is an algorithm for checking or verifying whether errors occur in the transmission of the wake-up signal information.

[0051] Furthermore, the wake-up signal information may also include padding information. The main function of the padding information is to ensure that the length of the data packet meets specific requirements. In wireless communication protocols, the size and format of the data packet must meet specific standards to ensure that the data can be correctly transmitted and parsed. When the size of a data packet does not meet the standards, padding information is required to increase the length of the data packet to the required length. The padding information can be specific characters or binary data used to occupy the excess space in the data packet.

[0052] Furthermore, the first sequence information may be used for downlink synchronization or radio resource management (RRM) measurement. Optionally, the number of the first sequence information is at least one.

[0053] Furthermore, the second sequence information can be used for at least one of the following: downlink synchronization, downlink timing offset estimation, downlink frequency offset estimation, and the location of the first signal carrying the "wake-up signal information." For example, the starting position of the first signal carrying the "wake-up signal information" may be after the second sequence information or differ from the second sequence information by a gap, where the gap value is a default configuration or is configured by the first node. Optionally, the number of second sequence information is at least one.

[0054] Optionally, the relationship between the first sequence information and the second sequence information includes at least one of the following: the second sequence information is taken from the first sequence information, the first sequence information is a repetition of the second sequence information, the first sequence information is composed of multiple second sequence information, and the first sequence information is composed of multiple second sequence information and their repetitions.

[0055] Optionally, the length of the first sequence information and / or the second sequence information includes at least one of the following: 5, 7, 11, 13, 16 and 23.

[0056] Illustratively, the sequence of length 5 may be at least one of the following:

[0057] [-1, -1, -1, 1, -1], [-1, 1, -1, -1, -1], [1, -1, 1, 1, 1], [1, 1, 1, -1, 1].

[0058] The sequence of length 7 can be at least one of the following:

[0059] [-1, -1, -1, 1, 1, -1, 1];

[0060] [-1, 1, -1, -1, 1, 1, 1];

[0061] [1, -1, 1, 1, -1, -1, -1];

[0062] [1, 1, 1, -1, -1, 1, -1].

[0063] The sequence of length 11 can be at least one of the following:

[0064] [-1,-1,-1,1,1,1,-1,1,-1,1];

[0065] [-1, 1, -1, -1, 1, -1, -1, -1, 1, 1, 1];

[0066] [1,-1,1,1,-1,1,1,-1,-1,-1];

[0067] [1, 1, 1, -1, -1, -1, -1, -1, 1, -1].

[0068] The sequence of length 13 can be at least one of the following:

[0069] [-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1];

[0070] [-1, 1, -1, 1, -1, -1, 1, -1, -1, -1, -1, -1];

[0071] [1,-1,1,-1,1,1,-1,-1,1,1,1,1,1];

[0072] [1, 1, 1, 1, 1, -1, -1, 1, 1, -1, 1, 1].

[0073] The sequence of length 16 can be at least one of the following:

[0074] [-1,-1,1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,1,-1];

[0075] [-1,-1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1];

[0076] [-1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,1];

[0077] [-1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1];

[0078] [-1, 1, 1, -1, -1, 1, -1, -1, -1, -1, -1, -1, -1, 1, 1];

[0079] [-1, 1, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, 1, -1, -1];

[0080] [1,-1,-1,1,-1,1,-1,1,1,1,1,-1,-1,-1,1,1];

[0081] [1,-1,-1,1,1,-1,-1,1,1,1,1,1,-1,-1];

[0082] [1,-1,-1,1,1,1,1,1,-1,1,-1,1,-1,-1,-1,-1];

[0083] [1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1];

[0084] [1, 1, -1, -1, 1, -1, 1, -1, 1, 1, 1, -1, -1, 1];

[0085] [1, 1, -1, -1, 1, 1, 1, 1, -1, 1, -1, 1, -1, 1, 1].

[0086] The sequence of length 23 can be at least one of the following:

[0087] [-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,1];

[0088] [-1,-1,-1,1,-1,-1,-1,-1,1,-1,-1,-1,1,1,1,1,-1,-1,-1,-1,1,1];

[0089] [-1,-1,1,1,1,-1,1,-1,-1-1,1,-1,1,1,-1,1,1,1,-1,1,1,1];

[0090] [-1, 1, -1, -1, -1, -1, -1, 1, -1, -1, -1, 1, -1, -1, 1, -1, -1, 1, -1, 1, 1, 1];

[0091] [-1, 1, -1, -1, 1, -1, 1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, -1, 1];

[0092] [-1,1,1,-1,1,1,1,-1,1,1,1,-1,-1,-1,-1,-1,1,-1,1,1,-1,1];

[0093] [1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1];

[0094] [1,-1,1,1,1,-1,-1,-1,-1,-1,1,1,1,-1,1,1,-1,1,1,-1,1,1,-1];

[0095] [1,-1,1,1,1,1,-1,-1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1];

[0096] [1, 1, -1, -1, -1, 1, -1, 1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1];

[0097] [1,1,1,-1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1];

[0098] [1,1,1,-1,1,1,1,-1,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,1,-1,-1,-1,-1,-1].

[0099] The sequence in the above example may be first sequence information and / or second sequence information.

[0100] Optionally, -1 in the above sequence may also be changed to 0, thereby forming another sequence.

[0101] Optionally, the 1s in the above sequence may also be modified to 0s, thereby forming another sequence.

[0102] Optionally, 1 in the above sequence may be modified to 0, and -1 may be modified to 1, thereby forming another sequence.

[0103] Optionally, -1 in the above sequence may be modified to 0, and 1 may be modified to -1, thereby forming another sequence.

[0104] Optionally, the first signal may be at least one of the following: a wake-up signal, a synchronization signal, and a preamble signal. Therefore, when the first signal is used as the wake-up signal, a shorter wake-up period may be configured for the wake-up signal based on the time domain symbols occupied by the first signal, thereby reducing the wake-up signal latency while meeting the power consumption requirements of the user equipment.

[0105] Optionally, the position information of the above-mentioned first signal in the time domain is indicated by at least one of the following: first position indication information, second position indication information and third position indication information; wherein, within a sending cycle or sending time window of a first signal, at least one resource for sending the first signal is configured.

[0106] Optionally, the first position indication information is at least one of the following: the offset of the starting position of the resources of the first signal relative to the starting position of the DRX cycle, the offset of the starting position of the resources of the first signal relative to the starting position of the paging frame (PF) in the DRX cycle, the offset of the starting position of the resources of the first signal relative to the starting position of the paging occasion (Paging Occasion) in the DRX cycle, and the offset of the starting position of the resources of the first signal relative to the starting position of the first signal sending cycle.

[0107] Optionally, when multiple PFs are configured in a DRX cycle, the first position indication information is an offset of a starting position of a resource of the first signal relative to a starting position of a first PF in the DRX cycle.

[0108] Optionally, when multiple POs are configured in a PF in a DRX cycle, the first position indication information is the offset of the starting position of the resource of the first signal relative to the starting position of the first PO in the first PF in the DRX cycle.

[0109] DRX is a power-saving mechanism that aims to reduce terminal power consumption and thus improve battery life. This technology allows a terminal to turn off its receiver during certain time periods to reduce power consumption, while turning on the receiver during other time periods to receive necessary signals or data.

[0110] DRX can be divided into DRX in RRC_IDLE / RRC_INACTIVE state and DRX in RRC_CONNECTED state. In RRC_IDLE / RRC_INACTIVE state, DRX means that the terminal periodically receives paging information at certain specific locations to achieve the purpose of power saving. In RRC_CONNECTED state, it is necessary to determine whether to receive PDCCH (Physical Downlink Control Channel) based on DRX configuration and uplink and downlink scheduling information obtained by the terminal. DRX in RRC_CONNECTED state is also called Connected Discontinuous Reception (C-DRX).

[0111] Optionally, the above-mentioned second position indication information is at least one of the following: the offset of the cut-off position of the resources of the first signal relative to the start position of the DRX cycle, the offset of the cut-off position of the resources of the first signal relative to the start position of PF in the DRX cycle, the offset of the cut-off position of the resources of the first signal relative to the start position of PO in the DRX cycle, the offset of the cut-off position of the resources of the first signal relative to the start position of the first signal sending cycle, and the offset of the cut-off position of the resources of the first signal relative to the start position of OnDuration in the DRX cycle.

[0112] Optionally, when multiple PFs are configured in a DRX cycle, the second position indication information is an offset of the cutoff position of the resource of the first signal relative to the starting position of the first PF in the DRX cycle.

[0113] Optionally, when multiple POs are configured in a PF in a DRX cycle, the second position indication information is the offset of the cutoff position of the resource of the first signal relative to the starting position of the first PO in the first PF in the DRX cycle.

[0114] Optionally, within a first signal transmission cycle, within the location indicated by the second location indication information, at least one of the following operations is performed: the terminal does not detect the first signal, the base station does not send the first signal, and the base station does not configure the first signal.

[0115] Among them, the cutoff position here contains two meanings. The first is the literal meaning; the second is a restriction condition on the resource location of the first signal. The specific restriction condition is: within a sending cycle of the first signal, within the position indicated by the second position indication information, at least one of the following operations is performed: the terminal does not detect the first signal, the base station does not send the first signal, and the base station does not configure the first signal.

[0116] In the NR C-DRX mechanism, OnDuration is an important parameter that defines the length of time the terminal monitors the PDCCH (Physical Downlink Control Channel) in each DRX cycle.

[0117] Optionally, the third position indication information is at least one of the following: the offset of the starting position of the sending period of the first signal relative to the starting position of the DRX cycle, the offset of the starting position of the sending period of the first signal relative to the starting position of PF in the DRX cycle, the offset of the starting position of the sending period of the first signal relative to the starting position of PO in the DRX cycle, and the offset of the starting position of the sending period of the first signal relative to the starting position of OnDuration in the DRX cycle.

[0118] Optionally, when multiple PFs are configured in a DRX cycle, the third position indication information is an offset of a starting position of a sending period of the first signal relative to a starting position of a first PF in the DRX cycle.

[0119] Optionally, when multiple POs are configured in a PF in a DRX cycle, the third position indication information is the offset of the starting position of the sending period of the first signal relative to the starting position of the first PO in the first PF in the DRX cycle.

[0120] Optionally, the quantization unit in the first position indication information, the second position indication information and the third position indication information is at least one of the following: an OFDM symbol, an OOK symbol, a time slot, a subframe and a frame.

[0121] A slot is a time unit, and a slot includes at least one OFDM symbol or at least one OOK symbol. A frame is a time unit, and a frame consists of multiple subframes or multiple slots.

[0122] Optionally, the length of the quantization unit is determined at least by the subcarrier spacing size.

[0123] Exemplarily, when the quantization unit is slot, when the subcarrier spacing is 15KHz, the length of the quantization unit "slot" is 1ms; when the subcarrier spacing is 30KHz, the length of the quantization unit "slot" is 0.5ms; when the subcarrier spacing is 60KHz, the length of the quantization unit "slot" is 0.25ms; when the subcarrier spacing is 120KHz, the length of the quantization unit "slot" is 0.125ms; when the subcarrier spacing is 240KHz, the length of the quantization unit "slot" is 0.0625ms.

[0124] The above subcarrier spacing is the subcarrier spacing of the wake-up signal, or the above subcarrier spacing is the subcarrier spacing of the paging information, or the above subcarrier spacing is the subcarrier spacing corresponding to the bandwidth part (Bandwidth Part, BWP) where the wake-up signal is located.

[0125] Optionally, when the BWP where the DRX cycle is located and the BWP where the first signal is located are different or are configured separately, the above-mentioned subcarrier spacing is at least one of the following: the subcarrier spacing corresponding to the BWP where the first signal is located, the subcarrier spacing corresponding to the BWP where the DRX cycle is located, and the subcarrier spacing corresponding to the BWP where the paging information is located.

[0126] In NR, BWP is a subset of the system's configured bandwidth. The system can be configured with one or more BWPs, and each BWP can be independently configured with a parameter set (for example, subcarrier spacing and CP length).

[0127] The second signal is a signal transmitted by the first signal in one time domain symbol. For example, when the first signal is used as a wake-up signal, the second signal may be a time domain expression of the wake-up signal on one OFDM symbol.

[0128] Optionally, the second signal is generated through a first processing process at least based on the first sub-information.

[0129] The first information is generated by the source information through the second processing process, and the first sub-information is a part of the first information, that is, the first sub-information can also be generated through the second processing process. Optionally, the first sub-information can be obtained in the following two ways:

[0130] The first implementation method: After the source information generates the first information through the second processing process, it is divided into multiple parts, each part is called a first sub-information.

[0131] The second implementation method is: firstly divide the source information into multiple parts, and then each part undergoes a second processing process, thereby generating a first sub-information.

[0132] Optionally, the second processing process includes at least one of the following: blocking, repetition, bit-level repetition, encoding, modulation, interleaving, adding padding bits, and adding CRC bits.

[0133] Optionally, the first sub-information may refer to at least one of the following: coded bit information, coded sequence information, and code word information.

[0134] Optionally, the first sub-information may include at least one of the following: information carried in the second signal and information in the first information and carried in the second signal.

[0135] The information carried in the second signal means that the first sub-information is information obtained by modifying the first information. For example, the first sub-information is obtained by Manchester encoding the first information. For example, the first information is divided into multiple parts, and then Manchester encoding is performed on each part to obtain the first sub-information. For another example, Manchester encoding is performed on the first information, and then the modified first information is divided into multiple parts. Each part is called a first sub-information.

[0136] The meaning of the information in the first information and carried in the second signal is that the first sub-information is only part of the first information, and no change processing has been performed on this part of the information.

[0137] Optionally, the first processing process may include: generating second sub-information having a second value length according to first sub-information having a first value length.

[0138] Optionally, the value of the second numerical value can be at least one of the following: the number of subcarriers occupied by the second signal in the frequency domain, the number of subcarriers configured by the second signal in the frequency domain, the number of subcarriers occupied by the first signal in the frequency domain, and the number of subcarriers configured by the first signal in the frequency domain.

[0139] For example, the first sub-information sent on M OOK time domain symbols (OOK symbols) is S M , define S M =[S0, S1, S2, ..., S M-1 ] and the length is M, according to certain rules, S M Converted into the second sub-information Q K , where Q K The length of is K, M is greater than or equal to 1, and K is greater than or equal to 1.

[0140] Optionally, the generating of the second sub-information having a second value in length according to the first sub-information having a first value in length includes at least one of the following:

[0141] generating a first data element sequence according to each first data element in the first sub-information having a length of the first value;

[0142] Second sub-information having a second value length is generated based on each first data element sequence.

[0143] The first sub-information includes first data elements with first values. Each first data element can generate a first data element sequence, and then the first data element sequences can be spliced ​​into the second sub-information.

[0144] Optionally, the process of generating the first data element sequence may include at least one of the following:

[0145] generating a first sequence of data elements based on the first number of first data elements;

[0146] generating a first data element sequence based on a first number of first data elements and a second number of second data elements; wherein the second number of second data elements is located at the head of the first data element sequence;

[0147] generating a first data element sequence based on a first number of first data elements and a third number of third data elements; wherein the third number of third data elements is located at the end of the first data element sequence;

[0148] generating a first data element sequence based on a first number of first data elements, a second number of second data elements, and a third number of third data elements; wherein the second number of second data elements are located at the head of the first data element sequence, and the third number of third data elements are located at the end of the first data element sequence;

[0149] generating a first data element sequence based on the first number of first data elements and third sequence information;

[0150] generating a first data element sequence based on a first number of first data elements, third sequence information, and a second data element sequence; wherein the second data element sequence is located at a head of the first data element sequence;

[0151] generating a first data element sequence based on a first number of first data elements, third sequence information, and a third data element sequence; wherein the third data element sequence is located at the end of the first data element sequence;

[0152] A first data element sequence is generated based on a first number of first data elements, third sequence information, a second data element sequence, and a third data element sequence; wherein the second data element sequence is located at the head of the first data element sequence, and the third data element sequence is located at the tail of the first data element sequence.

[0153] For example, continue to use the first sub-information as S M For example, any one of the following formulas 1 to 8 can be used to describe the first data element S in the first sub-information. i Generate Es i , and then use formula 9 to calculate Es i Processing is performed to generate a second sub-information Q with a length of the second value k . Q k =[Es0,Es1,…,Es M-1 ] Formula 9

[0154] Among them, the first quantity A i , the second quantity B i and the third quantity C i is a positive integer, x i is the second data element, yi is the third data element, is the second data element sequence, is the third data element sequence, It is the third sequence information.

[0155] Optionally, the value of the second data element and the third data element is one of the following: a zero element, a first data element, a predefined element, and a configured element.

[0156] Optionally, the second data element sequence includes one of the following: a second number of zero elements, the second number of data elements in the multiplication result of the first number of first data elements and the third sequence information, the last second number of data elements in the multiplication result of the first number of first data elements and the third sequence information, the second number of data elements in the third sequence information, and the last second number of data elements in the third sequence information.

[0157] Optionally, the third data element sequence includes one of the following: a third number of zero elements, the third number of data elements in the multiplication result of the first number of first data elements and the third sequence information, the first third number of data elements in the multiplication result of the first number of first data elements and the third sequence information, the third number of data elements in the third sequence information, and the first third number of data elements in the third sequence information.

[0158] Optionally, the value of the third sequence information may be preconfigured or predefined.

[0159] Optionally, the above-mentioned third sequence information includes at least one of the following: the third sequence information is composed of the fourth sequence information, the third sequence information is composed of the fourth sequence information and the fifth sequence information, the third sequence information is composed of the fourth sequence information and the sixth sequence information, and the third sequence information is composed of the fourth sequence information, the fifth sequence information and the sixth sequence information.

[0160] Optionally, the fourth sequence information may include one of the following: a ZC sequence, a random (M) sequence, a pseudo-noise (PN) sequence, and a repetition of each sequence.

[0161] Optionally, the fifth sequence information may include one of the following: a fourth number of zero elements, a fourth number of data elements at the front of the fourth sequence information, and a fourth number of data elements whose values ​​are preset values.

[0162] Optionally, the sixth sequence information may include one of the following: a fifth number of zero elements, the fifth number of data elements at the end of the fourth sequence information, and a fifth number of data elements whose values ​​are preset values.

[0163] Optionally, the third sequence information may also be composed of fourth sequence information and seventh sequence information, wherein the seventh sequence information is a variation of the fourth sequence information.

[0164] For example, assuming that the fourth sequence information is One of the data elements is 0≤a≤A i -1, can be Multiplying by one data element, dividing by one data element, adding one data element and / or subtracting one data element forms seventh sequence information, and then combining the fourth sequence information and the seventh sequence information to generate third sequence information.

[0165] In one embodiment, the generation process of the second signal can be as shown in FIG3 , where the first sub-information S M After the first processing, the second sub-information Q is generated k , after getting the second sub-information Q kAfterwards, the second sub-information Q k Perform K-point Discrete Fourier Transform (DFT) / Fast Fourier Transform (FFT) operations to obtain data information D k , D k =[d0,d1,d2,d3,…,d K-1 ].

[0166] Furthermore, optionally, the data information D k Perform at least one of the following operations:

[0167] To D k Perform upward circular shift operation, the size of the circular shift is or Or K / 2.

[0168] To D k Perform downward circular shift operation, the size of the circular shift is or Or K / 2.

[0169] To D k Perform a left circular shift operation, the size of the circular shift is or Or K / 2.

[0170] To D k Perform a right circular shift operation, the size of the circular shift is or Or K / 2.

[0171] To D k Performs the FFTSHIFT operation, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0172] in, is the ceiling operator, is the floor operator.

[0173] Next, the data information D kFill it onto K subcarriers in the frequency domain. When the overall frequency domain bandwidth of the system includes N subcarriers, an N-point Inverse Discrete Fourier Transform (IDFT) / Inverse Fast Fourier Transform (IFFT) operation is performed on the filling data on the N subcarriers to obtain the time domain data T of N sampling points. N =[t0,t1,t2,t3,…,t N-1 ]. Wherein, N is greater than or equal to 1.

[0174] Among them, T N =[t0,t1,t2,t3,…,t N-1 ] is the sampling point data of M OOK time domain symbols, that is, the time domain expression of the second signal on one OFDM symbol.

[0175] in, is the sampling point data of the first OOK time domain symbol among the M OOK time domain symbols, is the sampling point data of the second OOK time domain symbol in M ​​OOK time domain symbols, and so on. is the sampling point data of the Mth OOK time domain symbol among M OOK time domain symbols. M-1 =N.

[0176] Furthermore, before performing the N-point IDFT / IFFT operation, at least one of the following operations may be performed on the data padded on the N subcarriers:

[0177] Perform an upward circular shift operation on the data, and the size of the circular shift is or Or N / 2.

[0178] Perform a downward circular shift operation on the data, and the size of the circular shift is or Or N / 2. Perform a left cyclic shift operation on the data, and the size of the cyclic shift is or Or N / 2.

[0179] The data is circularly shifted to the right, and the size of the circular shift is or Or N / 2.

[0180] Performs an FFTSHIFT operation on the data, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0181] As another optional implementation, the process of generating the second signal may be as shown in FIG4 , where the first sub-information S M After the first processing, the second sub-information Q is generated k , after getting the second sub-information Q k Afterwards, the second sub-information Q k Perform K-point Discrete Fourier Transform (DFT) / Fast Fourier Transform (FFT) operations to obtain data information D k When the number of frequency domain subcarriers allocated to the second signal is not equal to K, for example, when the number of frequency domain subcarriers allocated to the second signal is K1, where K1 is not equal to K, the data information D may be k Processing, D k Convert to E k1 , where E k1 =[e0,e1,e2,e3,…,e k1-1 ].

[0182] Furthermore, we can also k1 Perform at least one of the following operations:

[0183] To E k1 Perform upward circular shift operation, the size of the circular shift is or Or K1 / 2.

[0184] To E k1 Perform downward circular shift operation, the size of the circular shift is or Or K1 / 2.

[0185] To E k1 Perform a left circular shift operation, the size of the circular shift is or Or K1 / 2.

[0186] To E k1 Perform a right circular shift operation, the size of the circular shift is or Or K1 / 2.

[0187] To E k1 Performs the FFTSHIFT operation, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0188] in, is the ceiling operator, is the floor operator.

[0189] Next, the data information E k1 Fill it onto K1 subcarriers in the frequency domain. When the overall frequency domain bandwidth of the system includes N subcarriers, an N-point Inverse Discrete Fourier Transform (IDFT) / Inverse Fast Fourier Transform (IFFT) operation is performed on the filling data on the N subcarriers to obtain the time domain data T of N sampling points. N =[t0,t1,t2,t3,…,t N-1 ]. Wherein, N is greater than or equal to 1.

[0190] Among them, T N =[t0,t1,t2,t3,…,t N-1 ] is the sampling point data of M OOK time domain symbols, that is, the time domain expression of the second signal on one OFDM symbol.

[0191] in, is the sampling point data of the first OOK time domain symbol among the M OOK time domain symbols, is the sampling point data of the second OOK time domain symbol in M ​​OOK time domain symbols, and so on. is the sampling point data of the Mth OOK time domain symbol among M OOK time domain symbols. M-1 =N.

[0192] Furthermore, before performing the N-point IDFT / IFFT operation, at least one of the following operations may be performed on the data padded on the N subcarriers:

[0193] Perform an upward circular shift operation on the data, and the size of the circular shift is or Or N / 2.

[0194] Perform a downward circular shift operation on the data, and the size of the circular shift is or Or N / 2. Perform a left cyclic shift operation on the data, and the size of the cyclic shift is or Or N / 2.

[0195] The data is circularly shifted to the right, and the size of the circular shift is or Or N / 2.

[0196] Performs an FFTSHIFT operation on the data, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0197] in, is the ceiling operator, is the floor operator.

[0198] In this embodiment, the above T N Optionally, the first processing step further includes: generating fourth sub-information based on the third sub-information.

[0199] Optionally, generating the fourth sub-information based on the third sub-information includes at least one of the following:

[0200] generating a fifth data element sequence based on each fourth data element sequence in the third sub-information;

[0201] The fourth sub-information is generated based on each fifth data element sequence.

[0202] The third sub-information includes multiple fourth data element sequences. The fourth data element sequences can be processed according to a certain rule to generate a fifth data element sequence, and then the fifth data element sequences are spliced ​​into the fourth sub-information.

[0203] Optionally, the generation process of the fifth data element sequence includes at least one of the following:

[0204] Remove the first sixth number of data elements from the fourth sequence of data elements;

[0205] removing the last seventh number of data elements in the fourth sequence of data elements;

[0206] removing the first sixth number of data elements and the last seventh number of data elements from the fourth data element sequence;

[0207] replacing the first sixth number of data elements in the fourth sequence of data elements with zero elements;

[0208] replacing the last seventh number of data elements in the fourth sequence of data elements with zero elements;

[0209] replacing the first sixth number of data elements and the last seventh number of data elements in the fourth sequence of data elements with zero elements;

[0210] replacing the first sixth number of data elements in the fourth sequence of data elements with zero elements, and removing the last seventh number of data elements in the fourth sequence of data elements;

[0211] The first sixth number of data elements in the fourth data element sequence are removed, and the last seventh number of data elements in the fourth data element sequence are replaced with zero elements.

[0212] Optionally, removing the first six data elements in the fourth data element sequence may also be understood as retaining other data elements in the fourth data element sequence except the first six data elements.

[0213] Removing the last seven data elements in the fourth data element sequence may also be understood as retaining the other data elements in the fourth data element sequence except the last seven data elements.

[0214] Removing the first six data elements and the last seven data elements in the fourth data element sequence can also be understood as retaining the other data elements in the fourth data element sequence except the first six data elements and the last seven data elements.

[0215] Optionally, the length of the third sub-information is equal to the number of sub-carriers included in the system bandwidth.

[0216] Exemplarily, the expression of the i-th OOK time-domain symbol among the M OOK time-domain symbols is: That is, the fourth data element sequence SubT in the third sub-information can be processed in at least one of the following ways: i Perform the operation to obtain the fifth data element sequence

[0217] Method 1: Remove SubT i The first P i data elements, SubT i Convert to in,

[0218] Method 2: Remove SubT i The last G i data elements, SubT i Convert to in,

[0219] Method 3: Remove SubT i The first P i data elements and the last G i data elements, SubT i Convert to in,

[0220] Method 4: SubT i The first P i data elements are replaced by P i zero elements, SubT i Convert to in,

[0221] Method 5: SubT i The last G i The data elements are replaced by G i zero elements, SubT i Convert to in,

[0222] Method 6: SubT i The first P i data elements are replaced by P i zero elements, and SubT i The last G i The data elements are replaced by G i zero elements, SubT i Convert to in,

[0223] Method 7: SubT i The first P i data elements are replaced by P i zero elements, and remove SubT i The last G i data elements, SubT i Convert to in,

[0224] Method 8: Remove SubT i The first P i data elements, and SubT i The last G i The data elements are replaced by G i zero elements, SubT i Convert to in,

[0225] Among them, the sixth quantity P i and the seventh quantity G i All are positive integers.

[0226] Next, each fifth data element sequence Splice and get the sampling point data T of M MC-OOK time domain symbols N ',in, That is, the fourth sub-information is generated.

[0227] Optionally, the fourth data element sequence SubT corresponding to different OOK time domain symbols i Transformed fifth data element sequence The fourth data element sequences corresponding to different OOK time-domain symbols may be processed using any of the above-mentioned methods 1 to 8 to obtain corresponding fifth data element sequences. This embodiment does not specifically limit the method for generating the fifth data element sequence from the fourth data element sequence corresponding to each OOK time-domain symbol.

[0228] Next, the time domain data T of N sampling points N 'Before sending, a cyclic prefix (CP) operation can be performed, that is, the time domain data T of N sampling points is added. N N at the end of ' CP The information of each sampling point is copied to the time domain data T of N sampling points N ', forming (N+N CP ) sampling points, and then the (N+N CP ) sampling points’ time domain data are sent out.

[0229] As another optional implementation, the second signal can also be generated by the following process: the first sub-information S M After the first processing, the second sub-information Q is generated k , after getting data information D k Afterwards, the data information D kThen, perform F-point IDFT / IFFT operation on the filled data on K subcarriers to obtain the time domain data T of F sampling points. F =[t0,t1,t2,t3,…,t F-1 ]. Wherein, F is greater than or equal to 1, and the value of F is different from the value of the system bandwidth N. Optionally, the value of F is less than the value of N.

[0230] in, is the sampling point data of the first OOK time domain symbol among the M OOK time domain symbols, is the sampling point data of the second OOK time domain symbol in M ​​OOK time domain symbols, and so on. is the sampling point data of the Mth OOK time domain symbol among M OOK time domain symbols. M-1 =F.

[0231] In this embodiment, the above T F Optionally, the first processing step includes generating sixth sub-information based on the fifth sub-information.

[0232] Optionally, generating the sixth sub-information based on the fifth sub-information includes at least one of the following:

[0233] generating a seventh data element sequence according to each sixth data element sequence in the fifth sub-information;

[0234] Sixth sub-information is generated based on each seventh data element sequence.

[0235] The fifth sub-information includes multiple sixth data element sequences. The sixth data element sequences can be processed according to a certain rule to generate a seventh data element sequence, and then the seventh data element sequences are spliced ​​into the sixth sub-information.

[0236] Optionally, the generation process of the seventh data element sequence includes one of the following:

[0237] adding a seventh number of data elements from the rear of a sixth sequence of data elements to the front of the sixth sequence of data elements;

[0238] adding a sixth number of data elements from the front of a sixth sequence of data elements to the end of the sixth sequence of data elements;

[0239] adding the first sixth number of data elements in the sixth sequence of data elements to the end of the sixth sequence of data elements, and adding the last seventh number of data elements in the sixth sequence of data elements to the beginning of the sixth sequence of data elements;

[0240] adding a seventh number of zero elements to the front of the sixth sequence of data elements;

[0241] adding a sixth number of zero elements to the end of the sixth sequence of data elements;

[0242] adding a seventh number of zero elements to the front of the sixth sequence of data elements, and adding a sixth number of zero elements to the back of the sixth sequence of data elements;

[0243] adding a seventh number of data elements from the end of a sixth sequence of data elements to the front of the sixth sequence of data elements, and adding a sixth number of zero elements to the end of the sixth sequence of data elements;

[0244] A seventh number of zero elements is added to the front of the sixth sequence of data elements, and a sixth number of data elements from the front of the sixth sequence of data elements is added to the back of the sixth sequence of data elements.

[0245] Optionally, the length of the fifth sub-information is smaller than the number of sub-carriers included in the system bandwidth.

[0246] Exemplarily, the expression of the i-th OOK time-domain symbol among the M OOK time-domain symbols is: That is, the sixth data element sequence SubT′ in the fifth sub-information is processed in at least one of the following ways: i Perform the operation to obtain the seventh data element sequence

[0247] Method 1: Add SubT′ i The last G i data elements to SubT′ i At the front, put SubT′ i Convert to in,

[0248] Method 2: Add SubT′ i The first P i data elements to SubT′ i At the end of i Convert to in,

[0249] Method 3: Add SubT′ i The last G i data elements to SubT′ i At the front, add SubT′ i The first P idata elements to SubT′ i At the end of i Convert to in,

[0250] Method 4: Add G i zero elements to SubT′ i At the front, put SubT′ i Convert to in,

[0251] Method 5: Add P i zero elements to SubT′ i At the end of i Convert to in,

[0252] Method 6: Add G i zero elements to SubT′ i At the front, add P i zero elements to SubT′ i At the end of i Convert to in,

[0253] Method 7: Add SubT′ i The last G i data elements to SubT′ i At the front, add P i zero elements to SubT′ i At the end of i Convert to in,

[0254] Method 8: Add SubT′ i The first P i data elements to SubT′ i At the end, add G i zero elements to SubT′ i At the front, put SubT′ i Convert to in,

[0255] Next, each seventh data element sequence Splice and get the sampling point data T of M MC-OOK time domain symbols N ",in, That is, the sixth sub-information is generated.

[0256] Furthermore, T N "Use this form to describe T N ″=[t0,t1,t2,t3…,t N-1 ],T N ″=[t0,t1,t2,t3…,t N-1 ] is the sampling point data of M MC-OOK time domain symbols. Wherein, N is the frequency domain bandwidth of the entire system, including the number of N subcarriers.

[0257] Next, the time domain data T of N sampling points N ″=[t0,t1,t2,t3…,t N-1 ] Before sending, you can also perform an additional CP operation, that is, the time domain data T of N sampling points N The N at the end of ″ CP The information of each sampling point is copied to the time domain data T of N sampling points N ″ head, forming (N+N CP ) sampling points, and then the (N+N CP ) sampling points’ time domain data are sent out.

[0258] In one embodiment, optionally, when the length of the first sub-information is 2 and the first sub-information is [0, 1], when the first data element is 0, generating the first data element sequence according to the first data element includes at least one of the following:

[0259] generating a first sequence of data elements based on an eighth number of first data elements;

[0260] A first sequence of data elements is generated based on an eighth number of first data elements and an eleventh number of zero elements.

[0261] When the first data element is 1, generating a first data element sequence according to the first data element includes at least one of the following:

[0262] generating a first sequence of data elements based on the ninth number of first data elements, the third sequence information, and the eighth sequence of data elements;

[0263] Optionally, the eighth data element sequence is the last tenth data elements in the product of the third sequence information and the ninth number of first data elements.

[0264] In one embodiment, optionally, when the length of the first sub-information is 2 and the first sub-information is [1, 0], generating the first data element sequence according to the first data element in the first sub-information includes at least one of the following:

[0265] When the first data element is 0, generating a first data element sequence according to the first data element includes at least one of the following:

[0266] generating a first sequence of data elements based on a ninth number of first data elements and a tenth number of zero elements;

[0267] A first data element sequence is generated based on the ninth number of first data elements.

[0268] When the first data element is 1, generating a first data element sequence according to the first data element includes at least one of the following:

[0269] generating a first data element sequence based on an eighth number of first data elements and the third sequence information;

[0270] A first data element sequence is generated based on the eighth number of first data elements, the third sequence information, and the ninth data element sequence.

[0271] Optionally, the ninth data element sequence is the eleventh number of data elements from the end of the product of the third sequence information and the eighth number of first data elements.

[0272] In one embodiment, optionally, when the length of the first sub-information is 4 and the first sub-information is [0, 1, 0, 1], when the first data element is 0, generating the first data element sequence according to the first data element includes at least one of the following:

[0273] generating a first sequence of data elements based on an eighth number of first data elements;

[0274] generating a first sequence of data elements based on a twelfth number of first data elements and a thirteenth number of zero elements;

[0275] generating a first sequence of data elements based on an eighth number of first data elements and an eleventh number of zero elements;

[0276] A first sequence of data elements is generated based on the twelfth number of first data elements.

[0277] When the first data element is 1, generating a first data element sequence according to the first data element includes at least one of the following:

[0278] generating a first sequence of data elements based on the ninth number of first data elements, the third sequence information, and the tenth sequence of data elements;

[0279] A first data element sequence is generated based on the fourteenth number of first data elements, the third sequence information, and the eleventh data element sequence.

[0280] Optionally, the tenth data element sequence is the last tenth data elements in the product of the ninth number of first data elements and the third sequence information.

[0281] Optionally, the eleventh data element sequence is the fifteenth data element from the end of the product of the fourteenth first data element and the third sequence information.

[0282] In one embodiment, optionally, when the length of the first sub-information is 4 and the first sub-information is [1, 0, 1, 0], when the first data element is 0, generating the first data element sequence according to the first data element includes at least one of the following:

[0283] generating a first sequence of data elements based on a ninth number of first data elements and a tenth number of zero elements;

[0284] A first sequence of data elements is generated based on the fourteenth number of first data elements and the fifteenth number of zero elements.

[0285] When the first data element is 1, generating a first data element sequence according to the first data element includes at least one of the following:

[0286] generating a first data element sequence based on an eighth number of first data elements and the third sequence information;

[0287] generating a first sequence of data elements based on the eighth number of first data elements, the third sequence information, and the twelfth sequence of data elements;

[0288] A first data element sequence is generated based on the twelfth number of first data elements, the third sequence information, and the thirteenth data element sequence.

[0289] Optionally, the twelfth data element sequence is the last eleventh data element in the product of the eighth number of first data elements and the third sequence information.

[0290] Optionally, the thirteenth data element sequence is the last thirteenth data element in the product of the twelfth first data element and the third sequence information.

[0291] In one embodiment, optionally, when the length of the first sub-information is 4 and the first sub-information is [1, 0, 0, 1], when the first data element is 0, generating the first data element sequence according to the first data element includes at least one of the following:

[0292] generating a first sequence of data elements based on a ninth number of first data elements and a tenth number of zero elements;

[0293] A first sequence of data elements is generated based on the twelfth number of first data elements and the thirteenth number of zero elements.

[0294] When the first data element is 1, generating a first data element sequence according to the first data element includes at least one of the following:

[0295] generating a first data element sequence based on an eighth number of first data elements and the third sequence information;

[0296] A first data element sequence is generated based on the fourteenth number of first data elements, the third sequence information, and the fourteenth data element sequence.

[0297] Optionally, the fourteenth data element sequence is the fifteenth data element from the end of the product of the eighth number of first data elements and the third sequence information.

[0298] In one embodiment, optionally, when the length of the first sub-information is 4 and the first sub-information is [0, 1, 1, 0], when the first data element is 0, generating the first data element sequence according to the first data element includes at least one of the following:

[0299] generating a first sequence of data elements based on an eighth number of first data elements;

[0300] A first sequence of data elements is generated based on the fourteenth number of first data elements and the fifteenth number of zero elements.

[0301] When the first data element is 1, generating a first data element sequence according to the first data element includes at least one of the following:

[0302] generating a first data element sequence based on the ninth number of first data elements, the third sequence information, and the fifteenth data element sequence;

[0303] A first data element sequence is generated based on the twelfth number of first data elements, the third sequence information, and the sixteenth data element sequence.

[0304] Optionally, the fifteenth data element sequence is the last ten data elements in the product of the third sequence information and the twelfth number of first data elements.

[0305] Optionally, the sixteenth data element sequence is the last thirteenth number of data elements in the product of the third sequence information and the ninth number of first data elements.

[0306] To facilitate understanding by those skilled in the art, the following takes the first signal as the wake-up signal and describes a specific method for indicating the location information of the wake-up signal in the time domain with reference to a specific example:

[0307] Example 1:

[0308] In the 5G NR wireless communication system, when the terminal enters the RRC_IDLE state, it periodically monitors (Monitoring) paging messages on the PO. Among them, the paging message is carried by the Physical Downlink Control Channel (PDCCH). A PO can include a group of PDCCHs, where the number of PDCCHs is greater than or equal to 1.

[0309] In this embodiment, the number of PDCCHs in a group of PDCCHs included in a PO is S, where S is the number of synchronization signal / PBCH (SSB) blocks configured in the system. For example, if four SSBs are configured in the system, namely SSB0, SSB1, SSB2, and SSB3, then a PO includes four PDCCHs, which are defined as PDCCH0, PDCCH1, PDCCH2, and PDCCH3, respectively. These four PDCCHs correspond to SSB0, SSB1, SSB2, and SSB3, respectively. That is, before monitoring a paging message, if the terminal successfully receives an SSB, such as SSB1, the terminal can only detect PDCCH1 when monitoring the paging message on the PO, without detecting other PDCCHs. Of course, the specific PDCCHs detected are related to the implementation method of the terminal. There is no specific limit here on the PDCCHs detected by the terminal. For example, the terminal can also detect all PDCCH0, PDCCH1, PDCCH2, and PDCCH3.

[0310] In 5G NR, SSBs include synchronization signals and broadcast signals. Specifically, synchronization signals include the Primary Synchronization Signal (PSS) and the Secondary Synchronization Signal (SSS); broadcast signals include the Physical Broadcast Channel (PBCH) data and PBCH pilot signals. SSBs occupy four OFDM symbols in the time domain and 20 RBs in the frequency domain.

[0311] In addition, the period during which the terminal monitors paging messages is defined as a DRX cycle, and the value of the DRX cycle is configured by the base station. In this embodiment, the base station sends a wake-up signal before the DRX cycle. During the process of receiving / monitoring the wake-up signal, the terminal will further monitor the paging information within the DRX cycle only if the wake-up signal is sent to the terminal or the terminal set targeted by the wake-up signal includes the terminal. The advantage of sending a wake-up signal is that if the terminal finds that the wake-up signal is not sent to the terminal after receiving the wake-up signal, the terminal does not need to monitor the PDCCH in the DRX cycle, thereby saving power consumption.

[0312] Optionally, the wake-up signal may be formed in at least one of the following ways: LP-WUS, LP-Preamble, and LP-SS.

[0313] Optionally, the wake-up signal is formed in at least one of the following ways:

[0314] LP-WUS;

[0315] LP-Preamble and LP-WUS, where LP-Preamble is sent before LP-WUS.

[0316] Next, we take the wake-up signal LP-WUS as an example to introduce:

[0317] In this embodiment, the LP-WUS is periodically configured, and the LP-WUS cycle is called an LP-WUS cycle. Optionally, the LP-WUS cycle is the same as the DRX cycle.

[0318] An LP-WUS cycle can include at least one LP-WUS set, and an LP-WUS set can include at least one LP-WUS. In this embodiment, an LP-WUS cycle includes two LP-WUS sets, namely LP-WUS set0 and LP-WUS set1; an LP-WUS set includes four LP-WUSs, defined as LP-WUS0, LP-WUS1, LP-WUS2, and LP-WUS3, corresponding to SSB0, SSB1, SSB2, and SSB3, respectively. Different LP-WUS sets are used for different terminals or different terminal groups.

[0319] The time domain position of the LP-WUS occupied resources in an LP-WUS cycle can be indicated by at least one of the following:

[0320] (1) The first position indication information (Gap1) indicates the starting position information of the LP-WUS resource in the LP-WUS cycle;

[0321] (2) The second position indication information (Gap2) indicates the end position information of the LP-WUS resource within the LP-WUS cycle;

[0322] (3) The third position indication information (Gap3) indicates the starting position information of the LP-WUS cycle.

[0323] Specifically, as shown in FIG5 , there are several specific indication methods for Gap1, including:

[0324] Method 1: Gap1-1 is the offset of the starting position of the LP-WUS resource in the LP-WUS cycle relative to the starting position of the DRX cycle.

[0325] Method 2: Gap1-2 is the offset (offset) of the starting position of the LP-WUS resource in the LP-WUS cycle relative to the starting position of the PF in the DRX cycle; optionally, when multiple PFs are configured in the DRX cycle, Gap1-2 is the offset (offset) of the starting position of the LP-WUS resource in the LP-WUS cycle relative to the starting position of the first PF in the DRX cycle.

[0326] Method 3: Gap1-3 is the offset (offset) of the starting position of the LP-WUS resource in the LP-WUS cycle relative to the starting position of the PO in the DRX cycle; optionally, when multiple POs are configured in a PF in the DRX cycle, Gap1-3 is the offset (offset) of the starting position of the LP-WUS resource in the LP-WUS cycle relative to the starting position of the first PO in the PF in the DRX cycle.

[0327] Mode 4: Gap1-4 is the offset of the starting position of the LP-WUS resource within the LP-WUS cycle relative to the starting position of the LP-WUS cycle.

[0328] As shown in Figure 6, there are several specific indication methods for Gap2, including:

[0329] Method 1: Gap2-1 is the offset of the end position of the LP-WUS resource in the LP-WUS cycle relative to the start position of the DRX cycle.

[0330] Method 2: Gap2-2 is the offset (offset) of the end position of the LP-WUS resource in the LP-WUS cycle relative to the start position of the PF in the DRX cycle; optionally, when multiple PFs are configured in the DRX cycle, Gap2-2 is the offset (offset) of the end position of the LP-WUS resource in the LP-WUS cycle relative to the start position of the first PF in the DRX cycle.

[0331] Method three: Gap2-3 is the offset (offset) of the end position of the LP-WUS resource in the LP-WUS cycle relative to the start position of the PO in the DRX cycle; optionally, when multiple POs are configured in a PF in the DRX cycle, Gap2-3 is the offset (offset) of the end position of the LP-WUS resource in the LP-WUS cycle relative to the start position of the first PO in the PF in the DRX cycle.

[0332] Mode 4: Gap2-4 is the offset of the end position of the LP-WUS resource within the LP-WUS cycle relative to the start position of the LP-WUS cycle.

[0333] Optionally, for an LP-WUS resource within an LP-WUS cycle, when its cutoff position satisfies at least one of the following conditions,

[0334] The offset of the end position relative to the start position of the DRX cycle is less than or equal to Gap2-1;

[0335] The offset of the cutoff position relative to the starting position of the PF in the DRX cycle is less than or equal to Gap2-2. When multiple PFs are configured in the DRX cycle, the offset of the cutoff position relative to the starting position of the first PF in the DRX cycle is less than or equal to Gap2-2.

[0336] The offset of the end position relative to the start position of the PO in the DRX cycle is less than or equal to Gap2-3. When multiple POs are configured in a PF in the DRX cycle, the offset of the end position relative to the start position of the first PO in the PF in the DRX cycle is less than or equal to Gap2-3.

[0337] Then, at least one of the following operations is performed: the terminal does not detect the LP-WUS, the base station does not send the LP-WUS, and the base station does not configure LP-WUS resources.

[0338] As shown in FIG7 , there are several specific indication methods for Gap3, including:

[0339] Method 1: Gap3-1 is the offset of the starting position of the LP-WUS cycle relative to the starting position of the DRX cycle.

[0340] Method 2: Gap3-2 is the offset (offset) of the starting position of the LP-WUS cycle relative to the starting position of the PF in the DRX cycle; optionally, when multiple PFs are configured in the DRX cycle, Gap3-2 is the offset (offset) of the starting position of the LP-WUS cycle relative to the starting position of the first PF in the DRX cycle.

[0341] Method 3: Gap3-3 is the offset (offset) of the starting position of the LP-WUS cycle relative to the starting position of the PO in the DRX cycle; optionally, when multiple POs are configured in a PF in the DRX cycle, Gap3-3 is the offset (offset) of the starting position of the LP-WUS cycle relative to the starting position of the first PO in the PF in the DRX cycle.

[0342] Optionally, the quantization units of the above Gap1, Gap2, and Gap3 are at least one of the following: an OFDM symbol length, an OOK symbol, a time slot (slot), a subframe, and a frame.

[0343] A slot is a time unit, and a slot includes at least one OFDM symbol or at least one OOK symbol; a frame is a time unit, and a frame consists of multiple subframes or multiple slots.

[0344] Optionally, the lengths of the quantization units of Gap1, Gap2, and Gap3 are at least determined by the subcarrier spacing size.

[0345] For example, when the quantization unit is slot, when the subcarrier spacing is 15 kHz, the slot length is 1 ms; when the subcarrier spacing is 30 kHz, the slot length is 0.5 ms; when the subcarrier spacing is 60 kHz, the slot length is 0.25 ms; when the subcarrier spacing is 120 kHz, the slot length is 0.125 ms; when the subcarrier spacing is 240 kHz, the slot length is 0.0625 ms.

[0346] The above subcarrier spacing is the subcarrier spacing of the wake-up signal, or the above subcarrier spacing is the subcarrier spacing of the paging information, or the above subcarrier spacing is the subcarrier spacing corresponding to the BWP where the wake-up signal is located.

[0347] Optionally, when the BWP where the DRX cycle is located and the BWP where the LP-WUS cycle is located are different or configured separately, the subcarrier spacing is the subcarrier spacing corresponding to the BWP where the wake-up signal is located, or the subcarrier spacing is the subcarrier spacing corresponding to the BWP where the paging information is located.

[0348] In NR, BWP (Bandwidth Part) is a subset of the system configuration bandwidth. The system can be configured with one or more BWPs, and each BWP can be independently configured with a parameter set (such as SCS size and CP length).

[0349] Optionally, as shown in Figure 8, the above-mentioned Gap1 can be Gap1-1, that is, Gap1 is the offset (offset) of the starting position of the LP-WUS resource in the LP-WUS cycle relative to the starting position of the DRX cycle; the above-mentioned Gap2 is Gap2-2, that is, Gap2 is the offset (offset) of the end position of the LP-WUS resource in the LP-WUS cycle relative to the starting position of the PF in the DRX cycle; optionally, when multiple PFs are configured in the DRX cycle, Gap2 is the offset (offset) of the end position of the LP-WUS resource in the LP-WUS cycle relative to the starting position of the first PF in the DRX cycle; the above-mentioned Gap3 is Gap3-2, that is, Gap3 is the offset (offset) of the starting position of the LP-WUS cycle relative to the starting position of the PF in the DRX cycle; optionally, when multiple PFs are configured in the DRX cycle, Gap3 is the offset (offset) of the starting position of the LP-WUS cycle relative to the starting position of the first PF in the DRX cycle.

[0350] Of course, the above-mentioned wake-up signal may also be composed in other ways. This embodiment only takes LP-WUS as an example of the composition of the wake-up signal, and does not specifically limit the composition of the wake-up signal. When the wake-up signal is composed in other ways, you can also refer to the relevant description of using LP-WUS as the wake-up signal in this embodiment, and this embodiment will not be repeated here.

[0351] Example 2:

[0352] In the 5G NR wireless communication system, when a terminal enters the RRC_CONNECTED state, to save power consumption, it can be configured with Distributed Radio Frequency (DRX), known as C-DRX. C-DRX is periodic, and the C-DRX cycle is called a C-DRX cycle. A terminal configured with C-DRX will only detect the PDCCH during the OnDuration period within the C-DRX cycle, avoiding the waste of power consumption caused by the terminal constantly monitoring the PDCCH. The start time of the OnDuration period is the start time of the C-DRX cycle, and the length of the OnDuration period is configured by the base station.

[0353] In this embodiment, the base station sends a wake-up signal before the C-DRX cycle. During the process of receiving / monitoring the wake-up signal, the terminal will further monitor the PDCCH during the OnDuration period of the C-DRX cycle only if the wake-up signal is sent to the terminal or the terminal set targeted by the wake-up signal includes the terminal. The advantage of sending the wake-up signal is that if the terminal finds that the wake-up signal is not sent to the terminal after receiving it, the terminal does not need to monitor the PDCCH during the C-DRX cycle, thereby saving terminal power consumption.

[0354] Optionally, the wake-up signal may be formed in at least one of the following ways: LP-WUS, LP-Preamble, and LP-SS.

[0355] Optionally, the wake-up signal is formed in at least one of the following ways:

[0356] LP-WUS;

[0357] LP-Preamble and LP-WUS, where LP-Preamble is sent before LP-WUS.

[0358] Next, we take the wake-up signal LP-WUS as an example to introduce:

[0359] In this embodiment, LP-WUS is also configured in a cycle, which is called an LP-WUS cycle. Optionally, the LP-WUS cycle is the same as the C-DRX cycle.

[0360] An LP-WUS cycle includes at least one LP-WUS set, and an LP-WUS set includes at least one LP-WUS. In this embodiment, an LP-WUS cycle includes two LP-WUS sets, LP-WUS Set0 and LP-WUS Set1, and an LP-WUS set includes one LP-WUS.

[0361] As shown in FIG9 , the time domain position of the LP-WUS occupied resources in an LP-WUS cycle is indicated by at least one of the following:

[0362] (1) Gap1 indicates the starting position information of LP-WUS resources within the LP-WUS cycle;

[0363] (2) Gap2 indicates the LP-WUS resource cutoff position information within the LP-WUS cycle;

[0364] (3) Gap3 indicates the starting position information of the LP-WUS cycle.

[0365] Among them, Gap1 is the offset (offset) of the starting position of the LP-WUS resource in the LP-WUS cycle relative to the starting position of the LP-WUS cycle; Gap2 is the offset (offset) of the end position of the LP-WUS resource in the LP-WUS cycle relative to the starting position of OnDuration in the C-DRX cycle; Gap3 is the offset (offset) of the starting position of the LP-WUS cycle relative to the starting position of OnDuration in the C-DRX cycle.

[0366] Furthermore, for an LP-WUS resource within the LP-WUS cycle, when the offset (offset) of its end position relative to the start position of OnDuration in the C-DRX cycle is less than or equal to Gap2, at least one of the following operations is performed: the terminal does not detect the LP-WUS, the base station does not send the LP-WUS, and the base station does not configure the LP-WUS resource.

[0367] Of course, the above-mentioned wake-up signal may also be composed in other ways. This embodiment only takes LP-WUS as an example of the composition of the wake-up signal, and does not specifically limit the composition of the wake-up signal. When the wake-up signal is composed in other ways, you can also refer to the relevant description of using LP-WUS as the wake-up signal in this embodiment, and this embodiment will not be repeated here.

[0368] Optionally, the quantization unit of Gap1, Gap2, and Gap3 is at least one of the following:

[0369] One OFDM symbol length, one OOK symbol, one slot, one subframe, one frame.

[0370] A slot is a time unit, and a slot includes at least one OFDM symbol or at least one OOK symbol; a frame is a time unit, and a frame consists of multiple subframes or multiple slots.

[0371] Optionally, the lengths of the quantization units of Gap1, Gap2, and Gap3 are at least determined by the subcarrier spacing size.

[0372] For example, when the quantization unit is slot, when the subcarrier spacing is 15 kHz, the slot length is 1 ms; when the subcarrier spacing is 30 kHz, the slot length is 0.5 ms; when the subcarrier spacing is 60 kHz, the slot length is 0.25 ms; when the subcarrier spacing is 120 kHz, the slot length is 0.125 ms; when the subcarrier spacing is 240 kHz, the slot length is 0.0625 ms.

[0373] Optionally, the above-mentioned subcarrier spacing is the subcarrier spacing of the wake-up signal, or the above-mentioned subcarrier spacing is the subcarrier spacing of the paging information, or the subcarrier spacing corresponding to the BWP where the above-mentioned wake-up signal is located.

[0374] Optionally, when the BWP where the C-DRX cycle is located and the BWP where the LP-WUS cycle is located are different or configured separately, the above-mentioned subcarrier spacing is the subcarrier spacing corresponding to the BWP where the wake-up signal is located, or the above-mentioned subcarrier spacing is the subcarrier spacing corresponding to the BWP where the paging information is located.

[0375] In NR, BWP is a subset of the system configuration bandwidth. The system can be configured with one or more BWPs, and each BWP can be independently configured with a parameter set (such as SCS size and CP length).

[0376] Next, the following describes how to generate the second signal with reference to a specific example:

[0377] Example 1:

[0378] The information length carried by the second signal (such as LP-WUS) when it is sent is 16 bits, expressed as: B LB =[b0,b1,b2,b3,b4,b5,b6,b7,b8,b9,b 10 ,b 11 ,b 12,b 13 ,b 14 ,b 15 ]. Among them, b0, b1, b2, b3, b4, b5, b6, b7 are the source information bits, and b8, b9, b 10 ,b 11 ,b 12 ,b 13 ,b 14 ,b 15 CRC bits. LP-WUS occupies at least one OFDM symbol during transmission.

[0379] To B LB Each bit b in i Perform Manchester encoding. The code rate of Manchester encoding is 1 / 2. The Manchester encoding rules are:

[0380] b i =0, the code generated after Manchester encoding is [0,1], b i When =1, the code generated after Manchester encoding is [1,0].

[0381] or,

[0382] b i =0, the code generated after Manchester encoding is [1,0], b i When =1, the code generated after Manchester encoding is [0,1].

[0383] In this embodiment, the Manchester encoding rule is selected as:

[0384] b i =0, the code generated after Manchester encoding is [0,1], b i When =1, the code generated after Manchester encoding is [1,0].

[0385] In this embodiment, b i The Manchester-encoded codeword is sent in one OFDM symbol, and the generated time domain signal process may include at least the following steps:

[0386] Step 1: b i The codeword after Manchester encoding is sent in one OFDM symbol, where the codeword length is 2 and the codeword is defined as S M (i.e. the first sub-information), S M =[s0,s1].

[0387] In this embodiment, S M =[s0,s1]=[0,1], or S M =[s0,s1]=[1,0].

[0388] Step 2-1: When S M =[s0,s1]=[0,1], Es0 is generated by s0, that is Generate Es1 from s1, that is

[0389] Optionally, the value of B1 is the same as the number of time domain sampling points occupied by the CP in the OFDM symbol.

[0390] Optionally, for The last B1 data element in the .

[0391] Optionally, A0+A1+B1=K, where K is the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0392] Optionally, A0=A1.

[0393] When S M =[s0,s1]=[1,0], Es0 is generated from s0, that is Generate Es1 from s1, that is

[0394] Optionally, the value of B1 is the same as the number of time domain sampling points occupied by the CP in the OFDM symbol.

[0395] Optionally, A0+A1+B1=K, where K is the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0396] Optionally, A0=A1.

[0397] Step 2-2: According to formula Q k =[Es0,Es1] generates data information Q k (i.e. the second sub-information). M =[s0,s1]=[0,1], the generated data information Q k As shown in Figure 10, when S M =[s0,s1]=[1,0], the generated data information Q k As shown in Figure 11.

[0398] Step 3: Qk Perform K-point DFT / FFT operation to obtain data information D k .

[0399] Furthermore, the data information D k Perform at least one of the following operations:

[0400] To D k Perform upward circular shift operation, the size of the circular shift is or or K / 2;

[0401] To D k Performs the FFTSHIFT operation, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0402] in, is the ceiling operator, is the floor operator.

[0403] Step 4: Data information D k Fill it onto K subcarriers in the frequency domain. When the overall frequency domain bandwidth of the system includes N subcarriers, an N-point Inverse Discrete Fourier Transform (IDFT) / Inverse Fast Fourier Transform (IFFT) operation is performed on the filling data on the N subcarriers to obtain the time domain data T of N sampling points. N =[t0,t1,t2,t3,…,t N-1 ]. Wherein, N is greater than or equal to 1.

[0404] Among them, T N =[t0,t1,t2,t3,…,t N-1 ] is the sampling point data of M OOK time domain symbols.

[0405] Among them, [t0,t1,t2,t3,…,t N / M-1 ] is the sampling point data of the first OOK time domain symbol in M ​​OOK time domain symbols, [t N / M ,t N / M+1 ,…,t 2N / M-1 ] is the sampling point data of the second OOK time domain symbol in M ​​OOK time domain symbols, and so on, [t (M-1)N / M,t(M-1)N / M+1,…,t N-1 ] is the sampling point data of the Mth OOK time domain symbol among M OOK time domain symbols.

[0406] Furthermore, before performing the N-point IDFT / IFFT operation, at least one of the following operations may be performed on the data padded on the N subcarriers:

[0407] Perform an upward circular shift operation on the data, and the size of the circular shift is or or N / 2;

[0408] Performs an FFTSHIFT operation on the data, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0409] Step 5: You can also perform time domain data T of N sampling points N As the third sub-information, the fourth sub-information is generated after data processing. The specific process of generating the fourth sub-information based on the third sub-information can refer to the relevant description of the above embodiment.

[0410] Step 6: Time domain data T of N sampling points N Before sending, you can also perform an additional CP operation, that is, the time domain data T of N sampling points N The N at the end of CP The information of each sampling point is copied to the time domain data T of N sampling points N The head of the form (N+N CP ) sampling points, and then the (N+N CP ) sampling points’ time domain data are sent out.

[0411] Example 2:

[0412] The difference from Example 1 lies in step 2-1 and step 2-2, and the remaining steps are the same as those in Example 1. That is, this embodiment only introduces the different steps 2-1 and step 2-2. The remaining steps can refer to the relevant description in Example 1, and this embodiment will not repeat them here.

[0413] Step 2-1: By s i Generate Es i ,Right now

[0414] Optionally, when s i =0,

[0415] Optionally, when s i =1, in, for The last B i data elements.

[0416] Optionally, B i The value of is the same as the number of time domain sampling points occupied by the CP in the OFDM symbol.

[0417] Step 2-2: According to formula Q k =[Es0,Es1] generates data information Q k (ie the second sub-information).

[0418] When S M =[s0,s1]=[0,1], Generated data information Q k As shown in Figure 12.

[0419] When S M =[s0,s1]=[1,0], Generated data information Q k As shown in Figure 13.

[0420] Optionally, A0+A1+B0+B1=K, where K is the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0421] Optionally, A0=A1.

[0422] Example 3: The difference from Example 1 lies in step 2-1 and step 2-2, and the remaining steps are the same as Example 1. That is, this embodiment only introduces the different steps 2-1 and step 2-2. The remaining steps can refer to the relevant description in Example 1, and this embodiment will not be repeated here.

[0423] Step 2-1: By s i Generate Es i , that is, when s i =0,

[0424] When s i =1, in, for The last B i data elements.

[0425] Step 2-2: According to formula Q k =[Es0,Es1] generates data information Q k (ie the second sub-information).

[0426] When S M =[s0,s1]=[0,1], Generated data information Q k As shown in Figure 14.

[0427] Optionally, the value of B1 is the same as the number of time domain sampling points occupied by the CP in the OFDM symbol.

[0428] Optionally, A0+A1+B1=K, where K is the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0429] Optionally, A0=A1+B1.

[0430] When S M =[s0,s1]=[1,0], Generated data information Q k As shown in Figure 15.

[0431] Optionally, the value of B0 is the same as the number of time domain sampling points occupied by the CP in the OFDM symbol.

[0432] Optionally, A0+A1+B0=K, where K is the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0433] Optionally, A1=A0+B0.

[0434] Example 4:

[0435] The information length carried by the second signal (such as LP-WUS) when it is sent is 16 bits, expressed as: B LB =[b0,b1,b2,b3,b4,b5,b6,b7,b8,b9,b 10 ,b 11 ,b 12 ,b 13 ,b 14 ,b 15 ]. Among them, b0, b1, b2, b3, b4, b5, b6, b7 are the source information bits, and b8, b9, b 10 ,b 11,b 12 ,b 13 ,b 14 ,b 15 CRC bits. LP-WUS occupies at least one OFDM symbol during transmission.

[0436] To B LB Each bit b in i Perform Manchester encoding. The code rate of Manchester encoding is 1 / 4. The Manchester encoding rules are:

[0437] b i = 0, the code generated by Manchester encoding is [0,1,0,1], b i When =1, the code generated after Manchester encoding is [1,0,1,0].

[0438] or,

[0439] b i =0, the code generated after Manchester encoding is [1,0,1,0], b i When =1, the code generated after Manchester encoding is [0,1,0,1].

[0440] In this embodiment, the Manchester encoding rule is selected as:

[0441] b i = 0, the code generated by Manchester encoding is [0,1,0,1], b i When =1, the code generated after Manchester encoding is [1,0,1,0].

[0442] In this embodiment, b i The Manchester-encoded codeword is sent in one OFDM symbol, and the generated time domain signal process may include at least the following steps:

[0443] Step 1: b i The codeword after Manchester encoding is sent in one OFDM symbol, where the codeword length is 4 and the codeword is defined as S M (i.e. the first sub-information), S M =[s0,s1,s2,s3].

[0444] In this embodiment, S M =[s0,s1,s2,s3]=[0,1,0,1], or S M =[s0,s1,s2,s3]=[1,0,1,0].

[0445] Step 2-1: When S M =[s0,s1,s2,s3]=[0,1,0,1], Es0 is generated from s0, that is Generate Es1 from s1, that is Generate Es2 from s2, that is Generate Es3 from s3, that is

[0446] Optionally, the value of at least one of B1, B2 and B3 is the same as the number of time-domain sampling points occupied by the CP in the OFDM symbol.

[0447] Optionally, for The last B1 data element in the .

[0448] Optionally, for The last B3 data elements in the .

[0449] Optionally, A0+A1+B1+A2+B2+A3+B3=K, where K is the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0450] Optionally, A0=A1=A2=A3.

[0451] When S M =[s0,s1,s2,s3]=[1,0,1,0], Es0 is generated from s0, that is, Generate Es1 from s1, that is Generate Es2 from s2, that is Generate Es3 from s3, that is

[0452] Optionally, the value of at least one of B1, B2 and B3 is the same as the number of time-domain sampling points occupied by the CP in the OFDM symbol.

[0453] Optionally, for The last B2 data elements in the .

[0454] Optionally, A0+A1+B1+A2+B2+A3+B3=K, where K is the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0455] Optionally, A0=A1=A2=A3.

[0456] Step 2-2: According to formula Q k =[Es0,Es1,Es2,Es3] generates data information Q k (ie the second sub-information).

[0457] Step 3: Q k Perform K-point DFT / FFT operation to obtain data information D k .

[0458] Furthermore, the data information D k Perform at least one of the following operations:

[0459] To D k Perform upward circular shift operation, the size of the circular shift is or or K / 2;

[0460] To D k Performs the FFTSHIFT operation, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0461] in, is the ceiling operator, is the floor operator.

[0462] Step 4: Data information D k Fill it onto K subcarriers in the frequency domain. When the overall frequency domain bandwidth of the system includes N subcarriers, an N-point Inverse Discrete Fourier Transform (IDFT) / Inverse Fast Fourier Transform (IFFT) operation is performed on the filling data on the N subcarriers to obtain the time domain data T of N sampling points. N =[t0,t1,t2,t3,…,t N-1 ]. Wherein, N is greater than or equal to 1.

[0463] Among them, T N =[t0,t1,t2,t3,…,t N-1 ] is the sampling point data of M OOK time domain symbols.

[0464] Among them, [t0,t1,t2,t3,…,t N / M-1 ] is the sampling point data of the first OOK time domain symbol in M ​​OOK time domain symbols, [t N / M ,t N / M+1 ,…,t 2N / M-1 ] is the sampling point data of the second OOK time domain symbol in M ​​OOK time domain symbols, and so on, [t (M-1)N / M ,t(M-1)N / M+1,…,t N-1 ] is the sampling point data of the Mth OOK time domain symbol among M OOK time domain symbols.

[0465] Furthermore, before performing the N-point IDFT / IFFT operation, at least one of the following operations may be performed on the data padded on the N subcarriers:

[0466] Perform an upward circular shift operation on the data, and the size of the circular shift is or or N / 2;

[0467] Performs an FFTSHIFT operation on the data, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0468] Step 5: You can also perform time domain data T of N sampling points N As the third sub-information, the fourth sub-information is generated after data processing. The specific process of generating the fourth sub-information based on the third sub-information can refer to the relevant description of the above embodiment.

[0469] Step 6: Time domain data T of N sampling points N Before sending, you can also perform an additional CP operation, that is, the time domain data T of N sampling points N The N at the end of CP The information of each sampling point is copied to the time domain data T of N sampling points N The head of the form (N+N CP ) sampling points, and then the (N+N CP ) sampling points’ time domain data are sent out.

[0470] Example 5:

[0471] The difference from Example 4 lies in step 2-1 and step 2-2, and the remaining steps are the same as Example 4. That is, this embodiment only introduces the different steps 2-1 and step 2-2. The remaining steps can refer to the relevant description in Example 4, and this embodiment will not repeat them here.

[0472] Step 2-1: By s i Generate Es i , that is, when s i =0, When s i =1, in, for The last B i data elements.

[0473] Optionally, B i The value of is the same as the number of time domain sampling points occupied by the CP in the OFDM symbol.

[0474] Optionally, A0+A1+B1+A2+B2+A3+B3+B0=K, where K is at least one of the following: the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0475] Optionally, A0=A1=A2=A3.

[0476] Step 2-2: According to formula Q k =[Es0,Es1,Es2,Es3] generates data information Q k (ie the second sub-information).

[0477] Example 6:

[0478] The difference from Example 4 lies in step 2-1 and step 2-2, and the remaining steps are the same as Example 4. That is, this embodiment only introduces the different steps 2-1 and step 2-2. The remaining steps can refer to the relevant description in Example 4, and this embodiment will not repeat them here.

[0479] Step 2-1: By s i Generate Es i , that is, when s i =0,

[0480] When s i =1, in, for The last B i data elements.

[0481] Optionally, s i =0 when Es i Length and s i =1 when Es i Equal length.

[0482] That is, when S M =[s0,s1,s2,s3]=[0,1,0,1],

[0483] When S M =[s0,s1,s2,s3]=[1,0,1,0],

[0484] Step 2-2: According to formula Q k =[Es0,Es1,Es2,Es3] generates data information Q k (ie the second sub-information).

[0485] Example 7:

[0486] The information length carried by the second signal (such as LP-WUS) when it is sent is 16 bits, expressed as: B LB =[b0,b1,b2,b3,b4,b5,b6,b7,b8,b9,b 10 ,b 11 ,b 12 ,b 13 ,b 14 ,b 15 ]. Among them, b0, b1, b2, b3, b4, b5, b6, b7 are the source information bits, and b8, b9, b 10 ,b 11 ,b 12 ,b 13 ,b 14 ,b 15 CRC bits. LP-WUS occupies at least one OFDM symbol during transmission.

[0487] To B LB Each bit b in i Perform Manchester encoding. The code rate of Manchester encoding is 1 / 4. The Manchester encoding rules are:

[0488] b i = 0, the code generated by Manchester encoding is [0,1,0,1], b i When =1, the code generated after Manchester encoding is [1,0,1,0].

[0489] or,

[0490] b i =0, the code generated after Manchester encoding is [1,0,1,0], b i When =1, the code generated after Manchester encoding is [0,1,0,1].

[0491] or,

[0492] b i = 0, the code generated by Manchester encoding is [1,0,0,1], b i When =1, the code generated after Manchester encoding is [0,1,1,0].

[0493] or,

[0494] b i = 0, the code generated by Manchester encoding is [0,1,1,0], b i When =1, the code generated after Manchester encoding is [1,0,0,1].

[0495] In this embodiment, the Manchester encoding rule is selected as:

[0496] b i = 0, the code generated by Manchester encoding is [0,1,1,0], b i When =1, the code generated after Manchester encoding is [1,0,0,1].

[0497] In this embodiment, b i The Manchester-encoded codeword is sent in one OFDM symbol, and the generated time domain signal process may include at least the following steps:

[0498] Step 1: b i The codeword after Manchester encoding is sent in one OFDM symbol, where the codeword length is 4 and the codeword is defined as S M (i.e. the first sub-information), S M =[s0,s1,s2,s3].

[0499] In this embodiment, S M =[s0,s1,s2,s3]=[0,1,1,0], or S M =[s0,s1,s2,s3]=[1,0,0,1].

[0500] Step 2-1: When S M =[s0,s1,s2,s3]=[1,0,0,1], Es0 is generated from s0, that is Generate Es1 from s1, that is Generate Es2 from s2, that is Generate Es3 from s3, that is

[0501] Optionally, the value of at least one of B1, B2 and B3 is the same as the number of time-domain sampling points occupied by the CP in the OFDM symbol.

[0502] Optionally, for The last B3 data elements in the .

[0503] Optionally, A0+A1+B1+A2+B2+A3+B3=K, where K is the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0504] Optionally, A0=A1=A2=A3.

[0505] When S M =[s0,s1,s2,s3]=[0,1,1,0], Es0 is generated from s0, that is Generate Es1 from s1, that is Generate Es2 from s2, that is Generate Es3 from s3, that is

[0506] Optionally, the value of at least one of B1, B2 and B3 is the same as the number of time-domain sampling points occupied by the CP in the OFDM symbol.

[0507] Optionally, for The last B1 data element in the .

[0508] Optionally, for The last B2 data elements in the .

[0509] Optionally, A0+A1+B1+A2+B2+A3+B3=K, where K is the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0510] Optionally, A0=A1=A2=A3.

[0511] Step 2-2: According to formula Q k =[Es0,Es1,Es2,Es3] generates data information Q k (ie the second sub-information).

[0512] When S M =[s0,s1,s2,s3]=[1,0,0,1], the generated data information Q k As shown in Figure 16.

[0513] When S M =[s0,s1,s2,s3]=[0,1,1,0], the generated data information Q k As shown in Figure 17.

[0514] Step 3: Q k Perform K-point DFT / FFT operation to obtain data information D k .

[0515] Furthermore, the data information D k Perform at least one of the following operations:

[0516] To D k Perform upward circular shift operation, the size of the circular shift is or or K / 2;

[0517] To D k Performs the FFTSHIFT operation, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0518] in, is the ceiling operator, is the floor operator.

[0519] Step 4: Data information D k Fill it onto K subcarriers in the frequency domain. When the overall frequency domain bandwidth of the system includes N subcarriers, an N-point Inverse Discrete Fourier Transform (IDFT) / Inverse Fast Fourier Transform (IFFT) operation is performed on the filling data on the N subcarriers to obtain the time domain data T of N sampling points. N =[t0,t1,t2,t3,…,tN-1 ]. Wherein, N is greater than or equal to 1.

[0520] Among them, T N =[t0,t1,t2,t3,…,t N-1 ] is the sampling point data of M OOK time domain symbols.

[0521] Among them, [t0,t1,t2,t3,…,t N / M-1 ] is the sampling point data of the first OOK time domain symbol in M ​​OOK time domain symbols, [t N / M ,t N / M+1 ,…,t 2N / M-1 ] is the sampling point data of the second OOK time domain symbol in M ​​OOK time domain symbols, and so on, [t (M-1)N / M ,t(M-1)N / M+1,…,t N-1 ] is the sampling point data of the Mth OOK time domain symbol among M OOK time domain symbols.

[0522] Furthermore, before performing the N-point IDFT / IFFT operation, at least one of the following operations may be performed on the data padded on the N subcarriers:

[0523] Perform an upward circular shift operation on the data, and the size of the circular shift is or or N / 2;

[0524] Performs an FFTSHIFT operation on the data, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0525] Step 5: You can also perform time domain data T of N sampling points N As the third sub-information, the fourth sub-information is generated after data processing. The specific process of generating the fourth sub-information based on the third sub-information can refer to the relevant description of the above embodiment.

[0526] Step 6: Time domain data T of N sampling points N Before sending, you can also perform an additional CP operation, that is, the time domain data T of N sampling points N The N at the end of CP The information of each sampling point is copied to the time domain data T of N sampling points N The head of the form (N+N CP ) sampling points, and then the (N+N CP) sampling points’ time domain data are sent out.

[0527] Example 8:

[0528] The information length carried by the second signal (such as LP-WUS) when it is sent is 16 bits, expressed as: B LB =[b0,b1,b2,b3,b4,b5,b6,b7,b8,b9,b 10 ,b 11 ,b 12 ,b 13 ,b 14 ,b 15 ]. Among them, b0, b1, b2, b3, b4, b5, b6, b7 are the source information bits, and b8, b9, b 10 ,b 11 ,b 12 ,b 13 ,b 14 ,b 15 CRC bits. LP-WUS occupies at least one OFDM symbol during transmission.

[0529] To B LB Each bit b in i Perform Manchester encoding. The code rate of Manchester encoding is 1 / 4. The Manchester encoding rules are:

[0530] b i = 0, the code generated by Manchester encoding is [0,1,0,1], b i When =1, the code generated after Manchester encoding is [1,0,1,0].

[0531] or,

[0532] b i =0, the code generated after Manchester encoding is [1,0,1,0], b i When =1, the code generated after Manchester encoding is [0,1,0,1].

[0533] or,

[0534] b i = 0, the code generated by Manchester encoding is [1,0,0,1], b i When =1, the code generated after Manchester encoding is [0,1,1,0].

[0535] or,

[0536] b i= 0, the code generated by Manchester encoding is [0,1,1,0], b i When =1, the code generated after Manchester encoding is [1,0,0,1].

[0537] In this embodiment, the Manchester encoding rule is selected as:

[0538] b i = 0, the code generated by Manchester encoding is [0,1,1,0], b i When =1, the code generated after Manchester encoding is [1,0,0,1].

[0539] In this embodiment, b i The Manchester-encoded codeword is sent in one OFDM symbol, and the generated time domain signal process may include at least the following steps:

[0540] Step 1: b i The codeword after Manchester encoding is sent in one OFDM symbol, where the codeword length is 4 and the codeword is defined as S M (i.e. the first sub-information), S M =[s0,s1,s2,s3].

[0541] In this embodiment, S M =[s0,s1,s2,s3]=[0,1,1,0], or S M =[s0,s1,s2,s3]=[1,0,0,1].

[0542] Step 2-1: When S M =[s0,s1,s2,s3]=[1,0,0,1], Es0 is generated from s0, that is Generate Es1 from s1, that is Generate Es2 from s2, that is Generate Es3 from s3, that is

[0543] Optionally, the value of at least one of B1, B2 and B3 is the same as the number of time-domain sampling points occupied by the CP in the OFDM symbol.

[0544] Optionally, for The last B3 data elements in the .

[0545] Optionally, for The last B2 data elements in the .

[0546] Optionally, for The last B1 data element in the .

[0547] Optionally, A0+A1+B1+A2+B2+A3+B3=K, where K is the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0548] Optionally, A0=A1=A2=A3.

[0549] When S M =[s0,s1,s2,s3]=[0,1,1,0], Es0 is generated from s0, that is Generate Es1 from s1, that is Generate Es2 from s2, that is Generate Es3 from s3, that is

[0550] Optionally, the value of at least one of B1, B2 and B3 is the same as the number of time-domain sampling points occupied by the CP in the OFDM symbol.

[0551] Optionally, for The last B1 data element in the .

[0552] Optionally, for The last B2 data elements in the .

[0553] Optionally, for The last B3 data elements in the .

[0554] Optionally, A0+A1+B1+A2+B2+A3+B3=K, where K is the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0555] Optionally, A0=A1=A2=A3.

[0556] Step 2-2: According to formula Q k =[Es0,Es1,Es2,Es3] generates data information Q k (ie the second sub-information).

[0557] When S M =[s0,s1,s2,s3]=[1,0,0,1], the generated data information Qk As shown in Figure 18.

[0558] When S M =[s0,s1,s2,s3]=[0,1,1,0], the generated data information Q k As shown in Figure 19.

[0559] Step 3: Q k Perform K-point DFT / FFT operation to obtain data information D k .

[0560] Furthermore, the data information D k Perform at least one of the following operations:

[0561] To D k Perform upward circular shift operation, the size of the circular shift is or or K / 2;

[0562] To D k Performs the FFTSHIFT operation, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0563] in, is the ceiling operator, is the floor operator.

[0564] Step 4: Data information D k Fill it onto K subcarriers in the frequency domain. When the overall frequency domain bandwidth of the system includes N subcarriers, an N-point Inverse Discrete Fourier Transform (IDFT) / Inverse Fast Fourier Transform (IFFT) operation is performed on the filling data on the N subcarriers to obtain the time domain data T of N sampling points. N =[t0,t1,t2,t3,…,t N-1 ]. Wherein, N is greater than or equal to 1.

[0565] Among them, T N =[t0,t1,t2,t3,…,t N-1 ] is the sampling point data of M OOK time domain symbols.

[0566] Among them, [t0,t1,t2,t3,…,t N / M-1 ] is the sampling point data of the first OOK time domain symbol in M ​​OOK time domain symbols, [t N / M ,t N / M+1 ,…,t 2N / M-1 ] is the sampling point data of the second OOK time domain symbol in M ​​OOK time domain symbols, and so on, [t (M-1)N / M ,t(M-1)N / M+1,…,t N-1 ] is the sampling point data of the Mth OOK time domain symbol among M OOK time domain symbols.

[0567] Furthermore, before performing the N-point IDFT / IFFT operation, at least one of the following operations may be performed on the data padded on the N subcarriers:

[0568] Perform an upward circular shift operation on the data, and the size of the circular shift is or or N / 2;

[0569] Performs an FFTSHIFT operation on the data, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0570] Step 5: You can also perform time domain data T of N sampling points N As the third sub-information, the fourth sub-information is generated after data processing. The specific process of generating the fourth sub-information based on the third sub-information can refer to the relevant description of the above embodiment.

[0571] Step 6: Time domain data T of N sampling points N Before sending, you can also perform an additional CP operation, that is, the time domain data T of N sampling points N The N at the end of CP The information of each sampling point is copied to the time domain data T of N sampling points N The head of the form (N+N CP ) sampling points, and then the (N+N CP ) sampling points’ time domain data are sent out.

[0572] Example 9:

[0573] The information length carried by the second signal (such as LP-WUS) when it is sent is 16 bits, expressed as: B LB=[b0,b1,b2,b3,b4,b5,b6,b7,b8,b9,b 10 ,b 11 ,b 12 ,b 13 ,b 14 ,b 15 ]. Among them, b0, b1, b2, b3, b4, b5, b6, b7 are the source information bits, and b8, b9, b 10 ,b 11 ,b 12 ,b 13 ,b 14 ,b 15 CRC bits. LP-WUS occupies at least one OFDM symbol during transmission.

[0574] To B LB Each bit b in i Perform Manchester encoding. The code rate of Manchester encoding is 1 / 4. The Manchester encoding rules are:

[0575] b i = 0, the code generated by Manchester encoding is [0,1,0,1], b i When =1, the code generated after Manchester encoding is [1,0,1,0].

[0576] or,

[0577] b i =0, the code generated after Manchester encoding is [1,0,1,0], b i When =1, the code generated after Manchester encoding is [0,1,0,1].

[0578] or,

[0579] b i = 0, the code generated by Manchester encoding is [1,0,0,1], b i When =1, the code generated after Manchester encoding is [0,1,1,0].

[0580] or,

[0581] b i = 0, the code generated by Manchester encoding is [0,1,1,0], b i When =1, the code generated after Manchester encoding is [1,0,0,1].

[0582] In this embodiment, the Manchester encoding rule is selected as:

[0583] b i = 0, the code generated by Manchester encoding is [0,1,1,0], b i When =1, the code generated after Manchester encoding is [1,0,0,1].

[0584] In this embodiment, b i The Manchester-encoded codeword is sent in one OFDM symbol, and the generated time domain signal process may include at least the following steps:

[0585] Step 1: b i The codeword after Manchester encoding is sent in one OFDM symbol, where the codeword length is 4 and the codeword is defined as S M (i.e. the first sub-information), S M =[s0,s1,s2,s3].

[0586] In this embodiment, S M =[s0,s1,s2,s3]=[0,1,1,0], or S M =[s0,s1,s2,s3]=[1,0,0,1].

[0587] Step 2-1: When S M =[s0,s1,s2,s3]=[1,0,0,1], Es0 is generated from s0, that is Generate Es1 from s1, that is Generate Es2 from s2, that is Generate Es3 from s3, that is

[0588] Optionally, the value of at least one of B1, B2 and B3 is the same as the number of time-domain sampling points occupied by the CP in the OFDM symbol.

[0589] Optionally, for The last B3 data elements in the .

[0590] Optionally, for The last B2 data elements in the .

[0591] Optionally, for The last B1 data element in the .

[0592] Optionally, A0+A1+B1+A2+B2+A3+B3=K, where K is the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0593] Optionally, A0=A1=A2=A3.

[0594] When S M =[s0,s1,s2,s3]=[0,1,1,0], Es0 is generated from s0, that is Generate Es1 from s1, that is Generate Es2 from s2, that is Generate Es3 from s3, that is

[0595] Optionally, the value of at least one of B1, B2 and B3 is the same as the number of time-domain sampling points occupied by the CP in the OFDM symbol.

[0596] Optionally, for The last B1 data element in the .

[0597] Optionally, for The last B3 data elements in the .

[0598] Optionally, as well as It forms a ZC sequence, M sequence, PN sequence or a repetition of these sequences.

[0599] Optionally, A0+A1+B1+A2+B2+A3+B3=K, where K is the number of subcarriers occupied by the second signal in the frequency domain. Optionally, the number of subcarriers corresponding to the guard bandwidth configured for the second signal in the frequency domain is not counted in the K subcarriers.

[0600] Optionally, A0=A1=A2=A3.

[0601] Step 2-2: According to formula Q k =[Es0,Es1,Es2,Es3] generates data information Q k (ie the second sub-information).

[0602] When S M =[s0,s1,s2,s3]=[1,0,0,1], the generated data information Q k As shown in Figure 20.

[0603] When S M=[s0,s1,s2,s3]=[0,1,1,0], the generated data information Q k As shown in Figure 21.

[0604] Step 3: Q k Perform K-point DFT / FFT operation to obtain data information D k .

[0605] Furthermore, the data information D k Perform at least one of the following operations:

[0606] To D k Perform upward circular shift operation, the size of the circular shift is or or K / 2;

[0607] To D k Performs the FFTSHIFT operation, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0608] in, is the ceiling operator, is the floor operator.

[0609] Step 4: Data information D k Fill it onto K subcarriers in the frequency domain. When the overall frequency domain bandwidth of the system includes N subcarriers, an N-point Inverse Discrete Fourier Transform (IDFT) / Inverse Fast Fourier Transform (IFFT) operation is performed on the filling data on the N subcarriers to obtain the time domain data T of N sampling points. N =[t0,t1,t2,t3,…,t N-1 ]. Wherein, N is greater than or equal to 1.

[0610] Among them, T N =[t0,t1,t2,t3,…,t N-1 ] is the sampling point data of M OOK time domain symbols.

[0611] Among them, [t0,t1,t2,t3,…,t N / M-1 ] is the sampling point data of the first OOK time domain symbol in M ​​OOK time domain symbols, [t N / M,t N / M+1 ,…,t 2N / M-1 ] is the sampling point data of the second OOK time domain symbol in M ​​OOK time domain symbols, and so on, [t (M-1)N / M ,t(M-1)N / M+1,...,t N-1 ] is the sampling point data of the Mth OOK time domain symbol among M OOK time domain symbols.

[0612] Furthermore, before performing the N-point IDFT / IFFT operation, at least one of the following operations may be performed on the data padded on the N subcarriers:

[0613] Perform an upward circular shift operation on the data, and the size of the circular shift is or or N / 2;

[0614] Performs an FFTSHIFT operation on the data, where FFTSHIFT is a function that shifts the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFTSHIFT(X) swaps the left and right halves of X or the top and bottom halves of X. For a matrix X, FFTSHIFT(X) swaps the first and third quadrants, or the second and fourth quadrants.

[0615] Step 5: You can also perform time domain data T of N sampling points N As the third sub-information, the fourth sub-information is generated after data processing. The specific process of generating the fourth sub-information based on the third sub-information can refer to the relevant description of the above embodiment.

[0616] Step 6: Time domain data T of N sampling points N Before sending, you can also perform an additional CP operation, that is, the time domain data T of N sampling points N The N at the end of CP The information of each sampling point is copied to the time domain data T of N sampling points N The head of the form (N+N CP ) sampling points, and then the (N+N CP ) sampling points’ time domain data are sent out.

[0617] FIG22 is a flow chart of a method for receiving a signal provided in an embodiment of the present application. The method for receiving a signal may be applied to, but not limited to, the second node 120 in the communication system shown in FIG1 . As shown in FIG22 , the method may include, but is not limited to, the following S2201:

[0618] S2201: Receive a first signal, where the first signal occupies at least one time domain symbol in the time domain; wherein a second signal is a signal received in one of the time domain symbols of the first signal, and the second signal is generated by at least a first processing process.

[0619] Optionally, the first signal carries first information; wherein, the first information includes at least one of the following: wake-up signal information, first sequence information, and second sequence information.

[0620] Optionally, the above-mentioned time domain symbol includes one of the following: OOK symbol, MC-OOK symbol, FSK symbol, MC-FSK symbol, OFDM symbol.

[0621] Optionally, the relationship between the above-mentioned first sequence information and the second sequence information includes at least one of the following: the second sequence information is taken from the first sequence information, the first sequence information is a repetition of the second sequence information, the first sequence information is composed of multiple second sequence information, and the first sequence information is composed of multiple second sequence information and their repetitions.

[0622] Optionally, the first signal may be at least one of the following: a wake-up signal, a synchronization signal, and a preamble signal.

[0623] The second signal is a signal transmitted by the first signal in one time domain symbol. For example, when the first signal is used as a wake-up signal, the second signal may be a time domain expression of the wake-up signal on one time domain symbol.

[0624] Optionally, the second signal is generated through a first processing process at least based on the first sub-information.

[0625] Optionally, the position information of the first signal in the time domain is indicated by at least one of the following: first position indication information, second position indication information, and third position indication information; wherein, within a sending cycle or a sending time window of a first signal, at least one resource for sending the first signal is configured.

[0626] Optionally, the first position indication information is at least one of the following: the offset of the starting position of the resources of the first signal relative to the starting position of the DRX cycle, the offset of the starting position of the resources of the first signal relative to the starting position of the PF in the DRX cycle, the offset of the starting position of the resources of the first signal relative to the starting position of the PO in the DRX cycle, and the offset of the starting position of the resources of the first signal relative to the starting position of the first signal sending cycle.

[0627] Optionally, when multiple PFs are configured in a DRX cycle, the first position indication information is an offset of the starting position of the resource of the first signal relative to the starting position of the first PF in the DRX cycle.

[0628] Optionally, when multiple POs are configured in a PF in a DRX cycle, the first position indication information is the offset of the starting position of the resource of the first signal relative to the starting position of the first PO in the first PF in the DRX cycle.

[0629] Optionally, the second position indication information is at least one of the following: the offset of the cut-off position of the resources of the first signal relative to the start position of the DRX cycle, the offset of the cut-off position of the resources of the first signal relative to the start position of PF in the DRX cycle, the offset of the cut-off position of the resources of the first signal relative to the start position of PO in the DRX cycle, the offset of the cut-off position of the resources of the first signal relative to the start position of the first signal sending cycle, and the offset of the cut-off position of the resources of the first signal relative to the start position of OnDuration in the DRX cycle.

[0630] Optionally, when multiple PFs are configured in a DRX cycle, the second position indication information is an offset of the cutoff position of the resource of the first signal relative to the starting position of the first PF in the DRX cycle.

[0631] Optionally, when multiple POs are configured in a PF in a DRX cycle, the second position indication information is the offset of the cutoff position of the resource of the first signal relative to the starting position of the first PO in the first PF in the DRX cycle.

[0632] Optionally, within a sending cycle of the first signal, within the position indicated by the second position indication information, the following operation is performed: the first signal is not detected.

[0633] Optionally, the third position indication information is at least one of the following: the offset of the starting position of the sending period of the first signal relative to the starting position of the DRX cycle, the offset of the starting position of the sending period of the first signal relative to the starting position of PF in the DRX cycle, the offset of the starting position of the sending period of the first signal relative to the starting position of PO in the DRX cycle, and the offset of the starting position of the sending period of the first signal relative to the starting position of OnDuration in the DRX cycle.

[0634] Optionally, when multiple PFs are configured in a DRX cycle, the third position indication information is an offset of a starting position of a sending period of the first signal relative to a starting position of a first PF in the DRX cycle.

[0635] Optionally, when multiple POs are configured in a PF in a DRX cycle, the third position indication information is the offset of the starting position of the sending period of the first signal relative to the starting position of the first PO in the first PF in the DRX cycle.

[0636] Optionally, the quantization unit in the first position indication information, the second position indication information and the third position indication information is at least one of the following: an OFDM symbol, an OOK symbol, a time slot, a subframe and a frame.

[0637] Optionally, the length of the quantization unit is determined at least by the subcarrier spacing size.

[0638] Optionally, when the partial bandwidth BWP where the DRX cycle is located is different from the BWP where the first signal is located or is configured separately, the subcarrier spacing is at least one of the following: the subcarrier spacing corresponding to the BWP where the first signal is located, the subcarrier spacing corresponding to the BWP where the DRX cycle is located, and the subcarrier spacing corresponding to the BWP where the paging information is located.

[0639] The technical solution provided by the embodiment of the present application receives a first signal to facilitate further application of the first signal. Since the first signal occupies at least one time domain symbol in the time domain, when the first signal is used as a wake-up signal, a shorter wake-up period can be configured for the wake-up signal according to the occupied time domain symbol, thereby reducing the wake-up signal delay while meeting the power consumption requirements of the user equipment.

[0640] It should be noted that, since the relevant embodiments of the above-mentioned signal receiving method and the relevant embodiments of the above-mentioned signal sending method belong to the same inventive concept, the only difference is the different execution subjects, that is, the execution subject of the above-mentioned signal sending method is the first node 110, and the execution subject of the above-mentioned signal receiving method is the second node 120. Therefore, the specific implementation methods of the relevant embodiments of the above-mentioned signal receiving method can refer to the specific implementation methods of the signal sending method in the above-mentioned embodiments. In order to avoid redundancy, this part of the specific implementation methods will not be repeated here.

[0641] In one embodiment, a communication node is also provided, which may be the first node 110 or the second node 120 described above. The internal structure diagram of the communication node may be shown in FIG23 . The communication node includes a processor, a memory, a network interface, and a database connected via a system bus. The processor of the communication node is configured to provide computing and control capabilities. The memory of the communication node includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of the operating system and computer program in the non-volatile storage medium. The database of the communication node is configured to store data generated during the transmission and reception of signals. The network interface of the communication node is configured to communicate with an external terminal via a network connection. When executed by the processor, the computer program implements a method for transmitting and receiving signals.

[0642] Those skilled in the art will understand that the structure shown in Figure 23 is merely a block diagram of a partial structure related to the scheme of the present application, and does not constitute a limitation on the communication node to which the scheme of the present application is applied. The specific communication node may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

[0643] An embodiment of the present application also provides a computer-readable storage medium, on which a computer program is stored. When the computer program is executed by a processor, the method for sending a signal in any of the aforementioned embodiments is implemented, or the method for receiving a signal in any of the aforementioned embodiments is implemented.

[0644] In addition, an embodiment of the present application also discloses a computer program product, including a computer program or computer instructions, which are stored in a computer-readable storage medium. The processor of a computer device reads the computer program or computer instructions from the computer-readable storage medium, and the processor executes the computer program or computer instructions, so that the computer device executes the signal sending method as in any of the foregoing embodiments, or executes the signal receiving method as in any of the foregoing embodiments.

[0645] The computer storage medium of the embodiment of the present application can adopt any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. The computer-readable storage medium can be, for example, but not limited to: an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. Computer-readable storage media include (non-exhaustive list): an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM), a flash memory, an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present application, a computer-readable storage medium can be any tangible medium containing or storing a program, which can be used by an instruction execution system, device or device or used in combination with it.

[0646] A computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, the data signal carrying computer-readable program code. Such propagated data signals may take various forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transfer a program for use by or in conjunction with an instruction execution system, apparatus, or device.

[0647] The program code contained on the computer-readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wire, optical cable, radio frequency (RF), etc., or any suitable combination of the foregoing.

[0648] Computer program code for performing the operations of the present disclosure may be written in one or more programming languages ​​or a combination of multiple programming languages, including object-oriented programming languages ​​(such as Java, Smalltalk, C++, Ruby, Go), and conventional procedural programming languages ​​(such as "C" or similar programming languages). The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0649] It will be appreciated by those skilled in the art that the term user terminal covers any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable web browser or a vehicle-mounted mobile station.

[0650] In general, various embodiments of the present application may be implemented in hardware or dedicated circuits, software, logic, or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that can be executed by a controller, microprocessor, or other computing device, although the present application is not limited thereto.

[0651] Embodiments of the present application may be implemented by executing computer program instructions by a data processor of a mobile device, for example, in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages.

[0652] The block diagram of any logical flow in the drawings of this application may represent program steps, or may represent interconnected logical circuits, modules and functions, or may represent a combination of program steps and logical circuits, modules and functions. A computer program may be stored on a memory. The memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random access memory (RAM), optical memory devices and systems (digital versatile discs (DVD) or compact disks (CD)), etc. Computer-readable media may include non-transitory storage media. The data processor may be of any type suitable for the local technical environment, such as, but not limited to, a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a programmable logic device (FPGA), and a processor based on a multi-core processor architecture.

Claims

1. A method for transmitting a signal, comprising: Sending a first signal, where the first signal occupies at least one time domain symbol in the time domain; The second signal is a signal of the first signal sent in one of the time domain symbols, and the second signal is generated at least through the first processing process.

2. The method according to claim 1, wherein The first signal carries first information; wherein the first information includes at least one of the following: Wake-up signal information; First sequence information; Second sequence information.

3. The method according to claim 1, wherein The second signal is generated through a first processing procedure based on at least the first sub-information.

4. The method according to claim 3, wherein: The first processing process includes: Second sub-information having a second value length is generated according to first sub-information having a first value length.

5. The method according to claim 4, wherein: The second value is at least one of the following: the number of subcarriers occupied by the second signal in the frequency domain; the number of subcarriers configured for the second signal in the frequency domain; the number of subcarriers occupied by the first signal in the frequency domain; The number of subcarriers configured for the first signal in the frequency domain.

6. The method according to claim 4, wherein: The first sub-information includes at least one of the following: information carried in the second signal; Information in the first information and carried in the second signal.

7. The method according to claim 4, wherein: Generating the second sub-information having a second value in length according to the first sub-information having a first value in length includes at least one of the following: generating a first data element sequence according to each first data element in the first sub-information having a length of the first value; Second sub-information having a second value length is generated based on each first data element sequence.

8. The method according to claim 7, wherein: The process of generating the first data element sequence includes one of the following: generating a first sequence of data elements based on the first number of first data elements; generating a first data element sequence based on a first number of first data elements and a second number of second data elements; wherein the second number of second data elements is located at the head of the first data element sequence; generating a first data element sequence based on a first number of first data elements and a third number of third data elements; wherein the third number of third data elements is located at the end of the first data element sequence; generating a first data element sequence based on a first number of first data elements, a second number of second data elements, and a third number of third data elements; wherein the second number of second data elements are located at the head of the first data element sequence, and the third number of third data elements are located at the end of the first data element sequence; generating a first data element sequence based on the first number of first data elements and third sequence information; generating a first data element sequence based on a first number of first data elements, third sequence information, and a second data element sequence; wherein the second data element sequence is located at a head of the first data element sequence; generating a first data element sequence based on the first number of first data elements, the third sequence information, and the third data element sequence; wherein the third data element sequence is located at the end of the first data element sequence; A first data element sequence is generated based on a first number of first data elements, third sequence information, a second data element sequence, and a third data element sequence; wherein the second data element sequence is located at the head of the first data element sequence, and the third data element sequence is located at the tail of the first data element sequence.

9. The method according to claim 8, wherein The value of the second data element and the third data element is one of the following: a zero element, the first data element, a predefined element, and a configured element.

10. The method according to claim 8, wherein The second sequence of data elements includes one of the following: the second number of zero elements; a second number of data elements in a result of multiplying the first number of first data elements and the third sequence information; the last second number of data elements in the product of multiplying the first number of first data elements by the third sequence information; a second number of data elements in the third sequence information; The second most recent data element in the third sequence information.

11. The method according to claim 8, wherein The third sequence of data elements includes one of the following: the third number of zero elements; a third number of data elements in a result of multiplying the first number of first data elements and the third sequence information; a third number of data elements at the beginning of a product of multiplying the first number of first data elements by the third sequence information; a third number of data elements in the third sequence information; The first third number of data elements in the third sequence information.

12. The method according to claim 8, wherein The third sequence information includes at least one of the following: The third sequence information is composed of the fourth sequence information; The third sequence information consists of the fourth sequence information and the fifth sequence information; The third sequence information is composed of the fourth sequence information and the sixth sequence information; The third sequence information consists of fourth sequence information, fifth sequence information and sixth sequence information.

13. The method according to claim 12, wherein: The fourth sequence information includes one of the following: ZC sequence, random M sequence, pseudo-noise PN sequence and repetition of each sequence.

14. The method according to claim 12, wherein: The fifth sequence information includes one of the following: the fourth number of zero elements; the first fourth number of data elements in the fourth sequence information; The fourth number of data elements has preset values.

15. The method according to claim 12, wherein: The sixth sequence information includes one of the following: the fifth number of zero elements; The fifth most recent data element in the fourth sequence of information; The fifth number of data elements has a preset value.

16. The method according to claim 1, wherein The first processing process includes: The fourth sub-information is generated based on the third sub-information.

17. The method according to claim 16, wherein Generating the fourth sub-information based on the third sub-information includes at least one of the following: generating a fifth data element sequence based on each fourth data element sequence in the third sub-information; The fourth sub-information is generated based on each fifth data element sequence.

18. The method according to claim 17, wherein The generation process of the fifth data element sequence includes at least one of the following: Remove the first sixth number of data elements from the fourth sequence of data elements; removing the last seventh number of data elements in the fourth sequence of data elements; removing the first sixth number of data elements and the last seventh number of data elements from the fourth data element sequence; replacing the first sixth number of data elements in the fourth sequence of data elements with zero elements; replacing the last seventh number of data elements in the fourth sequence of data elements with zero elements; replacing the first sixth number of data elements and the last seventh number of data elements in the fourth sequence of data elements with zero elements; replacing the first sixth number of data elements in the fourth sequence of data elements with zero elements, and removing the last seventh number of data elements in the fourth sequence of data elements; The first sixth number of data elements in the fourth data element sequence are removed, and the last seventh number of data elements in the fourth data element sequence are replaced with zero elements.

19. The method according to claim 16, wherein The length of the third sub-information is equal to the number of sub-carriers included in the system bandwidth.

20. The method according to claim 1, wherein The first processing process includes: The sixth sub-information is generated based on the fifth sub-information.

21. The method according to claim 20, wherein Generating the sixth sub-information based on the fifth sub-information includes at least one of the following: generating a seventh data element sequence according to each sixth data element sequence in the fifth sub-information; Sixth sub-information is generated based on each seventh data element sequence.

22. The method according to claim 21, wherein The generation process of the seventh data element sequence includes at least one of the following: adding a seventh number of data elements from the rear of a sixth sequence of data elements to the front of the sixth sequence of data elements; adding a sixth number of data elements from the front of a sixth sequence of data elements to the end of the sixth sequence of data elements; adding the first sixth number of data elements in the sixth sequence of data elements to the end of the sixth sequence of data elements, and adding the last seventh number of data elements in the sixth sequence of data elements to the beginning of the sixth sequence of data elements; adding a seventh number of zero elements to the front of the sixth sequence of data elements; adding a sixth number of zero elements to the end of the sixth sequence of data elements; adding a seventh number of zero elements to the front of the sixth sequence of data elements, and adding a sixth number of zero elements to the back of the sixth sequence of data elements; adding a seventh number of data elements from the end of a sixth sequence of data elements to the front of the sixth sequence of data elements, and adding a sixth number of zero elements to the end of the sixth sequence of data elements; A seventh number of zero elements is added to the front of the sixth sequence of data elements, and a sixth number of data elements from the front of the sixth sequence of data elements is added to the back of the sixth sequence of data elements.

23. The method according to claim 20, wherein The length of the fifth sub-information is smaller than the number of sub-carriers included in the system bandwidth.

24. The method according to any one of claims 1 to 23, wherein The time domain symbol includes one of the following: On-off keying modulation OOK symbols, multi-carrier on-off keying modulation MC-OOK symbols, frequency shift keying modulation FSK symbols, multi-carrier frequency shift keying modulation MC-FSK symbols, orthogonal frequency division multiplexing OFDM symbols.

25. The method according to any one of claims 2 to 23, comprising at least one of the following: The second sequence information is obtained from the first sequence information; The first sequence information is a repetition of the second sequence information; The first sequence information is composed of a plurality of second sequence information; The first sequence information is composed of a plurality of second sequence information and repetitions thereof.

26. The method according to claim 1, wherein The position information of the first signal in the time domain is indicated by at least one of the following: first position indication information; second position indication information; third position indication information; In which, within a sending cycle or a sending time window of a first signal, at least one resource for sending the first signal is configured.

27. The method according to claim 26, wherein The first position indication information is at least one of the following: An offset of a starting position of a resource of the first signal relative to a starting position of a discontinuous reception (DRX) cycle; An offset of a starting position of resources of the first signal relative to a starting position of a paging frame PF in a DRX cycle; An offset of a starting position of resources of the first signal relative to a starting position of a paging occasion PO in a DRX cycle; The offset of the starting position of the resource of the first signal relative to the starting position of the first signal sending period.

28. The method according to claim 27, wherein In response to configuring multiple PFs in the DRX cycle, the first position indication information is an offset of the starting position of the resource of the first signal relative to the starting position of the first PF in the DRX cycle.

29. The method according to claim 27, wherein In response to configuring multiple POs in a PF in a DRX cycle, the first position indication information is the offset of the starting position of the resource of the first signal relative to the starting position of the first PO in the first PF in the DRX cycle.

30. The method of claim 26, wherein: The second position indication information is at least one of the following: an offset of a cutoff position of resources of the first signal relative to a start position of a DRX cycle; an offset of a cutoff position of resources of the first signal relative to a PF start position in a DRX cycle; an offset of a cutoff position of resources of the first signal relative to a start position of PO in a DRX cycle; an offset of a cutoff position of resources of the first signal relative to a start position of a transmission period of the first signal; The offset of the cut-off position of the resource of the first signal relative to the start position of the duration OnDuration in the DRX cycle.

31. The method according to claim 30, wherein In response to configuring multiple PFs in the DRX cycle, the second position indication information is an offset of the cutoff position of the resource of the first signal relative to the starting position of the first PF in the DRX cycle.

32. The method according to claim 30, wherein In response to configuring multiple POs in a PF in a DRX cycle, the second position indication information is the offset of the cutoff position of the resource of the first signal relative to the starting position of the first PO in the first PF in the DRX cycle.

33. The method according to claim 30, wherein During a transmission cycle of the first signal, at the location indicated by the second location indication information, perform at least one of the following operations: The terminal does not detect the first signal; The base station does not send the first signal; The base station does not configure the first signal.

34. The method of claim 26, wherein: The third position indication information is at least one of the following: an offset of a start position of a transmission period of the first signal relative to a start position of a DRX cycle; an offset of a starting position of a transmission period of the first signal relative to a starting position of a PF in a DRX cycle; an offset of a starting position of a transmission period of the first signal relative to a starting position of a PO in a DRX cycle; The offset of the starting position of the transmission period of the first signal relative to the starting position of OnDuration in the DRX cycle.

35. The method according to claim 34, wherein In response to configuring multiple PFs in the DRX cycle, the third position indication information is an offset of a starting position of a sending period of the first signal relative to a starting position of a first PF in the DRX cycle.

36. The method of claim 34, wherein: In response to configuring multiple POs in a PF in the DRX cycle, the third position indication information is the offset of the starting position of the sending period of the first signal relative to the starting position of the first PO in the first PF in the DRX cycle.

37. The method of claim 26, wherein: The quantization units in the first position indication information, the second position indication information, and the third position indication information are at least one of the following: One OFDM symbol, one OOK symbol, one slot, one subframe, and one frame.

38. The method of claim 37, wherein: The length of the quantization unit is determined at least by the subcarrier spacing.

39. The method according to claim 38, wherein In response to the partial bandwidth BWP where the DRX cycle is located and the BWP where the first signal is located being different from or configured separately, the subcarrier spacing is at least one of the following: The subcarrier spacing corresponding to the BWP where the first signal is located; The subcarrier spacing corresponding to the BWP where the DRX cycle is located; The subcarrier spacing corresponding to the BWP where the paging information is located.

40. A method for receiving a signal, comprising: receiving a first signal, where the first signal occupies at least one time domain symbol in the time domain; The second signal is a signal received in one of the time domain symbols of the first signal, and the second signal is generated at least through a first processing process.

41. A communication node comprising: A memory and a processor, wherein the memory stores a computer program, and when the processor executes the computer program, the method according to any one of claims 1 to 40 is implemented.

42. A storage medium storing a computer program, wherein when the computer program is executed by a processor, the method according to any one of claims 1 to 40 is implemented.

Images