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

Abstract

The invention provides an information processing method, a first communication node, a second communication node, a storage medium and a program product, and the information processing method comprises the steps: carrying out the first operation processing of a first type of information, and obtaining a second type of information, the first operation at least comprising an encoding operation; and sending the second type of information.

Description

Technical Field

[0001] The present application relates to the field of communication technology, for example, to an information processing method, a first communication node, a second communication node, a storage medium and a program product. Background Art

[0002] For the fifth generation mobile communication system (5G), in addition to latency, reliability and availability, the energy efficiency of the user equipment (UE) is also crucial. Designing to extend battery life is a necessary condition for improving energy efficiency and user experience.

[0003] In order to meet the battery life requirements, determining the structure of low-power signals is a technical problem that needs to be solved urgently. Summary of the invention

[0004] The present 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, an embodiment of the present application provides an information processing method, applied to a first communication node, the method comprising:

[0006] Processing the first type of information through a first operation to obtain the second type of information, wherein the first operation at least includes an encoding operation;

[0007] Send the second type of information.

[0008] In a second aspect, an embodiment of the present application provides an information processing method, which is applied to a second communication node, and the method includes:

[0009] Obtain the second type of information;

[0010] The second category of information is parsed to obtain the first category of information, where the second category of information is obtained after the first category of information is processed by a first operation.

[0011] In a third aspect, an embodiment of the present application provides a first communication node, including:

[0012] one or more processors;

[0013] A 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 embodiment of the first aspect of the present application.

[0015] In a fourth aspect, an embodiment of the present application provides a second communication node, including:

[0016] One or more processors;

[0017] A 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 embodiment of this application.

[0019] In a fifth aspect, an embodiment of this application provides a storage medium storing a computer program, and when the computer program is executed by a processor, it implements the information processing method provided in the embodiment of this application.

[0020] In a sixth aspect, an embodiment of this application provides a computer program product including a computer program, and when the computer program is executed by a processor, it implements the information processing method provided in the embodiment of this application.

[0021] Regarding the above embodiments and other aspects of this application and their implementation manners, more descriptions are provided in the drawings description, the specific implementation manners, and the claims. Description of the Drawings

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

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

[0024] Figure 3 It is a flowchart of another method for generating MC-OOK based LP-WUS provided in an embodiment of this application;

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

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

[0027] Figure 6 It is a structural diagram of an information processing device provided in an embodiment of this application;

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

[0029] Figure 8 It is a structural diagram of a first communication node provided in an embodiment of this application;

[0030] Figure 9 It is a schematic structural diagram of a second communication node provided by an embodiment of the present application. Specific implementation manners

[0031] To make the objectives, technical solutions and advantages of the present application clearer and more understandable, the embodiments of the present application will be described in detail below with reference to the accompanying drawings. It should be noted that, without conflict, the embodiments in the present application and the features in the embodiments can be combined with each other arbitrarily.

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

[0033] The terms "first", "second", etc. in the present application are used to distinguish similar objects, and do not necessarily need to be used to describe a specific order or sequence.

[0034] In recent years, the Internet of Things (IoT) has attracted much attention. More interconnection of items is expected to improve efficiency and living comfort. Manually replaceable or rechargeable batteries cannot meet the power supply requirements of all IoT devices, resulting in high maintenance costs, serious environmental problems, and even potential safety hazards in some application scenarios. Therefore, new IoT technologies (Ambient IoT) have been studied. The solutions in the present application are also applicable to signaling and signals in Ambient IoT.

[0035] 5G devices may need to be charged weekly or daily according to an individual's usage time. Generally, 5G devices consume dozens of milliwatts of power in the Radio Resource Control (RRC) idle / inactive state and hundreds of milliwatts of power in the RRC connected state. Designing to extend battery life is a necessary condition for improving energy efficiency and user experience.

[0036] The power consumption of the UE depends on the configured wake-up cycle length, such as the paging cycle. To meet the battery life requirement, an extended discontinuous reception (eDRX) cycle with a higher value is expected to be used, which results in high latency and is not suitable for services that require 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 by on-off keying (OOK) modulation, which is called an OOK-based LP-WUS.

[0037] There is no determined solution for the structures of LP-WUS, LP-SS, and LP-Preamble and the sequence information they carry.

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

[0039] The roles 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 roles of LP-Preamble include at least one of the following: performing RRM measurements by detecting LP-Preamble, detecting LP-Preamble for downlink synchronization, and detecting LP-Preamble for frequency offset correction.

[0041] In some embodiments, the transmission of LP-Preamble is before LP-WUS, and the terminal device performs downlink synchronization and / or frequency offset correction by detecting LP-Preamble, thereby improving the detection performance of the terminal device for detecting LP-WUS. The terminal device covers any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable web browser, or a vehicle-mounted mobile station.

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

[0043] The waveforms of the above signals (LP-WUS / LP-SS / LP-Preamble) can be generated by the OOK modulation method, which is called OOK based LP-WUS / LP-SS / LP-Preamble. In addition, in the present application, the above signals can be carried by multiple subcarriers, that is, when the number of subcarriers occupied by OOK based LP-WUS / LP-SS / LP-Preamble in frequency is greater than 1, it is called multiple subcarrier (MC)-OOK based LP-WUS / LP-SS / LP-Preamble.

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

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

[0046] Figure 2 It is a flowchart of a generation method of MC-OOK based LP-WUS provided by an embodiment of the present application. Refer to Figure 2 , the generation method can generate the time-domain expression forms 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 the length is M;

[0048] Step 2: Convert S M to data information Q K according to the following formula, where the length of Q K is K, and K is greater than or equal to 1. Here, the generation formula of the data information Q K is not limited, as long as the data information S M can be converted into the data information Q K with a length of K.

[0049]

[0050] Or,

[0051]

[0052] wherein, A0 + A1 + … A i + … + A M-1 = K, A0, A1, … A i , …, A M-1 respectively correspond to Figure 2 in the of the A M-1 .

[0053] Wherein, the value of the data can be configured. Wherein, 0 ≤ i ≤ M - 1.

