Information processing method, first communication node, second communication node, storage medium, and program product

Abstract

The present application provides an information processing method, a first communication node, a second communication node, a storage medium, and a program product. The information processing method comprises: processing first-type information via a first operation to obtain second-type information, the first operation at least comprising an encoding operation; and sending the second-type information.

Description

Information processing method, first communication node, second communication node, storage medium and program product Technical Field

[0001] This application relates to the field of communication technology, such as information processing methods, first communication nodes, second communication nodes, storage media, and program products. Background Technology

[0002] For 5G mobile communication systems, in addition to latency, reliability, and availability, the energy efficiency of user equipment (UE) is also crucial. Designing for extended battery life is essential for improving energy efficiency and enhancing user experience.

[0003] Determining the structure of low-power signals is a crucial technical issue that needs to be addressed in order to meet battery life requirements. Summary of the Invention

[0004] This application provides an information processing method, a first communication node, a second communication node, a storage medium, and a program product, which realizes the determination of a low-power signal structure.

[0005] In a first aspect, embodiments of this application provide an information processing method applied to a first communication node, the method comprising:

[0006] The first type of information is processed by a first operation to obtain the second type of information, wherein the first operation includes at least an encoding operation;

[0007] Send the second type of information.

[0008] Secondly, embodiments of this application provide an information processing method applied to a second communication node, the method comprising:

[0009] Obtain the second type of information;

[0010] The second type of information is parsed to obtain the first type of information, and the second type of information is obtained by processing the first type of information through the first operation.

[0011] Thirdly, embodiments of this application provide a first communication node, including:

[0012] One or more processors;

[0013] Storage device for storing one or more programs;

[0014] When the one or more programs are executed by the one or more processors, the one or more processors implement the information processing method provided in the first aspect of the present application.

[0015] Fourthly, embodiments of this application provide a second communication node, including:

[0016] One or more processors;

[0017] Storage device for storing one or more programs;

[0018] When the one or more programs are executed by the one or more processors, the one or more processors implement the information processing method provided in the second aspect of the present application.

[0019] Fifthly, embodiments of this application provide a storage medium storing a computer program, which, when executed by a processor, implements the information processing method provided in embodiments of this application.

[0020] Sixthly, embodiments of this application provide a computer program product, including a computer program that, when executed by a processor, implements the information processing method provided in embodiments of this application.

[0021] Further details regarding the above embodiments and other aspects of this application, as well as their implementations, are provided in the accompanying drawings, detailed description, and claims. Attached Figure Description

[0022] Figure 1 is a flowchart illustrating an information processing method provided in an embodiment of this application;

[0023] Figure 2 is a flowchart of an MC-OOK based LP-WUS generation method provided in an embodiment of this application;

[0024] Figure 3 is a flowchart of another MC-OOK based LP-WUS generation method provided in the embodiments of this application;

[0025] Figure 4 is a flowchart of an MC-OOK based LP-WUS generation method provided in an embodiment of this application;

[0026] Figure 5 is a flowchart illustrating another information processing method provided in an embodiment of this application;

[0027] Figure 6 is a schematic diagram of the structure of an information processing device provided in an embodiment of this application;

[0028] Figure 7 is a schematic diagram of the structure of another information processing device provided in an embodiment of this application;

[0029] Figure 8 is a schematic diagram of the structure of a first communication node provided in an embodiment of this application;

[0030] Figure 9 is a schematic diagram of the structure of a second communication node provided in an embodiment of this application. Detailed Implementation

[0031] To make the objectives, technical solutions, and advantages of this application clearer, the embodiments of this application will be described in detail below with reference to the accompanying drawings. It should be noted that, unless otherwise specified, the embodiments and features described in these embodiments can be arbitrarily combined with each other.

[0032] The steps illustrated in the flowchart in the accompanying drawings can be executed in a computer system such as a set of computer-executable instructions. Furthermore, although a logical order is shown in the flowchart, in some cases the steps shown or described may be performed in a different order than that presented here.

[0033] In this application, the terms "first," "second," etc., are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence.

[0034] In recent years, the Internet of Things (IoT) has attracted much attention. The interconnectivity of more objects is expected to improve efficiency and quality of life. Manually replaceable or rechargeable batteries cannot meet the power needs of all IoT devices, leading to high maintenance costs, serious environmental problems, and even security risks in some application scenarios. Therefore, research into new IoT technologies (Ambient IoT) has been initiated. The solution in this application is also applicable to signaling and communication in Ambient IoT.

[0035] 5G devices may require charging weekly or daily depending on individual usage. Typically, 5G devices consume tens of milliwatts of power in Radio Resource Control (RRC) idle / inactive states and hundreds of milliwatts in RRC connected states. Designing for extended battery life is essential for improving energy efficiency and enhancing user experience.

[0036] The power consumption of a UE depends on the configured wake-up cycle length, such as the paging cycle. To meet battery life requirements, it is anticipated that the valuable Extended Discontinuous Reception (eDRX) cycle will be used, resulting in high latency, which is unsuitable for services requiring both battery life and low latency. Therefore, a low-power wake-up mechanism can be introduced. The low-power wake-up mechanism involves a low-power wake-up signal (LP-WUS), a low-power synchronization signal (LP-SS), and a low-power preamble (LP-Preamble). The waveform of the low-power wake-up signal can be generated using binary on-off keying (OOK) modulation, and is called an OOK-based low-power wake-up signal (OOK-WUS).

[0037] There is no established scheme for the structure and sequence information carried by LP-WUS, LP-SS, and LP-Preamble.

[0038] The role of LP-WUS is to carry low-power wake-up information.

[0039] The functions of LP-SS include at least one of the following: performing radio resource management (RRM) measurements by detecting LP-SS, performing downlink synchronization by detecting LP-SS, and performing frequency offset correction by detecting LP-SS.

[0040] The functions of LP-Preamble include at least one of the following: performing RRM measurement by detecting LP-Preamble, performing downlink synchronization by detecting LP-Preamble, and performing frequency offset correction by detecting LP-Preamble.

[0041] In some embodiments, the LP-Preamble transmission precedes the LP-WUS transmission. The terminal device performs downlink synchronization and / or frequency offset correction by detecting the LP-Preamble, thereby improving the terminal device's LP-WUS detection performance. The terminal device encompasses any suitable type of wireless user equipment, such as mobile phones, portable data processing devices, portable web browsers, or vehicle-mounted mobile stations.

[0042] In one exemplary embodiment, FIG1 is a flowchart illustrating an information processing method provided in an embodiment of the present application; the method can be applied to the situation of determining the structure of a low-power signal, the method can be executed by an information processing device, the information processing device can be integrated on a first communication node, and the first communication node can be any device capable of generating second type of information, such as a base station.

[0043] The waveform of the aforementioned signals (LP-WUS / LP-SS / LP-Preamble) can be generated using OOK modulation, and is referred to as OOK-based LP-WUS / LP-SS / LP-Preamble. Furthermore, in this application, the aforementioned signals can be carried by multiple subcarriers; that is, when the number of subcarriers occupied by the OOK-based LP-WUS / LP-SS / LP-Preamble in the frequency range is greater than one, it is referred to as a multiple subcarrier (MC)-OOK-based LP-WUS / LP-SS / LP-Preamble.

[0044] The following describes the MC-OOK based LP-WUS generation method:

[0045] In one embodiment, the MC-OOK based LP-WUS generation method can generate time-domain representations of M MC-OOK based LP-WUS symbols, where M is greater than or equal to 1.

[0046] Figure 2 is a flowchart of an MC-OOK based LP-WUS generation method provided in an embodiment of this application. Referring to Figure 2, the generation method can generate time-domain representations of M MC-OOK based LP-WUS symbols, where M is greater than or equal to 1. The generation method includes the following steps:

