Communication method and apparatus

Abstract

A communication method and an apparatus, which are applied to the technical field of mobile communications, and are used for improving the coverage performance of wake-up signals. The method comprises: a first apparatus generates second information, the second information being determined on the basis of an m-sequence, the m-sequence being determined on the basis of first information and a first recursion formula, the first recursion formula being related to the length of the first information and / or the first recursion formula being related to a code length, and the length of the second information being the code length; and the first apparatus sends a wake-up signal, the wake-up signal carrying the second information.

Description

A communication method and apparatus

[0001] Cross-reference to related applications

[0002] This application claims priority to Chinese Patent Application No. 202510185709.1, filed on February 19, 2025, entitled "A Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0003] This application relates to the field of mobile communication technology, and in particular to a communication method and apparatus. Background Technology

[0004] To reduce terminal power consumption, a working mode using a main link and a wake-up link is proposed. This mode is implemented as follows: after receiving a wake-up signal (WUS) from the base station via the wake-up link, the terminal wakes up the main link and monitors the control channel through the main link to obtain scheduling information carried on the control channel. Based on this scheduling information, the terminal performs transmission between the terminal and the base station. Currently, the wake-up signal often uses Manchester encoding. Manchester encoding uses waveform amplitude variations to represent the bit value at each bit.

[0005] One issue is the low coverage performance of wake-up signals based on Manchester coding. This can lead to inaccurate detection of the wake-up signal, especially when the received signal power is low, potentially causing the terminal to miss the wake-up signal. On one hand, missed wake-up signals increase transmission latency. On the other hand, to prevent missed wake-up signals, base stations need to transmit the wake-up signal with higher power, increasing base station power consumption. Therefore, improving the coverage performance of wake-up signals is a pressing technical problem that needs to be solved. Summary of the Invention

[0006] This application provides a communication method and apparatus for improving the coverage performance of wake-up signals.

[0007] Firstly, embodiments of this application provide a communication method, which can be executed by a first device. Unless otherwise specified, the "first device" in this application can refer to a communication device (e.g., a network device), a component within that communication device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication device. Taking the first device as the executing entity as an example, the method may include:

[0008] The first device generates second information, which is determined based on an m-sequence. The m-sequence is determined based on the first information and a first recursive formula. The first recursive formula is related to the length of the first information and / or related to the code length. The length of the second information is the code length. The first device sends a wake-up signal, which carries the second information.

[0009] Based on this implementation, the second information carried in the wake-up signal can be obtained from an m-sequence, where the input information of the m-sequence is the first information, and the first recursive formula of the m-sequence is related to the length of the first information and / or the code length. Therefore, the m-sequence can be used to encode the information carried in the wake-up signal. Since the m-sequence has superior autocorrelation, the wake-up signal generated using m-sequence encoding has better coverage performance. Compared to wake-up signals using Manchester encoding, wake-up signals using m-sequence encoding can improve the coverage performance and accuracy of wake-up signal detection. Therefore, without increasing the transmission power of network equipment, it can prevent terminals from missing wake-up signals or reduce the possibility of terminals missing wake-up signals, thus improving transmission reliability and reducing transmission latency.

[0010] In one possible implementation, the wake-up signal is a low-power wake-up signal.

[0011] Based on this implementation method, low-power wake-up signals can be transmitted using m-sequence encoding, thus improving the coverage performance of low-power wake-up signals.

[0012] In one possible implementation, the second information is determined based on an m-sequence, including: the second information is determined based on the m-sequence and a cyclic shift value, the cyclic shift value being related to the length of the first information.

[0013] Based on this implementation, the second information can be determined according to the cyclic shift value and the m-sequence. When the cyclic shift value is greater than 0, the minimum Hamming distance between codewords can be increased at higher code rates, thus ensuring detection performance.

[0014] In one possible implementation, the cyclic shift value and the length of the first information satisfy the following: Where cs represents the cyclic shift value, floor() represents rounding down, K represents the length of the first information, and α is a positive integer; or, cs = βK, where cs represents the cyclic shift value, K represents the length of the first information, and β is a positive integer.

[0015] Based on this implementation method, the cyclic shift value can be reasonably determined according to the length of the first information to ensure that the minimum Hamming distance between codewords is maximized.

[0016] In one possible implementation, the length of the first information satisfies: Wherein, K represents the length of the first information, and N represents the code length.

[0017] Based on this implementation, a cyclic shift value that satisfies the above relationship can be determined when the bit rate is high, or a cyclic shift value greater than 0 can be used to obtain better detection performance.

[0018] In one possible implementation, the length of the first information satisfies: Wherein, K represents the length of the first information, N represents the code length, and the cyclic shift value is 0.

[0019] Based on this implementation, the value can be cyclically shifted to 0 when the bit rate is low, or in other words, cyclic shifting is not required when determining the second information based on the m-sequence.

[0020] In one possible implementation, p is a predefined or preconfigured value.

[0021] In one possible implementation, the length of the first information is less than or equal to a first threshold.

[0022] Based on this implementation, the method provided in this application embodiment can be used to pursue better detection performance when the length of the first information is short. Furthermore, since the detection complexity of the m-sequence increases exponentially with the length of the first information, considering complexity constraints or terminal power consumption constraints, the method provided in this application embodiment is not used when the length of the first information is long.

[0023] In one possible implementation, the first device may determine the first recursive formula from one or more recursive formulas based on the code length and / or the length of the first information.

[0024] This implementation method allows for the reasonable determination of the first recursive formula. One or more recursive formulas can be predefined or pre-configured by the network device.

[0025] Secondly, embodiments of this application provide a communication method, which can be executed by a second communication device. Unless otherwise specified, the "second device" in this application can refer to a communication device (e.g., a terminal), a component within that communication device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the communication device. Taking the second device as the executing entity as an example, the method may include:

[0026] The second device receives a wake-up signal, which carries second information; the second device processes the wake-up signal according to a first recursive formula, which is related to the length of the first information, and / or the first recursive formula is related to the length of the second information. The length of the second information can also be replaced by a code length.

[0027] Based on this implementation, the second information carried in the wake-up signal can be obtained according to an m-sequence, where the input information of the m-sequence is the first information, and the first recursive formula of the m-sequence is related to the length of the first information and / or the code length. Therefore, the m-sequence can be used to encode the information carried in the wake-up signal. Since the m-sequence has superior autocorrelation, the wake-up signal generated using m-sequence encoding has better coverage performance. Compared to wake-up signals using Manchester encoding, wake-up signals using m-sequence encoding can improve the coverage performance and accuracy of wake-up signal detection. Therefore, without increasing the transmission power of network equipment, it can prevent terminals from missing wake-up signals or reduce the possibility of terminals missing wake-up signals, thus improving transmission reliability and reducing transmission latency. The second device can detect the wake-up signal according to the recursive formula.

[0028] In one possible implementation, the wake-up signal is a low-power wake-up signal.

[0029] In one possible implementation, processing the wake-up signal according to the recursive formula includes: generating multiple output information according to the first recursive formula, wherein any output information is determined according to an m-sequence, the m-sequence being determined according to an input information and the first recursive formula; determining the first information according to the cross-correlation result between the second information and the multiple output information, wherein the multiple input information corresponding to the multiple output information includes the first information.

[0030] Based on this implementation method, the second device can determine the first information according to the cross-correlation results between the multiple output information corresponding to the first recursive formula and the second information, so as to achieve reasonable determination of the first information.

[0031] In one possible implementation, the cross-correlation result between the second information and the output information is determined based on the second information, the m-sequence, and a cyclic shift value that is related to the length of the first information.

[0032] Based on this implementation, the second device can determine the cross-correlation result between the second information and the output information according to the second information, the cyclic shift value and any output information, so as to reduce the detection complexity.

[0033] In one possible implementation, the cyclic shift value and the length of the first information satisfy the following: Where cs represents the cyclic shift value, floor() represents rounding down, K represents the length of the first information, and α is a positive integer; or, cs = βK, where cs represents the cyclic shift value, K represents the length of the first information, and β is a positive integer.

[0034] In one possible implementation, the length of the first information satisfies: Where K represents the length of the first information and N represents the length of the second information.

[0035] In one possible implementation, the length of the first information satisfies: Wherein, K represents the length of the first information, N represents the length of the second information, and the cyclic shift value is 0.

[0036] In one possible implementation, p is a predefined or preconfigured value.

[0037] In one possible implementation, the length of the first information is less than or equal to a first threshold.

[0038] In one possible implementation, the second device may also determine the first recursive formula from one or more recursive formulas based on the code length and / or the length of the first information.

[0039] It is understood that the method provided in the second aspect corresponds to the method provided in the first aspect, and the beneficial effects of the relevant technical features in the second aspect can be referred to the description in the first aspect, and the repeated parts will not be repeated.

[0040] Thirdly, a communication device is provided. The device can implement the method described in any possible implementation of any of the first or second aspects described above. The device possesses the functions of the first or second device described above. The device is, for example, a terminal, a functional module within a terminal, a network device, or a functional module within a network device, etc.