[0054] Step 3: Perform a K-point DFT / FFT operation on the data information Q K to obtain the data information D K = [d0, d1, d2, d3,..., d K-1 .

[0055] Furthermore, at least one of the following operations can be performed on D K , and the following operations can be optional steps:

[0056] Perform a circular shift operation on D K upward, and the size of the circular shift is or or K / 2. Wherein, is the ceiling operator, is the floor operator;

[0057] Perform a circular shift operation on D K downward, and the size of the circular shift is or or K / 2. Wherein, is the ceiling operator, is the floor operator;

[0058] Perform a circular shift operation on D K to the left, and the size of the circular shift is or or K / 2. Wherein, is the ceiling operator, is the floor operator;

[0059] Perform an operation on DK Perform a right circular shift operation, and the size of the circular shift is Or Or K / 2. Wherein, Is the ceiling operator, Is the floor operator;

[0060] Perform an FFTSHIFT operation on D K Execute the FFTSHIFT operation, where FFTSHIFT is a function used to move the zero-frequency component of the Fourier transform to the center of the spectrum. For the vector X, FFTSHIFT(X) exchanges the left and right halves of X or exchanges the upper and lower halves of X. For the matrix X, FFTSHIFT(X) exchanges the first and third quadrants, and the second and fourth quadrants.

[0061] Step 4: Fill the data information D K Fill it onto K subcarriers in the frequency domain; when the overall frequency domain bandwidth of the system includes N subcarriers, then perform an N-point IDFT / IFFT operation on the filled data on the N subcarriers to obtain the time-domain data T of N sampling points N =[t0,t1,t2,t3,...,t N-1 . Wherein, N is greater than or equal to 1.

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

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

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

[0065] Perform an upward circular shift operation on the data, and the size of the circular shift is Or Or N / 2. Wherein, is the ceiling operator, is the floor operator;

[0066] performs a circular right shift operation on the said data, and the size of the circular shift is or or N / 2. Wherein, is the ceiling operator, is the floor operator;

[0067] performs a circular left shift operation on the said data, and the size of the circular shift is or or N / 2. Wherein, is the ceiling operator, is the floor operator;

[0068] performs a circular right shift operation on the said data, and the size of the circular shift is or or N / 2. Wherein, is the ceiling operator, is the floor operator;

[0069] performs the FFTSHIFT operation on the said data, wherein FFTSHIFT is a function for shifting the zero-frequency component of the Fourier transform to the center of the spectrum. For the vector X, FFTSHIFT(X) exchanges the left and right halves of X or exchanges the upper and lower halves of X. For the matrix X, FFTSHIFT(X) exchanges the first and third quadrants, and the second and fourth quadrants.

[0070] Step 5: The time-domain data T of N sampling points N = [t0, t1, t2, t3,..., t N-1 also needs to perform the Cyclic Prefix (CP) addition operation before transmission, that is, copy the information of the last N N sampling points at the tail of the time-domain data T of N sampling points cp to the head of the time-domain data T of N sampling points N to form the time-domain data of (N + N cp ) sampling points, and then send out the data of these (N + N cp ) sampling points.

[0071] In addition, in Step 4, when the number of frequency-domain subcarriers allocated for the MC-OOK based LP-WUS symbol is not equal to K, for example, when the number of frequency-domain subcarriers allocated for the MC-OOK based LP-WUS symbol is K1, where K1 is not equal to K, then the process of Step 4 is modified to the following operation, Figure 3It is a flowchart of another MC-OOK based LP-WUS generation method provided by an embodiment of the present application. Figure 3 It shows the generation process:

[0072] (1) Process the data information D K = [d0, d1, d2, d3,..., d K-1 , and convert D K into E K1 , where E K1 = [e0, e1, e2, e3,..., e K1-1 ;

[0073] Further, at least one of the following operations can be performed on E K1 . This operation can be an optional operation:

[0074] Perform an upward circular shift operation on , and the size of the circular shift is or or K1 / 2. Among them, is the ceiling operator, is the floor operator;

[0075] Perform a downward circular shift operation on E K1 , and the size of the circular shift is or or K1 / 2. Among them, is the ceiling operator, is the floor operator;

[0076] Perform a left circular shift operation on E K1 , and the size of the circular shift is or or K1 / 2. Among them, is the ceiling operator, is the floor operator;

[0077] Perform a right circular shift operation on E K1 , and the size of the circular shift is or or K1 / 2. Among them, is the ceiling operator, is the floor operator;

[0078] Perform an operation on E K1Perform the FFTSHIFT operation, where FFTSHIFT is a function used to move the zero-frequency component of the Fourier transform to the center of the spectrum. For vector X, FFTSHIFT(X) swaps the left and right halves of X or swaps the upper and lower halves of X. For matrix X, FFTSHIFT(X) swaps the first and third quadrants, and the second and fourth quadrants.

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

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

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

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

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

[0084] Perform a cyclic shift operation upward on the data, and the size of the cyclic shift is or or N / 2. Where is the ceiling operator, is the floor operator;

[0085] Perform a cyclic shift operation downward on the data, and the size of the cyclic shift is or or N / 2. Where is the ceiling operator, is the floor operator;

[0086] perform a cyclic left shift operation on the said data, and the size of the cyclic shift is or or N / 2. Wherein, is the ceiling operator, is the floor operator;

[0087] perform a cyclic right shift operation on the said data, and the size of the cyclic shift is or or N / 2. Wherein, is the ceiling operator, is the floor operator;

[0088] perform the FFTSHIFT operation on the said data, wherein FFTSHIFT is a function for shifting the zero-frequency component of the Fourier transform to the center of the frequency spectrum. For the vector X, FFTSHIFT(X) exchanges the left and right halves of X or exchanges the upper and lower halves of X. For the matrix X, FFTSHIFT(X) exchanges the first and third quadrants, and the second and fourth quadrants.

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

[0090] Step 1: The data information transmitted on M OOK symbols is S M , define S M = [s0, s1, s2, s3..., s M-1 and the length is M;

[0091] Step 2: Generate the data information M from S

[0092]

[0093] or

[0094]

[0095] Wherein, Wherein, is an integer greater than or equal to 1. Further, is preferably N. Wherein, N is the number of subcarriers included in the system bandwidth.

[0096] Wherein, the data The value of can be configured. Among them, 0 ≤ i ≤ M - 1.

[0097] Step 3: The data information Passes through the first processing module to obtain the data information D K = [d0, d1, d2, d3,..., d K-1 T . Among them, the first processing module includes at least one of the following operations:

[0098] (1) For Generate the data information D according to the following formula K

[0099]

[0100] Among them, Preferably, Is the generalized inverse matrix of F. Among them, (X) -1 Is the operation of finding the inverse matrix of matrix X, (X) H Is the operation of finding the conjugate transpose matrix of matrix X, (X) H Is the operation of finding the transpose matrix of matrix X.

[0101] Among them, F is the matrix composed of K column elements in the IDFT Matrix, and the matrix F is A matrix with rows and K columns.

[0102] Among them, the expression of the IDFT Matrix is:

[0103]

[0104] Or

[0105]

[0106] Furthermore, the position of the K column elements in the IDFT Matrix that make up F among the Column elements is determined by at least filling the data information D K To K subcarrier positions or subcarrier indices in the frequency domain.

[0107] (2) Perform at least one of the following operations on D K This operation can be an optional operation:

[0108] Perform an upward circular shift operation on D K The size of the circular shift is Or Or K / 2. Among them, Is the ceiling operator, ​is the floor operator;

[0109] for D K perform a circular shift down operation, and the size of the circular shift is or or K / 2. Here, is the ceiling operator, is the floor operator;

[0110] for D K perform a circular shift left operation, and the size of the circular shift is or or K / 2. Here, is the ceiling operator, is the floor operator;

[0111] for D K perform a circular shift right operation, and the size of the circular shift is or or K / 2. Here, is the ceiling operator, is the floor operator;

[0112] for D K perform the FFTSHIFT operation, where FFTSHIFT is a function used to move the zero-frequency component of the Fourier transform to the center of the spectrum. For the vector X, FFTSHIFT(X) exchanges the left and right halves of X or exchanges the upper and lower halves of X. For the matrix X, FFTSHIFT(X) exchanges the first and third quadrants, and the second and fourth quadrants.

[0113] Step 4: Fill the data information D K onto K subcarriers in the frequency domain; when the overall frequency-domain bandwidth of the system includes N subcarriers, then perform an N-point IDFT / IFFT operation on the filled data on the N subcarriers to obtain the time-domain data T of N sampling points N =[t0,t1,t2,t3,...,t N-1 . Here, N is greater than or equal to 1.

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

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

[0116] Step 5: The time-domain data T of N sampled points N = [t0, t1, t2, t3,..., t N-1 also needs to perform the operation of adding CP (Cyclic prefix) before transmission, that is, copy the information of the last N N sampled points at the tail of the time-domain data T of N sampled points to the head of the time-domain data T of N sampled points to form the time-domain data of (N + N cp ), and then send out the data of these (N + N N ) sampled points. cp ) sampled points. cp ) sampled points.

[0117] In addition, 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 the flowchart of a method for generating MC-OOK based LP-WUS provided by an embodiment of the present application, and the generation process is shown in Figure 4 :

[0118] (1) Process the data information D K = [d0, d1, d2, d3,..., d K-1 to convert D K into E K1 , where E K1 = [e0, e1, e2, e3,..., e K1-1 ;

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

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

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

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

[0123] This application can also process the data information S M in the following manner 1 or manner 2 to obtain the data information Q K or the data information

[0124] Manner 1: The data information transmitted on M OOK symbols is S M , and S M includes M elements, that is, the length of S M is M, denoted as S M = [s0, s1, s2, s3 ..., s M-1 .

[0125] Step 1: Generate Es M based on the element s i in the data information S i .

[0126] Exemplarily, Es i can satisfy any of the following formulas:

[0127]

[0128] Among them, x i = 0 or x i = s i , y i = 0 or y i = s i .

[0129] Step 2: Generate the data information Q i based on Es K or the data information

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

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

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

[0133] The length of Among them, is an integer greater than or equal to 1. Exemplarily, can take the value of N. Among them, N is the number of subcarriers included in the system bandwidth.

[0134] Method 2: The data information sent on M OOK symbols is S M , and S M includes M elements, that is, the length of S M is M, denoted as S M = [s0, s1, s2, s3..., s M-1 .

[0135] Step 1: Generate Es M based on the element s i in the data information S i .

[0136] Exemplarily, Es i can satisfy any of the following formulas:

[0137]

[0138] Among them, or is the B i elements in, for example can be the last B i elements in, 0 ≤ b i ≤ B i - 1.

[0139] or is the C ielements, such as can be the leading C in i elements, 0 ≤ c i ≤ C i - 1.

[0140] Among them, the data can be configured, 0 ≤ i ≤ M - 1.

[0141] In some embodiments, the data is composed of at least one of the following:[[]]

[0142] (1) A sequence of length

[0143] (2) A sequence of length is the first elements in or 0 elements or

[0144] (3) A sequence of length is the last elements in or 0 elements or

[0145] Exemplarily, the sequence can be a binary random sequence, such as Zadoff - Chu (ZC sequence), maximum length linear feedback shift register sequence (M sequence), pseudo noise sequence (PN sequence), and the sequence can also be a repetition of a binary random sequence.

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

[0147]

[0148] Exemplarily, the data can also be obtained by processing based on the elements of the above sequences. Taking as an example, one of its elements is ​​​where \(0\leq a\leq A\) i -1, and an element can be multiplied by and / or divided by and / or added to and / or subtracted from a further element.

[0149] Step 2: Generate data information Q i based on Es K or data information

[0150] where Q K = [Es0, Es1,..., Es M-1 ,

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

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

[0153] The length of where is an integer greater than or equal to 1. Exemplarily, the value of can be N. Where N is the number of subcarriers included in the system bandwidth.

[0154] It should be pointed out that the embodiments of the present application can learn from or refer to each other. For example, for the same or similar steps, among the method embodiments, system embodiments and device embodiments, they can all refer to each other without limitation.

[0155] The following describes the low-power signal structure by generating the second type of information. As Figure 1 shown, the information processing method provided by the present application includes the following operations:

[0156] S110. Process the first type of information through a first operation to obtain the second type of information, where the first operation at least includes an operation of encoding.

[0157] The first type of information can be regarded as processed information, and this information can be the information corresponding to the low-power signal, such as the wake-up information. That is, the first type of information can be the processed wake-up information. The wake-up information can be information indicating whether to wake up. Such as information indicating whether to wake up the UE.

[0158] In the present 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.

[0159] A Low Power Wake-Up Receiver (LP-WUR) can be a receiver designed specifically for low-power communication. Its function is to wake up the device's Main Radio by detecting a Low Power Wake-Up Signal (LP-WUS), thereby significantly reducing the power consumption of the device in the idle state and maintaining low-power operation when the Main Radio is turned off or in the sleep state.

[0160] The low power wake-up receiver can receive low power signals. The low power signals include LP-WUS. The low power wake-up receiver is simple to implement and has low complexity, so its power consumption is much lower than that of the main receiver. The main receiver has strong receiving performance and can achieve a high transmission rate; however, at the same time, its receiver complexity is relatively high, and the power consumption generated is also relatively high.

[0161] The electric energy consumed when the low power wake-up receiver operates can be lower than that of the main receiver, reducing energy consumption.

[0162] The second type of information can be the information generated after the first operation. The first operation at least includes an encoding operation, such as an operation including Manchester code. The first type of information can be the information encoded by RM code, also known as Reed-Muller code.

[0163] In this embodiment, the first operation at least includes an encoding operation, and can also combine other operations to process the first type of information. For example, the first operation can also include a repetition operation, and the repetition operation can include at least one of the following:

[0164] Repeating the whole first type of information;

[0165] Repeating each element in the first type of information;

[0166] Repeating the whole processed first type of information;

[0167] Repeating each element in the processed first type of information.

[0168] The processed first type of information can be the first type of information after encoding processing, and the means of processing is not limited here.

[0169] Among them, repeating the whole first type of information can take the first type of information as a whole and repeat the whole first type of information each time. Repeating each element in the first type of information can be repeated in terms of elements, and each element in the first type of information is repeated in turn.

[0170] In this embodiment, the execution order of each operation included in the first operation is not limited. The repeated operations can be executed first, and then the encoding operations; or the encoding operations can be executed first, and then the repeated operations.

[0171] In one example, the first type of information b0, b1, …, b N-1 generates the second type of information through the first operation.

[0172] S120. Transmit the second type of information.

[0173] After obtaining the second type of information, the second type of information can be transmitted to the second communication node, so that the second communication node can analyze the second type of information to obtain the first type of information, and then obtain the low-power signal.

[0174] The second type of information can be transmitted in symbols, such as segmenting the third type of information and transmitting it through different symbols.

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

[0176] For an information processing method provided by this application, the first type of information may include information of the processed low-power signal, such as wake-up information, or include information of the low-power signal. After processing the first type of information, the second type of information is obtained and the second type of information is transmitted. This embodiment can show that the first type of information corresponding to the information of the low-power signal is processed by the first operation to obtain the second type of information. The structure of the low-power signal is clarified.

[0177] Based on the above embodiment, a variant embodiment of the above embodiment is proposed. Here, it should be noted that for the sake of brief description, only the differences from the above embodiment are described in the variant embodiment.

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

[0179] Repeating each element in the first type of information R times to obtain the third type of information, and performing Manchester encoding on each element in the third type of information, where R is an integer greater than 1;

[0180] Performing Manchester encoding on each element in the first type of information;

[0181] Repeating the first type of information as a whole Z times to obtain the third type of information, and performing Manchester encoding on each element in the third type of information, where Z is an integer greater than 1;

[0182] 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;

[0183] After Manchester encoding each element in the first type of information, the third type of information is obtained, and every L elements in the third type of information are grouped and repeated, where L is the length of the Manchester encoding;

[0184] After Manchester encoding each element in the first type of information, the third type of information is obtained, and the third type of information is repeated Y times as a whole, where Y is an integer greater than 1.

[0185] The first operation can be to repeat in units of the elements in the first type of information to obtain the third type of information after the repetition operation. Then, each element in the third type of information is Manchester encoded to obtain the second type of information.

[0186] In this embodiment, the first operation may not include the repetition operation, such as including the operation of Manchester encoding each element in the first type of information.

[0187] In an example, the first operation includes:

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

[0189] (2) Each element in the third type of information is Manchester encoded, and then the second type of information is generated.

[0190] If R = 1, the repetition operation is not performed, and (2) can be executed.

[0191] Exemplarily, the first type of information may be b0, b1, …, b N-1 . The third type of information obtained by repeating each element in the first type of information may be The third type of information obtained after encoding may be

[0192] Wherein, the length of the Manchester encoding is 2. For example, bit 0 generates

[10] after Manchester encoding with a length of 2, and bit 1 generates

[01] after Manchester encoding with a length of 2. Each element in generates 2 elements through Manchester encoding, and finally constitutes the third type of information

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

[0194] 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 in the third type of information in sequence to obtain the second type of information. The first operation may also not include a repetition operation, such as an operation of performing Manchester encoding on each element in the first type of information.

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

[0196] (1) Repeating the first type of information as a whole Z times to generate the third type of information. Here, Z is an integer greater than or equal to 1;

[0197] (2) Manchester-encoding each element in the third type of information to generate the second type of information.

[0198] If R = 1, no repetition operation is performed, and (2) can be executed.

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

[0200] Among them, the length of the Manchester encoding is 2. For example, bit 0 generates

[10] after being Manchester-encoded with a length of 2, and bit 1 generates

[01] after being Manchester-encoded with a length of 2. Each element in generates 2 elements through Manchester encoding, and finally constitutes the second type of information In this example, the value of Z is taken as R for description.

[0201] In the above example, the first operation first performs a repetition operation and then an encoding operation. The following takes the example of performing encoding first and then repetition operation for description.

[0202] The first operation can perform Manchester encoding on each element in the first type of information and then repeat it in terms of the element dimension, or repeat it in terms of the overall dimension of the third type of information generated after encoding.

[0203] The following provides an example of first encoding each element and then repeating each encoded element:

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

[0205] (1) Manchester-encoding each element in the first type of information to generate the third type of information.

[0206] (2) The third - type information is repeated as a whole to generate the second - type information.

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

[0208] Exemplarily, the first - type information can be b0, b1, …, b N-1 . The third - type information is The second - type information is

[0209] Among them, the length of the Manchester code is 2. For example, bit 0 generates

[10] after being Manchester - coded with a length of 2, and bit 1 generates

[01] after being Manchester - coded with a length of 2. Each element in generates 2 elements through Manchester coding, and finally constitutes the third - type information Among them, the third - type information is repeated R times as a whole to generate the second - type information Among them, R is an integer greater than or equal to 1.

[0210] The following provides an example of first encoding each element and then repeating each encoded element:

[0211] In an example, the first operation includes:

[0212] (3) Each element in the first - type information is Manchester - coded (Manchester code), and then the third - type information is generated.

[0213] (4) Each element in the third - type information is repeated Q times to generate the second - type information. Among them, Q is an integer greater than or equal to 1;

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

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

[0216] Among them, the length of the Manchester code is 2. For example, bit 0 generates

[10] after being Manchester - coded with a length of 2, and bit 1 generates

[01] after being Manchester - coded with a length of 2. Each element in generates 2 elements through Manchester coding, and finally constitutes the third - type information Among them, each element in the third - type information is repeated R times to generate the third - type information Wherein, R is an integer greater than or equal to 1; in this embodiment, the value of Q is described as R.

[0217] In this embodiment, the first operation may first encode each element in the first type of information, and then repeat every L elements in the encoded third type of information as a group to obtain the second type of information. The first type of information may also be repeated every G elements as a group to obtain the third type of information, and each element in the third type of information is encoded to obtain the second type of information.

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

[0219] (1) Each element in the first type of information is encoded by Manchester code, thereby generating the third type of information.

[0220] (2) Every L elements in the third type of information are grouped as a group and repeated E times to generate the second type of information. Wherein, E is an integer greater than 1; wherein, L is the Manchester code length.

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

[0222] Exemplarily, the first type of information may 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 obtained by repeating every L in the third type of information as a group is

[0223] Wherein, the length of the Manchester code is 2. For example, bit 0 generates

[10] through the Manchester code with a length of 2, and bit 1 generates

[01] through the Manchester code with a length of 2. Each element in generates 2 elements through Manchester encoding, and finally constitutes the third type of information Wherein, every L = 2 elements in the third type of information are repeated R times to generate the second type of information Wherein, R is an integer greater than or equal to 1; in this embodiment, the value of E is described as R for example.

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

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

[0226] 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 the symbols is M;

[0227] When the symbol is Orthogonal Frequency Division Multiplexing (OFDM), the number of symbols is 1.

[0228] When the number of symbols is M, different elements can be transmitted on different symbols.

[0229] For the transmission method in this embodiment, refer to Figures 2 - 4 the shown transmission method.

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

[0231] Wake-up information;

[0232] Check information;

[0233] Padding information.

[0234] Here, the operations included in the second operation are not limited. The second operation may be an operation including RM coding. The execution order of each operation is not limited.

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

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

[0237] Identification information;

[0238] Indication information.

[0239] Among them, the identification information is the identification of the UE or the identification of the UE Group (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.

[0240] Among them, the indication information indicates at least one UE or at least one UE Group (UE Group, which includes at least one UE); the UE or UE Group indicated by the indication information is the UE or UE Group that needs to perform the wake-up operation.

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

[0242] The check information can be regarded as the information for implementing the check, such as Cyclic Redundancy Check (CRC). CRC is an algorithm used to detect or verify whether errors occur in data / information transmission.

[0243] The padding information can be the information for padding the wake-up information so that the length of the generated first type of information meets the requirements.

[0244] In wireless communication, the size and format of the transmitted information must conform to specific standards, and the information of a specific size is called an information block. When the information to be transmitted is smaller than the size of the information block, padding information needs to be used after the information to be transmitted so that the size of the information to be transmitted reaches the requirements of the information block. The padding information can be specific characters or binary data.

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

[0246] Repeat;

[0247] Scrambling;

[0248] Reed-Muller RM coding;

[0249] Interleaving;

[0250] Adding padding bits;

[0251] Adding check information;

[0252] Rate matching.

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

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

[0255] Repeat can be regarded as copying data according to certain rules.

[0256] Among them, the scrambling operation includes at least one of the following:

[0257] For the input data or information, according to the preset scrambling rule, perform a scrambling operation on the input data or information to generate the output data or information. For example, the input data or information is b0, b1, b2,..., b N-1 , and the output data or information is d0, d1, d2,..., d N-1 . The scrambling rule is: d i =(b i +c i )mod2.

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

[0259] where c i is generated according to the set rules.

[0260] b i and c i take values from one of the following: 0, 1, and -1.

[0261] The process of RM coding is as follows:

[0262] The input information for the RM coding operation is c0, c1, c2,..., c K-1 , and the length of the input information is K, where 3 ≤ K ≤ 11. The output information of the input information after the RM coding operation is d0, d1, d2,..., d N-1 , where N is the length of the output information d0, d1, d2,..., d N-1 The output information d0, d1, d2,..., d N-1 is obtained by the following method:

[0263]

[0264] where i = 0, 1,..., N - 1, and N = 32. M i,k takes its value from the following table.

[0265] Table 1: Values of M i,k of M

[0266] i <![CDATA[M i,0 > <![CDATA[M i,1 > <![CDATA[M i,2 > <![CDATA[M i,3 > <![CDATA[M i,4 > <![CDATA[M i,5 > <![CDATA[M i,6 > <![CDATA[M i,7 > <![CDATA[M i,8 > <![CDATA[M i,9 > <![CDATA[M i,10 > 0 1 1 0 0 0 0 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 1 1 2 1 0 0 1 0 0 1 0 1 1 1 3 1 0 1 1 0 0 0 0 1 0 1 4 1 1 1 1 0 0 0 1 0 0 1 5 1 1 0 0 1 0 1 1 1 0 1 6 1 0 1 0 1 0 1 0 1 1 1 7 1 0 0 1 1 0 0 1 1 0 1 8 1 1 0 1 1 0 0 1 0 1 1 9 1 0 1 1 1 0 1 0 0 1 1 10 1 0 1 0 0 1 1 1 0 1 1 11 1 1 1 0 0 1 1 0 1 0 1 12 1 0 0 1 0 1 0 1 1 1 1 13 1 1 0 1 0 1 0 1 0 1 1 14 1 0 0 0 1 1 0 1 0 0 1 15 1 1 0 0 1 1 1 1 0 1 1 16 1 1 1 0 1 1 1 0 0 1 0 17 1 0 0 1 1 1 0 0 1 0 0 18 1 1 0 1 1 1 1 1 0 0 0 19 1 0 0 0 0 1 1 0 0 0 0 20 1 0 1 0 0 0 1 0 0 0 1 21 1 1 0 1 0 0 0 0 0 1 1 22 1 0 0 0 1 0 0 1 1 0 1 23 1 1 1 0 1 0 0 0 1 1 1 24 1 1 1 1 1 0 1 1 1 1 0 25 1 1 0 0 0 1 1 1 0 0 1 26 1 0 1 1 0 1 0 0 1 1 0 27 1 1 1 1 0 1 0 1 1 1 0 28 1 0 1 0 1 1 1 0 1 0 0 29 1 0 1 1 1 1 1 1 1 0 0 30 1 1 1 1 1 1 1 1 1 1 1 31 1 0 0 0 0 0 0 0 0 0 0

[0267] where the interleaving operation includes at least one of the following:

[0268] For the input data or information, according to the preset interleaving rules, the input data or information is rearranged. The interleaving rules can be determined based on the time dimension, frequency dimension, or specified parameters.

[0269] After the interleaving process, the data or information that was originally adjacent in time, frequency, or space is dispersed after interleaving, enhancing the resistance of the data or information to interference and errors. When the data or information reaches the receiving end, the deinterleaving module will restore the received interleaved data or information to the original order in a manner corresponding to the interleaving rules at the sending end, so that subsequent data or information decoding operations can be carried out correctly.

[0270] where the rate matching operation can be:

[0271] The input information for the rate matching operation is d0, d1, d2,..., dN-1 , the 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 is the length of the output information f0, f1, f2,..., f E-1 . The output information f0, f1, f2,..., f E-1 is obtained in the following way:

[0272] Let the variable k start from 0, loop 1 each time until E - 1, and execute f each time in the loop k = d kmodN .

[0273] Adding padding bits can be considered as an operation of padding extra bits, such as the operation of padding padding information.

[0274] Adding check information can be considered as an operation of adding check information.

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

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

[0277] In one example, the second operation includes RM coding and rate matching. Among them, when the output information after RM coding The first length is N, when rate - matching the output information with the first length of N, the output information f0, f1, f2,..., f after rate - matching E-1 The second length is E.

[0278] Among them, the value of E can be less than or equal to or greater than N.

[0279] For the case where E is less than or equal to N, assuming the maximum value of N is 32, the value of E can be {7, 14, 21, 28}, that is, the values extended by multiples of 7 or 14.

[0280] For the case where E is greater than or equal to N, assuming the maximum value of N is 32, the value of E can be {35, 42, 49, 56, 63}, that is, the values extended by multiples of 7 or 14.

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

[0282] Set E1 = [7, 14, 21, 28, 35, 42, 49, 56, 63], that is, extended by multiples of 7;

[0283] Set E2 = [14, 28, 42, 56, 70], that is, extended by multiples of 14.

[0284] In one embodiment, when the first operation includes a repeated operation, the length of the output information corresponding to the RM coding in the second operation includes 28 or 32 or the maximum length among the coding lengths supported by the RM coding.

[0285] The repeated operation may include one or more of the following:

[0286] Performing a repeated operation on each element in the first type of information;

[0287] Performing a repeated operation on the first type of information as a whole;

[0288] Performing a repeated operation on each element in the third type of information;

[0289] Performing a repeated operation on the third type of information as a whole;

[0290] Performing a repeated operation on every G elements in the first type of information;

[0291] Performing a repeated operation on every L elements in the third type of information.

[0292] The maximum length among the coding lengths supported by the RM coding may be the maximum length among multiple predefined RM coding lengths. In this embodiment, the coding method is not limited and may be an error correction coding such as RM coding.

[0293] When the number of repetitions is greater than 1, that is, when the first operation includes a repeated operation, the length of the output information corresponding to the RM coding in the second operation is N max . Wherein, N max is 28 or 32 or the maximum length among the configured RM coding lengths.

[0294] When the number of repetitions R is greater than 1, N max = 32, and the following first operation may be adopted:

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

[0296] (2) Each element in the third type of information is Manchester - coded, and then the second type of information is generated.

[0297] 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 any transmission scheme, such as being applicable to receivers or terminals of types other than this application for reception.

[0298] For the transmission of the fourth type of information, there are 2 transmission schemes.

[0299] The first transmission scheme: 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 the second type of information is transmitted according to the Figures 2 - 4 scheme described in;

[0300] The second transmission scheme: The information to be transmitted is the first type of information or the fourth type of information, and their meanings are the same. However, the transmission methods are different, including:

[0301] Divide the first type of information or the fourth type of information into P (P is an integer greater than or equal to 1) sub-informations, and one sub-information is transmitted in one OOK symbol. The sub-informations of the first type of information or the fourth type of information are carried by a sequence. Among them, the sequence is:

[0302] (1) Figure 2 The data in the MC-OOK based LP-WUS generation method shown where 0 ≤ i ≤ M - 1;

[0303] (2) Figure 4 The data in the MC-OOK based LP-WUS generation method shown where 0 ≤ i ≤ M - 1;

[0304] (3) The data in the second method of processing the data information S M where 0 ≤ i ≤ M - 1.

[0305] In one embodiment, the lengths of each sub-information are the same;

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

[0307] Transmit the first sequence, also known as the sequence, according to the content of the sub-information of the first type of information or the fourth type of information. Among them, the sequence is taken from the first sequence set, also known as the sequence set. There is a corresponding relationship or mapping relationship between the sequences in the sequence set and the content of the sub-information.

[0308] ​When the number of symbols is M = 1, the maximum number of sequences in the sequence set is 16. That is to say, the sequence can support up to 4-bit sub-information;

[0309] When the number of symbols is M = 2, the maximum number of sequences in the sequence set is 8. That is to say, the sequence can support up to 3-bit sub-information;

[0310] When the number of symbols is M = 4, the maximum number of sequences in the sequence set is 4;, that is to say, the sequence can support up to 2-bit sub-information.

[0311] To ensure that the length of each sub-information is the same, some designs need to be made on the length of the first type of information or the fourth type of information.

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

[0313] An integer multiple of 2;

[0314] An integer multiple of 3;

[0315] An integer multiple of 4.

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

[0317] When the sending mode is the first sending mode, the length of the fourth type of information is an integer multiple of any one of 4, 3, and 2;

[0318] When the sending mode is the second sending mode, the length of the fourth type of information is an integer multiple of 3 or 2;

[0319] When the sending mode is the third sending mode, the length of the fourth type of information is an integer multiple of 2.

[0320] The sending mode can be characterized by the symbols used. The first sending mode can be the case where M is equal to 1. The second sending mode can be the case where M is equal to 2. The third sending mode can be the case where M is equal to 4. Here, the corresponding relationship between the first sending mode and M is not limited. The length of the fourth type of information a0, a1, a2,..., a K-1 is K.

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

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

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

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

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

[0326] In one example, when the transmission mode is the first transmission mode, the length of the fourth type of information is an integer multiple of 3.

[0327] In one example, when the transmission mode is the first transmission mode, the length of the fourth type of information is an integer multiple of 2.

[0328] In one example, when the transmission mode is the second transmission mode, the length of the fourth type of information is an integer multiple of 3.

[0329] In one example, when the transmission mode is the second transmission mode, the length of the fourth type of information is an integer multiple of 2.

[0330] When the number of symbols is M = 1, the maximum number of sequences in the sequence set is 16, that is, the sequence can support up to 4-bit information;

[0331] When the number of symbols is M = 2, the maximum number of sequences in the sequence set is 8, that is, the sequence can support up to 3-bit sub-information;

[0332] When the number of symbols is M = 4, the maximum number of sequences in the sequence set is 4; that is, the sequence can support up to 2-bit sub-information;

[0333] To ensure that the length of each sub-information in the fourth type of information is the same, it is necessary to consider the length of the fourth type of information, including:

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

[0335] When the wake-up information is 5 bits and the number of symbols is M = 2, the length K of the fourth type of information is 6, including P = 2 sub-informations;

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

[0337] When the wake-up information 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-informations;

[0338] When the wake-up information 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-informations;

[0339] When the wake-up information 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-informations;

[0340] 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-informations;

[0341] When the wake-up information 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-informations;

[0342] When the wake-up information 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-informations.

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

[0344] An integer multiple of 2;

[0345] An integer multiple of 3;

[0346] An integer multiple of 4.

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

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

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

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

[0351] In one embodiment, the length N of the output information of the RM coding in the second operation of generating the first type of information or the length of the output information after rate matching in the second operation of generating the first type of information satisfies one or more of the following:

[0352] An integer multiple of 2;

[0353] An integer multiple of 3;

[0354] An integer multiple of 4.

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

[0356] When M = 1, the length of the output information of RM coding in the second operation of generating the first type of information is an integer multiple of 4;

[0357] When M = 2, the length of the output information of RM coding in the second operation of generating the first type of information is an integer multiple of 3;

[0358] When M = 4, the length of the output information of RM coding in the second operation of generating the first type of information is an integer multiple of 2;

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

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

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

[0362] When the wake-up information is 5 bits and the number of symbols is M = 1, the length N of the first type of information is 8, 12, 16;

[0363] When the wake-up information is 5 bits and the number of symbols is M = 2, the length N of the first type of information is 6, 9, 12;

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

[0365] 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;

[0366] When the wake-up information is 6 bits and the number of symbols is M = 2, the length N of the first type of information is 6, 9, 12;

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

[0368] 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;

[0369] 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;

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

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

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

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

[0374] 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; P is 2, 3, 4 respectively;

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

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

[0377] 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; P is 2, 3, 4 respectively;

[0378] 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; P is 3, 4, 5 respectively;

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

[0380] 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 for generating the first type of information, and the length of the output information of RM coding in the second operation for generating the first type of information are determined by one or more of the following:

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

[0382] Transmission mode;

[0383] First quantity;

[0384] The second quantity;

[0385] An integer multiple of the third quantity;

[0386] Wherein, the first quantity includes one or more of the number of packets of the identification information of the second communication node (such as the number of packets of the UE identification) and the number of identification information (which can also be called indication information) of a predetermined function (such as all UEs that receive the identification information within the cell perform a wake-up operation); the second quantity includes, in the case of determining the transmission mode, when the symbol quantity is M, when M is determined, the number of sequences in the sequence set, and the sequence indicates 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 corresponding relationship between the transmission mode, M, and the number of sequences; the third quantity includes, in the case of determining the transmission mode, 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.

[0387] The length of the output information after rate matching in the second operation of generating the first type of information can be understood as the second length. The RM coding length (such as the length of the output information of RM coding, which can also be called the first length) may be a fixed value, and the change in the length of the first type of information is mainly determined by rate matching, that is, the second length can be changed.

[0388] An integer multiple of the third quantity includes one time of the third quantity, that is, the third quantity, and can also include at least two times of the third quantity. Such as 2, 3, 4... times.

[0389] In this embodiment, the integer multiple of the third quantity can be any integer multiple of 2, 3, or 4. The value of the third quantity can also be associated with the transmission mode. Different transmission modes can correspond to different third quantities. The transmission mode can be associated with the value of M.

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

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

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

[0393] In one embodiment, the length of the output information of the RM coding in the second operation of generating the first type of information is determined by one or more of system configuration, sending mode, the first quantity, the second quantity, and the third quantity.

[0394] In one example, the number of packets of the UE Group, which is also the identification information of the second communication node, is 31, that is, the first quantity is 31. Then the fourth type of information can at least indicate the 31 states. The value range of the length K of the fourth type of information is

[0395] In one example, the number of UE Groups is 15. Additionally, the identification information of 1 predefined function is also supported, that is, the first quantity is 15 + 1 = 16. Then the fourth type of information supports at least 16 states. The value range of the length K of the fourth type of information is

[0396] In one example, the number of UE Groups is 31, that is, the first quantity is 31. Then, in order to be able to indicate these 31 UE groups, the value range of the length K of the fourth type of information is at least When the number of symbols is M = 1, the number of sequences in the sequence set is 16, that is, the sequence can support 4-bit sub-information. To ensure that the length of each sub-information in the fourth type of information is the same, the length K of the fourth type of information is 8, which includes P = 2 sub-informations.

[0397] In one example, the number of UE Groups is 31, that is, the first quantity is 31. Then, in order to be able to indicate these 31 UE groups, the value range of the length K of the fourth type of information is

[0398] The first type of information is generated through the fourth type of information. The length N of the output information corresponding to the RM coding in the second operation of generating the first type of information is generated according to the following principle:

[0399] For a given value of M, for example, when the number of symbols is M = 1, the number of sequences in the sequence set is 16, that is, the sequence can support 4-bit information, which means that the sequence can carry 4-bit sub-information in the first type of information. To ensure that the length of each sub-information in the first type of information is the same, it is required that N is an integer multiple of 4. At the same time, considering that the length of N is the length after RM coding, in this embodiment, N can take values of 8, 12, 16, corresponding to P = 2, 3, 4 sub-informations respectively.

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

[0401] When the sending mode is the first sending mode, the third quantity is an integer multiple of any one of 4, 3, and 2;

[0402] When the sending mode is the second sending mode, the third quantity is an integer multiple of 3 or 2;

[0403] When the sending mode is the third sending mode, the third quantity is an integer multiple of 2.

[0404] For another example, when M is equal to 1, the third quantity is an integer multiple of any one of 4, 3, and 2;

[0405] When M is equal to 2, the third quantity is an integer multiple of 3 or 2;

[0406] When M is equal to 4, the third quantity is an integer multiple of 2.

[0407] 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 the sub - information of the fourth type of information;

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

[0409] When the length K of the fourth type of information is an integer multiple of the second quantity or the third quantity, the sequence indicates the 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 quantity or the third quantity, the sequence indicates the sub - information of the first type of information.

[0410] The relationship between the length of the first type of information (for example, the length N of the output information after RM coding), the M value (corresponding to the sending mode), and the second quantity (Y) is shown in the following table:

[0411] Table 2 Correspondence table between M, Y, and the length of the first type of information

[0412]

[0413] Referring to Table 2, the present application can determine the value of the length N of the first type of information according to the values of M and Y. Further, when there are multiple optional values for the value of N, the specific value of N can be further indicated by an indication message. Among them, the length of the fourth type of information is 5 bits or 6 bits. Here, the fourth type of information can be a wake-up message, such as the fourth type of information including only the wake-up message. The "-" in Table 2 indicates that it can be flexibly configured, such as being configured by the base station, and is not limited here. The correspondence relationship between M, Y, and the length of the first type of information can be the correspondence relationship between any column among the first column, the second column, and the length of the first type of information in the table (that is, M and Y can have a correspondence relationship with the length of the first type of information in at least one column of the table). For example, when M is 1 and Y is 4, the length of the first type of information is 8. The same applies to Table 3 and will not be elaborated here.

[0414] Table 3 Another correspondence table between M, Y, and the length of the first type of information

[0415]

[0416] Referring to Table 3, the present application can determine the value of the length N of the first type of information according to the values of M and Y. Further, when there are multiple optional values for the value of N, the specific value of N can be further indicated by an indication message. Among them, the length of the fourth type of information is 4 bits. Here, the fourth type of information can be a wake-up message, such as the fourth type of information including only the wake-up message.

[0417] In one embodiment, the sequence is a Zadoff-Chu (ZC) sequence, and the length L of the sequence RA includes at least one of 31, 61, and 131.

[0418] ZC sequence x u,v (n) is generated according to the following formula:

[0419] x u,v (n) = x u ((n + C v ) mod L RA )

[0420]

[0421] Among them, x u (i) is the ZC root sequence, which can be generated according to the above formula by the root index u. The length of the ZC sequence is L RA . C v is the value of the cyclic shift. C v is generated in the following manner:

[0422]

[0423] where \(v = 0, 1, \ldots, w - 1\) where \(q\) is the smallest non - negative integer satisfying \((qu)\bmod L\) RA \(= 1\).

[0424] In the case of \(N\) CS \(\leq d\) u \(< L\) RA \( / 3\), the values of the following parameters are:

[0425]

[0426] In the case of \(L\) RA \( / 3\leq d\) u \(\leq (L\) RA \(- N\) CS ) / 2, the values of the following parameters are:

[0427]

[0428] The root index \(u\) can also be referred to as the value of the ZC sequence root.

[0429] Figures 2 - 4 The data in the shown scheme where \(0\leq i\leq M - 1\); the value of the data can be configured. The ZC sequence can be converted to this data (the conversion includes the conversion of the length), and after conversion, it can be sent according to the Figures 2 - 4 provided sending method. The conversion method is as follows:

[0430] Conversion scheme 1: The length \(L\) of \(x\) u，v (n) is equal to \(A\) RA . \(x\) i (n) can be directly converted to data u，v .

[0431] Conversion scheme 2: When the length \(L\) of \(x\) u，v (n) is less than \(A\) RA , expand \(x\) i (n) to \(x'\) u，v (n) with a length of \(A\) i according to the following formula; u，v

[0432] \(x'(n)=x\) u，v (((n + C u )\bmod L\) v ), \(n = 0, 1, \ldots, A\) RA \(- 1\) i

[0433] where the value of \(C\) v is greater than or equal to \(0\).

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

[0435] Select X root indexes from the root index set in the first set order;

[0436] After selecting X root indexes from the root index set, select Y root indexes from the X root indexes in the second set order.

[0437] The root index set can be a set composed of multiple root indexes. The first set order can be the order preset for directly selecting root indexes from the root index set. The second set order can be the order preset for continuing to select root indexes among the X root indexes. The first set order and the second set order can be the same or different.

[0438] The first set order and the second set order are not limited and can be associated with the form of the root set. The first set order can be a random order or can be associated with the form of the root index set. For example, when the root index set is in tabular form, the first set order can be the order from top to bottom or from bottom to top in the column where the root index is located in the table. The first set order can also be the order from left to right or from right to left in the row where the root index is located in the table. When the root indexes in the root index set are arranged in order, the first set order can be the order from front to back in the root index set or can be the order from back to front. The second set order is the same here and is not limited.

[0439] In one example, randomly select X root indexes from the root index set, where X is a positive integer.

[0440] In one example, select X root indexes in order from the root index set (which can be a set after sorting the root indexes). Such as from top to bottom, from bottom to top, from left to right, from front to back, etc.

[0441] In this embodiment, the final root indexes can also be selected from the root index set in multiple times. For example, first select X root indexes from the root index set, and then select Y root indexes from the X root indexes in the second set order. Each time of selecting root indexes can be selected in the set order. The orders used for the root indexes selected in different times can be the same or different.

[0442] In one example, randomly or orderly select X root indexes from the root index set. Then randomly or orderly select Y root indexes from the X root indexes.

[0443] Taking the selection from front to back as an example, obtain the root indexes in sequence from the ordered root index set. The order can be from front to back, that is, select according to the order of arrangement of the root indexes in the root index set.

[0444] The sorting method of each root sequence in the root sequence set is not limited. For example, for each root index, it 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 in descending order according to the number of ZC sequences they can generate. In this application, they can also be sorted in ascending order.

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

[0446] In one embodiment, the multiple root indexes in the root index set are obtained after being sorted according to a set sorting method, and the set sorting method includes:

[0447] Sort the root indexes in descending order according to the number of ZC sequences generated by the ZC root sequence corresponding to the root index. That is, sort the root indexes according to the number of ZC sequences x u,v (n) generated by the ZC root sequence corresponding to the root index u from more to less.

[0448] In this embodiment, the sorting method of the root indexes included in the root index set is described. In this embodiment, the root indexes included in the root index set can be sorted in descending order according to the number of ZC sequences that the ZC root sequences they correspond to can generate. For example, the ZC root sequence corresponding to the first root index in the root index set can generate the most ZC sequences, and the ZC root sequence corresponding to the second root index can generate the second most ZC sequences. And so on. The ZC root sequence corresponding to the last root index in the root index set can generate the fewest ZC sequences.

[0449] In one embodiment, the number of ZC sequences generated by the ZC root sequence corresponding to the root index is associated with the value of the cyclic shift interval. That is, the number of ZC sequences x u,v (n) that can be generated in a root sequence index u is associated with the value of the cyclic shift interval (Ncs).

[0450] In this embodiment, it is described that the number of ZC sequences that the ZC root sequence corresponding to the root index can generate is associated with 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. The corresponding relationship is not limited here.

[0451] Table 4L RA = 31, the correspondence table of the root index u and the cyclic shift interval N cs

[0452]

[0453]

[0454] ​In this application, the root index set includes multiple sorted root indexes. The sorting of the root indexes can be associated with the value of the cyclic shift interval (N cs ), that is, the value configuration of the zero correlation zone. For example, according to the magnitudes of the respective values corresponding to Ncs = 2 (i.e., the number of ZC sequences that can be generated), u is sorted to form the root index set. Among them, the meaning of the value 5 corresponding to Ncs = 2 can be that 5 ZC sequences can be generated. Another example is that according to the magnitudes of the values corresponding to N cs = 3, u is sorted to form the root index set.

[0455] When the multiple values corresponding to Ncs = 2 are the same, the values of u corresponding to this value can be sorted arbitrarily.

[0456] The sorting of the root indexes in the root index set can come from the sorting in the first column of Table 4. Selecting a root index from the root index set can be done by selecting the first X u values from the table.

[0457] The value of the cyclic shift interval Ncs can be 2, 4, 8, 14, 16, or 32.

[0458] In the case of determining the value of u and the value of Ncs, the root sequence corresponding to u can generate the number of available ZC sequences x u,v (n) corresponding to the value of Ncs. The number corresponding to the value of Ncs can be the value in the column where the value of the cyclic shift interval is located, which can represent the number of ZC sequences that can be generated. That is, in the case of determining the root index and the value of the cyclic shift interval, the root sequence x u (i) corresponding to the root index can generate the number of ZC sequences.

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

[0460] Among them, there are various methods for sorting u. It is arranged in descending order or ascending order according to the value of the cyclic shift interval. Thus, the sorting of u corresponding to the cyclic shift interval is achieved. Referring to Table 4, any column from the 2nd to the 7th column is sorted from large to small, and then the corresponding u is sorted together. Thus, the sorted u is obtained.

[0461] The following respectively describes the correspondence tables of the root index u and the cyclic shift interval N RA under different sequence lengths L cs of the corresponding relationship table.

[0462] Table 5 LRA When = 61, the correspondence table of the root index u and the cyclic shift interval N cs

[0463]

[0464]

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

[0466]

[0467]

[0468]

[0469]

[0470] The "-" in Table 6 can be flexibly configured, such as being flexibly configured by the base station. L RA When taking different values, the root index u can have a correspondence with the cyclic shift interval N in at least one column of the table cs

[0471] Through the information processing method provided by this application, better detection performance for LP-WUS / LP-SS / LP-Preamble can be provided, and a larger LP-WUS / LP-SS / LP-Preamble signal coverage range can be supported.

[0472] In an exemplary embodiment, this embodiment further provides an information processing method, Figure 5 which is a schematic flowchart of another information processing method provided by the embodiments of this application; this method can be applicable to the situation of determining the structure of low-power signals, this method can be executed by an information processing device, the information processing device can be implemented by software and / or hardware, and is integrated on a second communication node, and the second communication node can be a UE. For the content not detailed in this embodiment, reference can be made to the above embodiments, and details are not described here.

[0473] Such as Figure 5 shown, the information processing method provided by this application includes the following operations:

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

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

[0476] ​​​S520. Analyze the second type of information to obtain the first type of information, where the second type of information is obtained after the first type of information is processed by the first operation.

[0477] After obtaining the second type of information, this operation can analyze the second type of information to obtain the first type of information. The analysis process can be associated with the first operation used to generate the second type of information. Details are not elaborated here.

[0478] The information processing method provided in this embodiment can analyze and obtain the first type of information through the obtained second type of information. The first type of information may include information on low-power signals, realizing the transmission of information on the low-power signals of the determined structure.

[0479] Based on the above embodiment, a variant embodiment of the above embodiment is proposed. Here, it should be noted that for the sake of brief description, only the differences from the above embodiment are described in the variant embodiment.

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

[0481] Repeat each element in the first type of information R times to obtain the third type of information, and perform Manchester coding on each element in the third type of information, where R is an integer greater than 1;

[0482] Perform Manchester coding on each element in the first type of information;

[0483] Repeat the first type of information as a whole Z times to obtain the third type of information, and perform Manchester coding on each element in the third type of information, where Z is an integer greater than 1;

[0484] After performing Manchester coding on each element in the first type of information to obtain the third type of information, repeat each element in the third type of information;

[0485] After performing Manchester coding on each element in the first type of information to obtain the third type of information, repeat every L elements in the third type of information as a group, where L is the length of the Manchester coding;

[0486] After performing Manchester coding on each element in the first type of information to obtain the third type of information, repeat the third type of information as a whole Y times, where Y is an integer greater than 1.

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

[0488] 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;

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

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

[0491] Wake-up information;

[0492] Check information;

[0493] Padding information.

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

[0495] Repetition;

[0496] Scrambling;

[0497] Reed-Muller RM coding;

[0498] Interleaving;

[0499] Adding padding bits;

[0500] Adding check information;

[0501] Rate matching.

[0502] In one embodiment, when the second operation includes RM coding and rate matching, the information with the first length output after RM coding of the fourth type of information is output with the second length after rate matching.

[0503] In one embodiment, when the first operation includes a repetition operation, the length of the output information corresponding to RM coding in the second operation includes 28 or 32 or the maximum length among the coding lengths supported by RM coding.

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

[0505] An integer multiple of 2;

[0506] An integer multiple of 3;

[0507] An integer multiple of 4.

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

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

[0510] When the transmission mode is the second transmission mode, the length of the fourth type of information is an integer multiple of 3 or 2.

[0511] When the sending mode is the third sending mode, the length of the fourth type of information is an integer multiple of 2.

[0512] 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 output information of RM coding in the second operation of generating the first type of information are determined by one or more of the following:

[0513] System configuration;

[0514] Sending mode;

[0515] First quantity;

[0516] Second quantity;

[0517] Integer multiple of the third quantity;

[0518] Wherein, the first quantity includes one or more of the number of packets of the 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 sending mode is determined, and the sequence indicates the sub-information of the first type of information or the sub-information in the fourth type of information; the third quantity includes the number of bits of the sub-information of the first type of information or the sub-information in the fourth type of information carried by the sequence in the sequence set when the sending mode is determined.

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

[0520] When the sending mode is the first sending mode, the third quantity is an integer multiple of any one of 4, 3, and 2;

[0521] When the sending mode is the second sending mode, the third quantity is an integer multiple of 3 or 2;

[0522] When the sending mode is the third sending mode, the third quantity is an integer multiple of 2.

[0523] 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 the sub-information of the fourth type of information;

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

[0525] In one embodiment, the sequence is the Zadoff-Chu ZC sequence, and the length of the sequence includes at least one of 31, 61, and 131.

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

[0527] Select X root indexes from the root index set in a first set order;

[0528] After selecting X root indexes from the root index set, select Y root indexes from the X root indexes in a second set order.

[0529] In one embodiment, multiple root indexes in the root index set are obtained after being sorted in a set sorting manner, and the set sorting manner includes:

[0530] Sort the root indexes in the order from the largest to the smallest number of ZC sequences generated by the ZC root sequences corresponding to the root indexes. 16. The method according to claim 15, wherein the number of ZC sequences generated by the ZC root sequence corresponding to the root index is associated with the value of the cyclic shift interval.

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

[0532] An integer multiple of 2;

[0533] An integer multiple of 3;

[0534] An integer multiple of 4.

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

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

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

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

[0539] In one embodiment, the length of the output information of the RM coding in the second operation of generating the first type of information or the length of the output information after rate matching in the second operation of generating the first type of information satisfies one or more of the following:

[0540] An integer multiple of 2;

[0541] An integer multiple of 3;

[0542] An integer multiple of 4.

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

[0544] When M is 1, the length of the output information of RM coding in the second operation of generating the first type of information is an integer multiple of 4;

[0545] When M is 2, the length of the output information of RM coding in the second operation of generating the first type of information is an integer multiple of 3;

[0546] When M is 4, the length of the output information of RM coding in the second operation of generating the first type of information is an integer multiple of 2;

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

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

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

[0550] In an exemplary embodiment, the present application provides an information processing apparatus, which can be integrated in the first communication node. Figure 6 It is a schematic structural diagram of an information processing apparatus provided by an embodiment of the present application; the information processing apparatus includes:

[0551] A processing module 610, configured to process the first type of information through a first operation to obtain a second type of information, where the first operation includes at least an operation of performing encoding;

[0552] A sending module 620, configured to send the second type of information.

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

[0554] Based on the above embodiments, a variant embodiment of the above embodiments is proposed. It should be noted here that for the sake of brief description, only the differences from the above embodiments are described in the variant embodiment.

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

[0556] Each element in the first type of information is repeated R times to obtain the third type of information, and Manchester coding is performed on each element in the third type of information, where R is an integer greater than 1;

[0557] Manchester coding is performed on each element in the first type of information;

[0558] The first type of information is repeated Z times as a whole to obtain the third type of information, and Manchester coding is performed on each element in the third type of information, where Z is an integer greater than 1;

[0559] Manchester coding is performed on each element in the first type of information to obtain the third type of information, and each element in the third type of information is repeated;

[0560] Manchester coding is performed on each element in the first type of information to obtain the third type of information, and every L elements in the third type of information are grouped and repeated, where L is the length of the Manchester coding;

[0561] Manchester coding is performed on each element in the first type of information to obtain the third type of information, and the third type of information is repeated Y times as a whole, where Y is an integer greater than 1.

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

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

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

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

[0566] Wake-up information;

[0567] Check information;

[0568] Padding information.

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

[0570] Repeating;

[0571] Scrambling;

[0572] Reed-Muller RM coding;

[0573] Interleaving;

[0574] Adding padding bits;

[0575] Add check information;

[0576] Rate matching.

[0577] In one embodiment, when the second operation includes RM coding and rate matching, the information with the first length output after RM coding of the fourth type of information is output with the second length after rate matching; 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.

[0578] In one embodiment, when the first operation includes a repeated operation, the length of the output information corresponding to RM coding in the second operation includes 28 or 32 or the maximum length among the coding lengths supported by RM coding.

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

[0580] An integer multiple of 2;

[0581] An integer multiple of 3;

[0582] An integer multiple of 4.

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

[0584] When the sending mode is the first sending mode, the length of the fourth type of information is an integer multiple of any one of 4, 3, and 2;

[0585] When the sending mode is the second sending mode, the length of the fourth type of information is an integer multiple of 3 or 2;

[0586] When the sending mode is the third sending mode, the length of the fourth type of information is an integer multiple of 2.

[0587] 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 for generating the first type of information, and the length of the output information of RM coding in the second operation for generating the first type of information are determined by one or more of the following:

[0588] System configuration;

[0589] Sending mode;

[0590] First quantity;

[0591] Second quantity;

[0592] An integer multiple of the third quantity;

[0593] Wherein, the first quantity includes one or more of the quantity of packets including the identification information of the second communication node and the quantity of the identification information of the predetermined function; the second quantity includes the quantity of sequences in the sequence set when the transmission mode is determined, and 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 mode is determined.

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

[0595] When the transmission mode is the first transmission mode, the third quantity is an integer multiple of any one of 4, 3, and 2;

[0596] When the transmission mode is the second transmission mode, the third quantity is an integer multiple of 3 or 2;

[0597] When the transmission mode is the third transmission mode, the third quantity is an integer multiple of 2.

[0598] 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;

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

[0600] In one embodiment, the sequence is a Zadoff-Chu (ZC) sequence, and the length of the sequence includes at least one of 31, 61, and 131.

[0601] In one embodiment, the root index of the sequence is selected by one of the following methods:

[0602] Select X root indexes from the root index set in the first set order;

[0603] After selecting X root indexes from the root index set, select Y root indexes from the X root indexes in the second set order.

[0604] In one embodiment, a plurality of root indexes in the root index set are sorted according to a set sorting method, and the set sorting method includes:

[0605] Sort the root indexes in the order from the largest to the smallest number of ZC sequences generated by the ZC root sequences corresponding to the root indexes.

[0606] In one embodiment, the number of ZC sequences generated by the ZC root sequence corresponding to the root index is associated with the value of the cyclic shift interval.

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

[0608] An integer multiple of 2;

[0609] An integer multiple of 3;

[0610] An integer multiple of 4.

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

[0612] In one embodiment, when M is 2, the length of the first type of information is an integer multiple of 3;

[0613] In one embodiment, when M is 4, the length of the first type of information is an integer multiple of 2.

[0614] In one embodiment, the length of the output information of RM coding in the second operation of generating the first type of information or the length of the output information after rate matching in the second operation of generating the first type of information satisfies one or more of the following:

[0615] An integer multiple of 2;

[0616] An integer multiple of 3;

[0617] An integer multiple of 4.

[0618] In one embodiment, the information processing device satisfies at least one of the following:

[0619] In one embodiment, when M is 1, the length of the output information of RM coding in the second operation of generating the first type of information is an integer multiple of 4;

[0620] In one embodiment, when M is 2, the length of the output information of RM coding in the second operation of generating the first type of information is an integer multiple of 3;

[0621] In one embodiment, when M is 4, the length of the output information of RM coding in the second operation of generating the first type of information is an integer multiple of 2;

[0622] In one embodiment, when M is 1, the length of the output information after rate matching in the second operation of generating the first type of information is an integer multiple of 4;

[0623] In one embodiment, when M is 2, the length of the output information after rate matching in the second operation of generating the first type of information is an integer multiple of 3;

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

[0625] In an exemplary embodiment, the embodiments of the present application further provide an information processing device, which can be integrated in a second communication node. Figure 7 FIG. 5 is a schematic structural diagram of another information processing device provided by the embodiments of the present application. The information processing device includes:

[0626] An acquisition module 710, configured to acquire a second type of information;

[0627] An analysis module 720, configured to analyze the second type of information to obtain a first type of information, where the second type of information is obtained after the first type of information is processed by a first operation.

[0628] The information processing device provided in this embodiment is used to implement the information processing method of the embodiment as 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 of the embodiment as shown in Figure 5 The information processing method of the embodiment is not described herein again.

[0629] On the basis of the above embodiments, a variant embodiment of the above embodiments is proposed. Here, it should be noted that, for the sake of brief description, only the differences from the above embodiments are described in the variant embodiment.

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

[0631] Repeating each element in the first type of information R times to obtain a third type of information, and performing Manchester coding on each element in the third type of information, where R is an integer greater than 1;

[0632] Performing Manchester coding on each element in the first type of information;

[0633] Repeating the first type of information as a whole Z times to obtain a third type of information, and performing Manchester coding on each element in the third type of information, where Z is an integer greater than 1;

[0634] Performing Manchester coding on each element in the first type of information to obtain a third type of information, and repeating each element in the third type of information;

[0635] Performing Manchester coding on each element in the first type of information to obtain a third type of information, and repeating every L elements in the third type of information as a group, where L is the length of the Manchester coding;

[0636] After Manchester encoding each element in the first type of information, third type of information is obtained, and the third type of information is repeated Y times as a whole, where Y is an integer greater than 1.

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

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

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

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

[0641] Wake-up information;

[0642] Check information;

[0643] Padding information.

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

[0645] Repetition;

[0646] Scrambling;

[0647] Reed-Muller RM coding;

[0648] Interleaving;

[0649] Adding padding bits;

[0650] Adding check information;

[0651] Rate matching.

[0652] In one embodiment, when the second operation includes RM coding and rate matching, the information with a first length output after RM coding of the fourth type of information is output as information with a second length after rate matching.

[0653] In one embodiment, when the first operation includes a repetition operation, the length of the output information corresponding to RM coding in the second operation includes 28 or 32 or the maximum length among the coding lengths supported by RM coding.

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

[0655] An integer multiple of 2;

[0656] An integer multiple of 3;

[0657] An integer multiple of 4.

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

[0659] When the sending mode is the first sending mode, the length of the fourth type of information is an integer multiple of any one of 4, 3, and 2;

[0660] When the sending mode is the second sending mode, the length of the fourth type of information is an integer multiple of 3 or 2;

[0661] When the sending mode is the third sending mode, the length of the fourth type of information is an integer multiple of 2.

[0662] 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 output information of RM coding in the second operation of generating the first type of information are determined by one or more of the following:

[0663] System configuration;

[0664] Sending mode;

[0665] First quantity;

[0666] Second quantity;

[0667] An integer multiple of the third quantity;

[0668] Wherein, the first quantity includes one or more of the number of packets of the 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 sending mode is determined, and the sequence indicates the sub-information of the first type of information or the sub-information in the fourth type of information; the third quantity includes the number of bits of the sub-information of the first type of information or the sub-information in the fourth type of information carried by the sequence in the sequence set when the sending mode is determined.

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

[0670] When the sending mode is the first sending mode, the third quantity is an integer multiple of any one of 4, 3, and 2;

[0671] When the sending mode is the second sending mode, the third quantity is an integer multiple of 3 or 2;

[0672] When the sending mode is the third sending mode, the third quantity is an integer multiple of 2.

[0673] 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;

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

[0675] In one embodiment, the sequence is a Zadoff-Chu (ZC) sequence, and the length of the sequence includes at least one of 31, 61, and 131.

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

[0677] Select X root indexes from the root index set in a first set order;

[0678] After selecting X root indexes from the root index set, select Y root indexes from the X root indexes in a second set order.

[0679] In one embodiment, multiple root indexes in the root index set are obtained after being sorted in a set sorting manner, and the set sorting manner includes:

[0680] Sort the root indexes in descending order of the number of ZC sequences generated by the ZC root sequences corresponding to the root indexes.

[0681] In one embodiment, the number of ZC sequences generated by the ZC root sequence corresponding to the root index is associated with the value of the cyclic shift interval.

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

[0683] An integer multiple of 2;

[0684] An integer multiple of 3;

[0685] An integer multiple of 4.

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

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

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

[0689] In one embodiment, the length of the output information after RM coding in the second operation of generating the first type of information or the length of the output information after rate matching in the second operation of generating the first type of information satisfies one or more of the following:

[0690] An integer multiple of 2;

[0691] An integer multiple of 3;

[0692] An integer multiple of 4.

[0693] In one embodiment, the information processing device satisfies at least one of the following:

[0694] When M is 1, the length of the output information after RM coding in the second operation of generating the first type of information is an integer multiple of 4;

[0695] When M is 2, the length of the output information after RM coding in the second operation of generating the first type of information is an integer multiple of 3;

[0696] When M is 4, the length of the output information after RM coding in the second operation of generating the first type of information is an integer multiple of 2;

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

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

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

[0700] In an exemplary embodiment, the embodiments of the present application further provide a first communication node, Figure 8 is a schematic structural diagram of a first communication node provided by the embodiments of the present application; as Figure 8 shown, the first communication node provided by the present application includes one or more processors 81 and a storage device 82; the processor 81 in the first communication node can be one or more, Figure 8 here taking one processor 81 as an example; 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 embodiments of the present application.

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

[0702] The processor 81, storage device 82, communication device 83, input device 84, and output device 85 in the first communication node may be connected via a bus or other means. Figure 8 Taking connection via a bus as an example.

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

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

[0705] The storage device 82, as a computer-readable storage medium, can be configured to store software programs, computer-executable programs, and modules, such as the program instructions / modules corresponding to the information processing method described in the embodiments of the present application (for example, the processing module 610 and the sending module 620 in the information processing device). The storage device 82 may include a program storage area and a data storage area. Among them, the program storage area may store an operating system and application programs required for at least one function; the data storage area may store data created according to the use of the first communication node, etc. In addition, the storage device 82 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state storage devices. In some instances, the storage device 82 may further include a memory remotely provided with respect to the processor 81, and these remote memories may be connected to the first communication node through a network. Examples of the above network include but are not limited to the Internet, an enterprise intranet, a local area network, a mobile communication network, and combinations thereof.

[0706] In an exemplary embodiment, the embodiments of the present application further provide a second communication node. Figure 9 It is a schematic structural diagram of a second communication node provided by the embodiments of the present application. As Figure 9 shown, the second communication node provided by the present application includes one or more processors 91 and a storage device 92; the processor 91 in the second communication node may be one or more. Figure 9 Taking 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 described in the embodiments of the present application.

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

[0708] 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 Taking connection by bus as an example.

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

[0710] The communication device 93 can include a receiver and a transmitter. The communication device 93 is configured to perform information transceiver communication under the control of the processor 91.

[0711] The storage device 92, as a computer-readable storage medium, can be configured to store software programs, computer-executable programs, and modules, such as the program instructions / modules corresponding to the information processing method described in the embodiments of the present application (for example, the acquisition module 710 and the parsing module 720 in the information processing device). The storage device 92 can include a program storage area and a data storage area. Among them, the program storage area can store an operating system and application programs required for at least one function; the data storage area can store data created according to the use of the second communication node, etc. In addition, the storage device 92 can include a high-speed random access memory, and can also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state storage devices. In some instances, the storage device 92 can further include a memory remotely set relative to the processor 91, and these remote memories can be connected to the second communication node through a network. Examples of the above network include but are not limited to the Internet, an enterprise intranet, a local area network, a mobile communication network, and combinations thereof.

[0712] In an exemplary embodiment, the embodiments of the present application further provide a storage medium storing a computer program, where the computer program, when executed by a processor, implements any of the methods described in the present application. The storage medium stores a computer program, and the computer program, when executed by a processor, implements any of the information processing methods described in the embodiments of the present application. Such as the information processing method applied to the first communication node and the information processing method applied to the second communication node. Among them, the information processing method applied to the first communication node includes: performing a first operation on the first type of information to obtain the second type of information, and the first operation includes at least an operation of encoding;

[0713] Sending the second type of information.

[0714] The information processing method applied to the second communication node includes: obtaining the second type of information;

[0715] Analyze the second type of information to obtain the first type of information, where the second type of information is obtained after the first type of information is processed by a first operation.

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

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

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

[0719] Computer program code for performing the operations of this application can be written in one or more programming languages or combinations thereof. The programming languages include object-oriented programming languages such as Java, Smalltalk, C++, and also include conventional procedural programming languages such as the "C" language or similar programming languages. The program code can be executed entirely on the user's computer, partially on the user's computer, executed as a stand-alone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In the case of a remote computer, the remote computer can be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (e.g., by connecting through the Internet using an Internet service provider).

[0720] As described above, the above are only exemplary embodiments of this application and are not used to limit the protection scope of this application.

[0721] Those skilled in the art should understand that the term terminal device covers any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable network browser, or a vehicle-mounted mobile station.

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

[0723] Embodiments of this application can be implemented by a data processor of a mobile device executing computer program instructions, such as in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions can be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-related instructions, microcode, firmware instructions, status setting data, or source code or object code written in any combination of one or more programming languages.

[0724] Any block diagram of a logical process in the drawings of this application may represent program steps, or may represent interconnected logical circuits, modules, and functions, or may represent a combination of program steps and logical circuits, modules, and functions. A computer program may be stored on a memory. The memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as but not limited to Read-Only Memory (ROM), Random Access Memory (RAM), optical memory devices and systems (Digital Video Disc (DVD) or Compact Disk (CD)), etc. A computer-readable medium may include a non-transitory storage medium. The data processor may be of any type suitable for the local technical environment, such as but not limited to general-purpose computers, special-purpose computers, microprocessors, Digital Signal Processing (DSP), Application Specific Integrated Circuit (ASIC), Field-Programmable Gate Array (FGPA), and processors based on multi-core processor architectures.

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

Claims

1. An information processing method, characterized in that, Applied to a first communication node, the method includes: Processing first type of information through a first operation to obtain second type of information, where the first operation includes at least an operation of encoding; Transmitting the second type of information.

2. The method according to claim 1, characterized in that, The first operation includes one of the following: Repeating each element in the first type of information R times to obtain a third type of information, and performing Manchester encoding on each element in the third type of information, where R is an integer greater than 1; Performing Manchester encoding on each element in the first type of information; Repeating the first type of information as a whole Z times to obtain a third type of information, and performing Manchester encoding on each element in the third type of information, where Z is an integer greater than 1; Performing Manchester encoding on each element in the first type of information to obtain a third type of information, and repeating each element in the third type of information; Performing Manchester encoding on each element in the first type of information to obtain a third type of information, and repeating every L elements in the third type of information as a group, where L is the length of Manchester encoding; Performing Manchester encoding on each element in the first type of information to obtain a third type of information, and repeating the third type of information as a whole Y times, where Y is an integer greater than 1.

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

4. The method according to claim 3, wherein When the symbol is an on-off keying symbol or a multi-carrier on-off keying symbol, the number of symbols is M; When the 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 a fourth type of information through a second operation, and the fourth type of information includes one or more of the following: Wake-up information; Check information; Padding information.

6. The method according to claim 5, characterized in that, The second operation includes one or more of the following: Repeating; Scrambling; Reed-Muller RM encoding; Interleaving; Adding padding bits; Adding check information; Rate matching.

7. The method according to claim 6, characterized in that When the second operation includes RM encoding and rate matching, the information with a first length output after RM encoding of the fourth type of information is rate-matched to output information with a second length.

8. The method according to claim 5, wherein When the first operation includes an operation of repeating, the length of the output information corresponding to 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, characterized in that, 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 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 are determined by one or more of the following: System configuration; Transmission mode; First quantity; Second quantity; An integer multiple of the third quantity; Wherein, the first quantity includes one or more of the quantity of packets including the identification information of the second communication node and the quantity of the identification information of the predetermined function; the second quantity includes the quantity of sequences in the sequence set when the transmission mode is determined, and 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 the sub-information of the first type of information or the sub-information of the fourth type of information carried by the sequences in the sequence set when the transmission mode is determined.

10. The method according to claim 9, characterized in that, Meet at least one of the following: When the transmission mode is the first transmission mode, the third quantity is an integer multiple of any one of 4, 3, and 2; When the transmission mode is the second transmission mode, the third quantity is an integer multiple of 3 or 2; When the transmission mode is the third transmission mode, 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 quantity or the third quantity, the sequence indicates the sub-information of the fourth type of information; When the quotient of the length of the fourth type of information and the second quantity or the third quantity is a non-integer, the sequence indicates the sub-information of the first type of information.

12. The method according to claim 9, characterized in that, The sequence is a Zadoff-Chu (ZC) sequence, and the length of the sequence includes at least one of 31, 61, and 131.

13. The method according to claim 9, characterized in that, The root index of the sequence is selected in one of the following ways: Select X root indexes from the root index set in the first set order; After selecting X root indexes from the root index set, select Y root indexes from the X root indexes in the second set order.

14. The method according to claim 13, wherein The multiple root indexes in the root index set are sorted according to the set sorting method, and the set sorting method includes: Sort the root indexes in the order from the largest to the smallest number of ZC sequences generated by the ZC root sequences corresponding to the root indexes.

15. The method according to claim 14, wherein The number of ZC sequences generated by the ZC root sequences corresponding to the root indexes is associated with the value of the cyclic shift interval.

16. An information processing method, characterized in that, Applied to the second communication node, the method includes: Obtain the second type of information; Parse the second type of information to obtain the first type of information, and the second type of information is obtained after the first type of information is processed by the first operation.

17. A first communication node, characterized in that, Including: One or more processors; A storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to any one of claims 1-15.

18. A second communication node, characterized in that, Including: One or more processors; A storage device for storing one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the method according to claim 16.

19. A storage medium, characterized in that, The storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1-16 is implemented.

20. A computer program product includes a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1-16 is implemented.

Images