[0047] Step 1: The data information sent on M OOK symbols is S M Define S M = [s0, s1, s2, s3..., s M-1 And its length is M;

[0048] Step 2: Calculate S according to the following formula. M Convert to data information Q K , where Q K The length is K, where K is greater than or equal to 1. Data information Q is not included here. K The generation formula is limited, as long as the data information is S. M Convert to data information Q of length K K That's all.

[0049] or,

[0050] Where A0+A1+…A i +…+A M-1 =K, A0, A1, ... A i A M-1 Corresponding to Figure 2 A0 A1, ..., A M-1 .

[0051] Among them, data The value of can be configured. Where 0 ≤ i ≤ M-1.

[0052] Step 3: Transfer data information Q K Data information D is obtained through K-point DFT / FFT operations. K = [d0, d1, d2, d3, ..., d K-1 ].

[0053] Furthermore, it is also possible to analyze D. K Perform at least one of the following operations, which may be optional steps:

[0054] For D K Perform an upward circular shift operation, the size of which is or Or K / 2. Wherein, This is the round-up operator. This is the floor operator;

[0055] For D K Perform a downward circular shift operation, the size of which is or Or K / 2. Wherein, This is the round-up operator. This is the floor operator;

[0056] For D K Perform a left circular shift operation, the size of which is or Or K / 2. Wherein, This is the round-up operator. This is the floor operator;

[0057] For D K Perform a right circular shift operation, the size of which is or Or K / 2. Wherein, This is the round-up operator. This is the floor operator;

[0058] For D K Perform the FFT operation, where FFT is a function used to shift the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFT(X) swaps the left and right halves of X or swaps the top and bottom halves of X. For a matrix X, FFT(X) swaps the first and third quadrants, and the second and fourth quadrants.

[0059] Step 4: Transfer data information D K The data is padded onto K subcarriers in the frequency domain. When the overall frequency bandwidth of the system includes N subcarriers, N-point IDFT / IFFT operations are performed on the padded data on the N subcarriers to obtain time-domain data T at N sampling points. N =[t0,t1,t2,t3,...,t N-1 ]. Where N is greater than or equal to 1.

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

[0061] Where, [t0, t1, t2, t3, ..., t N / M-1 ] represents the sampling point data of the first OOK time-domain symbol out of M OOK time-domain symbols, [t N / M , t N / M+1 , ..., t 2N / M-1 ] represents the sampling point data of the second OOK time-domain symbol out of M OOK time-domain symbols, and so on, [t (M-1)N / M ,t(M-1)N / M+1,...,t N-1 ] represents the sampling point data of the Mth OOK time-domain symbol out of M OOK time-domain symbols.

[0062] Furthermore, before performing the N-point IDFT / IFFT operation, at least one of the following operations can be performed on the data filled on the N subcarriers, and this operation can be optional:

[0063] Perform an upward circular shift operation on the data, with the shift size being... or Or N / 2. Wherein, This is the round-up operator. This is the floor operator;

[0064] Perform a downward circular shift operation on the data, with the shift size being... or Or N / 2. Wherein, This is the round-up operator. This is the floor operator;

[0065] Perform a left circular shift operation on the data, with the shift size being... or Or N / 2. Wherein, This is the round-up operator. This is the floor operator;

[0066] Perform a right circular shift operation on the data, with the shift size being... or Or N / 2. Wherein, This is the round-up operator. This is the floor operator;

[0067] The data is subjected to an FFT operation, where FFT is a function used to shift the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFT(X) swaps the left and right halves of X or swaps the top and bottom halves of X. For a matrix X, FFT(X) swaps the first and third quadrants, and the second and fourth quadrants.

[0068] Step 5: Time-domain data T from N sampling points N =[t0,t1,t2,t3,...,t N-1 Before transmission, a cyclic prefix (CP) operation needs to be performed, which involves adding a cyclic prefix to the time-domain data T of N sampling points. N N at the tail cp The time-domain data T, which is copied from the information of one sampling point to N sampling points, is... N The head is removed, forming (N+N) cp The time-domain data of (N+N) sampling points, and then these (N+N) cp Data from ) sampling points is sent out.

[0069] Additionally, in step 4, when the number of frequency domain subcarriers allocated to the MC-OOK based LP-WUS symbol is not equal to K, for example, when the number of frequency domain subcarriers allocated to the MC-OOK based LP-WUS symbol is K1, where K1 is not equal to K, the process in step 4 is modified as follows. Figure 3 is a flowchart of another MC-OOK based LP-WUS generation method provided in this application embodiment. Figure 3 shows the generation process:

[0070] (1) Data information D K = [d0, d1, d2, d3, ..., d K-1 Process D K Convert to E K1 E K1 =[e0,e1,e2,e3,...,e K1-1 ];

[0071] Furthermore, it is also possible to examine E. K1 Perform at least one of the following operations, which may be optional:

[0072] right Perform an upward circular shift operation, the size of which is or Or K1 / 2. Wherein, This is the round-up operator. This is the floor operator;

[0073] For E K1 Perform a downward circular shift operation, the size of which is or Or K1 / 2. Wherein, This is the round-up operator. This is the floor operator;

[0074] For E K1 Perform a left circular shift operation, the size of which is or Or K1 / 2. Wherein, This is the round-up operator. This is the floor operator;

[0075] For E K1 Perform a right circular shift operation, the size of which is or Or K1 / 2. Wherein, This is the round-up operator. This is the floor operator;

[0076] For E K1 Perform the FFT operation, where FFT is a function used to shift the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFT(X) swaps the left and right halves of X or swaps the top and bottom halves of X. For a matrix X, FFT(X) swaps the first and third quadrants, and the second and fourth quadrants.

[0077] (2) Transfer data information E K1 Fill the K1 subcarriers in the frequency domain;

[0078] (3) When the overall frequency domain bandwidth of the system includes N subcarriers, then perform N-point IDFT / IFFT operations on the padding data on the N subcarriers to obtain time domain data T at N sampling points. N =[t0,t1,t2,t3,...,t N-1 ]. Where N is greater than or equal to 1.

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

[0080] Where, [t0, t1, t2, t3, ..., t N / M-1 ] represents the sampling point data of the first OOK time-domain symbol out of M OOK time-domain symbols, [t N / M , t N / M+1 , ..., t 2N / M-1 ] represents the sampling point data of the second OOK time-domain symbol out of M OOK time-domain symbols, and so on, [t (M-1)N / M ,t(M-1)N / M+1,...,t N-1 ] represents the sampling point data of the Mth OOK time-domain symbol out of M OOK time-domain symbols.

[0081] Furthermore, before performing the N-point IDFT / IFFT operation, at least one of the following operations can be performed on the data filled on the N subcarriers, and this operation can be optional:

[0082] Perform an upward circular shift operation on the data, with the shift size being... or Or N / 2. Wherein, This is the round-up operator. This is the floor operator;

[0083] Perform a downward circular shift operation on the data, with the shift size being... or Or N / 2. Wherein, This is the round-up operator. This is the floor operator;

[0084] Perform a left circular shift operation on the data, with the shift size being... or Or N / 2. Wherein, This is the round-up operator. This is the floor operator;

[0085] Perform a right circular shift operation on the data, with the shift size being... or Or N / 2. Wherein, This is the round-up operator. This is the floor operator;

[0086] The data is subjected to an FFT operation, where FFT is a function used to shift the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFT(X) swaps the left and right halves of X or swaps the top and bottom halves of X. For a matrix X, FFT(X) swaps the first and third quadrants, and the second and fourth quadrants.

[0087] The MC-OOK based LP-WUS generation method generates time-domain representations of M MC-OOK based LP-WUS symbols, where M is greater than or equal to 1. The generation process includes the following steps:

[0088] Step 1: The data information sent on M OOK symbols is S M Define S M = [s0, s1, s2, s3..., s M-1 And its length is M;

[0089] Step 2: According to the following formula, S M Generate data information

[0090] or

[0091] in, in, It is an integer greater than or equal to 1. Furthermore, The preferred value for is N. Here, N represents the number of subcarriers included in the system bandwidth.

[0092] Among them, data The value of can be configured. Where 0 ≤ i ≤ M-1.

[0093] Step 3: Transfer the data information After the first processing module, data information D is obtained. K = [d0, d1, d2, d3, ..., d K-1 ] T .

[0094] The first processing module includes at least one of the following operations:

[0095] (1) To Generate data information D according to the following formula. K

[0096] in, Preferred, Let F be the generalized inverse matrix. Where (X) -1 To find the inverse of matrix X, (X) is the operation. H To find the conjugate transpose of matrix X, (X) H To find the transpose of matrix X, perform the matrix operation.

[0097] Where F is a matrix consisting of K columns of elements in the IDFT matrix, matrix F is A matrix with K rows and K columns.

[0098] The expression for the IDFT matrix is:

[0099] or

[0100] Furthermore, the K columns of elements in the IDFT matrix that make up F are in the IDFT matrix. The position of a column element is determined at least by the data information D. K The positions or indices of the K subcarriers filled into the frequency domain are determined.

[0101] (2) For D K Perform at least one of the following operations, which can be optional:

[0102] For D K During the upward circular shift operation, the size of the circular shift is... or Or K / 2. Wherein, This is the round-up operator. This is the floor operator;

[0103] For D K During the downward circular shift operation, the size of the circular shift is... or Or K / 2. Wherein, This is the round-up operator. This is the floor operator;

[0104] For D K During a left circular shift operation, the size of the shift is... or Or K / 2. Wherein, This is the round-up operator. This is the floor operator;

[0105] For D K During a right circular shift operation, the size of the shift is... or Or K / 2. Wherein, This is the round-up operator. This is the floor operator;

[0106] For D K Perform the FFT operation, where FFT is a function used to shift the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFT(X) swaps the left and right halves of X or swaps the top and bottom halves of X. For a matrix X, FFT(X) swaps the first and third quadrants, and the second and fourth quadrants.

[0107] Step 4: Transfer data information D K The data is padded onto K subcarriers in the frequency domain. When the overall frequency bandwidth of the system includes N subcarriers, N-point IDFT / IFFT operations are performed on the padded data on the N subcarriers to obtain time-domain data T at N sampling points. N =[t0,t1,t2,t3,...,t N-1 ]. Where N is greater than or equal to 1.

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

[0109] Where, [t0, t1, t2, t3, ..., t N / M-1 ] represents the sampling point data of the first OOK time-domain symbol out of M OOK time-domain symbols, [t N / M , t N / M+1 , ..., t 2N / M-1] represents the sampling point data of the second OOK time-domain symbol out of M OOK time-domain symbols, and so on, [t (M-1)N / M ,t(M-1)N / M+1,...,t N-1 ] represents the sampling point data of the Mth OOK time-domain symbol out of M OOK time-domain symbols.

[0110] Step 5: Time-domain data T from N sampling points N =[t0,t1,t2,t3,...,t N-1 Before transmission, a CP (Cyclic prefix) operation needs to be performed, which involves adding the time-domain data T from N sampling points. N N at the tail cp The time-domain data T, which is copied from the information of one sampling point to N sampling points, is... N The head is removed, forming (N+N) cp The time-domain data of (N+N) sampling points, and then these (N+N) cp Data from ) sampling points is sent out.

[0111] Additionally, in step 4, when the number of frequency domain subcarriers allocated to the MC-OOK based LP-WUS symbol is not equal to K, for example, when the number of frequency domain subcarriers allocated to the MC-OOK based LP-WUS symbol is K1, where K1 is not equal to K, the process of step 4 is as follows. Figure 4 is a flowchart of an MC-OOK based LP-WUS generation method provided by an embodiment of this application. The generation process is shown in Figure 4:

[0112] (1) Data information D K = [d0, d1, d2, d3, ..., d K-1 Process D K Convert to E K1 E K1 =[e0,e1,e2,e3,...,e K1-1 ];

[0113] (2) Transfer data information E K1 Fill the K1 subcarriers in the frequency domain;

[0114] (3) When the overall frequency domain bandwidth of the system includes N subcarriers, then perform N-point IDFT / IFFT operations on the padding data on the N subcarriers to obtain time domain data T at N sampling points. N =[t0,t1,t2,t3,...,t N-1 ]. Where N is greater than or equal to 1.

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

[0116] Where, [t0, t1, t2, t3, ..., t N / M-1 ] represents the sampling point data of the first OOK time-domain symbol out of M OOK time-domain symbols, [t N / M , t N / M+1 , ..., t 2N / M-1 ] represents the sampling point data of the second OOK time-domain symbol out of M OOK time-domain symbols, and so on, [t (M-1)N / M ,t(M-1)N / M+1,...,t N-1 ] represents the sampling point data of the Mth OOK time-domain symbol out of M OOK time-domain symbols.

[0117] This application may also process data information S in either method 1 or method 2. M The data is processed to obtain data information Q. K or data information

[0118] Method 1: The data information transmitted on M OOK symbols is S M S M It contains M elements, namely S M The length is M, denoted as S. M = [s0, s1, s2, s3…, s M-1 ].

[0119] Step 1: Based on data information S M element s in i Generate Es i .

[0120] For example, Es i It can satisfy any of the following formulas:

[0121] Where, x i =0 or x i =s i y i =0 or yi i =s i .

[0122] Step 2: Based on Es i Generate data information Q K or data information

[0123] Among them, Q K [Es0, Es1, ..., Es] M-1 ],

[0124] Q K The length is K, where K is greater than or equal to 1. For example, K can be the number of subcarriers occupied by LP-WUS / LP-SS / LP-Preamble in the frequency domain.

[0125] It should be noted that the number of subcarriers corresponding to the protection bandwidth configured in the frequency domain for LP-WUS / LP-SS / LP-Preamble is not counted in the K subcarriers.

[0126] The length is in, It is an integer greater than or equal to 1. For example, The value of can be N. Here, N represents the number of subcarriers included in the system bandwidth.

[0127] Method 2: The data information transmitted on M OOK symbols is S M S M It contains M elements, namely S M The length is M, denoted as S. M = [s0, s1, s2, s3, ..., s M-1 ].

[0128] Step 1: Based on data information S M element s in i Generate Es i .

[0129] For example, Es i It can satisfy any of the following formulas:

[0130] in, or for B in i Elements, for example It can be The last B in i There are n elements, 0 ≤ b i ≤B i -1.

[0131] or for C in i Elements, for example It can be The first C i There are elements, 0 ≤ c i ≤Ci -1.

[0132] Among them, data The value can be configured, 0≤i≤M-1.

[0133] In some embodiments, data It consists of at least one of the following:

[0134] (1) Length is sequence

[0135] (2) Length is sequence for Center front an element or A zero element or A padding element, where the padding element can be any predefined element.

[0136] (3) Length is sequence for Mid-back an element or A zero element or A padding element.

[0137] For example, sequence It can be a binary random sequence, such as a Zadoff-Chu (ZC sequence), a maximum length linear feedback shift register sequence (M sequence), or a pseudo noise sequence (PN sequence). It can also be a repetition of a binary random sequence.

[0138] In some embodiments, data It can be a combination of the above sequences, for example:

[0139] For example, data It can also be obtained by processing the elements of the above sequence. For example, one of the elements is Where 0≤a≤A i -1, can be used for Multiply by and / or divide by and / or add and / or subtract an element.

[0140] Step 2: Based on Es i Generate data information Q K or data information

[0141] Among them, Q K = [Es0, Es1, ..., Es] M-1 ],

[0142] Q K The length is K, where K is greater than or equal to 1. For example, K can be the number of subcarriers occupied by LP-WUS / LP-SS / LP-Preamble in the frequency domain.

[0143] It should be noted that the number of subcarriers corresponding to the protection bandwidth configured in the frequency domain for LP-WUS / LP-SS / LP-Preamble is not counted in the K subcarriers.

[0144] The length is in, It is an integer greater than or equal to 1. For example, The value of can be N. Here, N represents the number of subcarriers included in the system bandwidth.

[0145] It should be noted that the various embodiments of this application can be referenced or learned from each other. For example, the same or similar steps, method embodiments, system embodiments and device embodiments can be referenced from each other without limitation.

[0146] The following description of the low-power signal structure is illustrated by the generation of the second type of information, as shown in Figure 1. The information processing method provided in this application includes the following operations:

[0147] S110. The first type of information is processed by a first operation to obtain the second type of information, wherein the first operation includes at least an encoding operation.

[0148] The first type of information can be considered processed information, which may correspond to low-power signals, such as wake-up information. In other words, the first type of information can be processed wake-up information. Wake-up information can be information indicating whether to wake up the UE, such as information on whether to wake up the UE.

[0149] In this application, the low-power signal can be a low-power wake-up signal. The wake-up information can indicate the content carried by the low-power wake-up signal.

[0150] A Low Power Wake-Up Receiver (LP-WUR) is a receiver specifically designed for low-power communication. Its function is to wake up the device's main radio module by detecting a Low Power Wake-Up Signal (LP-WUS), thereby significantly reducing the device's power consumption in idle states. It maintains low-power operation when the main radio module is off or in sleep mode.

[0151] Low-power wake-up receivers can receive low-power signals, including LP-WUS. Low-power wake-up receivers are simple to implement and have low complexity, therefore their power consumption is much lower than that of the main receiver. The main receiver has strong receiving performance and can achieve high transmission rates; however, it also has higher receiver complexity and generates higher power consumption.

[0152] The low-power wake-up receiver consumes less power than the main receiver, thus reducing energy consumption.

[0153] The second type of information can be information generated after the first operation. The first operation includes at least encoding operations, such as Manchester encoding. The first type of information can be information encoded using RM (Reed-Muler) encoding.

[0154] In this embodiment, the first operation includes at least an encoding operation, and can also be combined with other operations to process the first type of information. For example, the first operation may also include a repeated operation, which may include at least one of the following:

[0155] Repeat the first type of information as a whole;

[0156] Repeat each element in the first type of information;

[0157] The first type of information is repeated as a whole after processing;

[0158] The operation is repeated for each element in the first type of information after processing.

[0159] The first type of information after processing can be the first type of information after encoding; the processing method is not limited here.

[0160] The repetition of the first type of information as a whole can be achieved by treating the first type of information as a whole and repeating the entire first type of information each time. The repetition of each element in the first type of information can be achieved by repeating each element in the first type of information sequentially.

[0161] In this embodiment, the execution order of the various operations included in the first operation is not limited. The repeated operations can be executed first, followed by the coded operations; or the coded operations can be executed first, followed by the repeated operations.

[0162] In one example, the first type of information b0, b1, ..., b N-1 The second type of information is generated after the first operation.

[0163] S120, Send the second type of information.

[0164] After obtaining the second type of information, it can be sent to the second communication node so that the second communication node can parse the second type of information to obtain the first type of information, and then obtain the low-power signal.

[0165] The second type of information can be sent in symbols, such as by segmenting the third type of information and sending it through different symbols.

[0166] In one example, data is transmitted across multiple Orthogonal Frequency Division Multiplexing (OFDM) symbols, where the data transmitted in one OFDM symbol is S. M That is, the M elements in the second type of information.

[0167] This application provides an information processing method whereby the first type of information may include processed low-power signal information, such as wake-up information, or information including low-power signals. After processing the first type of information, a second type of information is obtained and sent. This embodiment demonstrates that the first type of information corresponding to low-power signals is processed by a first operation to obtain the second type of information. The structure of the low-power signal is clarified.

[0168] Based on the above embodiments, modified embodiments of the above embodiments are proposed. It should be noted that, in order to keep the description brief, only the differences from the above embodiments are described in the modified embodiments.

[0169] In one embodiment, the first operation includes one of the following:

[0170] The third type of information is obtained by repeating each element of the first type of information R times. Manchester encoding is performed on each element of the third type of information, where R is an integer greater than 1.

[0171] Each element in the first type of information is Manchester encoded;

[0172] The first type of information is repeated Z times to obtain the third type of information. Each element in the third type of information is then encoded using Manchester encoding, where Z is an integer greater than 1.

[0173] After Manchester encoding each element in the first type of information, the third type of information is obtained, and each element in the third type of information is repeated.

[0174] After Manchester encoding each element in the first type of information, the third type of information is obtained. The third type of information is repeated in groups of L elements, where L is the length of the Manchester encoding.

[0175] The third type of information is obtained by performing Manchester encoding on each element in the first type of information. The third type of information is then repeated Y times, where Y is an integer greater than 1.

[0176] The first operation can be to repeat the information in the first category, element by element, to obtain the third category of information after the repetition. Then, Manchester encoding is performed on each element in the third category of information to obtain the second category of information.

[0177] In this embodiment, the first operation may also exclude repetitive operations, such as the operation of performing Manchester encoding on each element in the first type of information.

[0178] In one example, the first operation includes:

[0179] (1) Each element in the first type of information is repeated R times to generate the third type of information. Here, R is an integer greater than or equal to 1;

[0180] (2) Each element in the third type of information is encoded using Manchester code to generate the second type of information.

[0181] If R=1, then the operation is not repeated and (2) can be executed.

[0182] For example, the first type of information can be b0, b1, ..., b N-1 The third type of information obtained by repeating each element in the first type of information can be... The third type of information obtained after encoding can be...

[0183] The Manchester code has a length of 2. For example, bit 0 is generated as [1 0] after being encoded by Manchester code of length 2, and bit 1 is generated as [0 1] after being encoded by Manchester code of length 2. Each element in the code is encoded using Manchester encoding to generate two elements, which ultimately form the third type of information.

[0184] In this example, the value of element b includes one or more of the following: 0, 1, and -1. The subscript of element b does not affect the value of b. That is, the value of element b is not limited by its subscript.

[0185] The first operation can repeat the first type of information as a whole to obtain the third type of information, and then repeat each element of the third type of information in turn to obtain the second type of information. Alternatively, the first operation can exclude the repetition operation, such as including the operation of Manchester encoding each element of the first type of information.

[0186] In one example, the first operation includes:

[0187] (1) The first type of information is repeated Z times to generate the third type of information. Here, Z is an integer greater than or equal to 1.

[0188] (2) Each element in the third type of information is encoded using Manchester code to generate the second type of information.

[0189] If R=1, then the operation is not repeated and (2) can be executed.

[0190] For example, the first type of information can be b0, b1, ..., b N-1 The third type of information is obtained by repeating the first type of information as a whole. The second type of information obtained after encoding the third type of information is:

[0191] The Manchester code has a length of 2. For example, bit 0 is generated as [1 0] after being encoded by Manchester code of length 2, and bit 1 is generated as [0 1] after being encoded by Manchester code of length 2. Each element in the code is encoded using Manchester encoding to generate two elements, which together form the second type of information. This example uses the value of Z as R as an example for description.

[0192] In the example above, the first operation involves repeating the operation before encoding. The following description uses the example of encoding first, followed by repeating the operation.

[0193] The first operation can either repeat each element in the first type of information by Manchester encoding, or repeat it by the overall dimension of the encoded third type of information.

[0194] The following is an example of first encoding each element, and then repeating each encoded element:

[0195] In one example, the first operation includes:

[0196] (1) Each element in the first type of information is encoded using Manchester code to generate the third type of information.

[0197] (2) The third type of information is repeated as a whole, generating the second type of information.

[0198] If R=1, then the operation is not repeated and (2) can be executed.

[0199] For example, the first type of information can be b0, b1, ..., b N-1 The third type of information is The second type of information is

[0200] The Manchester code has a length of 2. For example, bit 0 is generated as [1 0] after being encoded by Manchester code of length 2, and bit 1 is generated as [0 1] after being encoded by Manchester code of length 2. Each element in the code is encoded using Manchester encoding to generate two elements, which ultimately form the third type of information. The third type of information is repeated R times to generate the second type of information. Where R is an integer greater than or equal to 1.

[0201] The following is an example of first encoding each element, and then repeating each encoded element:

[0202] In one example, the first operation includes:

[0203] (3) Each element in the first type of information is encoded using Manchester code to generate the third type of information.

[0204] (4) Each element in the third type of information is repeated Q times to generate the second type of information. Where Q is an integer greater than or equal to 1;

[0205] If R=1, then the operation is not repeated and (2) can be executed.

[0206] For example, the first type of information can be b0, b1, ..., b N-1 The third type of information is formed by encoding each element in the first type of information. The second type of information is obtained by repeating each element in the third type of information.

[0207] The Manchester code has a length of 2. For example, bit 0 is generated as [1 0] after being encoded by Manchester code of length 2, and bit 1 is generated as [0 1] after being encoded by Manchester code of length 2. Each element in the code is encoded using Manchester encoding to generate two elements, which ultimately form the third type of information. In the third type of information, each element is repeated R times to generate the third type of information. Where R is an integer greater than or equal to 1; in this embodiment, Q is described by taking the value R.

[0208] In this embodiment, the first operation can be to encode each element in the first type of information, and then repeat the encoding of the third type of information by grouping every L elements together to obtain the second type of information. Alternatively, the first type of information can be repeated by grouping every G elements together to obtain the third type of information, and then each element in the third type of information can be encoded to obtain the second type of information.

[0209] In one example, the first operation includes:

[0210] (1) Each element in the first type of information is encoded using Manchester code to generate the third type of information.

[0211] (2) In the third type of information, each group consists of L elements, which are repeated E times to generate the second type of information. Here, E is an integer greater than 1; and L is the Manchester code length.

[0212] If R=1, then the operation is not repeated and (2) can be executed.

[0213] For example, the first type of information can be b0, b1, ..., b N-1 The third type of information obtained by encoding the first type of information is: The second type of information is obtained by repeating the L items in each group from the third type of information.

[0214] The Manchester code has a length of 2. For example, bit 0 is generated as [1 0] after being encoded by Manchester code of length 2, and bit 1 is generated as [0 1] after being encoded by Manchester code of length 2. Each element in the code is encoded using Manchester encoding to generate two elements, which ultimately form the third type of information. In the third type of information, each L = 2 elements are repeated R times to generate the second type of information. Where R is an integer greater than or equal to 1; in this embodiment, the value of E is described as R.

[0215] In one embodiment, the M elements of the second type of information are sent in at least one symbol.

[0216] When M elements are to be sent on multiple symbols, the M elements can be grouped and sent on different symbols respectively.

[0217] In one embodiment, when the symbol is an on / off keying symbol OOK or a multi-subcarrier on / off keying symbol MC-OOK, the number of symbols is M;

[0218] When the symbol is an orthogonal frequency division multiplexing (OFDM), the number of symbols is 1.

[0219] With a symbol count of M, different elements can be sent on different symbols.

[0220] The transmission method in this embodiment is shown in Figure 2-4.

[0221] In one embodiment, the first type of information is information generated by the second operation from the fourth type of information, and the fourth type of information includes one or more of the following:

[0222] Wake-up message;

[0223] Verification information;

[0224] Fill in the information.

[0225] The second operation is not limited here. It may include operations such as RM encoding. The execution order of the operations is not specified.

[0226] The first type of information can be b0, b1, ..., b N-1 , with a length of N, where N is an integer greater than or equal to 1.

[0227] In one example, the wake-up message includes at least one of the following:

[0228] Identification information;

[0229] Instruction information.

[0230] The identification information is the identifier of the UE or the identifier of the UE group (which includes at least one UE); the UE or UE group corresponding to the identification information is the UE or UE group that needs to perform the wake-up operation.

[0231] The indication information refers to at least one UE or at least one UE group (including at least one UE); the UE or UE group indicated by the indication information is the UE or UE group that needs to perform a wake-up operation.

[0232] The wake-up information includes at least one of the identification information and / or at least one indication information.

[0233] Verification information can be considered as information used for verification, such as Cyclic Redundancy Check (CRC). CRC is an algorithm used to detect or verify whether errors have occurred in data / information transmission.

[0234] The padding information can be information used to fill in the wake-up information so that the length of the generated first type of information meets the requirements.

[0235] In wireless communication, the size and format of transmitted information must conform to specific standards; this specific size of information is called an information block. When the information to be transmitted is smaller than the information block size, padding information is used after the transmitted information to ensure that the size of the transmitted information meets the requirements of the information block. Padding information can be specific characters or binary data.

[0236] In one embodiment, the second operation includes one or more of the following:

[0237] repeat;

[0238] Scrambling;

[0239] Reidmiller RM encoding;

[0240] Intertwined;

[0241] Add padding bits;

[0242] Add verification information;

[0243] Rate matching.

[0244] In this embodiment, the execution order of each second operation is not limited.

[0245] In one example, the second operation includes RM encoding; or the second operation includes RM encoding and rate matching.

[0246] Repetition can be considered as copying data according to certain rules.

[0247] The scrambling operation includes at least one of the following:

[0248] Based on pre-defined scrambling rules, the input data or information is scrambled to generate output data or information. For example, the input data or information is b0, b1, b2, ..., b N-1 The output data or information is d0, d1, d2, ..., d N-1 The scrambling rule is: d i =(b i +c i )mod2.

[0249] Where i is an integer greater than or equal to 0 and less than or equal to N-1.

[0250] Among them, c i Generate according to the set rules.

[0251] b i and c i The value of is one of the following: 0, 1, and -1.

[0252] The RM encoding process is as follows:

[0253] The input information for RM encoding is c0, c1, c2, ..., c K-1 The length of the input information is K, where 3 ≤ K ≤ 11. The output information of the input information after RM encoding is d0, d1, d2, ..., d N-1 Where N is the output information d0, d1, d2, ..., d N-1 Length of the output information d0, d1, d2, ..., d N-1 Obtained through the following methods:

[0254] Where i = 0, 1, ..., N-1, N = 32. M i,k The value can be selected from the table below.

[0255] Table 1: M i,k The value of

[0256] The interleaving operation includes at least one of the following:

[0257] The input data or information is rearranged according to pre-defined interleaving rules. These interleaving rules can be determined based on time, frequency, or specified parameters.

[0258] After interleaving, data or information that was originally adjacent in time, frequency, or space is separated, enhancing its resistance to interference and errors. When the data or information arrives at the receiving end, the deinterleaving module restores the received interleaved data or information to its original order according to the interleaving rules at the sending end, so that subsequent data or information decoding operations can be performed correctly.

[0259] The rate matching operation can be:

[0260] The input information for the rate matching operation is d0, d1, d2, ..., d N-1The length of the input information is N, where N is an integer greater than or equal to 1. The output information of the input information after the rate matching operation is f0, f1, f2, ..., f E-1 Where E represents the output information f0, f1, f2, ..., f E-1 Length of output information f0, f1, f2, ..., f E-1 Obtained through the following methods:

[0261] Starting the variable k from 0, loop 1 in each iteration until E-1, and execute f in each iteration. k =d kmodN .

[0262] Adding padding bits can be considered as the operation of filling in extra bits, such as the operation of filling in padding information.

[0263] Adding verification information can be considered as the operation of adding verification information.

[0264] In one embodiment, when the second operation includes RM encoding and speed matching, the first length of the fourth type of information output after RM encoding is rate matched to output the second length of information.

[0265] The value of the second length can be greater than, less than, or equal to the first length.

[0266] In one example, the second operation includes RM encoding and rate matching. Specifically, the output information after RM encoding... When the first length is N, rate matching is performed on the output information of the first length N. The output information after rate matching is f0, f1, f2, ..., f E-1 The second length is E.

[0267] The value of E can be less than, equal to, or greater than N.

[0268] For cases where E is less than or equal to N, assuming the maximum value of N is 32, the possible values ​​of E are {7, 14, 21, 28}, which are values ​​extended in multiples of 7 or 14.

[0269] For cases where E is greater than or equal to N, assuming the maximum value of N is 32, the possible values ​​of E are {35, 42, 49, 56, 63}, which are values ​​extended in multiples of 7 or 14.

[0270] In one example, the set of values ​​for E includes at least one of the following:

[0271] Set E1 = [7, 14, 21, 28, 35, 42, 49, 56, 63], which means expanding in multiples of 7;

[0272] The set E2 is [14, 28, 42, 56, 70], which means it expands in multiples of 14.

[0273] In one embodiment, if the first operation includes a repetitive operation, the length of the output information corresponding to the RM encoding in the second operation includes 28 or 32 or the maximum length among the encoding lengths supported by RM encoding.

[0274] Repeated operations can include one or more of the following:

[0275] Repeat the operation on each element in the first type of information;

[0276] Repeat the operation on the entire first type of information;

[0277] Repeat the operation on each element in the third type of information;

[0278] Repeat the operation on the entire third type of information;

[0279] Repeat the operation on every G elements in the first type of information;

[0280] Repeat the operation for every L elements in the third type of information.

[0281] The maximum length supported by RM encoding can be the maximum length among a variety of predefined RM encoding lengths. This embodiment does not limit the encoding method; it can be error-correcting encoding such as RM encoding.

[0282] When the number of repetitions is greater than 1, that is, when the first operation includes a repetition operation, the length of the output information corresponding to the RM encoding in the second operation is N. max Among them, N max It can be 28 or 32, or the maximum length among the configured RM encoding lengths.

[0283] When the number of repetitions R is greater than 1, N max =32, and the following first operation can be performed:

[0284] (1) Each element in the first type of information is repeated R times to generate the third type of information. Here, R is an integer greater than or equal to 1;

[0285] (2) Each element in the third type of information is encoded using Manchester code to generate the second type of information.

[0286] The lengths of the first type of information and the second type of information are described below. The descriptions of the first type of information and the second type of information can be applied to this application or to any transmission scheme, such as to receivers or terminals of types other than those in this application.

[0287] There are two sending schemes for the fourth type of information.

[0288] The first sending scheme is as follows: First, generate the first type of information based on the fourth type of information, then generate the second type of information based on the first type of information, and then send the second type of information according to the scheme described in Figures 2-4.

[0289] The second sending scheme involves sending either type I or type IV information, with the same meaning. However, the sending method differs, including:

[0290] The first or fourth type of information is divided into P (P is an integer greater than or equal to 1) sub-information, and one sub-information is sent in one OOK symbol. The sub-information of the first or fourth type of information is carried by a sequence. The sequence is:

[0291] (1) Data in the MC-OOK based LP-WUS generation method shown in Figure 2 Where 0≤i≤M-1;

[0292] (2) Data in the MC-OOK based LP-WUS generation method shown in Figure 4 Where 0≤i≤M-1;

[0293] (3) Data information S M Data processed in method 2 Where 0≤i≤M-1.

[0294] In one embodiment, each sub-information has the same length;

[0295] In this embodiment, A0 = A1 = ... = A M-1 =L ZC That is, the length of the sequence is L. ZC .

[0296] Based on the content of the sub-information of the first type of information or the fourth type of information, the first sequence, also known as a sequence, is sent. The sequence is taken from a first sequence set, also known as a sequence set. The sequences in the sequence set have a correspondence or mapping relationship with the content of the sub-information.

[0297] When the number of symbols is M=1, the sequence set contains a maximum of 16 sequences, meaning that the sequence can support a maximum of 4 bits of sub-information;

[0298] When the number of symbols is M=2, the sequence set contains a maximum of 8 sequences, meaning that the sequence can support a maximum of 3 bits of sub-information;

[0299] When the number of symbols is M=4, the sequence set contains a maximum of 4 sequences; that is, the sequence can support a maximum of 2 bits of sub-information.

[0300] To ensure that each piece of information has the same length, some design is needed for the length of the first or fourth type of information.

[0301] In one embodiment, the length of the fourth type of information satisfies one or more of the following:

[0302] Multiples of 2;

[0303] Multiples of 3;

[0304] Multiples of 4.

[0305] In one embodiment, the information processing method includes at least one of the following:

[0306] When the transmission method is the first transmission method, the length of the fourth type of information is an integer multiple of any one of 4, 3, and 2;

[0307] When the transmission method is the second transmission method, the length of the fourth type of information is an integer multiple of 3 or 2;

[0308] When the transmission method is the third transmission method, the length of the fourth type of information is an integer multiple of 2.

[0309] The transmission method can be represented by the symbols used. The first transmission method can be the case where M equals 1. The second transmission method can be the case where M equals 2. The third transmission method can be the case where M equals 4. Here, the correspondence between the first transmission method and M is not limited. The fourth type of information is a0, a1, a2, ..., a K-1 The length is K.

[0310] In one example, when the number of symbols is M = 1, K is an integer multiple of any of 4, 3, and 2;

[0311] In one example, when the number of symbols is M = 2, K is a multiple of 3 or 2;

[0312] In one example, when the number of symbols is M = 4, K is an integer multiple of 2;

[0313] In one example, the number of OOK symbols in an OFDM symbol is M. Different values ​​of M are associated with the number of OOK symbols in an OFDM symbol. The second type of information can be transmitted on the number of OOK symbols corresponding to the value of M. M can also correspond to the number of elements in the second type of information.

[0314] In one example, when the transmission method is the first transmission method, the length of the fourth type of information is an integer multiple of 4.

[0315] In one example, when the sending method is the first sending method, the length of the fourth type of information is an integer multiple of 3.

[0316] In one example, when the sending method is the first sending method, the length of the fourth type of information is an integer multiple of 2.

[0317] In one example, when the sending method is the second sending method, the length of the fourth type of information is an integer multiple of 3.

[0318] In one example, when the sending method is the second sending method, the length of the fourth type of information is an integer multiple of 2.

[0319] When the number of symbols is M=1, the sequence set contains a maximum of 16 sequences, meaning that the sequence can support a maximum of 4 bits of information.

[0320] When the number of symbols is M=2, the sequence set contains a maximum of 8 sequences, meaning that the sequence can support a maximum of 3 bits of sub-information;

[0321] When the number of symbols is M=4, the sequence set contains a maximum of 4 sequences; that is, the sequence can support a maximum of 2 bits of sub-information.

[0322] To ensure that each sub-information in the fourth category has the same length, the length of the fourth category needs to be adjusted, including:

[0323] When the wake-up message is 5 bits and the number of symbols is M=1, the length K of the fourth type of information is 8, which includes P=2 sub-information;

[0324] When the wake-up message is 5 bits and the number of symbols is M=2, the length K of the fourth type of information is 6, which includes P=2 sub-information;

[0325] When the wake-up message is 5 bits and the number of symbols is M=4, the length K of the fourth type of information is 6, which includes P=3 sub-information;

[0326] When the wake-up message is 6 bits and the number of symbols is M=1, the length K of the fourth type of information is 8, which includes P=2 sub-information;

[0327] When the wake-up message is 6 bits and the number of symbols is M=2, the length K of the fourth type of information is 6, which includes P=2 sub-information;

[0328] When the wake-up message is 6 bits and the number of symbols is M=4, the length K of the fourth type of information is 6, which includes P=3 sub-information;

[0329] When the wake-up information is 7 bits and the number of symbols is M=1, the length K of the fourth type of information is 8, which includes P=2 sub-information;

[0330] When the wake-up message is 7 bits and the number of symbols is M=2, the length K of the fourth type of information is 9, which includes P=3 sub-information;

[0331] When the wake-up message is 7 bits and the number of symbols is M=4, the length K of the fourth type of information is 8, which includes P=4 sub-information.

[0332] In one embodiment, the first type of information b0, b1, ..., b N-1 The length N satisfies one or more of the following:

[0333] Multiples of 2;

[0334] Multiples of 3;

[0335] Multiples of 4.

[0336] In one embodiment, the information processing method satisfies at least one of the following:

[0337] When M is 1, the length of the first type of information is an integer multiple of 4;

[0338] When M is 2, the length of the first type of information is an integer multiple of 3;

[0339] When M is 4, the length of the first type of information is an integer multiple of 2.

[0340] In one embodiment, the length N of the RM-encoded output information in the second operation for generating the first type of information, or the length of the rate-matched output information in the second operation for generating the first type of information, satisfies one or more of the following:

[0341] Multiples of 2;

[0342] Multiples of 3;

[0343] Multiples of 4.

[0344] In one embodiment, the information processing method includes at least one of the following:

[0345] When M is 1, the length of the RM-encoded output information in the second operation that generates the first type of information is an integer multiple of 4;

[0346] When M is 2, the length of the RM-encoded output information in the second operation that generates the first type of information is an integer multiple of 3;

[0347] When M is 4, the length of the RM-encoded output information in the second operation that generates the first type of information is an integer multiple of 2;

[0348] When M is 1, the length of the output information after rate matching in the second operation that generates the first type of information is an integer multiple of 4;

[0349] When M is 2, the length of the output information after rate matching in the second operation that generates the first type of information is an integer multiple of 3;

[0350] When M is 4, the length of the output information after rate matching in the second operation that generates the first type of information is an integer multiple of 2.

[0351] When the wake-up message is 5 bits and the number of symbols is M=1, the length N of the first type of message is 8, 12, or 16.

[0352] When the wake-up message is 5 bits and the number of symbols is M=2, the length N of the first type of message is 6, 9, or 12.

[0353] When the wake-up message is 5 bits and the number of symbols is M=4, the length N of the first type of message is 6, 8, 10, 12, 14.

[0354] When the wake-up information is 6 bits and the number of symbols is M=1, the length N of the first type of information is 8, 12, or 16.

[0355] When the wake-up message is 6 bits and the number of symbols is M=2, the length N of the first type of message is 6, 9, or 12.

[0356] When the wake-up message is 6 bits and the number of symbols is M=4, the length N of the first type of message is 6, 8, 10, 12, 14;

[0357] When the wake-up information is 7 bits and the number of symbols is M=1, the length N of the first type of information is 8, 12, or 16.

[0358] When the wake-up information is 7 bits and the number of symbols is M=2, the length N of the first type of information is 9, 12, or 15.

[0359] When the wake-up message is 7 bits and the number of symbols is M=4, the length N of the first type of message is 8, 10, 12, or 14.

[0360] When the wake-up message is 5 bits and the number of symbols is M=1, the length N of the first type of message is 8, 12, 16; and P is 2, 3, 4 respectively.

[0361] When the wake-up message is 5 bits and the number of symbols is M=2, the length N of the first type of message is 6, 9, 12; and P is 2, 3, 4 respectively.

[0362] When the wake-up message is 5 bits and the number of symbols is M=4, the length N of the first type of message is 6, 8, 10, 12, 14; and P is 3, 4, 5, 6, 7 respectively.

[0363] When the wake-up information is 6 bits and the number of symbols is M=1, the length N of the first type of information is 8, 12, 16; and P is 2, 3, 4 respectively.

[0364] When the wake-up message is 6 bits and the number of symbols is M=2, the length N of the first type of message is 6, 9, 12; and P is 2, 3, 4 respectively.

[0365] When the wake-up message is 6 bits and the number of symbols is M=4, the length N of the first type of message is 6, 8, 10, 12, 14; and P is 3, 4, 5, 6, 7 respectively.

[0366] When the wake-up information is 7 bits and the number of symbols is M=1, the length N of the first type of information is 8, 12, 16; and P is 2, 3, 4 respectively.

[0367] When the wake-up information is 7 bits and the number of symbols is M=2, the length N of the first type of information is 9, 12, 15; and P is 3, 4, 5 respectively.

[0368] When the wake-up information is 7 bits and the number of symbols of the first type is M=4, the length N of the first type of information is 8, 10, 12, 14; and P is 4, 5, 6, 7 respectively.

[0369] In one embodiment, one or more of the length of the fourth type of information, the length of the first type of information, the length of the output information after rate matching in the second operation of generating the first type of information, and the length of the RM-encoded output information in the second operation of generating the first type of information are determined by one or more of the following:

[0370] System configuration, such as base station configuration;

[0371] Sending method;

[0372] First quantity;

[0373] Second quantity;

[0374] The third quantity is an integer multiple of the quantity;

[0375] The first quantity includes one or more of the following: the number of packets of identification information of the second communication node (e.g., the number of packets of UE identification) and the number of identification information (also called indication information) for a predetermined function (e.g., all UEs receiving identification information in the cell perform a wake-up operation); the second quantity includes the number of sequences in the sequence set when the transmission mode is determined, also known as the number of symbols M, where M is determined, and the sequences indicate sub-information of the first type of information or sub-information of the fourth type of information. Different M (the number of OOK symbols corresponding to one OFDM symbol is M) can correspond to different numbers of sequences. There is a correspondence between the transmission mode, M, and the number of sequences; the third quantity includes the number of bits of sub-information of the first type of information or sub-information of the fourth type of information carried by the sequences in the sequence set when the transmission mode is determined.

[0376] The length of the output information after rate matching in the second operation that generates the first type of information can be understood as the second length. The RM encoding length (such as the length of the RM encoded output information, which can also be called the first length) may be a fixed value, while the change in the length of the first type of information is mainly determined by rate matching, that is, the second length can change.

[0377] Multiples of the third quantity include one times the third quantity, i.e., the third quantity itself, and can also include at least two times the third quantity, such as 2, 3, 4, etc.

[0378] In this embodiment, the third quantity can be an integer multiple of 2, 3, or 4. The value of the third quantity can also be associated with the sending method. Different sending methods can correspond to different third quantities. The sending method can be associated with the value of M.

[0379] In this embodiment, since the sequence can indicate sub-information, the number of bits for the third quantity can be indicated by the number of sequences for the second quantity. For example, if the number of sequences for the second quantity is 4, the third quantity can be 2. That is, 4 sequences correspond to 2 bits of sub-information.

[0380] In one embodiment, the length of the fourth type of information is determined by the system configuration, the sending method, and one or more of the first, second, and third quantities.

[0381] In one embodiment, the length of the first type of information is determined by system configuration, transmission method, and one or more of a first quantity, a second quantity, and a third quantity.

[0382] In one embodiment, the length of the RM-encoded output information in the second operation that generates the first type of information is determined by system configuration, transmission method, and one or more of a first quantity, a second quantity, and a third quantity.

[0383] In one example, the number of UE groups (also known as the identification information of the second communication node) is 31, meaning the first quantity is 31. Therefore, the fourth type of information can indicate at least these 31 states. The length K of the fourth type of information can then be...

[0384] In one example, the number of UE groups is 15. Additionally, it supports one predefined function identifier, making the total number 15 + 1 = 16. Therefore, the fourth type of information supports at least 16 states. The length K of the fourth type of information can then be...

[0385] In one example, the number of UE groups is 31, meaning the first quantity is 31. Therefore, in order to indicate these 31 UE groups, the fourth type of information length K must have a minimum value of [value missing]. When the number of symbols is M=1, the sequence set contains 16 sequences, meaning the sequence can support 4-bit sub-information. To ensure that each sub-information in the fourth type of information has the same length, the length K of the fourth type of information is 8, which includes P=2 sub-information.

[0386] In one example, the number of UE groups is 31, meaning the first quantity is 31. Therefore, to indicate these 31 UE groups, the fourth type of information length K is set to...

[0387] The first type of information is generated from the fourth type of information. The length N of the output information corresponding to the RM encoding in the second operation of generating the first type of information is generated according to the following principles:

[0388] For a given value of M, for example, if the number of symbols is M=1, the sequence set contains 16 sequences, meaning the sequence can support 4 bits of information. In other words, the sequence can carry 4 bits of sub-information from the first type of information. To ensure that each sub-information in the first type of information has the same length, N must be an integer multiple of 4. Considering that the length of N is the length after RM encoding, in this embodiment, N can take values ​​of 8, 12, and 16, corresponding to P=2, 3, and 4 sub-information, respectively.

[0389] In one embodiment, the information processing method satisfies one of the following:

[0390] When the transmission method is the first transmission method, the integer multiple of the third quantity is any integer multiple of 4, 3, and 2;

[0391] When the transmission method is the second transmission method, the integer multiple of the third quantity is either 3 or an integer multiple of 2;

[0392] When the transmission method is the third transmission method, the integer multiple of the third quantity is an integer multiple of 2.

[0393] For example, when M equals 1, the integer multiple of the third quantity is any integer multiple of 4, 3, and 2;

[0394] When M equals 2, the integer multiple of the third quantity is either 3 or an integer multiple of 2;

[0395] When M equals 4, the integer multiple of the third quantity is an integer multiple of 2.

[0396] In one embodiment, when the length of the fourth type of information is an integer multiple of the second quantity or the third quantity, the sequence indicates sub-information of the fourth type of information;

[0397] When the quotient of the length of the fourth type of information and the second or third quantity is not an integer, the sequence indicates sub-information of the first type of information.

[0398] When the length K of the fourth type of information is an integer multiple of the second or third quantity, the sequence indicates a sub-information of the fourth type of information. When the length K of the fourth type of information is not an integer multiple of the second or third quantity, the sequence indicates a sub-information of the first type of information.

[0399] The relationship between the length of the first type of information (e.g., the length N of the output information after RM encoding), the value of M (corresponding to the transmission method), and the second quantity (Y) is shown in the table below:

[0400] Table 2 shows the correspondence between M, Y, and the length of the first type of information.

[0401] Referring to Table 2, this application can determine the length N of the first type of information based on the values ​​of M and Y. Furthermore, when there are multiple possible values ​​for N, the specific value of N can be further indicated by indication information. The length of the fourth type of information is 5 bits or 6 bits. Here, the fourth type of information can be wake-up information, such as fourth type information that only includes wake-up information. The "-" in Table 2 indicates that it can be flexibly configured, such as by the base station; this is not limited here. The correspondence between M, Y, and the length of the first type of information can be the correspondence between the first column, the second column, and any column of the first type of information length in the table (i.e., M and Y can have a correspondence with the length of at least one column of the first type of information in the table). For example, when M is 1 and Y is 4, the length of the first type of information is 8. Table 3 is similar and will not be elaborated here.

[0402] Table 3 shows another correspondence between M, Y, and the length of the first type of information.

[0403] Referring to Table 3, this application can determine the length N of the first type of information based on the values ​​of M and Y. Furthermore, when there are multiple possible values ​​for N, the specific value of N can be further indicated by indication information. The length of the fourth type of information is 4 bits; here, the fourth type of information can be wake-up information, such as fourth type information that only includes wake-up information.

[0404] In one embodiment, the sequence is a Zadovchu ZC sequence, and the length of the sequence is L. RA Including at least one of 31, 61, and 131.

[0405] ZC sequence x u,v The formula for generating (n) is as follows:

[0406] x u,v (n)=x u ((n+C v )modL RA )

[0407] Where, x u (i) is the ZC root sequence, which can be generated using the root index u according to the formula above. The length of the ZC sequence is L. RA C v For the value of the circular shift, C v Generate as follows:

[0408] Where v = 0, 1, ..., w-1,

[0409] Where q is the expression that satisfies (qu) mod LRA The smallest non-negative integer equal to 1.

[0410] In N CS ≤d u <L RA In the case of / 3, the following parameters take the following values:

[0411] In L RA / 3≤d u ≤(L RA -N CS In the case of ) / 2, the following parameters take the following values:

[0412] The root index u can also be referred to as the value of the root of the ZC sequence.

[0413] Figure 2-4 shows the data in the scheme. Where 0 ≤ i ≤ M-1; the data values ​​are configurable. The ZC sequence can be converted into this data (the conversion includes length conversion), and the converted data can be sent according to the sending method provided in Figure 2-4. The conversion method is as follows:

[0414] Conversion scheme 1: x u,v The length L of (n) RA Equals A i x u,v (n) can be directly converted into data.

[0415] Transformation scheme 2: When x u,v The length L of (n) RA Less than A i When x is calculated according to the following formula u,v (n) is expanded to a length of A i x' u,v (n);

[0416] x′ u，v (n)=x u ((n+C v )mod L RA ), n = 0, 1, ..., A i -1 where C v The value of is greater than or equal to 0.

[0417] In one embodiment, the root index of the sequence is selected in one of the following ways:

[0418] Select X root indices from the root index set in a first predetermined order;

[0419] After selecting X root indices from the root index set, Y root indices are selected from the X root indices in a second predetermined order.

[0420] The root index set can be a collection of multiple root indices. The first predetermined order can be a pre-defined order for selecting root indices directly from the root index set. The second predetermined order can be a pre-defined order for continuing to select root indices from X root indices. The first and second predetermined orders can be the same or different.

[0421] The first and second predefined orders are not limited and can be associated with the form of the root set. The first predefined order can be random or associated with the form of the root index set. For example, if the root index set is in tabular form, the first predefined order can be the top-to-bottom or bottom-to-top order of the columns containing the root indices. The first predefined order can also be the left-to-right or right-to-left order of the rows containing the root indices. If the root indices in the root index set are ordered, the first predefined order can be the front-to-back or back-to-front order of the root indexes. The second predefined order is similarly unrestricted here.

[0422] In one example, X root indices are randomly selected from the set of root indices, where X is a positive integer.

[0423] In one example, X root indices are selected in order from the root index set (which can be a set of sorted root indices). For example, from top to bottom, from bottom to top, from left to right, from front to back, etc.

[0424] This embodiment can also be divided into multiple selections of the final root index from the root index set. For example, first select X root indices from the root index set, and then select Y root indices from the X root indices according to a second predetermined order. Each selection of root indices can be in a predetermined order. The order used for selecting root indices in different selections can be the same or different.

[0425] In one example, X root indices are randomly or sequentially selected from the set of root indices. Then, Y root indices are randomly or sequentially selected from the X root indices.

[0426] Taking the selection from front to back as an example, the root indices are obtained sequentially from the ordered set of root indices. The order can be from front to back, that is, the selection is performed according to the order in which the root indices are arranged in the set of root indices.

[0427] The sorting method of each root sequence in the root sequence set is not limited. For example, each root index can be sorted according to the number of ZC sequences it can generate. For example, the root sequences included in the root index set can be sorted from the largest to the smallest number of ZC sequences they can generate. This application can also sort them from the smallest to the largest number.

[0428] In this embodiment, after selecting the root index, a sequence can be generated based on the ZC root sequence corresponding to the root index.

[0429] In one embodiment, the root index set is obtained by sorting multiple root indices according to a predetermined sorting method, which includes:

[0430] Sort the root indices in descending order of the number of ZC sequences generated from the ZC root sequence corresponding to the root index u. That is, sort the ZC sequences x that can be generated from the ZC root sequence corresponding to root index u. u,v Sort the root indexes by the number of (n) from largest to smallest.

[0431] This embodiment describes the sorting method of the root indices included in the root index set. In this embodiment, the root indices included in the root index set can be sorted in descending order of the number of ZC sequences that can be generated by their corresponding ZC root sequences. For example, the root index at the beginning of the root index set corresponds to the ZC root sequence that can generate the most ZC sequences, the second-most root index corresponds to the ZC root sequence that can generate the second-most ZC sequences, and so on. The root index at the end of the root index set corresponds to the ZC root sequence that can generate the fewest ZC sequences.

[0432] In one embodiment, the number of ZC sequences generated from the ZC root sequence corresponding to the root index is related to the value of the cyclic shift interval. That is, a root sequence index u can generate a ZC sequence x. u,v The number of (n) is related to the value of the cyclic shift interval (Ncs).

[0433] This embodiment describes the relationship between the number of ZC sequences that can be generated from the ZC root sequence corresponding to the root index and the value of the cyclic shift interval. That is, there is a corresponding relationship between the number of ZC sequences that can be generated and the value of the cyclic shift interval. This correspondence is not limited here.

[0434] Table 4 L RA When = 31, the root index u and the cyclic shift interval N cs Correspondence table

[0435] In this application, the root index set includes multiple sorted root indices, and the sorting of the root indices can be related to the cyclic shift interval (N). cs This refers to the value association of the zero-correlation region configuration. For example, according to the values ​​corresponding to Ncs=2 (i.e., the number of ZC sequences that can be generated), u is sorted to form a root index set. Here, the value 5 corresponding to Ncs=2 means that 5 ZC sequences can be generated. Another example is according to N...cs The values ​​corresponding to 3 are sorted to form a root index set.

[0436] When Ncs = 2, if multiple values ​​are the same, the values ​​of u corresponding to that value can be arbitrarily ordered.

[0437] The sorting of the root indices in the root index set can be derived from the sorting of the first column in Table 4. The root index can be selected from the root index set by selecting the first X u values ​​from the table.

[0438] The cyclic shift interval Ncs can be 2, 4, 8, 14, 16 or 32.

[0439] Given the values ​​of u and Ncs, the root sequence corresponding to u can generate a number of usable ZC sequences x corresponding to the values ​​of Ncs. u,v (n). The number of values ​​corresponding to Ncs can be the values ​​in the column where the cyclic shift interval is located, representing the number of ZC sequences that can be generated. That is, given the values ​​of the root index and the cyclic shift interval, the number of root sequences x corresponding to the root index is... u (i) The number of ZC sequences that can be generated.

[0440] If u is 3 and Ncs = 2, 5 ZC sequences can be generated. That is, C in the above ZC generation formula... v The value of can be 0-4, that is, it can have five values, so as to generate the corresponding ZC sequence according to the generation formula. The length of the ZC sequence is determined by n.

[0441] There are several ways to sort the values ​​of u, such as arranging them in descending order of the cyclic shift interval or in ascending order of the cyclic shift interval. This achieves the sorting of u corresponding to each cyclic shift interval. See Table 4; any column from 2 to 7 is sorted in descending order, and the corresponding u is also sorted accordingly. This yields the sorted u.

[0442] The lengths L of different sequences are described below. RA Below, the root index u and the cyclic shift interval N cs The corresponding relationship table.

[0443] Table 5 L RA When = 61, the root index u and the cyclic shift interval N cs Correspondence table

[0444] Table 6 L RA When = 131, the root index u and the cyclic shift interval N cs Correspondence table

[0445] The "-" marks in Table 6 can be flexibly configured, such as by the base station. RA For different values, the root index u can be the circular shift interval N of at least one column in the table. cs There is a corresponding relationship.

[0446] The information processing method provided in this application can provide better detection performance for LP-WUS / LP-SS / LP-Preamble and can support a wider coverage of LP-WUS / LP-SS / LP-Preamble signals.

[0447] In one exemplary embodiment, this embodiment also provides an information processing method. Figure 5 is a flowchart illustrating another information processing method provided in this application embodiment. This method can be applied to situations where the structure of a low-power signal is determined. This method can be executed by an information processing device, which can be implemented by software and / or hardware and integrated on a second communication node, which can be a UE. Details not covered in this embodiment can be found in the above embodiments and will not be elaborated upon here.

[0448] As shown in Figure 5, the information processing method provided in this application includes the following operations:

[0449] S510, Obtain the second type of information.

[0450] The second type of information can be transmitted by the first communication node, and this operation can obtain the second type of information from the first communication node.

[0451] S520. Parse the second type of information to obtain the first type of information. The second type of information is obtained by processing the first type of information through the first operation.

[0452] After obtaining the second type of information, this operation can parse it to obtain the first type of information. The parsing process can be associated with the first operation used to generate the second type of information. Details are omitted here.

[0453] The information processing method provided in this embodiment can parse the first type of information by acquiring the second type of information. The first type of information may include information about low-power signals, thereby realizing the transmission of information about low-power signals that determine the structure.

[0454] Based on the above embodiments, modified embodiments of the above embodiments are proposed. It should be noted that, in order to keep the description brief, only the differences from the above embodiments are described in the modified embodiments.

[0455] In one embodiment, the first operation includes one of the following:

[0456] The third type of information is obtained by repeating each element of the first type of information R times. Manchester encoding is performed on each element of the third type of information, where R is an integer greater than 1.

[0457] Each element in the first type of information is Manchester encoded;

[0458] The first type of information is repeated Z times to obtain the third type of information. Each element in the third type of information is then encoded using Manchester encoding, where Z is an integer greater than 1.

[0459] After Manchester encoding each element in the first type of information, the third type of information is obtained, and each element in the third type of information is repeated.

[0460] After Manchester encoding each element in the first type of information, the third type of information is obtained. The third type of information is repeated in groups of L elements, where L is the length of the Manchester encoding.

[0461] The third type of information is obtained by performing Manchester encoding on each element in the first type of information. The third type of information is then repeated Y times, where Y is an integer greater than 1.

[0462] In one embodiment, the M elements of the second type of information are sent in at least one symbol.

[0463] In one embodiment, when the symbol is an on / off keying symbol or a multi-subcarrier on / off keying symbol, the number of symbols is M;

[0464] When the symbol is an orthogonal frequency division multiplexing symbol, the number of symbols is 1.

[0465] In one embodiment, the first type of information is information generated by the second operation from the fourth type of information, and the fourth type of information includes one or more of the following:

[0466] Wake-up message;

[0467] Verification information;

[0468] Fill in the information.

[0469] In one embodiment, the second operation includes one or more of the following:

[0470] repeat;

[0471] Scrambling;

[0472] Reidmiller RM encoding;

[0473] Intertwined;

[0474] Add padding bits;

[0475] Add verification information;

[0476] Rate matching.

[0477] In one embodiment, when the second operation includes RM encoding and speed matching, the first length of the fourth type of information output after RM encoding is rate matched to output the second length of information.

[0478] In one embodiment, if the first operation includes a repetitive operation, the length of the output information corresponding to the RM encoding in the second operation includes 28 or 32 or the maximum length among the encoding lengths supported by RM encoding.

[0479] In one embodiment, the length of the fourth type of information satisfies one or more of the following:

[0480] Multiples of 2;

[0481] Multiples of 3;

[0482] Multiples of 4.

[0483] In one embodiment, the information processing method includes at least one of the following:

[0484] When the transmission method is the first transmission method, the length of the fourth type of information is an integer multiple of any one of 4, 3, and 2;

[0485] When the transmission method is the second transmission method, the length of the fourth type of information is an integer multiple of 3 or 2;

[0486] When the transmission method is the third transmission method, the length of the fourth type of information is an integer multiple of 2.

[0487] In one embodiment, one or more of the length of the fourth type of information, the length of the first type of information, the length of the output information after rate matching in the second operation of generating the first type of information, and the length of the RM-encoded output information in the second operation of generating the first type of information are determined by one or more of the following:

[0488] System configuration;

[0489] Sending method;

[0490] First quantity;

[0491] Second quantity;

[0492] The third quantity is an integer multiple of the quantity;

[0493] Wherein, the first quantity includes one or more of the number of packets of identification information of the second communication node and the number of identification information of the predetermined function; the second quantity includes the number of sequences in the sequence set when the transmission method is determined, the sequences indicating sub-information of the first type of information or sub-information of the fourth type of information; the third quantity includes the number of bits of sub-information of the first type of information or sub-information of the fourth type of information carried by the sequences in the sequence set when the transmission method is determined.

[0494] In one embodiment, the information processing method satisfies at least one of the following:

[0495] When the transmission method is the first transmission method, the integer multiple of the third quantity is any integer multiple of 4, 3, and 2;

[0496] When the transmission method is the second transmission method, the integer multiple of the third quantity is either 3 or an integer multiple of 2;

[0497] When the transmission method is the third transmission method, the integer multiple of the third quantity is an integer multiple of 2.

[0498] In one embodiment, when the length of the fourth type of information is an integer multiple of the second quantity or the third quantity, the sequence indicates sub-information of the fourth type of information;

[0499] When the quotient of the length of the fourth type of information and the second or third quantity is not an integer, the sequence indicates sub-information of the first type of information.

[0500] In one embodiment, the sequence is a Zadovchu ZC sequence, and the length of the sequence includes at least one of 31, 61, and 131.

[0501] In one embodiment, the root index of the sequence is selected in one of the following ways:

[0502] Select X root indices from the root index set in a first predetermined order;

[0503] After selecting X root indices from the root index set, Y root indices are selected from the X root indices in a second predetermined order.

[0504] In one embodiment, the root index set is obtained by sorting multiple root indices according to a predetermined sorting method, which includes:

[0505] The root indices are sorted in descending order of the number of ZC sequences generated from the ZC root sequences corresponding to the root indices. 16. The method according to claim 15, wherein the number of ZC sequences generated from the ZC root sequences corresponding to the root indices is related to the value of the cyclic shift interval.

[0506] In one embodiment, the length of the first type of information satisfies one or more of the following:

[0507] Multiples of 2;

[0508] Multiples of 3;

[0509] Multiples of 4.

[0510] In one embodiment, the information processing method satisfies one of the following:

[0511] When M is 1, the length of the first type of information is an integer multiple of 4;

[0512] When M is 2, the length of the first type of information is an integer multiple of 3;

[0513] When M is 4, the length of the first type of information is an integer multiple of 2.

[0514] In one embodiment, the length of the RM-encoded output information in the second operation for generating the first type of information, or the length of the rate-matched output information in the second operation for generating the first type of information, satisfies one or more of the following:

[0515] Multiples of 2;

[0516] Multiples of 3;

[0517] Multiples of 4.

[0518] In one embodiment, the information processing method satisfies at least one of the following:

[0519] When M is 1, the length of the RM-encoded output information in the second operation that generates the first type of information is an integer multiple of 4;

[0520] When M is 2, the length of the RM-encoded output information in the second operation that generates the first type of information is an integer multiple of 3;

[0521] When M is 4, the length of the RM-encoded output information in the second operation that generates the first type of information is an integer multiple of 2;

[0522] When M is 1, the length of the output information after rate matching in the second operation that generates the first type of information is an integer multiple of 4;

[0523] When M is 2, the length of the output information after rate matching in the second operation that generates the first type of information is an integer multiple of 3;

[0524] When M is 4, the length of the output information after rate matching in the second operation that generates the first type of information is an integer multiple of 2.

[0525] In one exemplary embodiment, this application provides an information processing device that can be integrated into a first communication node. Figure 6 is a schematic diagram of the structure of an information processing device provided in an embodiment of this application. The information processing device includes:

[0526] Processing module 610 is configured to process the first type of information through a first operation to obtain the second type of information, wherein the first operation includes at least an encoding operation;

[0527] The sending module 620 is configured to send the second type of information.

[0528] The information processing device provided in this embodiment is used to implement the information processing method shown in Figure 1. The implementation principle and technical effect of the information processing device provided in this embodiment are similar to those of the information processing method shown in Figure 1, and will not be repeated here.

[0529] Based on the above embodiments, modified embodiments of the above embodiments are proposed. It should be noted that, in order to keep the description brief, only the differences from the above embodiments are described in the modified embodiments.

[0530] In one embodiment, the first operation includes one of the following:

[0531] The third type of information is obtained by repeating each element of the first type of information R times. Manchester encoding is performed on each element of the third type of information, where R is an integer greater than 1.

[0532] Each element in the first type of information is Manchester encoded;

[0533] The first type of information is repeated Z times to obtain the third type of information. Each element in the third type of information is then encoded using Manchester encoding, where Z is an integer greater than 1.

[0534] After Manchester encoding each element in the first type of information, the third type of information is obtained, and each element in the third type of information is repeated.

[0535] After Manchester encoding each element in the first type of information, the third type of information is obtained. The third type of information is repeated in groups of L elements, where L is the length of the Manchester encoding.

[0536] The third type of information is obtained by performing Manchester encoding on each element in the first type of information. The third type of information is then repeated Y times, where Y is an integer greater than 1.

[0537] In one embodiment, the M elements of the second type of information are sent in at least one symbol.

[0538] In one embodiment, when the symbol is an on / off keying symbol or a multi-subcarrier on / off keying symbol, the number of symbols is M;

[0539] When the symbol is an orthogonal frequency division multiplexing symbol, the number of symbols is 1.

[0540] In one embodiment, the first type of information is information generated by the second operation from the fourth type of information, and the fourth type of information includes one or more of the following:

[0541] Wake-up message;

[0542] Verification information;

[0543] Fill in the information.

[0544] In one embodiment, the second operation includes one or more of the following:

[0545] repeat;

[0546] Scrambling;

[0547] Reidmiller RM encoding;

[0548] Intertwined;

[0549] Add padding bits;

[0550] Add verification information;

[0551] Rate matching.

[0552] In one embodiment, when the second operation includes RM encoding and speed matching, the first length of the fourth type of information output after RM encoding is rate matched, and then the second length of information is output; the second length is less than or equal to the first length, or the second length is greater than or equal to the first length.

[0553] In one embodiment, if the first operation includes a repetitive operation, the length of the output information corresponding to the RM encoding in the second operation includes 28 or 32 or the maximum length among the encoding lengths supported by RM encoding.

[0554] In one embodiment, the length of the fourth type of information satisfies one or more of the following:

[0555] Multiples of 2;

[0556] Multiples of 3;

[0557] Multiples of 4.

[0558] In one embodiment, the information processing method includes at least one of the following:

[0559] When the transmission method is the first transmission method, the length of the fourth type of information is an integer multiple of any one of 4, 3, and 2;

[0560] When the transmission method is the second transmission method, the length of the fourth type of information is an integer multiple of 3 or 2;

[0561] When the transmission method is the third transmission method, the length of the fourth type of information is an integer multiple of 2.

[0562] In one embodiment, one or more of the length of the fourth type of information, the length of the first type of information, the length of the output information after rate matching in the second operation of generating the first type of information, and the length of the RM-encoded output information in the second operation of generating the first type of information are determined by one or more of the following:

[0563] System configuration;

[0564] Sending method;

[0565] First quantity;

[0566] Second quantity;

[0567] The third quantity is an integer multiple of the quantity;

[0568] Wherein, the first quantity includes one or more of the number of packets of identification information of the second communication node and the number of identification information of the predetermined function; the second quantity includes the number of sequences in the sequence set when the transmission method is determined, the sequences indicating sub-information of the first type of information or sub-information of the fourth type of information; the third quantity includes the number of bits of sub-information of the first type of information or sub-information of the fourth type of information carried by the sequences in the sequence set when the transmission method is determined.

[0569] In one embodiment, the information processing method satisfies at least one of the following:

[0570] When the transmission method is the first transmission method, the integer multiple of the third quantity is any integer multiple of 4, 3, and 2;

[0571] When the transmission method is the second transmission method, the integer multiple of the third quantity is either 3 or an integer multiple of 2;

[0572] When the transmission method is the third transmission method, the integer multiple of the third quantity is an integer multiple of 2.

[0573] In one embodiment, when the length of the fourth type of information is an integer multiple of the second quantity or the third quantity, the sequence indicates sub-information of the fourth type of information;

[0574] When the quotient of the length of the fourth type of information and the second or third quantity is not an integer, the sequence indicates sub-information of the first type of information.

[0575] In one embodiment, the sequence is a Zadovchu ZC sequence, and the length of the sequence includes at least one of 31, 61, and 131.

[0576] In one embodiment, the root index of the sequence is selected in one of the following ways:

[0577] Select X root indices from the root index set in a first predetermined order;

[0578] After selecting X root indices from the root index set, Y root indices are selected from the X root indices in a second predetermined order.

[0579] In one embodiment, multiple root indices in the root index set are sorted according to a predetermined sorting method, which includes:

[0580] Sort the root indices according to the number of ZC sequences generated from the ZC root sequences corresponding to the root indices, from most to least.

[0581] In one embodiment, the number of ZC sequences generated from the ZC root sequence corresponding to the root index is related to the value of the cyclic shift interval.

[0582] In one embodiment, the length of the first type of information satisfies one or more of the following:

[0583] Multiples of 2;

[0584] Multiples of 3;

[0585] Multiples of 4.

[0586] In one embodiment, when M is 1, the length of the first type of information is an integer multiple of 4;

[0587] When M is 2, the length of the first type of information is an integer multiple of 3;

[0588] When M is 4, the length of the first type of information is an integer multiple of 2.

[0589] In one embodiment, the length of the RM-encoded output information in the second operation for generating the first type of information, or the length of the rate-matched output information in the second operation for generating the first type of information, satisfies one or more of the following:

[0590] Multiples of 2;

[0591] Multiples of 3;

[0592] Multiples of 4.

[0593] In one embodiment, the information processing apparatus satisfies at least one of the following:

[0594] When M is 1, the length of the RM-encoded output information in the second operation that generates the first type of information is an integer multiple of 4;

[0595] When M is 2, the length of the RM-encoded output information in the second operation that generates the first type of information is an integer multiple of 3;

[0596] When M is 4, the length of the RM-encoded output information in the second operation that generates the first type of information is an integer multiple of 2;

[0597] When M is 1, the length of the output information after rate matching in the second operation that generates the first type of information is an integer multiple of 4;

[0598] When M is 2, the length of the output information after rate matching in the second operation that generates the first type of information is an integer multiple of 3;

[0599] When M is 4, the length of the output information after rate matching in the second operation that generates the first type of information is an integer multiple of 2.

[0600] In one exemplary embodiment, this application also provides an information processing device that can be integrated into a second communication node. Figure 7 is a schematic diagram of another information processing device provided in this application. The information processing device includes:

[0601] Module 710 is configured to acquire the second type of information.

[0602] The parsing module 720 is configured to parse the second type of information to obtain the first type of information, wherein the second type of information is obtained by processing the first type of information through the first operation.

[0603] The information processing device provided in this embodiment is used to implement the information processing method shown in Figure 5. The implementation principle and technical effect of the information processing device provided in this embodiment are similar to those of the information processing method shown in Figure 5, and will not be repeated here.

[0604] Based on the above embodiments, modified embodiments of the above embodiments are proposed. It should be noted that, in order to keep the description brief, only the differences from the above embodiments are described in the modified embodiments.

[0605] In one embodiment, the first operation includes one of the following:

[0606] The third type of information is obtained by repeating each element of the first type of information R times. Manchester encoding is performed on each element of the third type of information, where R is an integer greater than 1.

[0607] Each element in the first type of information is Manchester encoded;

[0608] The first type of information is repeated Z times to obtain the third type of information. Each element in the third type of information is then encoded using Manchester encoding, where Z is an integer greater than 1.

[0609] After Manchester encoding each element in the first type of information, the third type of information is obtained, and each element in the third type of information is repeated.

[0610] After Manchester encoding each element in the first type of information, the third type of information is obtained. The third type of information is repeated in groups of L elements, where L is the length of the Manchester encoding.

[0611] The third type of information is obtained by performing Manchester encoding on each element in the first type of information. The third type of information is then repeated Y times, where Y is an integer greater than 1.

[0612] In one embodiment, the M elements of the second type of information are sent in at least one symbol.

[0613] In one embodiment, when the symbol is an on / off keying symbol or a multi-subcarrier on / off keying symbol, the number of symbols is M;

[0614] When the symbol is an orthogonal frequency division multiplexing symbol, the number of symbols is 1.

[0615] In one embodiment, the first type of information is information generated by the second operation from the fourth type of information, and the fourth type of information includes one or more of the following:

[0616] Wake-up message;

[0617] Verification information;

[0618] Fill in the information.

[0619] In one embodiment, the second operation includes one or more of the following:

[0620] repeat;

[0621] Scrambling;

[0622] Reidmiller RM encoding;

[0623] Intertwined;

[0624] Add padding bits;

[0625] Add verification information;

[0626] Rate matching.

[0627] In one embodiment, when the second operation includes RM encoding and speed matching, the first length of the fourth type of information output after RM encoding is rate matched to output the second length of information.

[0628] In one embodiment, if the first operation includes a repetitive operation, the length of the output information corresponding to the RM encoding in the second operation includes 28 or 32 or the maximum length among the encoding lengths supported by RM encoding.

[0629] In one embodiment, the length of the fourth type of information satisfies one or more of the following:

[0630] Multiples of 2;

[0631] Multiples of 3;

[0632] Multiples of 4.

[0633] In one embodiment, the information processing method includes at least one of the following:

[0634] When the transmission method is the first transmission method, the length of the fourth type of information is an integer multiple of any one of 4, 3, and 2;

[0635] When the transmission method is the second transmission method, the length of the fourth type of information is an integer multiple of 3 or 2;

[0636] When the transmission method is the third transmission method, the length of the fourth type of information is an integer multiple of 2.

[0637] In one embodiment, one or more of the length of the fourth type of information, the length of the first type of information, the length of the output information after rate matching in the second operation of generating the first type of information, and the length of the RM-encoded output information in the second operation of generating the first type of information are determined by one or more of the following:

[0638] System configuration;

[0639] Sending method;

[0640] First quantity;

[0641] Second quantity;

[0642] The third quantity is an integer multiple of the quantity;

[0643] Wherein, the first quantity includes one or more of the number of packets of identification information of the second communication node and the number of identification information of the predetermined function; the second quantity includes the number of sequences in the sequence set when the transmission method is determined, the sequences indicating sub-information of the first type of information or sub-information of the fourth type of information; the third quantity includes the number of bits of sub-information of the first type of information or sub-information of the fourth type of information carried by the sequences in the sequence set when the transmission method is determined.

[0644] In one embodiment, the information processing method satisfies at least one of the following:

[0645] When the transmission method is the first transmission method, the integer multiple of the third quantity is any integer multiple of 4, 3, and 2;

[0646] When the transmission method is the second transmission method, the integer multiple of the third quantity is either 3 or an integer multiple of 2;

[0647] When the transmission method is the third transmission method, the integer multiple of the third quantity is an integer multiple of 2.

[0648] In one embodiment, when the length of the fourth type of information is an integer multiple of the second quantity or the third quantity, the sequence indicates sub-information of the fourth type of information;

[0649] When the quotient of the length of the fourth type of information and the second or third quantity is not an integer, the sequence indicates sub-information of the first type of information.

[0650] In one embodiment, the sequence is a Zadovchu ZC sequence, and the length of the sequence includes at least one of 31, 61, and 131.

[0651] In one embodiment, the root index of the sequence is selected in one of the following ways:

[0652] Select X root indices from the root index set in a first predetermined order;

[0653] After selecting X root indices from the root index set, Y root indices are selected from the X root indices in a second predetermined order.

[0654] In one embodiment, the root index set is obtained by sorting multiple root indices according to a predetermined sorting method, which includes:

[0655] Sort the root indices according to the number of ZC sequences generated from the ZC root sequences corresponding to the root indices, from most to least.

[0656] In one embodiment, the number of ZC sequences generated from the ZC root sequence corresponding to the root index is related to the value of the cyclic shift interval.

[0657] In one embodiment, the length of the first type of information satisfies one or more of the following:

[0658] Multiples of 2;

[0659] Multiples of 3;

[0660] Multiples of 4.

[0661] In one embodiment, when M is 1, the length of the first type of information is an integer multiple of 4;

[0662] When M is 2, the length of the first type of information is an integer multiple of 3;

[0663] When M is 4, the length of the first type of information is an integer multiple of 2.

[0664] In one embodiment, the length of the RM-encoded output information in the second operation for generating the first type of information, or the length of the rate-matched output information in the second operation for generating the first type of information, satisfies one or more of the following:

[0665] Multiples of 2;

[0666] Multiples of 3;

[0667] Multiples of 4.

[0668] In one embodiment, the information processing apparatus satisfies at least one of the following:

[0669] When M is 1, the length of the RM-encoded output information in the second operation that generates the first type of information is an integer multiple of 4;

[0670] When M is 2, the length of the RM-encoded output information in the second operation that generates the first type of information is an integer multiple of 3;

[0671] When M is 4, the length of the RM-encoded output information in the second operation that generates the first type of information is an integer multiple of 2;

[0672] When M is 1, the length of the output information after rate matching in the second operation that generates the first type of information is an integer multiple of 4;

[0673] When M is 2, the length of the output information after rate matching in the second operation that generates the first type of information is an integer multiple of 3;

[0674] When M is 4, the length of the output information after rate matching in the second operation that generates the first type of information is an integer multiple of 2.

[0675] In one exemplary embodiment, this application also provides a first communication node. FIG8 is a schematic diagram of the structure of a first communication node provided in this application embodiment. As shown in FIG8, the first communication node provided in this application includes one or more processors 81 and a storage device 82. The processors 81 in the first communication node may be one or more, and one processor 81 is used as an example in FIG8. The storage device 82 is used to store one or more programs. The one or more programs are executed by the one or more processors 81, so that the one or more processors 81 implement the information processing method as described in the embodiment of this application.

[0676] The first communication node also includes: a communication device 83, an input device 84, and an output device 85.

[0677] The processor 81, storage device 82, communication device 83, input device 84, and output device 85 in the first communication node can be connected by a bus or other means. Figure 8 shows an example of connection via a bus.

[0678] Input device 84 can be used to receive input digital or character information, and to generate key signal inputs related to user settings and function control of the first communication node. Output device 85 may include display devices such as a display screen.

[0679] The communication device 83 may include a receiver and a transmitter. The communication device 83 is configured to perform information transmission and reception communication under the control of the processor 81.

[0680] Storage device 82, as a computer-readable storage medium, can be configured to store software programs, computer-executable programs, and modules, such as program instructions / modules corresponding to the information processing method described in the embodiments of this application (e.g., processing module 610 and sending module 620 in the information processing device). Storage device 82 may include a program storage area and a data storage area, wherein the program storage area may store the operating system and at least one application program required for a function; the data storage area may store data created based on the use of the first communication node, etc. Furthermore, storage device 82 may include high-speed random access memory and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some instances, storage device 82 may further include memory remotely located relative to processor 81, and these remote memories can be connected to the first communication node via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0681] In one exemplary embodiment, this application also provides a second communication node. FIG9 is a schematic diagram of the structure of a second communication node provided in this application embodiment. As shown in FIG9, the second communication node provided in this application includes one or more processors 91 and a storage device 92; the processors 91 in the second communication node can be one or more, and FIG9 uses one processor 91 as an example; the storage device 92 is used to store one or more programs; the one or more programs are executed by the one or more processors 91, so that the one or more processors 91 implement the information processing method as described in the embodiment of this application.

[0682] The second communication node also includes: a communication device 93, an input device 94, and an output device 95.

[0683] The processor 91, storage device 92, communication device 93, input device 94, and output device 95 in the second communication node can be connected by a bus or other means. Figure 9 shows an example of connection via a bus.

[0684] Input device 94 can be used to receive input digital or character information, and to generate key signal inputs related to user settings and function control of the second communication node. Output device 95 may include display devices such as a display screen.

[0685] The communication device 93 may include a receiver and a transmitter. The communication device 93 is configured to perform information transmission and reception communication under the control of the processor 91.

[0686] Storage device 92, as a computer-readable storage medium, can be configured to store software programs, computer-executable programs, and modules, such as program instructions / modules corresponding to the information processing method described in the embodiments of this application (e.g., the acquisition module 710 and parsing module 720 in the information processing device). Storage device 92 may include a program storage area and a data storage area, wherein the program storage area may store the operating system and at least one application program required for a function; the data storage area may store data created based on the use of the second communication node, etc. Furthermore, storage device 92 may include high-speed random access memory and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state storage device. In some instances, storage device 92 may further include memory remotely located relative to processor 91, and these remote memories can be connected to the second communication node via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0687] In one exemplary embodiment, this application also provides a storage medium storing a computer program that, when executed by a processor, implements any of the methods described in this application. The storage medium stores a computer program that, when executed by a processor, implements any of the information processing methods described in the embodiments of this application. Examples include an information processing method applied to a first communication node and an information processing method applied to a second communication node. The information processing method applied to the first communication node includes: processing a first type of information through a first operation to obtain a second type of information, wherein the first operation at least includes an encoding operation.