[0041] In one optional implementation, the device may include modules corresponding one-to-one with the methods / operations / steps / actions performed in any possible implementation of any of the first to second aspects. These modules may be hardware circuits, software, or a combination of hardware circuits and software. In another optional implementation, the device includes a processing unit (sometimes also called a processing module) and a communication unit (sometimes also called a transceiver module, communication module, etc.). The transceiver unit is capable of both sending and receiving functions. When the transceiver unit performs the sending function, it may be called a sending unit (sometimes also called a sending module); when the transceiver unit performs the receiving function, it may be called a receiving unit (sometimes also called a receiving module). The sending unit and the receiving unit may be the same functional module, which is called the transceiver unit and can perform both sending and receiving functions; or, the sending unit and the receiving unit may be different functional modules, with the transceiver unit being a collective term for these functional modules.

[0042] For example, when the apparatus is used to perform the method described in any one of the first to second aspects, the apparatus may include a communication unit and a processing unit.

[0043] Fourthly, embodiments of this application also provide a communication device, including a processor for executing a computer program (or computer-executable instructions) stored in a memory, such that when the computer program (or computer-executable instructions) is executed, the device performs the method as described in any possible implementation of any of the first to second aspects.

[0044] In one possible implementation, the processor and memory are integrated together;

[0045] In another possible implementation, the memory is located outside the communication device.

[0046] The communication device also includes a communication interface for communicating with other devices, such as sending or receiving data and / or signals. Exemplarily, the communication interface may be a transceiver, circuit, bus, module, or other type of communication interface.

[0047] Fifthly, a computer-readable storage medium is provided for storing a computer program or instructions that, when executed, enable the implementation of the method described in any possible implementation of any of the first to second aspects, and the method shown in any possible implementation of the first aspect.

[0048] A sixth aspect provides a computer program product containing instructions that, when run on a computer, enables the method described in any possible implementation of any of the first to second aspects to be implemented.

[0049] In a seventh aspect, embodiments of this application also provide a communication device for performing the method described in any possible implementation of any of the first to second aspects described above.

[0050] Eighthly, a chip system is provided, comprising logic circuitry (or, as understood, a processor, which may include logic circuitry, etc.), and further comprising input / output interfaces. The input / output interfaces can be used to input messages or to output messages. The input / output interfaces can be the same interface, i.e., the same interface can implement both sending and receiving functions; or, the input / output interface includes an input interface and an output interface, the input interface being used to implement the receiving function, i.e., to receive messages; and the output interface being used to implement the sending function, i.e., to send messages. The logic circuitry can be used to perform operations other than the sending and receiving functions in any possible implementation of any of the first to second aspects described above; the logic circuitry can also be used to transmit messages to the input / output interfaces or to receive messages from other communication devices from the input / output interfaces. The chip system can be used to implement the methods described in any possible implementation of any of the first to second aspects described above. The chip system can be composed of chips or can include chips and other discrete devices.

[0051] Optionally, the chip system may also include a memory, which can be used to store instructions, and the logic circuits can call the instructions stored in the memory to implement the corresponding functions.

[0052] Ninth aspect, a communication method is provided, which may include the method implemented by a first device as shown in the first aspect and any possible implementation thereof, and the method implemented by a second device as shown in the second aspect and any possible implementation thereof.

[0053] In a tenth aspect, a communication system is provided, which may include a first device and a second device. The first device may be used to implement the method shown in the first aspect and any possible implementation thereof, and the second device may be used to implement the method shown in the second aspect and any possible implementation thereof.

[0054] The technical effects brought about by the third to tenth aspects above can be found in the descriptions of the beneficial effects of the corresponding solutions in the first and second aspects above, and will not be repeated here. Attached Figure Description

[0055] Figure 1 is a schematic diagram of the architecture of a wireless communication system provided in an embodiment of this application;

[0056] Figure 2 is a schematic diagram of a method for triggering MR activation using LP-WUS;

[0057] Figure 3 is a schematic diagram of an LP-WUS transmission process;

[0058] Figure 4 is a schematic diagram of the bit and waveform correspondence of a Manchester encoding;

[0059] Figures 5 and 9 are schematic flowcharts of a communication method provided in an embodiment of this application;

[0060] Figure 6 is a schematic diagram of the structure of a linear feedback shift register provided in an embodiment of this application;

[0061] Figure 7 is a schematic diagram of the variation curve of the minimum Hamming distance between the output information of primitive polynomials under different values ​​of K and N provided in an embodiment of this application;

[0062] Figure 8 is a schematic diagram of the variation curve of the minimum Hamming distance between multiple output information of a primitive polynomial under different cyclic shift values ​​provided in an embodiment of this application;

[0063] Figures 10 and 11 are schematic diagrams of the structure of a communication device provided in an embodiment of this application. Detailed Implementation

[0064] This application can be applied to mobile communication systems or mobile network systems. The network architecture and service scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new service scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0065] For example, this application can be applied to fourth-generation mobile communication systems (4G). th generation, 4G), fifth generation mobile communication system (5G) th (generation, 5G), or future-oriented evolutionary systems, etc., without specific limitations.

[0066] In this application embodiment, the number of nouns, unless otherwise specified, refers to "singular nouns or plural nouns," that is, "one or more." "At least one" means one or more, and "more than one" means two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can mean: A exists alone, A and B exist simultaneously, or B exists alone, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship. For example, A / B means: A or B. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c means: a, b, c, a and b, a and c, b and c, or a and b and c, where a, b, and c can be single or multiple.

[0067] The ordinal numbers such as "first" and "second" mentioned in the embodiments of this application are used to distinguish multiple objects, and are not used to limit the size, content, order, timing, priority, or importance of the multiple objects. Furthermore, the numbering of steps in the various embodiments described in this application is only to distinguish different steps and is not used to limit the order in which the steps are performed.

[0068] To make the objectives, technical solutions, and advantages of the embodiments of this application clearer, the embodiments of this application will be further described in detail below with reference to the accompanying drawings.

[0069] In this embodiment, the terminal is a device with wireless transceiver capabilities, which can be a fixed device, a mobile device, a handheld device (e.g., a mobile phone), a wearable device, an in-vehicle device, or a wireless device (e.g., a communication module, a modem, or a chip system, etc.) built into the aforementioned devices. The terminal is used to connect people, objects, or machines, and can be widely used in various scenarios, including but not limited to the following: sensing scenarios, cellular communication, device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, machine-to-machine / machine-type (M2M / MTC) communication, Internet of Things (IoT), virtual reality (VR), augmented reality (AR), industrial control, self-driving, remote medical care, smart grid, smart furniture, smart office, smart wearables, smart transportation, smart city, drones, robots, and indoor commercial scenarios (such as mobile phone screen mirroring, file sharing, and mobile phone to VR glasses video transmission). When the terminal is used in V2X, it can also be called a V2X device, such as a smart car, digital car, unmanned car, driverless car, pilotless car, or automobile, self-driving car, or autonomous car, pure electric vehicle (EV), hybrid electric vehicle (HEV), range-extended electric vehicle (REEV), plug-in hybrid electric vehicle (PHEV), new energy vehicle, or roadside unit (RSU). The terminal can also be a device in D2D communication, such as an electricity meter or water meter.

[0070] Furthermore, in this embodiment, the terminal can also be a terminal in an Internet of Things (IoT) system. IoT is an important component of future information technology development, and its main technical feature is to connect objects to the network through communication technology, thereby realizing an intelligent network of human-machine interconnection and object-to-object interconnection.

[0071] The various terminals described above, if located in a vehicle (e.g., placed inside or installed inside a vehicle), can all be considered vehicle-mounted terminals, also known as on-board units (OBUs). The terminal in this application can also be an on-board module, on-board unit, on-board component, on-board chip, or on-board unit built into a vehicle as one or more components or units. The vehicle can implement the methods of this application through the built-in on-board module, on-board component, on-board chip, or on-board unit.

[0072] The terminal may sometimes be referred to as UE, terminal, access station, UE station, remote station, wireless communication equipment, or user equipment, etc.

[0073] In this application embodiment, the communication device used to implement the terminal function can be a terminal device. This terminal device can be a terminal itself, or it can be a device capable of supporting the terminal in implementing this function, such as a chip system. This device can be installed in the terminal. In the technical solutions provided in this application embodiment, the terminal device is used as an example to describe the technical solutions provided in this application embodiment.

[0074] The network devices in this application embodiment include, for example, access network devices (or access network elements) and / or core network devices (or core network elements). The access network devices are devices with wireless transceiver capabilities, used for communicating with the terminal. The access network devices include, but are not limited to, base stations (base transceiver stations, BTS), Node Bs, evolved Node Bs (eNodeBs) / eNBs, or next-generation Node Bs (gNodeBs).

[0075] The access network equipment includes gNBs, transmission reception points (TRPs), current and / or future base stations evolved under the 3rd Generation Partnership Project (3GPP), access nodes, wireless relay nodes, and wireless backhaul nodes in Wi-Fi systems. Base stations can be macro base stations, micro base stations, pico base stations, small cells, relay stations, or readers / writers. Multiple base stations can support networks using the same access technology or networks using different access technologies. A base station can contain one or more co-located or non-co-located transmission and reception points. The access network equipment can also be a radio controller, centralized unit (CU), and / or distributed unit (DU) in a cloud radio access network (CRAN) scenario. The access network equipment can also be a server, etc. For example, network equipment in V2X technology can be a roadside unit (RSU). The following description of access network equipment uses a base station as an example. Base stations can communicate with terminals directly or via relay stations. The terminal can communicate with multiple base stations in different access technologies. The core network equipment is used to implement functions such as mobility management, data processing, session management, policy and charging. The names of the equipment implementing core network functions may differ in systems using different access technologies, and this application does not limit this. Taking a 5G system as an example, the core network equipment may include, for example, access and mobility management functions (AMF), session management functions (SMF), policy control functions (PCF), or user plane functions (UPF), etc.

