Information processing method, electronic equipment, storage medium and program product

Abstract

The embodiment of the invention provides an information processing method, electronic equipment, a storage medium and a program product, and the method comprises the steps: generating target information according to first information and specified operation; according to the embodiment of the invention, the problem of determining various signals under an existing low-power-consumption wake-up signal mechanism can be solved, the number of connections can be increased in a scene with large equipment density, the system complexity can be improved, and the system power consumption can be reduced.

Description

Technical Field

[0001] The present application relates to the field of wireless communication technologies, and in particular, to an information processing method, an electronic device, 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 user equipment (UE) is also crucial. Currently, 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. How to provide longer battery life, reduce energy consumption, and improve the user experience has become an urgent problem to be solved.

[0003] 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, it is expected to use an extended discontinuous reception (eDRX) cycle with a higher value, which results in high latency and is not suitable for such services that require both battery life and low latency. Currently, existing communication protocols have introduced a low-power wake-up signal (LP-WUS) mechanism. The low-power wake-up mechanism involves a low-power wake-up signal, 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 an on-off keying (OOK) adjustment method, which is called an OOK-based LP-WUS. Currently, the structures of the low-power wake-up signal, the low-power synchronization signal, and the low-power preamble, as well as the sequence information carried, have not been determined. Therefore, how to conduct research under the new IoT technology to meet the scenarios with a large number of existing connections and / or high device density, and reduce the system complexity and system power consumption. Summary of the Invention

[0004] Embodiments of the present application aim to provide an information processing method, an electronic device, a storage medium, and a program product to solve the problem of determining various signals under the existing low-power wake-up signal mechanism, increase the number of connections in a scenario with a large device density, improve the system complexity, and reduce the system power consumption.

[0005] An embodiment of the present application provides an information processing method, which includes:

[0006] Generating target information according to the first information by performing a specified operation.

[0007] An embodiment of the present application provides another electronic device, which includes:

[0008] One or more processors;

[0009] A memory for storing one or more programs;

[0010] When the one or more programs are executed by the one or more processors, the one or more processors implement the information processing method as described in any one of the embodiments of the present application.

[0011] An embodiment of the present application further provides a computer-readable storage medium, which stores one or more programs, and the one or more programs are executed by one or more processors to implement the information processing method as described in any one of the embodiments of the present application.

[0012] An embodiment of the present application further provides a computer program product, which includes a computer program, and the computer program implements the information processing method as described in any one of the embodiments of the present application when executed by a processor.

[0013] It should be understood that the content described in this part is not intended to identify the key or important features of the embodiments of the present application, nor is it used to limit the scope of the present application. Other features of the present application will become easily understood through the following description. Description of the Drawings

[0014] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for the description of the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present application, and those of ordinary skill in the art can obtain other drawings without creative efforts based on these drawings.

[0015] Figure 1 It is an example diagram of generating an MC-OOK based LP-WUS provided by an embodiment of the present application;

[0016] Figure 2 It is another example diagram of generating an MC-OOK based LP-WUS provided by an embodiment of the present application;

[0017] Figure 3It is an example diagram of another MC-OOK based LP-WUS generation provided by an embodiment of this application;

[0018] Figure 4 It is a flowchart of an information processing method provided by an embodiment of this application;

[0019] Figure 5 It is an example diagram of an OFDM symbol carried in an OOK symbol for transmission provided by an embodiment of this application;

[0020] Figure 6 It is an example diagram of a third piece of information being repeatedly transmitted provided by an embodiment of this application;

[0021] Figure 7 It is another example diagram of a third piece of information being repeatedly transmitted provided by an embodiment of this application;

[0022] Figure 8 It is a schematic structural diagram of an information processing device provided by an embodiment of this application;

[0023] Figure 9 It is a schematic structural diagram of an electronic device provided by an embodiment of this application. Detailed implementation manners

[0024] It should be understood that the specific implementation described herein is only for explaining this application and is not used to limit this application.

[0025] In subsequent descriptions, suffixes such as "module", "component", or "unit" used to represent elements are only for the convenience of explaining this application, and they have no specific meaning in themselves. Therefore, "module", "component", or "unit" can be used interchangeably.

[0026] In an embodiment of this application, the role of LP-WUS is to carry low-power wake-up information.

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

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

[0029] In some application embodiments, the transmission of the LP-Preamble is located before the LP-WUS. The terminal performs downlink synchronization and / or frequency domain correction by detecting the LP-Preamble, thereby improving the detection performance of the terminal for detecting the LP-WUS.

[0030] The waveforms of the above LP-WUS / LP-SS / LP-Preamble signals can be generated by the OOK adjustment method to become OOK-based LP-WUS / LP-SS / LP-Preamble. In addition, in the application embodiments of the present application, the above signals can also be carried by multiple subcarriers. That is, when the number of subcarriers occupied by the OOK-based LP-WUS / LP-SS / LP-Preamble in the frequency domain is greater than 1, it is called multiple subcarrier (MC)-OOK-based LP-WUS / LP-SS / LP-Preamble.

[0031] In some application embodiments, the generation method of the MC-OOK-based LP-WUS may include Method 1. Refer to Figure 1 The time-domain expression forms of M MC-OOK-based LP-WUS symbols can be generated, where M is greater than or equal to 1. The generation process of the MC-OOK-based LP-WUS may include the following steps:

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

[0033] Step 2: Convert the data information S M into data information Q K , where the length of Q K is K, and K is greater than or equal to 1.

[0034]

[0035] Or

[0036]

[0037] Where A0 + A1 + … A i + … + A M-1 = K.

[0038] Among them, the value of the data can be configured, where 0 ≤ i ≤ M - 1.