[0688] Send the second type of information.

[0689] The information processing method applied to the second communication node includes: acquiring a second type of information;

[0690] The second type of information is parsed to obtain the first type of information, and the second type of information is obtained by processing the first type of information through the first operation.

[0691] The computer storage medium in this application embodiment can be any combination of one or more computer-readable media. The computer-readable medium can be a computer-readable signal medium or a computer-readable storage medium. For example, a computer-readable storage medium can be, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of computer-readable storage media (a non-exhaustive list) include: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), flash memory, optical fiber, portable CD-ROM, optical storage device, magnetic storage device, or any suitable combination thereof. The computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

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

[0693] Program code contained on a computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber, radio frequency (RF), etc., or any suitable combination thereof.

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

[0695] The above description is merely an exemplary embodiment of this application and is not intended to limit the scope of protection of this application.

[0696] Those skilled in the art will understand that the term terminal equipment covers any suitable type of wireless user equipment, such as mobile phones, portable data processing devices, portable web browsers, or vehicle-mounted mobile stations.

[0697] Generally, the various embodiments of this application can be implemented in hardware or dedicated circuitry, software, logic, or any combination thereof. For example, some aspects can be implemented in hardware, while others can be implemented in firmware or software that can be executed by a controller, microprocessor, or other computing device, although this application is not limited thereto.