[0076] In a CU-DU architecture, or in an open RAN (ORAN) system, access network equipment may include one or more logical network elements such as a central unit (CU), a distributed unit (DU), a CU-control plane (CP), a CU-user plane (UP), or a radio unit (RU). CUs and DUs may be separate entities or included in the same network element, such as a baseband unit (BBU). RUs may be included in radio equipment or radio units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).

[0077] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN system, CU can also be called an open CU (O-CU), DU can also be called an open DU (O-DU), CU-CP can also be called an open CU-CP (O-CU-CP), CU-UP can also be called an open CU-UP (O-CU-CP), and RU can also be called an open RU (O-RU). For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples in its embodiments. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in the embodiments of this application can be implemented through software modules, hardware modules, or a combination of software modules and hardware modules.

[0078] The CU and DU can be configured according to the protocol layer functions of the wireless network they implement. For example, the CU can be configured to implement the functions of the Packet Data Convergence Protocol (PDCP) layer and above (such as the Radio Resource Control (RRC) layer and / or the Service Data Adaptation Protocol (SDAP) layer); the DU can be configured to implement the functions of protocol layers below the PDCP layer (such as one or more of the Radio Link Control (RLC) layer, Media Access Control (MAC) layer, or Physical (PHY) layer). As another example, the CU can be configured to implement the functions of protocol layers above the PDCP layer (such as the RRC and / or SDAP layers), and the DU can be configured to implement the functions of protocol layers below the PDCP layer (such as one or more of the RLC, MAC, or PHY layers).

[0079] The above CU and DU configurations are merely examples; the functions of the CU and DU can be configured as needed. For instance, the CU or DU can be configured to have more protocol layer functions, or only some protocol layer processing functions. For example, some RLC layer functions and protocol layer functions above the RLC layer can be placed in the CU, while the remaining RLC layer functions and protocol layer functions below the RLC layer can be placed in the DU. Furthermore, the functions of the CU or DU can be divided according to service type or other system requirements, such as by latency. Functions that require low latency can be placed in the DU, while functions that do not require low latency can be placed in the CU.

[0080] DU and RU can cooperate to implement the functions of the PHY layer. A DU can be connected to one or more RUs. The functions of DU and RU can be configured in various ways depending on the design. For example, a DU can be configured to implement baseband functions, and an RU can be configured to implement mid-RF functions. Another example is that a DU can be configured to implement higher-level functions in the PHY layer, and an RU can be configured to implement lower-level functions in the PHY layer, or to implement both lower-level and RF functions. Higher-level functions in the physical layer can include a portion of the physical layer's functions that are closer to the MAC layer, while lower-level functions in the physical layer can include another portion of the physical layer's functions that are closer to the mid-RF side.

[0081] The network device in this application embodiment is, for example, a non-ORAN architecture or an ORAN architecture. Optionally, if the network device is an ORAN architecture, for example, if the network device includes an RU or the network device is an RU, the steps described below of the network device sending information to the UE and / or receiving information from the UE can be performed by the RU.

[0082] Figure 1 is a schematic diagram of an exemplary communication system 10, which can be applied to this communication system. As shown in Figure 1, the communication system includes a wireless access network 100 and a core network 200. Optionally, the communication system 10 may also include an Internet 300. The wireless access network 100 may include at least one access network device (110a and 110b in Figure 1) and at least one terminal (120a-120j in Figure 1). The terminal connects wirelessly to the wireless access network device, and the wireless access network device connects wirelessly or via a wired connection to the core network. The core network device and the wireless access network device can be independent physical devices, or the functions of the core network device and the logical functions of the wireless access network device can be integrated on the same physical device, or a single physical device can integrate some of the functions of the core network device and some of the functions of the wireless access network device. Terminals can be interconnected with each other, and wireless access network devices can be interconnected via wired or wireless connections. Figure 1 is only a schematic diagram; the communication system may also include other network devices, such as wireless relay devices and wireless backhaul devices, which are not shown in Figure 1.

[0083] In the architecture shown in Figure 1, terminals 120a-120j can be referred to the description of terminals in this application, and will not be repeated here. Access network devices 110a and 110b can be referred to the description of access network devices in this application, and will not be repeated here.

[0084] It is understandable that the roles of access network devices and terminals can be relative. For example, the helicopter or drone 120i in Figure 1 can be configured as a mobile base station. For terminals 120j that access the wireless access network 100 through 120i, terminal 120i is an access network device; however, for access network device 110a, 120i is a terminal, meaning that 110a and 120i communicate via a wireless air interface protocol. Of course, 110a and 120i can also communicate via an interface protocol between access network devices. In this case, relative to 110a, 120i is also an access network device. Therefore, access network devices and terminals can both be collectively referred to as communication devices. For example, 110a and 110b in Figure 1 can be considered communication devices with access network device functions, and 120a-120j in Figure 1 can be considered communication devices with terminal functions.

[0085] Communication between access network devices and terminals, between access network devices, and between terminals can be conducted using licensed spectrum, unlicensed spectrum, or both simultaneously. Communication can be conducted using spectrum below 6 GHz, spectrum above 6 GHz, or both simultaneously. The embodiments of this application do not limit the spectrum resources used for wireless communication.

[0086] In embodiments of this application, the functions of the access network device can also be executed by a control subsystem that includes the functions of the access network device. This control subsystem, which includes the functions of the access network device, can be a control center in the aforementioned application scenarios such as smart grids, industrial control, intelligent transportation, and smart cities.

[0087] In this application embodiment, the communication device used to implement the functions of a network device can be referred to as a network device. This network device can be a network element, a network device, or a device capable of supporting the network device or network element to implement the function, such as a chip system. This device can be installed in the network device. In the technical solutions provided in this application embodiment, the device used to implement the functions of a network device is described as a network device (for example, the device used to implement the functions of an access network device is an access network device, and the device used to implement the functions of a core network device is a core network device). In the following text, unless otherwise specified, a network device can refer to an access network device, and a network device can refer to an access network device.

[0088] The technical features involved in the embodiments of this application are described below.

[0089] Whether the terminal is performing a paging process in the radio resource control (RRC) idle or inactive state, or receiving data in the RRC connected state, it uses the same receiving module. This receiving module can be referred to as the main radio (MR) or main receiver (MR). The terminal operating in the main radio or main receiver mode can also be described as the terminal operating on a 5G new radio (NR) link.

[0090] To further reduce power consumption, the terminal can also use a circuit independent of the MR to receive signals, for example, referred to as circuit A. Circuit A can be implemented using a simple circuit or chip with low power consumption. Circuit A can also be called a wake-up radio, a wake-up receiver (WUR), a wake-up circuit, a low-power circuit, or a wake-up receiver module, etc., and this application embodiment does not limit the name. Circuit A can monitor the WUS from network devices, which is also called LP-WUS. In terms of coverage, the coverage area of ​​LP-WUS may be equal to or smaller than the coverage area of ​​the NR cell. Circuit A demodulates the wake-up information based on the information bits carried in the LP-WUS, thereby waking up the main circuit or main receiver in the terminal that is turned off (or in a sleep state). The terminal using circuit A to receive the wake-up signal can be referred to as the terminal operating on the WUR link, or the WUR circuit being in an active state. The wake-up signal can be used to wake up at least one terminal or at least a group of terminals. As an example, the wake-up signal includes wake-up information, which represents information related to the terminal to be woken up.

[0091] For example, wake-up information includes paging terminal information, used by the terminal to determine whether to proceed with the paging reception process. Alternatively, wake-up information can be used by the terminal to determine whether to initiate random access. As an example, wake-up information may include information about one or more terminals to be woken up (e.g., terminal identifiers (IDs)). These one or more terminals may also be in the form of a terminal group (or terminal subgroup). Accordingly, wake-up information may include the group ID of the terminal group. When the network device sends a wake-up signal to the terminal, to reduce the power consumption of the WUR circuit, the wake-up signal typically uses simple modulation methods such as on-off keying (OOK), amplitude-shift keying (ASK), or frequency-shift keying (FSK). Accordingly, circuit A in the terminal can receive the wake-up signal using envelope detection. The following mainly uses OOK modulation as an example; however, OOK modulation can be replaced with ASK modulation or FSK modulation as needed.

[0092] As an example, wake-up information may include a paging early indication (PEI). The PEI indicates whether a paging message exists in the corresponding paging occasion (PO). Before any PO, the network sends an indication to the terminal informing it whether the PO contains a paging message for the terminal. If the PO does not contain a paging message for the terminal, the terminal can ignore the detection of this PO and enter a sleep state to save power. The PEI indication can be combined with packet information; that is, UEs belonging to the same PO can be divided into several subgroups, and the PEI can indicate which users need to receive paging messages, further reducing the terminal's detection of unnecessary paging messages.