[0039] Step 3: The data information QK The data information D is obtained through the DFT / FFT operation at point K K = [d0, d1, d2, d3,..., d K-1 ;

[0040] Furthermore, at least one of the following operations can be performed on D K :

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

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

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

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

[0045] Execute the FFTSHIFT operation on D K . Here, 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

[0046] 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 pointsN = [t0, t1, t2, t3, ..., t N-1 . Where N is greater than or equal to 1.

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

[0048] Where [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.

[0049] 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 N subcarriers:

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

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

[0052] Perform a left circular shift operation on the data, and the size of the circular shift is Or Or N / 2. Where is the ceiling operator, is the floor operator;

[0053] Perform a right circular shift operation on the data, and the size of the circular shift is Or Or N / 2. Where is the ceiling operator, is the floor operator;

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

[0055] Step 5: Time-domain data T of N sampling points N =[t0,t1,t2,t3,...,t N-1 Before transmission, it is also necessary to perform the operation of adding a cyclic prefix (CP), that is, copy the information of the last N N sampling points at the tail of the time-domain data T of N cp sampling points to the head of the time-domain data T of N N sampling points to form time-domain data of (N + N cp ) sampling points, and then transmit the data of these (N + N cp ) sampling points.

[0056] In some other application embodiments, 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, then Step 4 can be replaced by:

[0057] Step 4.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 ;

[0058] Furthermore, on the basis of the above application embodiments, at least one of the following operations can be performed on E K1 :

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

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

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

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

[0063] Perform the FFTSHIFT operation on E K1 . Wherein, 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.

[0064] Step 4.2: Fill the data information E K1 onto K1 subcarriers in the frequency domain;

[0065] Step 4.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 N = [t0, t1, t2, t3,..., t N-1 . Wherein, N is greater than or equal to 1.

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

[0067] Wherein, [t0, t1, t2, t3,..., t N / M-1 is the sampled 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 sampled 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 sampled point data of the Mth OOK time-domain symbol among M OOK time-domain symbols.

[0068] 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 N subcarriers:

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

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

[0071] Perform a cyclic shift operation to the left on the data, and the size of the cyclic shift is Or Or N / 2. Wherein, is the ceiling operator, is the floor operator;

[0072] Perform a cyclic shift operation to the right on the data, and the size of the cyclic shift is Or Or N / 2. Wherein, is the ceiling operator, is the floor operator;

[0073] Perform the FFTSHIFT operation on the data, 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. The time-domain expression form of M MC-OOK based LP-WUS symbols is as Figure 2 shown.

[0074] In some application embodiments, the MC-OOK based LP-WUS generation method can include Method 2, see Figure 3, the time-domain expression of generating M MC-OOK based LP-WUS symbols provided by the embodiment of the present application, where M is greater than or equal to 1. The generation process of the second method may include the following steps:

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

[0076] Step 2: Generate data information according to the following formula from S M

[0077]

[0078] Or

[0079]

[0080] Among them, Among them, is an integer greater than or equal to 1.

[0081] Further, The value of is preferably N. Among them, N is the number of subcarriers included in the system bandwidth.

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

[0083] Step 3: Pass the data information through the first processing module to obtain the data information D K = [d0, d1, d2, d3,..., d K-1 T .

[0084] Among them, the first processing module includes at least one of the following operations:

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

[0086]

[0087] 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) HFor the operation of finding the conjugate transpose matrix of matrix X, (X) T For the operation of finding the transpose matrix of matrix X.

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

[0089] Among them, the expression of the IDFT Matrix is

[0090]

[0091] Or

[0092]

[0093] Furthermore, the positions of the K column elements in the IDFT Matrix that make up F among the column elements in the IDFT Matrix are determined by at least the data information D K filled into K subcarrier positions or subcarrier indices in the frequency domain.

[0094] (2) Perform at least one of the following operations on D K During the following operations:

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

[0096] Perform a downward circular shift operation on D K The size of the circular shift is Or K / 2. Among them, is the ceiling operator, is the floor operator;

[0097] Perform a left circular shift operation on D K The size of the circular shift is Or K / 2. Among them, is the ceiling operator, is the floor operator;

[0098] Perform a right circular shift operation on D K The size of the circular shift is Or K / 2. Among them, is the ceiling operator, is the floor operator;

[0099] Perform on DK 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 vector X, FFTSHIFT(X) exchanges the left and right halves of X or exchanges the upper and lower halves of X. For matrix X, FFTSHIFT(X) exchanges the first and third quadrants, and the second and fourth quadrants.

[0100] 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 . Where N is greater than or equal to 1.

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

[0102] Among them, [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.

[0103] Step 5: The time-domain data T of N sampling points N = [t0, t1, t2, t3,..., t N-1 also needs to perform the 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 the data of these (N + N cp ) sampling points.

[0104] In some other application embodiments, 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:

[0105] Step 4.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 ;

[0106] Step 4.2: Fill the data information E K1 onto K1 subcarriers in the frequency domain;

[0107] Step 4.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 N =[t0, t1, t2, t3,..., t N-1 . Where N is greater than or equal to 1.

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

[0109] 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, is the sampled point data of the Mth OOK time-domain symbol among M OOK time-domain symbols.

[0110] Based on the above method 1 and method 2, the data information S M can also be processed in the following manner to obtain the data information Q K or the data information

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

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

[0113] Exemplarily, Es i can satisfy at least one of the following formulas:

[0114]

[0115] where x i = 0 or x i = s i , y i = 0 or y i = s i .

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

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

[0118] The length of Q K is K, and K is greater than or equal to 1.

[0119] Exemplarily, K can be the number of subcarriers occupied by LP - WUS / LP - SS / LP - Preamble in the frequency domain.

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

[0121] The length of where is an integer greater than or equal to 1. Exemplarily, the value of

[0122] can be N. Where N is the number of subcarriers included in the system bandwidth. M , S M includes M elements, namely S MThe length is M, denoted as S M = [s0, s1, s2, s3..., s M-1 .

[0123] Step 1: Generate Es M from the elements s i in S i .

[0124] Exemplarily, Es i can satisfy at least one of the following formulas:

[0125]

[0126]

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

[0128] or is C elements in i , for example can be the first C elements in i , 0 ≤ c i ≤ C i - 1.

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

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

[0131] (1) A sequence of length

[0132] (2) A sequence of length is the first elements in or 0 elements or padding elements, wherein, the padding element can be any predefined element.

[0133] (3) The sequence with a length of is the last elements in or zero elements or

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

[0135] In some embodiments, the data can be a combination of the above sequences. For example

[0136]

[0137] 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 ≤ a ≤ A i -1, and can be multiplied and / or divided and / or added and / or subtracted by an element.

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

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

[0140] Q K has a length of 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.

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

[0142] The length of wherein, is an integer greater than or equal to 1. Exemplarily, can take the value of N. Wherein, N is the number of sub - carriers included in the system bandwidth.

[0143] Embodiments of the present application provide an information processing method. Embodiments of the present application are applicable to cases where LP - WUS / LP - SS / LP - Preamble signals and other carrier sequence information are involved. This method can be executed by an information processing device. The method provided by embodiments of the present application specifically includes the following steps:

[0144] Step 110: Generate target information according to the first information according to a specified operation.

[0145] Wherein, the first information can be sequence information of length N, N is an integer greater than or equal to 1, and the first information can be expressed as b0, b1, …, b N-1 , the first information can include UE indication information, UE group indication information, padding information, etc. The specified operation can be a processing operation for generating target information. The specified operation can include a first operation for generating the second information, and / or a second operation for generating the third information. The first operation can include at least one of repetition, scrambling, first encoding, second encoding, adding padding bits, adding check information, and rate matching. The second operation can include at least one of scrambling, adding padding bits, and adding check information. The target information can include the second information and / or the third information. The second information and the third information can be information to be transmitted, and the second information and the third information can be sequence information with the same or different sequence lengths.

[0146] In embodiments of the present application, target information can be generated according to the first information according to a specified operation. This process can include, but is not limited to, generating the second information according to the first information according to the first operation, and / or generating the third information according to the first information according to the second operation.

[0147] In some embodiments of the application, generating target information according to the first information according to a specified operation includes:

[0148] Generating the second information according to the first information according to the first operation, wherein the second information is sent in the first type of symbols of the first quantity.

[0149] In other embodiments of the application, generating target information according to the first information according to a specified operation includes:

[0150] Generating the third information according to the first information according to the second operation, wherein the third information is sent in the first type of symbols of the second quantity.

[0151] Figure 4 It is a flowchart of an information processing method provided by an embodiment of the present application. The embodiment of the present application is applicable to cases where sequence information is carried, such as LP-WUS / LP-SS / LP-Preamble signals. This method can be executed by an information processing device. Refer to Figure 4 The method provided by the embodiment of the present application specifically includes the following steps:

[0152] Step 110: Generate second information according to the first information according to a first operation, where the second information is sent in a first number of first-type symbols.

[0153] Among them, the first information can be denoted as b0, b1, …, b N-1 , the length of the first information is N, where N is an integer greater than or equal to 1. The first information may include at least one of the following: indication information of the UE, indication information of the UE group, or padding information, etc. The UE or UE group corresponding to the above indication information may be the UE or UE group that needs to perform a wake-up operation. In wireless communication, the size and format of the transmitted information must conform to specific standards. The information of this 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 to make the size of the information to be transmitted meet the requirements of the information block. The padding information may be specific characters or binary data.

[0154] In some embodiments of the application, the first operation may be a processing operation for generating second information according to the first information. This processing operation may include, but is not limited to, repetition, scrambling, first encoding, second encoding, adding padding bits, adding check information, rate matching, etc.

[0155] In some embodiments of the application, when the first information is greater than 2 bits, the first operation includes at least one of the following:

[0156] The first operation includes first encoding;

[0157] The first operation includes first encoding and rate matching;

[0158] The first operation includes first encoding and repetition, where the repetition is an operation of repeating the output information after the first encoding;

[0159] The first operation includes first encoding, rate matching and repetition, where the repetition is an operation of repeating the output information after "first encoding" and "rate matching".

[0160] In some embodiments of the application, the first encoding is a Reed-Muller (RM) code.

[0161] In some other application embodiments, when the first information is 2 bits, the first operation includes at least one of the following:

[0162] The first operation includes second encoding;

[0163] The first operation includes second encoding and rate matching;

[0164] The first operation includes second encoding and repetition, where the repetition can be an operation on the output information after the second encoding;

[0165] The first operation includes second encoding, rate matching and repetition, where the repetition can be an operation on the output information after "second encoding" and "rate matching".

[0166] In some other application embodiments, when the first information is 1 bit, the first operation includes repetition.

[0167] In an exemplary embodiment, when the input information is c0, c1, c2,..., c K-1 When the length is K, 3 ≤ K ≤ 11, the output information after the first encoding can be d0, d1, d2,..., d N-1 , with a length of N, and the output information d0, d1, d2,..., d N-1 can be obtained by the following method:

[0168]

[0169] where i = 0, 1,..., N - 1, N = 32. The value of M i,k is selected from the following table:

[0170] Table 1 Values of M i,k Values

[0171]

[0172]

[0173] In some other application embodiments, when the length of the input information c0, c1 is 2, the output information after the second encoding is d0, d1, d2, where d0, d1, d2 = c0, c1, c2, and c2 = (c0 + c1) mod 2.

[0174] In some application embodiments, the implementation method of rate matching includes:

[0175] The input information of the rate matching operation is d0, d1, d2,..., d N-1 , with a length of N, where N is an integer greater than or equal to 1. The output information after the rate matching operation is f0, f1, f2,... fE-1 , where E is the length of the output messages f0, f1, f2, ..., f E-1 . The output messages f0, f1, f2, ..., f E-1 are obtained as follows:

[0176] for k = 0 to E - 1

[0177] f k = d k mod N ;

[0178] end for

[0179] That is, each element f in the output messages k is determined by the (k mod N)-th element in the input messages, where k ranges from 0 to E - 1.

[0180] Step 120: Generate a third message according to the first message by a second operation, where the third message is sent in the first type of symbols of a second quantity.

[0181] In some application embodiments, the second quantity is less than or equal to the first quantity.

[0182] In the embodiments of the present application, the second operation includes at least one of the following: scrambling, adding padding bits, adding check information.

[0183] In some application embodiments, the second operation at least includes adding padding bits.

[0184] Based on the above application embodiments, the ways of adding padding bits include at least one of the following:

[0185] Way 1: d0, d1, d2, ..., d N-1 = p0, p1, …, p X-1 , c0, c1, c2, ..., c K-1 ;

[0186] where c0, c1, c2, ..., c K-1 is the first message; d0, d1, d2, ..., d N-1 is the output message after adding padding bits, that is, the third message, and p0, p1, …, p X-1 is the padding bit information.

[0187] Way 2: d0, d1, d2, ..., d N-1 = c0, c1, c2, ..., c K-1 p0, p1, …, p Y-1 ;

[0188] Among them, c0, c1, c2, ..., c K-1 is the first information, d0, d1, d2, ..., d N-1 is the output information after adding padding bit information, that is, the third information, p0, p1, …, p X-1 is the padding bit information.

[0189] Method 3: d0, d1, d2, ..., d N-1 = p0, p1, …, p X -1, c0, c1, c2, ..., c K-1 p0, p1, …, p Y-1 ;

[0190] Among them, c0, c1, c2, ..., c K-1 is the first information; d0, d1, d2, ..., d N-1 is the output information after adding padding bits, that is, the third information, p0, p1, …, p X-1 is the padding bit information.

[0191] Based on the above application embodiments, the output information generated by rate matching in the first operation includes f0, f1, f2, ..., f E-1 , where E is the length of the output information, and the value of E includes at least one of the following:

[0192] The value of E is between [3, 64];

[0193] The value of E is between [4, 64];

[0194] The value of E is between [3, 32];

[0195] The value of E is between [4, 32];

[0196] The value of E is an integer multiple of 3;

[0197] The value of E is an integer multiple of 4;

[0198] The value of E is an integer multiple of 5;

[0199] The value of E is an integer multiple of 6;

[0200] For different first information, the minimum Hamming distance among f0, f1, f2, ..., f E-1 with length E is greater than or equal to the first threshold TH1,

[0201] For different first information, the minimum Hamming distance among f0, f1, f2, ..., f E-1The minimum Hamming distance ratio is greater than or equal to a second threshold TH2, where the value of the second threshold TH2 can preferably be in the range of [0.4, 0.5].

[0202] In the embodiments of the present application, the first operation may at least include rate matching. The output information after rate matching processing includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the length of the output information may include at least one of the following:

[0203] Between [3, 64], between [4, 64], between [3, 32], between [4, 32], an integer multiple of 3, an integer multiple of 4, an integer multiple of 5, and an integer multiple of 6, etc.

[0204] Specifically, for the output information f0, f1, f2,..., f with different lengths E of the first information E-1 , the minimum Hamming distance in f0, f1, f2,..., f E-1 of this output information is greater than or equal to a first threshold TH1, or the minimum Hamming distance ratio in f0, f1, f2,..., f E-1 of this output information is greater than or equal to a second threshold TH2. The values of the first threshold TH1 or the second threshold TH2 can be configured by the system or take default values respectively.

[0205] It can be understood that in the embodiments of the present application, the first operation for processing the first information is not limited to rate matching, and may also include other operations. The examples of the first operation are only for illustration and are not restrictive.

[0206] Based on the above embodiments of the application, the length of the first information is 2, and the output information generated by rate matching in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the value of E includes at least one of the following:

[0207] The value of E is between [3, 64];

[0208] The value of E is between [4, 64];

[0209] The value of E is between [3, 32];

[0210] The value of E is between [4, 32];

[0211] The value of E is an integer multiple of 3;

[0212] The value of E is an integer multiple of 6.

[0213] In an embodiment of the present application, when the length of the first information is 2, the output information generated by rate matching processing included in the first operation is f0, f1, f2,..., f E-1 , and the length of the output information f0, f1, f2,..., f E-1 is E, and the value of E may include at least one of the following: an integer multiple of 3, an integer multiple of 6, between [3, 64], between [4, 64], between [3, 32], between [4, 32], etc.

[0214] In some other embodiments of the application, the length of the first information is K, and the value of K is greater than 2. The output information generated by rate matching in the first operation includes f0, f1, f2,..., f E-1 , where the value of E includes at least one of the following:

[0215] The value of E is between [3, 64];

[0216] The value of E is between [4, 64];

[0217] The value of E is between [3, 32];

[0218] The value of E is between [4, 32];

[0219] The value of E is an integer multiple of the value of K.

[0220] Specifically, the length of the first information is K, and K is an integer greater than 2. The output information generated by rate matching in the first operation is f0, f1, f2,..., f E-1 , and the value of E is an integer multiple of the value of K, that is, the length E of the output information is an integer multiple of the length K of the first information, or between [3, 64], between [4, 64], between [3, 32], between [4, 32], etc.

[0221] In an exemplary embodiment, when K takes different values, the value range of E may change based on the value of K. The specific correspondence between the value of K and the value of E is shown in the following table:

[0222] K E 3 [6,12,24,48,64] 4 [8,16,32,64] 5 [10,20,40,64]

[0223] When K = 3, the value of E may be one of 6, 12, 24, 48, 64; when K = 4, the value of E may be one of 8, 16, 32, and 64; when K = 5, the value of E may be one of 10, 20, 40, and 64.

[0224] In some other application embodiments, the number of repetitions in the first operation is R, the length of the first information is K, and K is greater than 2. The output information generated through the first encoding and rate matching in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the value of E includes: E = K * R.

[0225] In the embodiments of the present application, the first operation may at least include repetition, first encoding, and rate matching. The output information after the first encoding and rate matching in the first operation is f0, f1, f2,..., f E-1 , where E is the length of the output information. The value of E can be determined by the length K of the first information and the repetition times R corresponding to the repetition, E = K * R. That is, the length E of the output information after the first encoding and rate matching in the first operation is the product of the repetition times R and the length K of the first information.

[0226] In some other application embodiments, the length of the first information is K, and K is greater than 2. The output information generated through the first encoding and rate matching in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the value of E includes: E = K * R, where R is an integer greater than or equal to 1.

[0227] In the embodiments of the present application, the length of the first information is K. The output information after the first encoding and rate matching of the first information in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, E = K * R, and R is an integer greater than or equal to 1.

[0228] Based on the above application embodiments, the value of E further includes 32 and / or 64.

[0229] In some other application embodiments, the output information generated through the rate matching in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the value of E includes at least one of the following:

[0230] 5, 6, 7, 9, 11, 14, 15, 19, 20, 23, 25, 26, 27, 29, 30, 31, 32, 38, 39, 41, 43, 46, 47, 51, 52, 55, 57, 58, 59, 61, 62, 63, and 64.

[0231] In an exemplary embodiment, the first information is K = 5, and the first information c0, c1, c2,..., c K-1The output information after the first encoding is d0, d1, d2,..., d N-1 , where N = 32, d0, d1, d2,..., d N-1 The output information after rate matching is f0, f1, f2,..., f E-1 , and the value of E is in the range of [3, 64].

[0232] In the embodiment of the present application, the first information c0, c1, c2,..., c K-1 has different corresponding values of f0, f1, f2,..., f E-1 . Tables 2 and 3 respectively give the different f0, f1, f2,..., f K-1 corresponding to different first information c0, c1, c2,..., c E-1 and the minimum Hamming distance between them.

[0233] To ensure the detection performance of the first information c0, c1, c2,..., c K-1 , the preferred value of the length E of f0, f1, f2,..., f E-1 is the value of E when the minimum Hamming distance corresponding to f0, f1, f2,..., f E-1 is greater than or equal to the threshold TH.

[0234] Table 2 Examples of the minimum Hamming distance between f0, f1, f2,..., f E-1 corresponding to the first information of different lengths

[0235]

[0236] Table 3 Examples of the minimum Hamming distance between f0, f1, f2,..., f E-1 corresponding to the first information of different lengths

[0237]

[0238] In another exemplary embodiment, the first information is c0, c1, c2,..., c K-1 , K = 5, and the output information of the first information c0, c1, c2,..., c K-1 after the first encoding is d0, d1, d2,..., d N-1 , where N = 32, d0, d1, d2,..., d N-1 The output information after rate matching is f0, f1, f2,..., f E-1 , and the value of E is in the range of [3, 64].

[0239] In the embodiments of the present application, the first information c0, c1, c2,..., c K-1 with different values corresponds to different f0, f1, f2,..., f E-1 . Table 4 and Table 5 respectively give the minimum Hamming distance ratios between different f0, f1, f2,..., f K-1 corresponding to different first information c0, c1, c2,..., c E-1 , where the minimum Hamming distance ratio = minimum Hamming distance / E.

[0240] To ensure the detection performance of the first information c0, c1, c2,..., c K-1 , the preferred value of the length E of f0, f1, f2,..., f E-1 is the value of E when the corresponding minimum Hamming distance ratio of f0, f1, f2,..., f E-1 is greater than or equal to TH.

[0241] Table 4 Examples of the minimum Hamming distance ratios between f0, f1, f2,..., f E-1 corresponding to the first information of different lengths

[0242]

[0243]

[0244] Table 5 Examples of the minimum Hamming distance ratios between f0, f1, f2,..., f E-1 corresponding to the first information of different lengths

[0245]

[0246] In some embodiments of the application, the first information c0, c1, c2,..., c K-1 = 00001. When E = 8, the second information f0, f1, f2,..., f E-1 = 00000111.

[0247] Furthermore, each bit f E-1 of f0, f1, f2,..., f i is Manchester encoded. The Manchester encoding rule is:

[0248] f i = 0, the codeword generated after Manchester encoding is [0, 1]; f i = 1, the codeword generated after Manchester encoding is [1, 0].

[0249] Or

[0250] f i When f = 0, the codeword generated after Manchester encoding is [1, 0], and when f i = 1, the codeword generated after Manchester encoding is [0, 1].

[0251] In the embodiments of the present application, the Manchester encoding rule is: when f i = 0, the codeword generated after Manchester encoding is [0, 1], and when f i = 1, the codeword generated after Manchester encoding is [1, 0].

[0252] Then f0, f1, f2,..., f E-1 generate data information h0, h1, h2,..., h after Manchester encoding H-1 = 01 01 01 01 01 10 10 10.

[0253] Furthermore, M elements in h0, h1, h2,..., h H-1 are carried and sent in M OOK symbols. In the embodiments of the present application, the time domain length occupied by the M OOK symbols is the same as the length of one OFDM symbol or is included in one OFDM symbol. The M elements are defined as S M , that is, S M = [s0, s1, s2, s3..., s M-1 , and the generation process of data information S M in the MC-OOK based LP-WUS provided by the embodiments of the present application can be implemented using the generation steps.

[0254] In the embodiments of the present application, h0, h1, h2,..., h H-1 = 01 01 01 01 01 10 10 10 needs to be carried and sent in 16 OOK symbols. That is, M = 4, that is, the time domain length occupied by 4 OOK symbols is the same as the length of one OFDM symbol or is included in one OFDM symbol. Among them, the calculation method of the length of one OFDM symbol is: the length of the CP plus the length of the OFDM symbol corresponding to the CP, or the length of one OFDM symbol does not include the length of the CP. Then h0, h1, h2,..., h H-1 = 01 01 01 0101 10 10 10 needs to be carried and sent in 4 OOK symbols.

[0255] In the embodiments of the present application, "0101" is carried on the 4 OOK symbols in the first OFDM symbol among the 4 OFDMs, "0101" is carried on the 4 OOK symbols in the second OFDM symbol, "0101" is carried on the 4 OOK symbols in the third OFDM symbol, and "1010" is carried on the 4 OOK symbols in the fourth OFDM symbol, as Figure 5 shown.

[0256] Based on the above embodiments of the application, a first sequence is transmitted in a first number of first type symbols, and the first sequence includes at least one of the following:

[0257] The first sequence transmitted in each first type symbol is the same;

[0258] The first sequence transmitted on the target binary keying modulation symbols in each first type symbol is the same, where the data carried in the target binary keying modulation symbols is 1.

[0259] In the embodiments of the present application, the first sequence may be transmitted in a first number of first type symbols, the first sequence transmitted in each first type symbol may be the same, or the first sequence transmitted on the target binary keying modulation symbols in each first type symbol is the same, and the data carried by the target binary keying modulation symbol is 1.

[0260] Based on the above embodiments of the application, it further includes:

[0261] The index of the first sequence is 0 or N seq -1, N seq is the number of the first sequences; or, the cyclic shift value of the ZC sequence generating the first sequence is 0.

[0262] Specifically, the index of the first sequence on the first number of first type symbols is 0 or N seq -1, or the cyclic shift value of the ZC sequence generating the first sequence is 0, that is, the cyclic shift value C v = 0.

[0263] In some embodiments of the application, it further includes: The third information is divided into S third sub-informations, and one third sub-information is transmitted on one target binary keying modulation symbol, where the data carried in the target binary keying modulation symbol is 1.

[0264] Specifically, the third information may be divided into multiple third sub-informations, and at least one third sub-information is transmitted on the target binary keying modulation symbol carrying data of 1.

[0265] In some embodiments of the application, it further includes:

[0266] Indicate the third sub - information through the first sequence, where the cyclic shift step size N for generating the first sequence cs is determined according to one of the following formulas:

[0267]

[0268]

[0269] where, N cs represents the cyclic shift step size for generating the first sequence, N seq represents the number of the first sequences, N root represents the number of root sequences for generating the first sequence, B ZC represents the length of the ZC sequence corresponding to the first sequence, M bitbyseq represents the number of information bits carried in one third sub - information.

[0270] In the embodiments of the present application, the third sub - information can be indicated through the first sequence, and the cyclic shift step size N for generating the first sequence cs can be determined according to one of the following formulas:

[0271]

[0272] where, N cs represents the cyclic shift step size for generating the first sequence, N seq represents the number of the first sequences, N root represents the number of root sequences for generating the first sequence, B ZC represents the length of the ZC sequence corresponding to the first sequence, M bitbyseq represents the number of information bits carried in one third sub - information.

[0273] Based on the above - mentioned embodiments of the application, the value of Nseq includes at least one of the following:

[0274] When M = 1, N seq = at least one of 2, 4, 8, and 16;

[0275] When M = 2, N seq = at least one of 2, 4, and 8;

[0276] When M = 4, N seq = at least one of 2 and 4;

[0277] M is the number of OOK symbols included in one OFDM symbol, or the amount of data carried by one OFDM symbol.

[0278] Specifically, the value of M and the value of N seq can be as shown in the following table, Nseq is the number of the first sequence, and M is the number of OOK symbols included in one OFDM symbol, or the amount of data carried by one OFDM symbol.

[0279] Table 6N seq Value examples of

[0280] <![CDATA[N seq value]]> M＝1 [2,4,8,16] M＝2 [2,4,8] M＝4 [2,4]

[0281] Based on the above embodiments of the application, M bitbyseq takes values including at least one of the following:

[0282] M = 1, M bitbyseq = at least one of 1, 2, 3, and 4;

[0283] M = 2, M bitbyseq = at least one of 1, 2, and 3;

[0284] M = 4, M bitbyseq = at least one of 1 and 2;

[0285] M is the number of OOK symbols included in one OFDM symbol, or the amount of data carried by one OFDM symbol.

[0286] Specifically, the value of M and the value of M bitbyseq can be as shown in the following table. M bitbyseq represents the number of information bits carried in one of the third sub-informations, and M is the number of OOK symbols included in one OFDM symbol, or the amount of data carried by one OFDM symbol.

[0287] Table 7M bitbyseq Value examples of

[0288] <![CDATA[M bitbyseq value]]> M＝1 [1,2,3,4] M＝2 [1,2,3] M＝4 [1,2]

[0289] In an exemplary embodiment, when the third information is 6-bit information and is divided into S = 2 third sub-informations. In the embodiments of the present application, the third information is "001 100", so the 2 third sub-informations are respectively "001" and "100", which are converted into decimal numbers as "1" and "4".

[0290] Specifically, the content of the above-mentioned third sub-information is indicated by 8 ZC (Zadoff Chu) sequences. For example, the content of the third sub-information indicated by the ZC sequence with index 0 is "000", the content of the third sub-information indicated by the ZC sequence with index 1 is "001", the content of the third sub-information indicated by the ZC sequence with index 2 is "010", and so on. The content of the third sub-information indicated by the ZC sequence with index 7 is "111". Therefore, in the embodiment of the present application, the two third sub-informations are "001" and "100" respectively, that is, they are indicated by the ZC sequences with index 1 and index 4 respectively.

[0291] Further, for the selected ZC sequence, the following method provided by the embodiment of the present application can be used for transmission:

[0292] 1. Data in the process of generating the MC-OOK based LP-WUS signal based on Method 1 where 0 ≤ i ≤ M - 1;

[0293] 2. Data in the process of generating the MC-OOK based LP-WUS signal based on Method 2 where 0 ≤ i ≤ M - 1;

[0294] 3. Data based on Supplementary Method 2 where 0 ≤ i ≤ M - 1.

[0295] In the embodiment of the present application, the specific generation process of the ZC sequence may include the following steps:

[0296] (1) According to the u value and B ZC , generate the sequence X u (m)

[0297]

[0298] where the value of u is taken from [1, 2, 3,..., Bzc - 1], and Bzc represents the length of the ZC sequence corresponding to the first sequence.

[0299] where the value of Bzc is shown in the following table. When M takes the values of 1, 2, and 4, different Bzc values correspond respectively. M is the number of OOK symbols included in an OFDM symbol, or the amount of data carried by an OFDM symbol.

[0300] Table 8 B ZC Value example

[0301] <![CDATA[B ZC > M＝1 131 M＝2 61 M＝4 31

[0302] (2) Then, according to X u(m) and the cyclic shift value C v Generate the first sequence X u,v (m).

[0303] X u,v (m) = X u ((m + C v ) mod B ZC ), m = 0, 1, …, B ZC -1

[0304] where C v = v…N CS , The value of Ncs is determined according to one of the following formulas:

[0305]

[0306] is the floor operation, the value of M is related to N seq The value of is as shown in the following table, where N seq represents the number of configured ZC sequences.

[0307] Table 9 N seq Value example

[0308] <![CDATA[N seq value]]> M＝1 [2,4,8,16] M＝2 [2,4,8] M＝4 [2,4]

[0309] where the value of M is related to M bitbyseq The value of is as shown in the following table, where M bitbyseq represents the number of information bits carried in a third sub - information.

[0310] Table 10 M bitbyseq Value example

[0311] <![CDATA[M bitbyseq value]]> M＝1 [1,2,3,4] M＝2 [1,2,3] M＝4 [1,2]

[0312] where the value of N root is 1 or 2.

[0313] (3) X u,v (m) is further used to generate the ZC sequence Y through the following formula u,v (n)

[0314] Y u,v (n) = X u,v (n mod B ZC ), n = 0, 1, …, L ZC -1

[0315] When M is 1, 2, 4, the corresponding value of L ZC is as shown in the following table.

[0316] Table 11 LZC Value example

[0317] <![CDATA[L ZC > M＝1 132 M＝2 66 M＝4 33

[0318] The ZC sequence Y generated above u,v (n) corresponds to at least one of the following:

[0319] 1. Data in the process of generating the MC-OOK based LP-WUS signal based on Method 1 where 0 ≤ i ≤ M - 1;

[0320] 2. Data in the process of generating the MC-OOK based LP-WUS signal based on Method 2 where 0 ≤ i ≤ M - 1;

[0321] 3. Data in Supplementary Method 2 where 0 ≤ i ≤ M - 1.

[0322] where A0 = A1 = … = A M-1 = L ZC .

[0323] Based on the above application embodiments, the third information is repeatedly sent, and the number of repeated transmissions is determined by at least one of the following:

[0324] Indicator information;

[0325] Number of repeated transmissions where, is the floor operation; the third quantity is the number of target binary keying modulation symbols among the first type of symbols of the first quantity, the first type of symbols includes at least binary keying modulation symbols, and the data carried in the target binary keying modulation symbols is 1;

[0326] Number of repeated transmissions where, is the floor operation.

[0327] In the embodiments of the present application, the third information can be repeatedly sent, and the number of repeated transmissions of the third information can be determined by the indicator information, by the third quantity or the first quantity. The way to determine the number of repeated transmissions by the third quantity can include: the number of repeated transmissions where the third quantity is the number of target binary keying modulation symbols among the first type of symbols of the first quantity, the first type of symbols includes at least binary keying modulation symbols, and the data carried in the target binary keying modulation symbols is 1. The way to determine the number of repeated transmissions by the first quantity can include: the number of repeated transmissions is the floor operation.

[0328] Based on the above application embodiments, it further includes: the third quantity cannot be divided evenly by S, and the target binary keying symbols of the fourth quantity carry at least part of the third information, wherein the data carried in the target binary keying modulation symbols is 1, and the fourth quantity is less than or equal to the third quantity minus the product of the number of repeated transmissions and the number of third sub-information into which the third information is divided.

[0329] Specifically, when the third quantity cannot be divided evenly by S, at least part of the third information can be carried in the target binary keying symbols of the fourth quantity, and the data carried in the target binary keying modulation symbols is 1. This fourth quantity is less than or equal to the third quantity minus the product of the number of repeated transmissions R and the number of third sub-information S into which the third information is divided, that is, the fourth quantity ≤ the third quantity - R * S.

[0330] Further, based on the above application embodiments, preferably, the fourth quantity = the third quantity - R * S.

[0331] Based on the above application embodiments, it further includes: the first quantity cannot be divided evenly by 2 * S, and the target binary keying symbols of the fourth quantity carry at least part of the third information, wherein the data carried in the target binary keying modulation symbols is 1, and the fourth quantity is less than or equal to half of the third quantity minus twice the product of the number of repeated transmissions and the number of third sub-information into which the third information is divided.

[0332] In the embodiments of the present application, when the first quantity cannot be divided evenly by 2 * S, at least part of the third information is carried in the target binary keying symbols of the fourth quantity, that is, part of the third information is carried on the fourth quantity of OOK-ON symbols, wherein the fourth quantity ≤ (the first quantity - 2 · R · S) / 2.

[0333] Further, preferably, the fourth quantity = (the first quantity - 2 · R · S) / 2.

[0334] In an exemplary implementation manner, a first way of repeating the third information:

[0335] wherein, D = d0, d1, d2,..., d N-1 ; E is the output information after repeating D for R times.

[0336] When the third information is 6-bit information, d0, d1, d2,..., d5 = 001100, and it is divided into S = 2 third sub-informations. Specifically, the third information is "001 100", so the two third sub-informations are "001" and "100" respectively, and when converted to decimal numbers, they are "1" and "4".

[0337] In the embodiments of the present application, the content of the above-mentioned third sub-information can be indicated by 8 ZC sequences. For example, the content of the third sub-information indicated by the ZC sequence with an index of 0 is "000", the content of the third sub-information indicated by the ZC sequence with an index of 1 is "001", the content of the third sub-information indicated by the ZC sequence with an index of 2 is "010", and so on. The content of the third sub-information indicated by the ZC sequence with an index of 7 is "111". Therefore, in the embodiments of the present application, the two third sub-informations "001" and "100" are indicated by the ZC sequences with an index of 1 and an index of 4 respectively.

[0338] Specifically, when the second information is sent, it occupies 16 OOK symbols, and the time domain length corresponds to 4 OFDM symbols. Moreover, the length of one OFDM symbol includes 4 OOK symbol lengths. As follows Figure 6 shown, the indexes of the 4 OFDM symbols are 0, 1, 2, and 3. The third information is sent repeatedly, and the number of repetitions is R, and

[0339]

[0340] wherein, the third quantity is the number of OOK-ON symbols among the 16 OOK symbols, that is, the third quantity is 8.

[0341] Specifically, the way of repeatedly sending the third information is as follows: ZC1 is sent on OOK1 of OFDM symbol 0, ZC4 is sent on OOK3 of OFDM symbol 0, ZC1 is sent on OOK1 of OFDM symbol 1, ZC4 is sent on OOK3 of OFDM symbol 1, ZC1 is sent on OOK1 of OFDM symbol 2, ZC4 is sent on OOK3 of OFDM symbol 2, ZC1 is sent on OOK0 of OFDM symbol 3, and ZC4 is sent on OOK2 of OFDM symbol 3.

[0342] In another exemplary embodiment, the second way of repeating the third information:

[0343]

[0344] wherein, D = d0, d1, d2,..., d N-1 , where R is the number of repetitions.

[0345] wherein, N1 < N,

[0346] Preferably, or or wherein, j = 1, 2,..., S - 1.

[0347] wherein, S is the number of third sub-informations into which the third information is divided.

[0348] In the embodiment of the present application, when the third information is 6-bit information, d0, d1, d2,..., d5 = 001100 and is divided into S = 2 third sub-informations.

[0349] In the embodiment of the present application, the third information is "001 100", so the two third sub-informations are "001" and "100" respectively, and when converted to decimal numbers, they are "1" and "4".

[0350] In the embodiment of the present application, 8 ZC sequences are used to indicate the content of the above third sub-information. For example, the content of the third sub-information indicated by the ZC sequence with index (Index) 0 is "000", the content of the third sub-information indicated by the ZC sequence with index 1 is "001", the content of the third sub-information indicated by the ZC sequence with index 2 is "010", and so on. The content of the third sub-information indicated by the ZC sequence with index 7 is "111". Therefore, the two third sub-informations "001" and "100" are indicated by the ZC sequences with index 1 and index 4 respectively.

[0351] In the embodiment of the present application, when the second information is sent, it occupies 14 OOK symbols, and the time domain length corresponds to 7 OFDM symbols, and the length of one OFDM symbol includes 2 OOK symbol lengths. As follows Figure 7 As shown, the indexes of the 7 OFDM symbols are 0, 1, 2, 3, 4, 5, 6.

[0352] In the embodiment of the present application, the third information is sent repeatedly, and the number of repetitions is R, and

[0353]

[0354] wherein, the third quantity is the number of OOK-ON symbols among 14 OOK symbols, that is, the third quantity is 7.

[0355] In the embodiment of the present application, the third information is repeatedly sent in the following way: ZC1 is sent on OOK1 of OFDM symbol 0, ZC4 is sent on OOK0 of OFDM symbol 1, ZC1 is sent on OOK0 of OFDM symbol 2, ZC4 is sent on OOK0 of OFDM symbol 3, ZC1 is sent on OOK1 of OFDM symbol 4, and ZC4 is sent on OOK1 of OFDM symbol 5.

[0356] In addition, since the third quantity is 7 and cannot be divided evenly by S = 2, then that is, the ZC sequence ZC1 corresponding to d0, d1, d2 = 001 is sent on OOK0 of OFDM symbol 6.

[0357] In some application embodiments, the output information of the S third sub-information after rate matching through the second operation includes F0, F1, F2,..., F E-1 , where the value of E is determined by at least one of the following:

[0358] Indicating information;

[0359] Wherein, is a floor operation; the third quantity is the number of target binary keying modulation symbols among the first type of symbols of the first quantity, the first type of symbols includes at least binary keying modulation symbols, and the data carried in the target binary keying modulation symbols is 1;

[0360] Wherein, is a floor operation.

[0361] In the embodiments of the present application, the S third sub-information can be defined as D0, D1, D2,..., D S-1 , D i is the (i + 1)-th third sub-information among the S third sub-information, i = 0, 1, 2,..., S - 1, D i includes M bitbyseq bit information. Similarly, among F0, F1, F2,..., F E-1 , the size of F j is the same as that of D i , and also includes M bitbyseq bit, j = 0, 1, 2,..., E - 1.

[0362] Based on the above application embodiments, the output information of the S third sub-information after rate matching through the second operation includes F0, F1, F2,..., F E-1 Specifically expressed as:

[0363]

[0364] Based on the above application embodiments, it further includes: the third quantity cannot divide S evenly, and the target binary keying symbols of the fourth quantity carry at least part of the third information, where the data carried in the target binary keying modulation symbols is 1, and the fourth quantity is less than or equal to the third quantity minus the product of E and the number of third sub-information (S) into which the third information is divided, that is, the fourth quantity ≤ the third quantity - E * S.

[0365] Based on the above application embodiments, it further includes: the first quantity cannot be divided evenly by 2*S, and the target binary keying symbols of the fourth quantity carry at least part of the third information, where the data carried in the target binary keying modulation symbols is 1, and the fourth quantity is less than or equal to 1 / 2 times the third quantity minus the product of 2 times E and the number of third sub-information divisions (S), that is, the fourth quantity ≤ (the first quantity - 2·E°S) / 2.

[0366] Based on the above application embodiments, the specific generation method of the ZC sequence includes:

[0367] 1) According to the value of u and B ZC , generate the sequence X u (m)

[0368]

[0369] where the value of u is taken from [1, 2, 3,..., Bzc - 1].

[0370] (2) Then, according to the cyclic shift value C v generate the first sequence X u,v (m)

[0371] X u,v (m) = X u ((m + C v ) mod B ZC ), m = 0, 1,..., B ZC -1

[0372] where C v = v·N CS , When M is 1, 2, 4, the corresponding values of B ZC , N CS are shown in the following table.

[0373] Table 12L ZC , B ZC and N CS value example

[0374]

[0375]

[0376] (3) X u,v (m) is then used to generate the ZC sequence Y u,v (n)

[0377] Y u,v (n) = X u,v (n mod B ZC), n = 0, 1, …, L ZC -1

[0378] Among them, when M is 1, 2, or 4, the corresponding L ZC takes the values as shown in the above table.

[0379] The generated ZC sequence Y u,v (n) can correspond to at least one of the following:

[0380] 1. Data in the process of generating the MC-OOK based LP-WUS signal based on Method 1 where 0 ≤ i ≤ M - 1;

[0381] 2. Data in the process of generating the MC-OOK based LP-WUS signal based on Method 2 where 0 ≤ i ≤ M - 1;

[0382] 3. Data based on the supplementary method 2 where 0 ≤ i ≤ M - 1.

[0383] Among them, A0 = A1 = … = A M-1 = L ZC .

[0384] In some application embodiments, it further includes: generating a fourth piece of information according to a second sequence, and sending the fourth piece of information, where the fourth piece of information is sent in a third number of first-type symbols.

[0385] In the embodiments of the present application, a fourth piece of information can be generated according to the second sequence, and the fourth piece of information can include LP-SS, and the generated fourth piece of information can be sent in a third number of first-type symbols.

[0386] Based on the above application embodiments, M elements in the second sequence are sent in M of the first-type symbols, or are sent in 1 of the first-type symbols, where M is an integer greater than or equal to 1.

[0387] In the embodiments of the present application, M elements in the second sequence can be sent in M first-type symbols, or can be sent in 1 first symbol. For example, M elements in the second sequence can be sent in M OOK symbols, or can be sent in one OFDM symbol.

[0388] M elements in the second sequence in the embodiments of the present application can constitute the data information S in the generation process of MC-OOK based LP-WUS M = [s0, s1, s2, s3..., s M-1, and generate the output information T according to the generation process of MC-OOK based LP-WUS provided in the embodiments of the present application N =[t0,t1,t2,t3,...,t N-1 , all the output information can be merged to form the fourth information.

[0389] In some embodiments of the application, the second sequence can be as shown in the following table:

[0390] Table 13 Second sequence corresponding to M = 1

[0391]

[0392] Table 14 Second sequence corresponding to M = 2

[0393]

[0394]

[0395] Table 15 Second sequence corresponding to M = 4

[0396]

[0397] In the generation process of MC-OOK based LP-WUS provided in the embodiments of the present application, the third sequence can be used, and the third sequence is at least one of the following:

[0398] 1. Data in the process of generating the MC-OOK based LP-WUS signal based on Method 1 where 0 ≤ i ≤ M - 1;

[0399] 2. Data in the process of generating the MC-OOK based LP-WUS signal based on Method 2 where 0 ≤ i ≤ M - 1;

[0400] 3. Data based on Supplementary Method 2 where 0 ≤ i ≤ M - 1.

[0401] Based on the above embodiments of the application, it further includes at least one of the following:

[0402] When the M value when generating the second information is the same as the M value when generating the fourth information, select the third sequence from the first sequence;

[0403] When the M value when generating the second information is different from the M value when generating the fourth information, indicate the configuration information of the third sequence through signaling.

[0404] In the embodiments of the present application, when the M value corresponding to the generated second information is the same as the M value for generating the fourth information, the third sequence is selected from the first sequence. Further, the sequence indices of multiple third sequences are the same. The index of the third sequence is configured by the system or by default, and the default configuration may include the first index or the last index.

[0405] In some other embodiments of the application, when the M value for generating the second information is different from the M value for generating the fourth information, the configuration information of the third sequence may be indicated by signaling. The cyclic shift value of the ZC sequence for generating the third sequence takes the value of 0. Preferably, the cyclic shift value does not need to be given in the configuration information because the default is 0.

[0406] The embodiments of the present application provide an information processing device, which can execute the information processing method provided in any embodiment of the present application, and has the corresponding functional modules and beneficial effects for executing the method. The device may be implemented by software and / or hardware, and this information processing device is used to generate target information according to the first information according to a specified operation.

[0407] In some embodiments of the application, the information processing device includes a first processing module, which is used to generate second information according to the first information according to a first operation, where the second information is sent in the first type of symbols of the first quantity.

[0408] In some other embodiments of the application, the information processing device includes a second processing module, which is used to generate third information according to the first information according to a second operation, where the third information is sent in the first type of symbols of the second quantity.

[0409] Figure 8 It is a schematic structural diagram of an information processing device provided in the embodiments of the present application. This device can execute the information processing method provided in any embodiment of the present application, and has the corresponding functional modules and beneficial effects for executing the method. The device may be implemented by software and / or hardware. As Figure 8 shown, the device provided in the embodiments of the present application specifically includes:

[0410] A first processing module 210, which is used to generate second information according to the first information according to a first operation, where the second information is sent in the first type of symbols of the first quantity.

[0411] A second processing module 220, which is used to generate third information according to the first information according to a second operation, where the third information is sent in the first type of symbols of the second quantity.

[0412] Based on the above embodiments of the application, the first operation includes at least one of the following:

[0413] Repeat, scramble, first encoding, second encoding, add padding bits, add check information, rate matching.

[0414] Based on the above application embodiments, the output information generated by rate matching in the first operation includes where E is the length of the output information, and the value of E includes at least one of the following:

[0415] The value of E is between [3, 64];

[0416] The value of E is between [4, 64];

[0417] The value of E is between [3, 32];

[0418] The value of E is between [4, 32];

[0419] The value of E is an integer multiple of 3;

[0420] The value of E is an integer multiple of 4;

[0421] The value of E is an integer multiple of 5;

[0422] The value of E is an integer multiple of 6;

[0423] where the minimum Hamming distance of f0, f1, f2,..., f with length E corresponding to different first information is greater than or equal to the first threshold TH1, or the minimum Hamming distance ratio of f0, f1, f2,..., f with length E corresponding to different first information is greater than or equal to the second threshold TH2. E-1 E-1

[0424] Based on the above application embodiments, the length of the first information is 2, and the output information generated by rate matching in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the value of E includes at least one of the following:

[0425] The value of E is between [3, 64];

[0426] The value of E is between [4, 64];

[0427] The value of E is between [3, 32];

[0428] The value of E is between [4, 32];

[0429] The value of E is an integer multiple of 3;

[0430] The value of E is an integer multiple of 6.

[0431] Based on the above application embodiments, the length of the first information is K, and K > 2, and the output information generated by rate matching in the first operation includes f0, f1, f2,..., f​​E-1 , where E is the length of the output information, and the value of E includes at least one of the following:

[0432] The value of E is between [3, 64];

[0433] The value of E is between [4, 64];

[0434] The value of E is between [3, 32];

[0435] The value of E is between [4, 32];

[0436] The value of E is an integer multiple of the value of K.

[0437] Based on the above application embodiments, the number of repetitions in the first operation is R, the length of the first information is K, and K is greater than 2. The output information generated by the first encoding and rate matching in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the value of E includes: E = K * R.

[0438] Based on the above application embodiments, the length of the first information is K, and K is greater than 2. The output information generated by the first encoding and rate matching in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the value of E includes: E = K * R, where R is an integer greater than or equal to 1.

[0439] Based on the above application embodiments, the value of E further includes 32 and / or 64.

[0440] Based on the above application embodiments, the output information generated by the rate matching in the first operation includes where E is the length of the output information, and the value of E includes at least one of the following:

[0441] 5, 6, 7, 9, 11, 14, 15, 19, 20, 23, 25, 26, 27, 29, 30, 31, 32, 38, 39, 41, 43, 46, 47, 51, 52, 55, 57, 58, 59, 61, 62, 63, and 64.

[0442] Based on the above application embodiments, it further includes: a first sequence sending module, configured to send a first sequence in a first number of first type symbols, where the first sequence includes at least one of the following:

[0443] The first sequence sent in each first type symbol is the same;

[0444] The first sequence transmitted on the target binary keying modulation symbol in each symbol of the first type is the same, where the data carried in the target binary keying modulation symbol is 1.

[0445] Based on the above application embodiments, the index of the first sequence is 0 or Nseq - 1, where Nseq is the number of the first sequences, or the cyclic shift value of the ZC sequence generating the first sequence is 0.

[0446] Based on the above application embodiments, the second operation includes at least one of the following:

[0447] Scrambling, adding padding bits, adding check information.

[0448] Based on the above application embodiments, it further includes: a partitioning module, configured to partition the third information into S third sub-informations, and one third sub-information is transmitted on one target binary keying modulation symbol, where the data carried in the target binary keying modulation symbol is 1, and S is an integer greater than or equal to 1.

[0449] Based on the above application embodiments, it further includes: an information indication module, configured to indicate the third sub-information through the first sequence, where the cyclic shift step size N cs of the generated first sequence is determined according to one of the following formulas:

[0450]

[0451]

[0452] where N cs represents the cyclic shift step size of the generated first sequence, N seq represents the number of the first sequences, N root represents the number of the root sequences of the generated first sequence, B ZC represents the length of the ZC sequence corresponding to the first sequence, M bitbyseq represents the number of information bits carried in one third sub-information.

[0453] Based on the above application embodiments, the value of N seq includes at least one of the following:

[0454] When M = 1, N seq = at least one of 2, 4, 8, and 16;

[0455] When M = 2, N seq = at least one of 2, 4, and 8;

[0456] When M = 4, N seq = at least one of 2 and 4;

[0457] M is the number of OOK symbols included in an OFDM symbol, or the amount of data carried in an OFDM symbol.

[0458] Based on the above application embodiments, M bitbyseq takes values including at least one of the following:

[0459] When M = 1, M bitbyseq = at least one of 1, 2, 3, and 4;

[0460] When M = 2, M bitbyseq = at least one of 1, 2, and 3;

[0461] When M = 4, M bitbyseq = at least one of 1 and 2;

[0462] M is the number of OOK symbols included in an OFDM symbol, or the amount of data carried in an OFDM symbol.

[0463] Based on the above application embodiments, the third information is sent repeatedly, and the number of repeated transmissions is determined by at least one of the following:

[0464] Indicating information;

[0465] The number of repeated transmissions where is a floor operation; the third quantity is the number of target binary keying modulation symbols among the first type of symbols of the first quantity, the first type of symbols includes at least binary keying modulation symbols, and the data carried in the target binary keying modulation symbols is 1;

[0466] The number of repeated transmissions where is a floor operation.

[0467] Based on the above application embodiments, it further includes: the third quantity cannot divide S evenly, the target binary keying symbols of the fourth quantity carry at least part of the third information, where the data carried in the target binary keying modulation symbols is 1, and the fourth quantity is less than or equal to the third quantity minus the product of the number of repeated transmissions and the number of third sub - information into which the third information is divided.

[0468] Based on the above application embodiments, it further includes:

[0469] The first quantity cannot divide 2*S evenly, the target binary keying symbols of the fourth quantity carry at least part of the third information, where the data carried in the target binary keying modulation symbols is 1, and the fourth quantity is less than or equal to 1 / 2 times the third quantity minus 2 times the product of the number of repeated transmissions and the number of third sub - information into which the third information is divided.

[0470] Based on the above application embodiments, the output information of the S third sub-information after rate matching through the second operation includes F0, F1, F2,..., F E-1 , where the value of E is determined by at least one of the following:

[0471] Indication information;

[0472] Where is a floor operation; the third quantity is the number of target binary keying modulation symbols among the first type of symbols of the first quantity, the first type of symbols includes at least binary keying modulation symbols, and the data carried in the target binary keying modulation symbols is 1;

[0473] Where is a floor operation.

[0474] Based on the above application embodiments, it further includes: the third quantity cannot divide S evenly, and the fourth quantity of target binary keying symbols carry at least part of the third information, where the data carried in the target binary keying modulation symbols is 1, and the fourth quantity is less than or equal to the third quantity minus the product of E and the number of the third sub-information into which the third information is divided.

[0475] Based on the above application embodiments, it further includes: the first quantity cannot divide 2*S evenly, and the fourth quantity of target binary keying symbols carry at least part of the third information, where the data carried in the target binary keying modulation symbols is 1, and the fourth quantity is less than or equal to half of the third quantity minus twice the product of E and the number of the third sub-information into which the third information is divided.

[0476] Based on the above application embodiments, it further includes: a third processing module, configured to generate fourth information according to a second sequence and send the fourth information, where the fourth information is sent in the first type of symbols of the third quantity.

[0477] Based on the above application embodiments, M elements in the second sequence are sent in M first type of symbols, or, sent in 1 first type of symbol, where M is an integer greater than or equal to 1.

[0478] In some application embodiments, it further includes a third sequence determination module, configured to perform at least one of the following: when the M value when generating the second information is the same as the M value when generating the fourth information, select a third sequence from the first sequence; when the M value when generating the second information is different from the M value when generating the fourth information, indicate the configuration information of the third sequence through a signaling.

[0479] Figure 9 Figure 9 is a schematic structural diagram of an electronic device provided by an embodiment of the present application. The electronic device includes a processor 10, a memory 11, an input device 12, and an output device 13; the number of processors 10 in the electronic device may be one or more, Figure 9 and one processor 10 is taken as an example herein; the processor 10, the memory 11, the input device 12, and the output device 13 in the electronic device may be connected through a bus or other means, Figure 9 and connection through a bus is taken as an example herein.

[0480] The memory 11, as a computer-readable storage medium, can be used to store software programs, computer-executable programs, and modules, such as the modules corresponding to the image information processing device in the embodiments of the present application (the first processing module 310 and the second processing module 320). The processor 10 executes various functional applications and data processing of the electronic device by running the software programs, instructions, and modules stored in the memory 11, that is, implements the above method.

[0481] The memory 11 may mainly 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 electronic device, etc. In addition, the memory 11 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 memory 11 may further include a memory remotely provided with respect to the processor 10, and these remote memories may be connected to the electronic device 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.

[0482] The input device 12 can be used to receive input digital or character information, and generate key signal inputs related to the user settings and function controls of the electronic device. The output device 13 may include a display device such as a display screen.

[0483] In the embodiments of the present application, the above disclosure provides explanations and descriptions, but is not intended to be exhaustive or limit the aspects to the exact forms disclosed. Modifications and changes can be made according to the above disclosure, and can also be obtained from the practice of these aspects.

[0484] In embodiments of the present application, unless explicitly described, any element, action, or instruction used herein should not be construed as critical or essential. Additionally, the articles "a" and "an" used herein are intended to include one or more items and may be used interchangeably with "one or more." Further, the terms "set" and "group" used herein are intended to include one or more elements (e.g., related elements, unrelated elements, combinations of related and unrelated elements, and / or similar elements) and may be used interchangeably with "one or more." If only one item is intended, the phrases "single," "only one," or similar language is used.

[0485] In embodiments of the present application, the term "in accordance with" should not be construed as a reference to a closed set of information, one or more conditions, one or more factors, or the like. In other words, the phrase "in accordance with A" (where "A" may be information, a condition, a factor, etc.) should be construed as "at least in accordance with A," unless specifically construed differently.

[0486] In embodiments of the present application, although specific combinations of features are recited in the claims and / or disclosed in the specification, these combinations are not intended to limit the disclosure of the various aspects. In fact, many of these features may be combined in ways not specifically recited in the claims and / or not closed in the specification. Although each dependent claim listed below may directly depend on only one claim, the disclosure of the various aspects includes the combination of each dependent claim with all other claims in the claim set. The phrase "at least one" referring to a list of items means any combination of those items, including a single member. For example, "comprising at least one of the following: A, B, or C" is intended to cover A, B, C, A and B, A and C, B and C, A and B and C (and any other order of A, B, and C).

[0487] In embodiments of the present application, the terms "system" and "network" are often used interchangeably herein. The term "and / or" herein is merely an associative relationship to describe associated objects, indicating that there can be three relationships. For example, A and / or B can represent three situations: A exists alone, A and B exist simultaneously, and B exists independently of A.

[0488] In embodiments of the present application, "when," "if," and "in case" all indicate that the UE or the base station will perform corresponding processing under certain objective circumstances, rather than a limited time. It does not require the UE or the base station to have a judgment action during implementation and does not imply any other restrictions.

[0489] Those of ordinary skill in the art will understand that all or some of the steps in the methods disclosed above, and the functional modules / units in the systems and devices, can be implemented as software, firmware, hardware, or a suitable combination thereof. In the hardware implementation, the division between the functional modules / units mentioned above does not necessarily correspond to the division of physical units; for example, one physical component can have multiple functions, or one function or step can be executed by several physical components in cooperation. Some or all of the components can be implemented as a processor, such as software executed by a digital channel encoder or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on a computer-readable medium, which can include a computer storage medium (or non-transitory medium) and a communication medium (or transitory medium).

[0490] As is well known to those of ordinary skill in the art, the processor in the embodiments of the present application can be an integrated circuit chip with channel coding capabilities. During implementation, each step of the above method embodiments can be completed by the hardware integrated logic circuit or instructions in software form in the processor. The above processor can be a general-purpose processor, a digital channel encoder (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components. The methods, steps, and logic block diagrams disclosed in the embodiments of the present application can be implemented or executed. The general-purpose processor can be a microprocessor, or any conventional processor or the like. The steps of the methods disclosed in combination with various embodiments of the present application can be directly implemented by the hardware decoding processor, or implemented by a combination of the hardware and software modules in the decoding processor. The software module can be located in a mature storage medium in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, or electrically erasable programmable memory, registers, etc. The storage medium is located in the memory, and the processor reads the information in the memory and combines its hardware to complete the steps of the above method.

[0491] As is well known to those of ordinary skill in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information such as computer-readable instructions, data structures, program modules, or other data. Non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically programmable erasable programmable read-only memory (electric EPROM, EEPROM), or flash memory. Volatile memory can be random access memory (RAM), which acts as an external cache. For example, there are many forms of RAM available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous DRAM, SDRAM, double data rate synchronous dynamic random access memory (double data rate SDRAM, DDR SDRAM), enhanced synchronous dynamic random access memory (enhanced SDRAM, ESDRAM), synchronous link dynamic random access memory (synchlink DRAM, SLDRAM), and direct rambus random access memory (directrambus RAM, DR RAM). In addition, it is well known to those of ordinary skill in the art that communication media typically contain computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transmission mechanism, and can include any information delivery medium.

[0492] An embodiment of the present application further provides a storage medium containing computer-executable instructions, and the computer-executable instructions are used to execute an information processing method when executed by a computer processor. The method includes:

[0493] Generating target information according to the first information according to a specified operation.

[0494] Through the above description of the embodiments, those skilled in the art can clearly understand that the present application can be implemented by means of software and necessary general-purpose hardware. Of course, it can also be implemented by hardware, but in many cases the former is a better implementation. Based on such an understanding, the technical solution of the present application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. The computer software product can be stored in a computer-readable storage medium, such as a floppy disk, read-only memory (ROM), random access memory (RAM), flash memory (FLASH), hard disk, or optical disc of a computer, and includes several instructions for causing a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in various embodiments of the present application.

[0495] In some exemplary embodiments of the application, the data transmission method may be implemented as a computer program tangibly embodied in a computer-readable storage medium, such as a memory. In some embodiments, part or all of the computer program may be loaded and / or installed onto the electronic device via the ROM 12 and / or the communication unit. When the computer program is loaded into the RAM and executed by the processor, one or more steps of the data transmission method described above may be performed. Alternatively, in other embodiments, the processor may be configured to execute the data transmission method by any other suitable means (e.g., by means of firmware). The computer program for the method of the embodiments of the present application may be written in any combination of one or more programming languages. These computer programs may be provided to the processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions / operations specified in the flowchart and / or block diagram to be implemented. The computer program may be executed entirely on the machine, partially on the machine, as a stand-alone software package partially on the machine and partially on a remote machine, or entirely on a remote machine or server.

[0496] In the context of the embodiments of the present application, a computer-readable storage medium may be a tangible medium that can contain or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. The computer-readable storage medium may include, but is not limited to, electronic, magnetic, optical, electromagnetic, infrared, or semiconductor systems, apparatus, or devices, or any suitable combination of the foregoing. Alternatively, the computer-readable storage medium may be a machine-readable signal medium. More specific examples of the machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

[0497] It should be noted that in the embodiments of the above device, the various units and modules included are only divided according to functional logic, but are not limited to the above division, as long as the corresponding functions can be achieved; in addition, the specific names of the functional units are only for the convenience of mutual distinction and do not limit the protection scope of the present application.

[0498] Those of ordinary skill in the art can understand that all or some of the steps in the methods disclosed above, and the functional modules / units in the devices, can be implemented as software, firmware, hardware, and appropriate combinations thereof.

[0499] In a hardware implementation, the division between the functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a single physical component can have multiple functions, or a function or step can be executed by the cooperation of several physical components. Some or all of the physical components can be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application specific integrated circuit. The corresponding software can be distributed on a computer-readable medium, which can include a computer storage medium (or non-transitory medium) and a communication medium (or transitory medium). As is well known to those of ordinary skill in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information, such as computer-readable instructions, data structures, program modules, or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired information and can be accessed by a computer. In addition, as is well known to those of ordinary skill in the art, a communication medium typically includes computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transmission mechanism, and can include any information delivery medium.

[0500] The foregoing has described the preferred embodiments of the present application with reference to the accompanying drawings, and thus does not limit the scope of the rights of the present application. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and essence of the present application shall be within the scope of the rights of the present application.

Claims

1. An information processing method, characterized in that, The method includes: Generating target information according to the first information by performing a specified operation.

2. The method according to claim 1, wherein The generating of the target information according to the first information by performing a specified operation includes: Generating second information according to the first information by performing a first operation, wherein the second information is transmitted in a first number of first-type symbols.

3. The method according to claim 1, characterized in that, The generating of the target information according to the first information by performing a specified operation includes: Generating third information according to the first information by performing a second operation, wherein the third information is transmitted in a second number of first-type symbols.

4. The method according to claim 1, wherein The generating of the target information according to the first information by performing a specified operation includes: Generating second information according to the first information by performing a first operation, wherein the second information is transmitted in a first number of first-type symbols; Generating third information according to the first information by performing a second operation, wherein the third information is transmitted in a second number of first-type symbols; wherein, the second number is less than the first number.

5. The method according to claim 2 or 4, characterized in that, The first operation includes at least one of the following: Repeating, scrambling, first encoding, second encoding, adding padding bits, adding check information, rate matching.

6. The method according to claim 5, wherein The output information generated by rate matching in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the value of E includes at least one of the following: The value of E ranges from [3, 64]; The value of E ranges from [4, 64]; The value of E ranges from [3, 32]; The value of E ranges from [4, 32]; The value of E is an integer multiple of 3; The value of E is an integer multiple of 4; The value of E is an integer multiple of 5; The value of E is an integer multiple of 6; f0, f1, f2,..., f with length E corresponding to different said first information E-1 in which the minimum Hamming distance is greater than or equal to the first threshold TH1 f0, f1, f2,..., f with length E corresponding to different said first information E-1 The minimum Hamming distance ratio in it is greater than or equal to a second threshold TH2.

7. The method according to claim 5, wherein The length of the first information is 2, and the output information generated by rate matching in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the value of E includes at least one of the following: The value of E ranges from [3, 64]; The value of E ranges from [4, 64]; The value of E ranges from [3, 32]; The value of E ranges from [4, 32]; The value of E is an integer multiple of 3; The value of E is an integer multiple of 6.

8. The method according to claim 5, characterized in that, The length of the first information is K, and the value of K is greater than 2. The output information generated by rate matching in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the value of E includes at least one of the following: The value of E ranges from [3, 64]; The value of E ranges from [4, 64]; The value of E ranges from [3, 32]; The value of E ranges from [4, 32]; The value of E is an integer multiple of the value of K.

9. The method according to claim 5, characterized in that The number of repetitions in the first operation is R, the length of the first information is K, and the value of K is greater than 2. The output information generated by the first encoding and rate matching in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the value of E includes: E = K * R.

10. The method according to claim 5, wherein The length of the first information is K, and the value of K is greater than 2. The output information generated by the first encoding and rate matching in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the value of E includes: E = K * R, where R is an integer greater than or equal to 1.

11. According to the method described in claim 10, wherein The value of E further includes 32 and / or 64.

12. The method according to claim 5, wherein The output information generated by rate matching in the first operation includes f0, f1, f2,..., f E-1 , where E is the length of the output information, and the value of E includes at least one of the following: 5, 6, 7, 9, 11, 14, 15, 19, 20, 23, 25, 26, 27, 29, 30, 31, 32, 38, 39, 41, 43, 46, 47, 51, 52, 55, 57, 58, 59, 61, 62, 63 and 64.

13. The method according to claim 2 or 4, characterized in that, It further includes: Transmitting a first sequence in the first number of first-type symbols, wherein the first sequence includes at least one of the following: The first sequence transmitted in each of the first-type symbols is the same; The first sequence transmitted on the target binary keying modulation symbols in each of the first-type symbols is the same, wherein the data carried in the target binary keying modulation symbols is 1.

14. The method according to claim 13, wherein It further includes: The index of the first sequence is 0 or N seq -1, where the N seq is the number of the first sequence; Or, The cyclic shift value of the ZC sequence for generating the first sequence is 0.

15. The method according to claim 3 or 4, characterized in that, The second operation includes at least one of the following: Scrambling, adding padding bits, adding check information.

16. The method according to claim 15, wherein It further includes: The third information is divided into S third sub-informations, and one of the third sub-informations is sent on one target binary keying modulation symbol, where the data carried in the target binary keying modulation symbol is 1, and S is an integer greater than or equal to 1.

17. The method according to claim 16, wherein It further includes: Indicating the third sub-information through a first sequence, where the value of the cyclic shift step Ncs for generating the first sequence is determined according to one of the following formulas: Among them, N cs represents the cyclic shift step size for generating the first sequence, N seq represents the number of the first sequences, N root represents the number of root sequences for generating the first sequence, B ZC represents the length of the ZC sequence corresponding to the first sequence, M bitbyseq represents the number of information bits carried in one of the third sub-information.

18. The method according to claim 17, wherein The said N seq takes values including at least one of the following: When M = 1, N seq is at least one of 2, 4, 8, and 16; When M = 2, N seq is at least one of 2, 4, and 8; When M = 4, N seq is at least one of 2 and 4; M is the number of OOK symbols included in one OFDM symbol, or the number of data carried in one OFDM symbol.

19. The method according to claim 17, wherein The said M bitbyseq takes values including at least one of the following: When M = 1, M bitbyseq is at least one of 1, 2, 3, and 4; When M = 2, M bitbyseq is at least one of 1, 2, and 3; When M = 4, M bitbyseq is at least one of 1 and 2; M is the number of OOK symbols included in one OFDM symbol, or the number of data carried in one OFDM symbol.

20. The method according to claim 16, wherein The third information is sent by repeated transmission, and the number of repeated transmissions of the repeated transmission is determined by at least one of the following: Indicating information; The number of repeated transmissions wherein is a floor operation; the third quantity is the number of target binary keying modulation symbols among the first type of symbols of the first quantity, the first type of symbols includes at least binary keying modulation symbols, and the data carried in the target binary keying modulation symbols is 1; The number of repeated transmissions wherein is a floor operation.

21. The method according to claim 16, wherein The output information of the S third sub-information after rate matching by the second operation includes F0, F1, F2,..., F E-1 , where the value of E is determined by at least one of the following: Indicating information; Among them, is a floor operation; the third quantity is the number of target binary keying modulation symbols among the first type of symbols of the first quantity, the first type of symbols includes at least binary keying modulation symbols, and the data carried in the target binary keying modulation symbols is 1; Among them, is a floor operation.

22. The method according to claim 20, wherein It further includes: When the third quantity cannot divide S evenly, the target binary keying symbols of the fourth quantity carry at least part of the third information, where the data carried in the target binary keying modulation symbol is 1, and the fourth quantity is less than or equal to the third quantity minus the product of the number of repeated transmissions and the number of the third sub-informations into which the third information is divided.

23. The method according to claim 20, wherein It further includes: When the first quantity cannot divide 2*S evenly, the target binary keying symbols of the fourth quantity carry at least part of the third information, where the data carried in the target binary keying modulation symbol is 1, and the fourth quantity is less than or equal to 1 / 2 times the third quantity minus 2 times the product of the number of repeated transmissions and the number of the third sub-informations into which the third information is divided.

24. The method according to claim 21, wherein It further includes: When the third quantity cannot divide S evenly, the target binary keying symbols of the fourth quantity carry at least part of the third information, where the data carried in the target binary keying modulation symbol is 1, and the fourth quantity is less than or equal to the third quantity minus the product of E and the number of the third sub-informations into which the third information is divided.

25. The method according to claim 21, wherein It further includes: When the first quantity cannot divide 2*S evenly, the target binary keying symbols of the fourth quantity carry at least part of the third information, where the data carried in the target binary keying modulation symbol is 1, and the fourth quantity is less than or equal to 1 / 2 times the third quantity minus 2 times the product of E and the number of the third sub-informations into which the third information is divided.

26. The method according to claim 2 or 4, characterized in that, It further includes: Generating a fourth information according to a second sequence and sending the fourth information, where the fourth information is sent in the first type of symbols of the third quantity.

27. The method according to claim 26, characterized in that M elements in the second sequence are sent in M first type of symbols, or in 1 first type of symbol, where M is an integer greater than or equal to 1.

28. The method according to claim 27, wherein It further includes at least one of the following: When the M value when generating the second information is the same as the M value when generating the fourth information, selecting a third sequence from the first sequence; When the M value when generating the second information is different from the M value when generating the fourth information, indicating the configuration information of the third sequence through signaling.

29. An electronic device, characterized in that, The electronic device includes: One or more processors; A memory 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 information processing method according to any one of claims 1-28.

30. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores one or more programs, and the one or more programs are executed by one or more processors to implement the information processing method according to any one of claims 1-28.

31. A computer program product, characterized in that, The computer program product includes a computer program which, when executed by a processor, implements the information processing method according to any one of claims 1-28.

Images