[0698] Embodiments of this application can be implemented by executing computer program instructions through the data processor of a mobile device, for example, in a processor entity, or through hardware, or through a combination of software and hardware. The computer program instructions can be assembly instructions, Instruction Set Architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, status setting data, or source code or object code written in any combination of one or more programming languages.

[0699] Any block diagram of logical flow in the accompanying drawings of this application may represent program steps, or may represent interconnected logic circuits, modules, and functions, or may represent a combination of program steps and logic circuits, modules, and functions. The computer program may be stored on memory. The memory may be of any type suitable to the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random access memory (RAM), optical storage devices and systems (Digital Video Disc (DVD) or Compact Disk (CD)), etc. Computer-readable media may include non-transitory storage media. The data processor may be of any type suitable to the local technical environment, such as, but not limited to, general-purpose computers, special-purpose computers, microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), and processors based on multi-core processor architectures.

[0700] A detailed description of exemplary embodiments of this application has been provided above through exemplary and non-limiting examples. However, various modifications and adjustments to the above embodiments will be apparent to those skilled in the art when considered in conjunction with the accompanying drawings and claims, without departing from the scope of this disclosure.

Claims

1. An information processing method applied to a first communication node, the method comprising: The first type of information is processed by a first operation to obtain the second type of information, wherein the first operation includes at least an encoding operation; Send the second type of information.