[0093] For example, the PEI can be used to indicate the terminal group that needs to be woken up. For instance, the PEI may contain the group identifier of the terminal group that needs to be woken up. If the terminal determines that the group identifier carried in the PEI is the group identifier of the terminal's group, it can detect the PO; otherwise, if the terminal determines that the group identifier carried in the PEI is the same as the group identifier of the terminal, it can ignore the detection of this PO and can further enter a sleep state.

[0094] If the NR master link signal can be found, the terminal can camp on the NR master link. If the NR master link signal indicates LP-WUS configuration information, the terminal can further search for LP-WUS in circuit A based on the LP-WUS configuration information. If LP-WUS can be found and the LP-WUS signal quality is good, the terminal can operate in circuit A.

[0095] Taking the wake-up information PEI as an example, the terminal can first search for the NR main link signal in the MR during power-on. Refer to Figure 2, which illustrates the operation of circuit A and MR. In Figure 2, circuit A is shown as a low-power circuit. After the terminal operates in the low-power circuit, if it detects LP-WUS, it can determine whether the terminal needs to be woken up based on the PEI carried in LP-WUS. For example, if the PEI indicates that the terminal is being woken up or that the terminal group to which the terminal belongs is being woken up, the terminal can trigger MR activation to receive paging or initiate random access, etc. However, if the terminal does not detect LP-WUS, or if it does not detect the PEI indicating that the terminal or the terminal group to which the terminal belongs is being woken up, it does not need to trigger MR activation; MR can remain off (or remain in sleep mode), thereby reducing MR operating time and saving terminal power.

[0096] Specifically, after the terminal detects LP-WUS and wakes up the MR based on LP-WUS, the terminal can monitor paging messages through the MR. These paging messages can be downlink control information (DCI) scrambled with a paging-radio network temporary identity (P-RNTI), and can be used to schedule the terminal's transmissions. Paging messages can be carried on the physical downlink control channel (PDCCH).

[0097] Currently, wake-up signals mostly use Manchester encoding. That is, in the modulation symbols of the wake-up signal (such as OOK modulation symbols), the energy change of the two OOK modulation symbols represents a bit 1 or a bit 0. Each Manchester-coded symbol contains two modulation symbols, one of which represents "on" and the other represents "off".

[0098] As shown in Figure 3, taking OOK modulation as an example, in the wake-up signal transmission process, the network device can perform OOK modulation on the wake-up information to obtain OOK modulation symbols, and then perform Manchester encoding on the OOK modulation symbols. The encoded information can also be processed by one or more of the following methods: discrete Fourier transform (DFT), frequency domain mapping, and inverse discrete Fourier transform (IDFT) before being transmitted over the air interface.

[0099] Taking the OOK modulation symbol as an example, Figure 4 shows an example of using a sequence of all 1s as the "on" OOK symbol in Manchester encoding. In Figure 4, the device part includes a schematic diagram of the real part of the sample corresponding to the Manchester encoding symbol and a schematic diagram of the envelope corresponding to the real part of the sample. For example, in the example of Figure 4, when two consecutive OOK modulation symbols represent "on, off", the Manchester encoding symbol represents bit 0; when two consecutive OOK modulation symbols represent "off, on", the Manchester encoding symbol represents bit 1. It can be understood that in practical applications, bit 0 can also be represented by two consecutive OOK modulation symbols representing "off, on" in Manchester encoding, and bit 1 can be represented by two consecutive OOK modulation symbols representing "on, off". This application does not impose specific limitations.

[0100] When using Manchester encoding, the terminal receiver needs to determine whether the bit represented by the Manchester code is 0 or 1 based on the energy difference between two consecutive modulation symbols when parsing the Manchester code. This signal detection method leads to reduced coverage performance of the wake-up signal. For example, in situations where the received signal power of the wake-up signal is low, the signal-to-noise ratio is not high, or there is sudden interference, there is a high probability of error in identifying the information represented by the Manchester code based on the energy change of the modulation symbols, causing the terminal to be unable to correctly parse the wake-up signal and thus potentially miss it. On the one hand, missing the wake-up signal and subsequent scheduling information will increase data transmission latency. On the other hand, to avoid the terminal missing the wake-up signal, the base station needs to use higher transmit power to send the wake-up signal, which increases the base station's power consumption.

[0101] In summary, improving the coverage performance of wake-up signals based on Manchester coding is a pressing technical problem that needs to be solved.

[0102] Therefore, in this embodiment, an m-sequence is used to encode the information carried by the wake-up signal (i.e., the first information hereinafter) to obtain the encoded information to be transmitted (or codeword, i.e., the second information hereinafter). The relationship between the input and output information of the m-sequence is determined by a primitive polynomial or a recursive formula. Specifically, the primitive polynomial or recursive formula of the m-sequence is determined by the length K of the first information and / or the length N of the second information (i.e., the code length). The length of the first information is also the length of the information bits before encoding. Correspondingly, the receiver determines the same recursive formula based on the information length K and / or the code length N, and performs wake-up signal detection.

[0103] The m-sequence exhibits superior autocorrelation, resulting in better coverage performance for wake-up signals generated using m-sequence encoding. Compared to wake-up signals using Manchester encoding, wake-up signals encoded with m-sequences offer improved coverage performance and increased accuracy in detection. Furthermore, without increasing the transmission power of network equipment, they can prevent terminals from missing wake-up signals or reduce the likelihood of such misses, thus enhancing transmission reliability and reducing transmission latency.

[0104] In this embodiment of the application, the "monitor" channel can also be understood or replaced as the "detect" control channel.

[0105] It should be noted that this application uses LP-WUS (or WUS) as an example of a wake-up signal, but it should not be construed as limiting the embodiments of this application to the use of LP-WUS. The embodiments of this application are also applicable to communication scenarios of other Manchester-encoded signals, information, and / or data.

[0106] Figure 5 shows a flowchart of a communication method provided in an embodiment of this application. This communication method can be executed by a device sending a wake-up signal, such as a network device. As can be seen, the method may include the following steps:

[0107] S101: The network device generates second information. The second information is determined based on an m-sequence, which is determined based on the first information and a first recursive formula. The first recursive formula is related to the length K of the first information and / or, the first recursive formula is related to the code length N.

[0108] S102: The network device sends a wake-up signal, which carries the second information.

[0109] The wake-up signal can be, for example, LP-WUS. For instance, the wake-up signal can be obtained by performing one or more operations on the second information, such as DFT, frequency domain mapping, or IDFT.

[0110] In S102, network devices can send wake-up signals via the air interface.

[0111] Optionally, the network device can send a wake-up signal to the terminal's WUR.

[0112] As shown in Figure 5, in the communication method provided in this embodiment, the network device can encode first information based on an m-sequence and send a wake-up signal. The wake-up information can be carried in the encoded codeword, which is the second information. Compared with Manchester encoding, this method can improve the accuracy of wake-up signal detection under conditions such as low received signal power, low signal-to-noise ratio, or sudden interference. In other words, this method can prevent the terminal from missing the wake-up signal or reduce the possibility of the terminal missing the wake-up signal without increasing the transmission power of the network device, thus improving transmission reliability and reducing transmission latency.

[0113] The first piece of information will be explained below.

[0114] In this embodiment of the application, the first information can be considered as the information to be encoded, that is, the original information bits before encoding.

[0115] The length of the first piece of information can be denoted as K. The length of the first piece of information can also be called the information bit length.

[0116] Optionally, the first information can be the payload, or the payload and check bits.

[0117] The payload can be a sequence of multiple bits to be sent. For example, if the bits to be sent are 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, then the payload is: 10101100101.

[0118] Alternatively, the check bits can be obtained from the payload. For example, the check bits can be cyclic redundancy check (CRC) bits or check bits corresponding to other check methods. The check bits can be located after the payload and adjacent to the payload.

[0119] Optionally, the payload of the wake-up signal may include wake-up information. Therefore, it can also be said that the first information may include wake-up information. The wake-up information may instruct the terminal to enable control channel monitoring, or instruct the terminal to monitor the control channel, or instruct the terminal to enable MR. The terminal can monitor the control channel through MR. For example, the wake-up information may include PEI.

[0120] In one possible embodiment, the first information may include a modulation symbol obtained by OOK modulation, which can be obtained by modulating wake-up information; that is, the modulation symbol can carry or transmit wake-up information. In other words, modulation can be performed first, followed by encoding. Alternatively, encoding can be performed first, for example, obtaining the second information and then modulating it using OOK or similar methods to obtain a modulation symbol. In this case, the first information may include wake-up information. OOK modulation can also be replaced by ASK modulation or FSK modulation.

[0121] In one possible embodiment, K is less than or equal to a first threshold. The first threshold can be a positive integer greater than 1. For example, the possible values ​​of the first threshold are 12, 13, ... 20, etc. That is, the communication method shown in the embodiment of this application can be implemented when K is small, as shown in the flowchart of Figure 5. Here, "small K" means, for example, K is less than or equal to the first threshold. The design of this embodiment is because the detection complexity of the m-sequence will increase exponentially with the increase of K. Therefore, considering the complexity constraint or the terminal power consumption constraint, the communication method shown in this application can be used when K is small. If the complexity constraint or the terminal power consumption constraint is not considered, it is not required to use the communication method shown in this application when K is small, that is, the communication method shown in this application can still be used when K is large.