2. The method according to claim 1, wherein, The first operation includes one of the following: The third type of information is obtained by repeating each element of the first type of information R times. Manchester encoding is performed on each element of the third type of information, where R is an integer greater than 1. Each element in the first type of information is Manchester encoded; The first type of information is repeated Z times to obtain the third type of information. Each element in the third type of information is then encoded using Manchester encoding, where Z is an integer greater than 1. After Manchester encoding each element in the first type of information, the third type of information is obtained, and each element in the third type of information is repeated. After Manchester encoding each element in the first type of information, the third type of information is obtained. The third type of information is repeated in groups of L elements, where L is the length of the Manchester encoding. The third type of information is obtained by performing Manchester encoding on each element in the first type of information. The third type of information is then repeated Y times, where Y is an integer greater than 1.

3. The method according to claim 1, wherein, The M elements in the second type of information are sent in at least one symbol.

4. The method according to claim 3, wherein, When at least one symbol is an on / off keying symbol or a multi-subcarrier on / off keying symbol, the number of symbols is M; When at least one symbol is an orthogonal frequency division multiplexing symbol, the number of symbols is 1.

5. The method according to claim 1, wherein, The first type of information is information generated by the second operation from the fourth type of information, and the fourth type of information includes at least one of the following: Wake-up message; Verification information; Fill in the information.

6. The method according to claim 5, wherein, The second operation includes at least one of the following: repeat; Scrambling; Reidmiller RM encoding; Intertwined; Add padding bits; Add verification information; Rate matching.

7. The method according to claim 6, wherein, When the second operation includes RM encoding and speed matching, the first length of the fourth type of information output after RM encoding is rate matched, and then the second length of information is output.

8. The method according to claim 5, wherein, In the case where the first operation includes repeated operations, the length of the output information corresponding to the RM encoding in the second operation includes 28 or 32 or the maximum length among the encoding lengths supported by RM encoding.

9. The method according to claim 5, wherein, At least one of the following—the length of the fourth type of information, the length of the first type of information, the length of the output information after rate matching in the second operation for generating the first type of information, and the length of the output information of RM encoding in the second operation for generating the first type of information—is determined by at least one of the following: System configuration; Sending method; First quantity; Second quantity; The third quantity is an integer multiple of the quantity; Wherein, the first quantity includes at least one of the number of packets of identification information of the second communication node and the number of identification information of the predetermined function; the second quantity includes the number of sequences in the sequence set when the transmission method is determined, wherein the sequences indicate sub-information of the first type of information or sub-information of the fourth type of information; the third quantity includes the number of bits of sub-information of the first type of information or sub-information of the fourth type of information carried by the sequences in the sequence set when the transmission method is determined.