[0122] The second piece of information will be explained below.

[0123] The second piece of information can be considered as encoded information, or simply coded information.

[0124] The length of the second information is code length N. The code length can be predefined or determined by the network device and pre-configured in the terminal. Furthermore, the code length N can be determined based on the information bit length K and the code rate. For example, the code rate can be predefined or pre-configured, and the code length N can be determined based on the code rate and the information bit length K.

[0125] For the wake-up signal, the second information includes encoded wake-up information, or encoded modulation symbols that can carry or bear the wake-up information. For example, if encoding is performed before modulation, the second information may include encoded wake-up information. Similarly, if modulation is performed before encoding, the second information may include encoded modulation symbols.

[0126] In this embodiment of the application, the method of obtaining the second information through encoding is as follows: using the first sequence as the input information (or input sequence) of the m sequence, obtaining the m sequence corresponding to the first sequence through the first recursive formula, and obtaining the second information based on the m sequence. The m sequence can be used as the output information (or output sequence) corresponding to the first sequence; that is, the output information is an m sequence.

[0127] First, the first recursive formula and its determination method are explained in conjunction with the m-sequence.

[0128] (1) m sequence

[0129] m-sequence is short for Longest Linear Feedback Shift Register Sequence. It is the sequence with the longest period generated by a shift register with linear feedback. Generally, the longest period generated by an n-stage linear feedback shift register is equal to 2. n -1, meaning the sequence length output by the linear feedback shift register is 2. n -1.

[0130] In this context, the length K of the first piece of information is less than or equal to n, meaning the number of bits that the m-sequence can carry is less than or equal to the number of register levels. Additionally, N can be less than 2. n -1 indicates that the complete periodic m-sequence needs to be truncated to obtain a second piece of information of length N. Furthermore, N can be greater than 2. n -1 indicates that a cyclic expansion is needed from the complete periodic m-sequence to obtain a second piece of information of length N. Furthermore, if N = 2... n If the value is -1, then there is no need to truncate or expand the output information; that is, the output information is the second information.

[0131] Figure 6 shows an example of the basic structure of a linear feedback shift register. The structure of a linear feedback shift register refers to the feedback connection method. Let the primitive polynomial be x. n +x n-1 For example, the recursive formula corresponding to +…+x+1 is s(t+n)=mod(s(t+n-1)+s(t+n-2)+…+s(t+1)+s(t),2). In Figure 6, the feedback connection method of the register represents that the feedback function performs an XOR operation on all bits in the memory, i.e. Then the memory output information is The input information used for initialization is stored in memory, and this input information can be denoted as (a1, a2, ..., a...). n Each shift can generate a new value through a feedback function and replenish it in memory.

[0132] The first information can be used as the input information of the linear feedback shift register. Correspondingly, the output information of the linear feedback shift register is the m-sequence. The second information can be a sequence of length N extracted from the m-sequence.

[0133] (2) Recursive formula

[0134] It is understandable that the m-sequence output by the linear feedback shift register is determined by the input information and the primitive polynomial, where the order of the primitive polynomial is the highest power of the polynomial. This highest power is not less than the length of the input information. The primitive polynomial affects the structure of the linear feedback shift register, that is, it affects the feedback function, which in turn affects the output m-sequence. Figure 6 illustrates a specific example. The primitive polynomial corresponds to the recursive formula; therefore, in this context and in some subsequent passages, "primitive polynomial" and "recursive formula" can be used interchangeably.

[0135] Generally, for binary input information, the primitive polynomial can be expressed as: a i a represents the i-th element of the sequence stored in memory. i ∈{0,1}, where r represents the highest power of the primitive polynomial. Accordingly, the recurrence relation can be expressed as: t is a positive integer greater than r, s represents the output information, and s(0), s(1), ..., s(r) are the input information.

[0136] For example, when r = 7, the primitive polynomial is f(x) = x. 7 +x+1, correspondingly, the recurrence relation is s(t)+s(t-6)+s(t-7)=0. Furthermore, since binary operations are all defined as modulo 2 operations, i.e. -1=1 (mod 2), 1+1=0 (mod 2), 1+0=1 (mod 2), and 0+0=0 (mod 2), the above primitive polynomial can also be transformed into the recurrence relation s(t)=mod(s(t-6)+s(t-7),2).

[0137] It can be considered that, given a fixed primitive polynomial or recursive formula, there are multiple possible outputs due to the existence of various input information. Each output can be considered to be determined by a single input and a primitive polynomial, or in other words, each output can be considered to be determined by a single input and a recursive formula.

[0138] (3) Determination of the first recursive formula

[0139] In this embodiment of the application, the first recursive formula is a recursive formula used to determine the second information.

[0140] The first recursive formula used to determine the second information is related to the length K of the first information, and / or the first recursive formula is related to the code length N. Alternatively, the first recursive formula can be said to be related to K and / or N, or that the first recursive formula can be determined based on K and / or N.

[0141] For example, with K=8 and N=16, the optimal primitive polynomial has a decimal value of 301, corresponding to the primitive polynomial f(x) = x. 8 +x 5 +x 3 +x 2 +1, the corresponding recurrence formula (i.e. the first recurrence formula) is s(t)=mod(s(t-3)+s(t-5)+s(t-6)+s(t-8),2).

[0142] For example, with K=8 and N=24, the optimal primitive polynomial has a decimal value of 333, and the corresponding primitive polynomial is f(x) = x. 8 +x 6 +x 3 +x 2 +1, the corresponding recurrence formula (i.e. the first recurrence formula) is s(t)=mod(s(t-2)+s(t-5)+s(t-6)+s(t-8),2).

[0143] It is understandable that, since the encoding rate is related to the length K of the first information and the code length N, the first recursive formula can also be said to be related to the code rate. As an example, the encoding rate equals... Unless otherwise specified, the encoding rate may be referred to simply as the bitrate in the following text.

[0144] As one possible implementation for determining the first recursive formula, the network device can select the first recursive formula from one or more recursive formulas based on K and / or N. These one or more recursive formulas can serve as alternative recursive formulas. For example, the network device can obtain a correspondence between one or more recursive formulas and K and / or N. After determining K and / or N, the network device can determine the first recursive formula from the one or more recursive formulas based on K and / or N and the aforementioned correspondence.

[0145] The first recursive formula can be one of one or more recursive formulas that corresponds to K and / or N. This correspondence is explained below.

[0146] As an example, the correspondence between the recursive formula and K and / or N can be a one-to-one correspondence. As shown in Table 1, any one of the recursive formulas #1 to #5 can be selected based on the values ​​of K and / or N; the selected recursive formula is the first recursive formula. Furthermore, any two recursive formulas from #1 to #5 can be the same or different, without specific limitations.

[0147] Table 1

[0148] Table 1 above is an example of the correspondence between the recursive formula and K and / or N. The values ​​in Table 1 should not be interpreted as restrictions on the values ​​of K and / or N in the correspondence.

[0149] As another example, the recursive formula can also correspond to a certain range of values ​​for K and / or a certain range of values ​​for N. As shown in Table 2, the same first recursive formula can be selected for multiple values ​​of K and / or multiple values ​​of N. For example, when K = 8 or 16, the first recursive formula can be recursive formula #1.

[0150] Table 2

[0151] Table 2 above is an example of the correspondence between the recursive formula and K and / or N. The values ​​in Table 2 should not be interpreted as restrictions on the values ​​of K and / or N in the correspondence.

[0152] Based on Table 1 or Table 2 above, the network device can determine the first recursive formula by querying the correspondence shown in Table 1 or Table 2 after determining K and / or N.

[0153] It is understood that the above one or more recursive formulas and / or the correspondence between the above one or more recursive formulas and K and / or N may be predefined by the protocol, or may be determined and pre-configured in the terminal by the network device.

[0154] The above one or more recursive formulas can be called alternative recursive formulas, representing alternative recursive formulas used to determine the second information.

[0155] Optionally, any alternative recursive formula can be determined based on maximizing the minimum Hamming distance between multiple output information. Here, the multiple output information corresponds to multiple input information, and each output information is determined based on one input information and the recursive formula. For the first recursive formula, one of the multiple input information is the first information, and the second information is determined based on the output information (i.e., the m-sequence) corresponding to that input information. In other words, for different recursive formulas, there are multiple sets of correspondences between input and output information, where the alternative recursive formula is determined based on the principle of maximizing the minimum Hamming distance between multiple output information.

[0156] For example, for K and / or N, alternative recursive formulas can be determined based on the principle of maximizing the minimum Hamming distance between multiple output information. The expression based on the recursive formula... A set of recursive formulas for K and / or N can be obtained, and the output information of one or more recursive formulas in the set can be obtained by traversing the set. The maximum value of the minimum Hamming distance among the multiple output information of each recursive formula can be determined. Furthermore, the recursive formula with the largest maximum value can be selected as the candidate recursive formula corresponding to K and / or N. The candidate recursive formulas here are the recursive formulas shown in Table 1 and / or Table 2. Therefore, the correspondence between the recursive formulas shown in Table 1 and / or Table 2 and K and / or N can be obtained.

[0157] The method for determining the alternative recursive formulas corresponding to any K and / or N can be random selection or manual selection, etc., and this application does not specifically limit it.

[0158] Secondly, the method for determining the second piece of information will be explained.

[0159] After determining the first recursive formula, the network device can use the first information as the input information of the linear feedback shift register and determine the connection method of the linear feedback shift register according to the first recursive formula, thereby obtaining the output information of the linear feedback shift register. This output information is the m-sequence. The second information can be determined based on this m-sequence.

[0160] In one possible embodiment, the second information can be determined based on the m-sequence and the cyclic shift value. Alternatively, the network device can determine the cyclic shift value based on this information. The cyclic shift value is related to K. Specifically, the cyclic shift value is positively correlated with K, meaning that the cyclic shift value increases as K increases.

[0161] One example is that the cyclic shift value satisfies K:

[0162] Here, cs represents the circular shift value, floor() represents rounding down, and α is a positive integer. For example, α is a positive integer greater than 1, that is, α = 2, 3, 4...

[0163] This can be understood as follows: if the cyclic shift value and K satisfy relation 1, then the cyclic shift value represents a shift of the m-sequence by the length of the m-sequence. 1 bit.

[0164] Another example is when the cyclic shift value and K satisfy: cs = βK; (Equation 2)

[0165] Where cs represents the cyclic shift value, K represents the length of the first information, and β is a positive integer. For example, β is a positive integer greater than 1, that is, β = 2, 3, 4...

[0166] This can be understood as follows: if the cyclic shift value and K satisfy relation 2, the cyclic shift value represents βK bits of the m-sequence.

[0167] Optionally, considering the energy-saving requirements of network equipment, the energy consumption required for cyclic shifting operation is lower at higher bit rates. The cyclic shift value and K can satisfy the above relationship 1 or relationship 2 to pursue higher detection performance.

[0168] That is, at higher bit rates, network devices can determine the cyclic shift value based on relation 1 or relation 2.

[0169] A higher bitrate can also refer to K and N satisfying the following:

[0170] or Where 0 < p < 1. That is, p can be a threshold for the bitrate, and a higher bitrate can be a bitrate greater than or equal to p.

[0171] For example, a higher bitrate can mean a bitrate greater than or equal to or Etc. That is, the value of p can be... or wait.

[0172] Furthermore, at low bit rates, to reduce the energy consumption required for cyclic shifting, the cyclic shift value can be set to 0, i.e., cs = 0. Alternatively, it can be considered that when the cyclic shift value is 0, there is no need to perform cyclic shifting on the m-sequence.

[0173] A lower bitrate can also refer to K and N satisfying the following:

[0174] or Where 0 < p < 1. That is, p can be a threshold for the bitrate, and a lower bitrate can be a bitrate less than or equal to p.

[0175] For example, a lower bitrate can mean a bitrate less than or equal to or Etc. That is, the value of p can be... or wait.

[0176] It is understandable that the above can be predefined by the protocol, or it can be determined and pre-configured on the terminal by the network device.

[0177] As one way to determine the second information based on the cyclic shift value and the m-sequence, the second information can be determined by truncating bits from the m-sequence. For example, when the length of the m-sequence is greater than N, the second information can be determined by truncating bits.

[0178] One possible way to determine the second information by truncation is that the second information can be the first to Nth bits truncated after cyclically shifting the m-sequence according to the cyclic shift value. Alternatively, the second information can be a sequence consisting of the first to Nth bits after cyclically shifting the m-sequence according to the cyclic shift value. For example, if the m-sequence determined by the first information and the first recursive formula is [0,0,0,1,0,0,1,1,0,1,0,1,0,1], and cs = 4 and N = 8, the cyclically shifted m-sequence is [0,0,1,1,0,1,0,1,0,0,0,1]. The second information can be composed of the first to Nth bits of the cyclically shifted m-sequence, i.e., the second information is [0,0,1,1,0,1,0,1].

[0179] Another possible way to determine the second information by truncation is to not perform a circular shift on the m-sequence, but instead truncate the cs+1 to cs+N bits of the m-sequence. In other words, the second information is a sequence composed of the cs+1 to cs+N bits of the m-sequence. For example, if the m-sequence determined by the first information and the first recursive formula is [0,0,0,1,0,0,1,1,0,1,0,1,0,1], and cs=4 and N=8, the second information is composed of the 5th to 12th bits of the m-sequence, that is, the second information is [0,0,1,1,0,1,0,1].

[0180] As another way to determine the second information based on the cyclic shift value and the m-sequence, the second information can be determined by cyclically expanding the m-sequence. For example, if the length of the m-sequence is less than N, the second information of length N can be obtained by cyclically expanding the m-sequence.

[0181] One possible way to determine the second information through cyclic expansion is that the second information can be obtained by cyclically shifting the m-sequence according to the cyclic shift value and then expanding the m-sequence into a sequence of length N through cyclic expansion. This sequence can then be used as the second information. For example, if the m-sequence determined according to the first information and the first recursive formula is [0,0,0,1,1,0], and cs=4 and N=8, the cyclically shifted m-sequence is [1,0,0,0,0,1], and the sequence of length N obtained through cyclic expansion is [1,0,0,0,0,1,1,0], which means the second information is [1,0,0,0,0,1,1,0].

[0182] Another possible way to determine the second information through cyclic expansion is to not cyclically shift the m-sequence, but instead cyclically expand the m-sequence to at least cs+N bits, where the second information is a sequence consisting of the cs+1 to cs+N bits of the cyclically expanded m-sequence. For example, if the m-sequence determined according to the first information and the first recursive formula is [0,0,0,1,1,0], and cs=4 and N=8, the sequence after cyclic expansion to 12 bits is [0,0,0,1,1,0,0,0,0,1,1,0]. The 5th to 12th bits of this cyclically expanded sequence are taken as the second information, that is, the second information is [1,0,0,0,0,1,1,0].

[0183] As another way to determine the second information based on the cyclic shift value and the m-sequence, if the length of the m-sequence is equal, the cyclically shifted m-sequence can be used as the second information. For example, if the m-sequence determined by the first information and the first recursive formula is [0,0,0,1,0,0,1,1], and cs=4 and N=8, the cyclically shifted sequence is [0,0,1,1,0,0,0,1], which means the second information is [0,0,1,1,0,0,0,1].

[0184] In the above embodiments, the second information can be determined based on the m-sequence and the cyclic shift value. When the cyclic shift value is greater than 0, the minimum Hamming distance between codewords can be increased at higher code rates, ensuring detection performance. Taking N=8 as an example, the effect is illustrated as follows: Output information #1 obtained according to the first recursive formula and input information #1 is [0,0,0,1,0,0,1,1,0,1,0,1,0,1], and output information #2 obtained according to the first recursive formula and input information #2 is [0,0,1,1,0,1,0,1,1,1,0]. If no cyclic shift is performed, or the cyclic shift value is 0, then codeword #1 obtained according to output information #1 is [0,0,0,1,0,0,1,1], and codeword #2 obtained according to output information #2 is [0,0,0,1,0,0,1,1]. Therefore, the Hamming distance between codeword #1 and codeword #2 is 3. With a cyclic shift value of 4, the codeword #1 obtained from output information #1 is [0,0,1,1,0,1,0,1], and the codeword #2 obtained from output information #2 is [0,1,0,1,1,1,1,0]. It can be seen that the Hamming distance between codeword #1 and codeword #2 is 5. Therefore, using a cyclic shift value greater than 1 can increase the Hamming distance between different codewords, thereby improving detection performance.

[0185] The m-sequence can essentially be viewed as a systematic code. The first K bits of the second information are the first information, i.e., the source bits, and the last NK bits can be the check bits. By cyclically shifting to select more check bits, we can ensure that the Hamming distance does not deteriorate to the maximum extent.

[0186] Figure 7 shows the variation curves of the minimum Hamming distance between the output information of a certain primitive polynomial when K=8 and N=16 and K=8 and N=24, respectively. It can be seen that the variation curves of the minimum Hamming distance between multiple output information are different when N=16 and N=24. Therefore, it can be considered that the optimal primitive polynomial is different for different values ​​of N. That is, at least the optimal primitive polynomial and the corresponding first recursive formula can be determined based on N.

[0187] As shown in Figure 8, the output information is divided according to its overall length. and This diagram illustrates the variation of the minimum Hamming distance between multiple outputs of a primitive polynomial after cyclic shifting the output information. The curves showing the variation of the minimum Hamming distance between the outputs coincide when the cyclic shift value is different, indicating that the optimal primitive polynomial remains unchanged regardless of the cyclic shift value. In other words, the cyclic shift value is independent of the choice of the first recursive formula. Furthermore, the cyclic shift value can be determined before or after determining the first recursive formula; the order of determining the first recursive formula and determining the cyclic shift value is not restricted.

[0188] The following describes the terminal's detection of the wake-up signal, referring to the process shown in Figure 9. This wake-up signal can be the one sent by the network device in Figure 5. As shown in Figure 9, the process may include the following steps:

[0189] S201: The terminal receives a wake-up signal, which carries the second information.

[0190] The wake-up signal can be referred to in the description in S103, and the second information can be referred to the description of the relevant content in Figure 5, which will not be repeated here.

[0191] S202: The terminal processes the wake-up signal according to the first recursive formula.

[0192] The first recursive formula can be referred to in Figure 5, and will not be repeated here. For example, the first recursive formula is related to the length K of the first information, and / or the first recursive formula is related to the length N of the second information.