10. The method according to claim 9, wherein, Meet at least one of the following: When the transmission method is the first transmission method, the integer multiple of the third quantity is any integer multiple of 4, 3, and 2; When the transmission method is the second transmission method, the integer multiple of the third quantity is either 3 or an integer multiple of 2; When the transmission method is the third transmission method, the integer multiple of the third quantity is an integer multiple of 2.

11. The method according to claim 9, wherein, When the length of the fourth type of information is an integer multiple of the second or the third quantity, the sequence indicates sub-information of the fourth type of information; When the quotient of the length of the fourth type of information and the second or third quantity is not an integer, the sequence indicates sub-information of the first type of information.

12. The method according to claim 9, wherein, The sequence is a Zadovchu ZC sequence, and the length of the sequence includes at least one of 31, 61, and 131.

13. The method according to claim 9, wherein, The root index of the sequence is selected in one of the following ways: Select X root indices from the root index set in a first predetermined order; After selecting X root indices from the root index set, Y root indices are selected from the X root indices according to a second predetermined order.

14. The method according to claim 13, wherein, The root index set is obtained by sorting multiple root indices according to a set sorting method, which includes: Sort the root indices according to the number of ZC sequences generated from the ZC root sequences corresponding to the root indices, from most to least.

15. The method according to claim 14, wherein, The number of ZC sequences generated from the ZC root sequence corresponding to the root index is related to the value of the cyclic shift interval.

16. An information processing method applied to a second communication node, the method comprising: Obtain the second type of information; The second type of information is parsed to obtain the first type of information, and the second type of information is obtained by processing the first type of information through the first operation.

17. A first communication node, comprising: At least one processor; A storage device configured to store at least one program; When the at least one program is executed by the at least one processor, the at least one processor implements the method as described in any one of claims 1-15.

18. A second communication node, comprising: At least one processor; A storage device configured to store at least one program; When the at least one program is executed by the at least one processor, the at least one processor performs the method as described in claim 16.

19. A storage medium storing a computer program that, when executed by a processor, implements the method of any one of claims 1-16.

20. A computer program product comprising a computer program that, when executed by a processor, implements the method according to any one of claims 1-16.

Images