[0193] The terminal can determine the first recursive formula based on K and / or N.

[0194] K and / or N can be predefined by the protocol, or they can be determined by the network device and pre-configured on the terminal.

[0195] In addition, K and / or N can also be indicated to the terminal by the network device via a preamble of the wake-up signal.

[0196] Specifically, the first device can implicitly indicate different K and / or N using preambles of different lengths and / or formats. The preambles of different formats maintain low cross-correlation. The second device determines the implicitly indicated K and / or N by blindly detecting preambles of different lengths and / or formats.

[0197] Specifically, through implicit preamble indication, for example, the network device can preconfigure or the protocol can predefine the correspondence between one or more possible preambles of the wake-up signal and K and / or N. Accordingly, the terminal can determine the K and / or N of the preamble indication based on this correspondence. For example, preambles of different lengths and / or formats can correspond to different K and / or N. When the network device uses a preamble of a certain length and / or format, the terminal can determine the corresponding K and / or N based on the length and / or format of the preamble obtained through blind detection and the corresponding correspondence, thus enabling flexible determination of K and / or N.

[0198] The terminal determines the first recursive formula based on K and / or N by selecting one or more recursive formulas from among K and / or N. The first recursive formula may correspond to K and / or N. These one or more recursive formulas and / or the correspondence between them and K and / or N may be predefined by the protocol, or they may be determined and pre-configured in the terminal by the network device.

[0199] Alternatively, the network device can indicate the first recursive formula to the terminal without requiring the terminal to determine the first recursive formula based on K and / or N. For example, the first recursive formula can be indicated by a preamble. For instance, the preamble can implicitly indicate the index of the first recursive formula, so the terminal can determine the first recursive formula from multiple recursive formulas based on the index.

[0200] It is understandable that the first recursive formula determined by the network device is the same as the first recursive formula determined by the terminal.

[0201] In one possible embodiment, the terminal processing the wake-up signal according to the first recursive formula may include the terminal processing the wake-up signal according to the first recursive formula to obtain first information. Referring to the flowchart in Figure 5, the first information may include wake-up information; therefore, the terminal can detect the wake-up information according to the first recursive formula.

[0202] Specifically, the terminal's processing of the wake-up signal according to the first recursive formula may include:

[0203] The terminal generates multiple output information based on the first recursive formula. Each output information is generated based on an m-sequence, which is determined by an input information and the first recursive formula. Any input information can serve as the initial sequence for a linear feedback shift register, and the output information is the m-sequence output by the linear feedback shift register.

[0204] The terminal can also determine the first information based on the cross-correlation result between the second information and the multiple output information, wherein the first information is included among the multiple input information corresponding to the multiple output information. The multiple input information can be multiple sequences of length K. For example, the multiple input information can include all binary sequences of length K.

[0205] The cross-correlation result can be the result of cross-correlation operation between two sequences. This application does not specify the method of cross-correlation operation. The cross-correlation result can indicate the degree of similarity between two sequences. If the cross-correlation result indicates that the second information is most similar to one of the multiple output information, then this output information can be selected as the selected output information, and the corresponding input information is the first information.

[0206] In one possible embodiment, the cross-correlation result between the second information and any output information can be determined based on the second information, the cyclic shift value, and the output information. The cyclic shift value can be related to K. That is, the terminal can determine the cyclic shift value based on K. Specifically, the terminal can determine the cyclic shift value by referring to the method described herein for determining the cyclic shift value using network devices. In other words, the cyclic shift value determined by the network device is the same as the cyclic shift value determined by the terminal.

[0207] Specifically, for any given output information, the terminal can determine the cyclically shifted output information based on the cyclic shift value and the output information itself. For ease of explanation, this cyclically shifted output information can be referred to as third information. After traversally shifting multiple output information based on the cyclic shift value, the terminal can obtain multiple cyclically shifted output information, i.e., multiple third pieces of information. The terminal can determine the cross-correlation result between the second information and these multiple third pieces of information, and this cross-correlation result can be used as the cross-correlation result between the second information and the output information. This cross-correlation result can indicate the third information with the highest similarity to the second information. The second device can determine the output information before the cyclic shift of this third information, and the input information corresponding to this output information can be used as the first information.

[0208] It is understandable that the actions performed by the network device shown in Figure 5 can also be replaced by actions performed by the terminal, chip, or other execution entities. Similarly, the actions performed by the terminal shown in Figure 9 can also be replaced by actions performed by the network device, chip, or other execution entities. Furthermore, the wake-up information in Figures 5 and 9 can be replaced by control information or data other than wake-up information.

[0209] Based on the same technical concept, embodiments of this application provide a communication device for implementing the first device and / or the second device in this application. The device includes modules, units, or means that perform the method steps in the above method embodiments. These functions, units, or means can be implemented by software, hardware, or hardware executing corresponding software.

[0210] For example, referring to FIG10, the device 1000 may include a processing unit 1010 (or processing module) and a transceiver unit 1020 (or transceiver module).

[0211] Optionally, the transceiver unit 1020 may include a sending unit and / or a receiving unit. The sending unit is used to perform the sending operation in the above method embodiments. The receiving unit is used to perform the receiving operation in the above method embodiments.

[0212] It should be noted that the communication device 1000 may include a transmitting unit but not a receiving unit. Alternatively, the communication device 1000 may include a receiving unit but not a transmitting unit. Specifically, it depends on whether the above-described scheme executed by the communication device 1000 includes both transmitting and receiving actions.

[0213] The processing unit 1010 is used for data processing. The transceiver unit 1020 can implement corresponding communication functions.

[0214] Optionally, the communication device 1000 may further include a storage unit, which can be used to store instructions and / or data. The processing unit 1010 can read the instructions and / or data in the storage unit so that the communication device 1000 can implement the aforementioned method embodiments.

[0215] For example, the communication device 1000 may be a first device or a component configurable on a first device. The first device may be, for example, a terminal. The processing unit 1010 is used to perform processing-related operations of the first device in the above method embodiments. The transceiver unit 1020 is used to perform sending and / or receiving-related operations of the first device in the above method embodiments.

[0216] For example, when implementing the steps shown in FIG5 performed by the terminal device: the processing unit 1010 or the transceiver unit 1020 can be used to refer to the second information in S101, see S101. The transceiver unit 1020 can be used to send the wake-up signal in S102, see S102.

[0217] Furthermore, the communication device 1000 can be a second device or a component configurable on a second device. The second device is, for example, a network device. The processing unit 1010 is used to perform processing-related operations of the second device in the above method embodiments. The transceiver unit 1020 is used to perform transmission and / or reception-related operations of the second device in the above method embodiments.

[0218] For example, when implementing the steps shown in FIG5 performed by the terminal device: the processing unit 1010 or the transceiver unit 1020 can be used to generate the second information in S101, see S101. The transceiver unit 1020 can be used to send the wake-up signal in S102, see S102.

[0219] It should be understood that all relevant content of each step involved in the above method embodiments can be referenced from the functional description of the corresponding functional module, and will not be repeated here.

[0220] The processing unit 1010 in the above embodiments can be implemented by at least one processor or processor-related circuitry. The transceiver unit 1020 can be implemented by a transceiver or transceiver-related circuitry. The transceiver unit 1020 can also be referred to as a communication module or communication interface.

[0221] The following is another structural schematic diagram of a communication device according to an embodiment of this application, used to implement the first device and / or the second device in this application. As shown in FIG11, an embodiment of this application also provides a communication device 1100, including:

[0222] At least one processor 1110; and an interface circuit 1120 communicatively connected to the at least one processor 1110; the at least one processor 1110 causes the apparatus to perform the method steps in the above method embodiments through the interface circuit 1120 by executing instructions stored in at least one memory 1102.

[0223] Optionally, the at least one memory 1102 is located outside the device 1100.

[0224] Optionally, the device 1100 includes at least one memory 1130, which is connected to at least one processor 1110 and stores instructions executable by the at least one processor 1110. Figure 11 shows, with dashed lines, that the memory 1130 is optional for the device 1100.

[0225] The processor 1110 and the memory 1130 can be coupled through an interface circuit or integrated together; no restriction is imposed here.

[0226] This application embodiment does not limit the specific connection medium between the processor 1110, memory 1130, and interface circuit 1120. In Figure 11, the processor 1110, memory 1130, and interface circuit 1120 are connected via a bus, which is represented by a straight line in Figure 11. The connection methods between other components are only illustrative and not intended to be limiting. The bus can be divided into address bus, data bus, control bus, etc. For ease of illustration, a straight line is used to represent the bus in Figure 11, but this does not indicate that there is only one bus or one type of bus.

[0227] When the communication device 1100 is the first device, the first device may include a processor, a memory, and a transceiver. The memory may store computer program code, and the transceiver includes a transmitter and a receiver.

[0228] The processor is primarily used for processing communication protocols and data; for example, controlling the first device, executing software programs, and processing data from those programs. The memory is primarily used for storing software programs and data. The transmitter is used to send signals to other communication devices or equipment, and the receiver is used to receive signals from other communication devices or equipment.

[0229] When the communication device 1100 is a chip in the first device, the chip may include a processor, a memory, and a transceiver. The transceiver may be an input / output circuit or a communication interface. The processor may be a processing module integrated on the chip, a microprocessor, or an integrated circuit. In the above method embodiments, the transmitting operation of the first device can be understood as the output of the chip, and the receiving operation of the first device in the above method embodiments can be understood as the input of the chip.

[0230] Similarly, when the communication device 1100 is a second device, the second device may include a processor, a memory, and a transceiver. The memory may store computer program code, and the transceiver includes a transmitter and a receiver.

[0231] The processor is primarily used for processing communication protocols and data; controlling the secondary device; executing software programs; and processing the data from those programs. The memory is mainly used for storing software programs and data. The transmitter is used to send signals to other communication devices or equipment, and the receiver is used to receive signals from other communication devices or equipment.

[0232] When the communication device 1100 is a chip in the second device, the chip may include a processor, a memory, and a transceiver. The transceiver may be an input / output circuit or a communication interface. The processor may be a processing module integrated on the chip, a microprocessor, or an integrated circuit. In the above method embodiments, the transmitting operation of the second device can be understood as the output of the chip, and the receiving operation of the second device in the above method embodiments can be understood as the input of the chip.

[0233] It should be understood that the processor mentioned in the embodiments of this application can be implemented in hardware or software. When implemented in hardware, the processor can be a logic circuit, integrated circuit, etc. When implemented in software, the processor can be a general-purpose processor, implemented by reading software code stored in memory.

[0234] For example, the processor can be a central processing unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor can be a microprocessor or any conventional processor.

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

[0236] It should be noted that when the processor is a general-purpose processor, DSP, ASIC, FPGA, or other programmable logic device, discrete gate or transistor logic device, or discrete hardware component, the memory (storage module) can be integrated into the processor.

[0237] It should be noted that the memories described herein are intended to include, but are not limited to, these and any other suitable types of memories.

[0238] Based on the same technical concept, embodiments of this application also provide a computer-readable storage medium, including a program or instructions, which, when run on a computer, cause the methods in the above method embodiments to be executed.

[0239] This application also provides a chip or chip system, including circuitry (such as analog circuitry and / or logic circuitry; or understood as the chip system including one or more processors, which may include circuitry, etc.), or understood as the chip including a processor. The circuitry or processor is coupled to a memory for executing computer programs or instructions stored in the memory, thereby implementing the methods shown in FIG. 5, FIG. 9, or the various embodiments of this application. The chip or chip system may also include input / output interfaces. For example, taking the implementation of terminal device functions as an example, the chip can receive information from other modules (such as radio frequency or antenna) of the terminal device through the input / output interface, and this information may be sent to the terminal device by other communication devices such as base stations. Alternatively, the chip can send information to other modules (such as radio frequency or antenna) in the terminal device through the input / output interface, and this information may be sent by the terminal device to other communication devices such as base stations.

[0240] Based on the same technical concept, embodiments of this application also provide a computer program product, including instructions that, when run on a computer, cause the methods in the above method embodiments to be executed.

[0241] Based on the same technical concept, embodiments of this application also provide a communication system, which may include a first device and a second device. The first device can be used to implement the method implemented by the first device in the above method embodiments, and the second device can be used to implement the method implemented by the second device in the above method embodiments. For example, the first device is used to execute the action implemented by the first device in the process shown in FIG5 or FIG9, and the second device is used to execute the action implemented by the second device in the process shown in FIG5 or FIG9. For example, the first device is a terminal, and the second device is a base station, CU, DU, or RU, etc.

[0242] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0243] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to this application. It should be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in one or more blocks of the flowchart illustrations and / or one or more blocks of the block diagrams.

[0244] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means that implement the functions specified in one or more flowcharts and / or one or more block diagrams.

[0245] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, such that the instructions, which execute on the computer or other programmable apparatus, provide steps for implementing the functions specified in one or more flowcharts and / or one or more block diagrams.

[0246] In the description of this application, terms such as "first" and "second" are used only for the purpose of distinguishing descriptions and should not be construed as indicating or implying relative importance, nor should they be construed as indicating or implying order. It should be noted that this application does not limit the order in which "first," "second," etc., appear; for example, "second" may appear first, followed by "first," and this application does not impose such a limitation.

[0247] In the description of this application, "at least one" means one or more, and "more than one" means two or more. "At least one of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one of a, b, or c can mean: a, b, c, a and b, a and c, b and c, or a and b and c, where a, b, and c can be single or multiple. In the description of this application, " / " means "or," for example, a / b means a or b.

[0248] In the embodiments of this application, "transmission" includes "sending" and / or "receiving". "Sending" and "receiving" can be considered to represent the direction of signal transmission. For example, "sending information to XX" can be understood as the destination of the information being XX, which can include sending information directly through an air interface or other interface, or indirectly sending it from other units or modules. "Receiving information from YY" can be understood as the source of the information being YY, which can include receiving information directly from YY through an air interface or other interface, or indirectly inputting information from YY from other units or modules. "Sending" can also be understood as the "output" of a chip interface, and "receiving" can also be understood as the "input" of a chip interface. In other words, sending and receiving can occur between devices, such as between access network nodes and terminals; sending and receiving can also occur within a device, such as input or output between components, modules, chips, software modules, or hardware modules within the device via buses, traces, or interfaces.

Claims

1. A communication method, characterized in that, include: Generate second information, which is determined based on an m-sequence, which is determined based on first information and a first recursive formula, wherein the first recursive formula is related to the length of the first information and / or is related to the code length, and the length of the second information is the code length; Send a wake-up signal, the wake-up signal carrying the second information.

2. The method as described in claim 1, characterized in that, The wake-up signal is a low-power wake-up signal.

3. The method as described in claim 1 or 2, characterized in that, The second information is determined based on the m-sequence and includes: The second information is determined based on the m-sequence and the cyclic shift value, which is related to the length of the first information.

4. The method as described in claim 3, characterized in that, The cyclic shift value and the length of the first information satisfy the following: Where cs represents the cyclic shift value, floor() represents flooring down, K represents the length of the first information, and α is a positive integer; or, cs = βK, where cs represents the cyclic shift value, K represents the length of the first information, and β is a positive integer.

5. The method as described in claim 4, characterized in that, The length of the first information satisfies: Wherein, K represents the length of the first information, and N represents the code length.

6. The method as described in claim 3, characterized in that, The length of the first information satisfies: Wherein, K represents the length of the first information, and N represents the code length; The cyclic shift value is 0.

7. The method as described in claim 5 or 6, characterized in that, p is a predefined or preconfigured value.

8. The method according to any one of claims 1-7, characterized in that, The length of the first information is less than or equal to the first threshold.

9. The method according to any one of claims 1-8, characterized in that, The method further includes: The first recursive formula is determined from one or more recursive formulas based on the code length and / or the length of the first information.

10. A communication method, characterized in that, include: Receive a wake-up signal, wherein the wake-up signal carries second information; The wake-up signal is processed according to a first recursive formula, which is related to the length of the first information, and / or the first recursive formula is related to the length of the second information.

11. The method as described in claim 10, characterized in that, The wake-up signal is a low-power wake-up signal.

12. The method as described in claim 10 or 11, characterized in that, The step of processing the wake-up signal according to the recursive formula includes: Multiple output information is generated according to the first recursive formula, and any output information is determined according to an m-sequence, wherein the m-sequence is determined according to an input information and the first recursive formula; The first information is determined based on the cross-correlation result between the second information and the plurality of output information, wherein the first information is included among the plurality of input information corresponding to the plurality of output information.

13. The method as described in claim 12, characterized in that, The cross-correlation result between the second information and the output information is determined based on the second information, the m-sequence, and the cyclic shift value, which is related to the length of the first information.

14. The method as described in claim 13, characterized in that, The cyclic shift value and the length of the first information satisfy the following: Where cs represents the cyclic shift value, floor() represents flooring down, K represents the length of the first information, and α is a positive integer; or, cs = βK, where cs represents the cyclic shift value, K represents the length of the first information, and β is a positive integer.

15. The method as described in claim 14, characterized in that, The length of the first information satisfies: Where K represents the length of the first information and N represents the length of the second information.

16. The method as described in claim 13, characterized in that, The length of the first information satisfies: Wherein, K represents the length of the first information, and N represents the length of the second information; The cyclic shift value is 0.

17. The method as described in claim 15 or 16, characterized in that, p is a predefined or preconfigured value.

18. The method according to any one of claims 10-17, characterized in that, The length of the first information is less than or equal to the first threshold.

19. The method according to any one of claims 10-18, characterized in that, The method further includes: The first recursive formula is determined from one or more recursive formulas based on the code length and / or the length of the first information.

20. A communication device, characterized in that, It includes units or modules for performing the method as described in any one of claims 1-9, or includes units or modules for performing the method as described in any one of claims 10-19.

21. A communication device, characterized in that, Includes a processor for executing computer programs or instructions to implement the method as described in any one of claims 1-9, or to implement the method as described in any one of claims 10-19.

22. A computer-readable storage medium, characterized in that, The storage medium stores a computer program or instructions, which, when executed by a communication device, implement the method as described in any one of claims 1-9, or the method as described in any one of claims 10-19.

23. A computer program product, characterized in that, When the computer program product is executed by a computer, the computer executes the method as described in any one of claims 1-9, or executes the method as described in any one of claims 10-19.

Images