Information processing method, electronic device, storage medium and program product
By using a low-power wake-up signal generation method with multi-subcarrier modulation, the signal distribution in the frequency and time domains is optimized, solving the problem of the undetermined structure of the low-power wake-up signal in 5G devices. This reduces system complexity and power consumption, and improves the number of connections and battery life.
Patent Information
- Application Number
- PCT/CN2026/086221
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2025-05-08
- Filing Date
- 2026-03-26
- Publication Date
- 2026-11-12
AI Technical Summary
In 5G devices, the structure and bearer sequence information of low-power wake-up signals are undetermined, resulting in high system complexity and high power consumption, making it difficult to meet the requirements of connection quantity and battery life in scenarios with high device density.
A low-power wake-up signal generation method based on multi-subcarrier modulation (MC-OOK) is adopted. By using Fourier transform and cyclic prefix processing, the signal distribution in the frequency and time domains is optimized, thereby reducing system power consumption and improving detection performance.
In scenarios with high device density, increasing the number of connections reduces system power consumption, increases system complexity, and extends battery life.
Smart Images

Figure CN2026086221_12112026_PF_FP_ABST
Abstract
Description
Information processing methods, electronic devices, storage media and program products Technical Field
[0001] This application relates to the field of wireless communication technology, such as an information processing method, electronic device, storage medium, and program product. Background Technology
[0002] For 5G systems, in addition to latency, reliability, and availability, the energy efficiency of user equipment (UE) is also crucial. Currently, 5G devices may require charging on a weekly or daily basis depending on individual usage time. Typically, 5G devices consume tens of milliwatts of power in Radio Resource Control (RRC) idle / inactive states and hundreds of milliwatts in RRC connected states. Improving battery life, reducing energy consumption, and enhancing user experience are pressing issues that need to be addressed.
[0003] The power consumption of a UE depends on the configured wake-up cycle length, such as the paging cycle. To meet battery life requirements, it is anticipated that the valuable Extended Discontinuous Reception (eDRX) cycle will be used, resulting in high latency, which is unsuitable for services requiring both battery life and low latency. Currently, relevant communication protocols have introduced a Low Power Wake-Up Signal (LP-WUS) mechanism. This 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 using binary on-off keying (OOK), and is referred to as an OOK-based LP-WUS. Currently, the structure and sequence information carried by the low-power wake-up signal, low-power synchronization signal, and low-power preamble are not yet determined. Therefore, it is crucial to conduct research under the new Internet of Things (IoT) technology to meet the needs of scenarios with extremely high connection numbers and / or device density, while reducing system complexity and power consumption. Summary of the Invention
[0004] The embodiments of this application aim to provide an information processing method, electronic device, storage medium, and program product to solve the problem of determining various signals under the low-power wake-up signal mechanism. This can increase the number of connections in scenarios with high device density, improve system complexity, and reduce system power consumption.
[0005] This application provides an information processing method, wherein the method includes:
[0006] Generate target information based on the first information and perform the specified operations.
[0007] This application provides another electronic device, wherein the electronic device includes:
[0008] One or more processors;
[0009] Memory, configured to store 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 of the embodiments of this application.
[0011] This application also provides a computer-readable storage medium storing one or more programs that are executed by one or more processors to implement the information processing method as described in any of the embodiments of this application.
[0012] This application also provides a computer program product, which includes a computer program that, when executed by a processor, implements the information processing method according to any of the embodiments of this application.
[0013] It should be understood that the description in this section is not intended to identify key or essential features of the embodiments of this application, nor is it intended to limit the scope of this application. Other features of this application will become readily apparent from the following description. Attached Figure Description
[0014] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below.
[0015] Figure 1 is an example diagram generated by MC-OOK based LP-WUS according to an embodiment of this application;
[0016] Figure 2 is an example diagram generated by another MC-OOK based LP-WUS according to an embodiment of this application;
[0017] Figure 3 is an example diagram generated by another MC-OOK based LP-WUS according to an embodiment of this application;
[0018] Figure 4 is a flowchart of an information processing method provided in an embodiment of this application;
[0019] Figure 5 is an example diagram of OFDM symbols being transmitted in OOK symbols according to an embodiment of this application;
[0020] Figure 6 is an example diagram of repeated transmission of third information provided in an embodiment of this application;
[0021] Figure 7 is an example diagram of another repeated transmission of third information provided in an embodiment of this application;
[0022] Figure 8 is a schematic diagram of the structure of an information processing device provided in an embodiment of this application;
[0023] Figure 9 is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Detailed Implementation
[0024] It should be understood that the specific embodiments described herein are for illustrative purposes only and are not intended to limit the scope of this application.
[0025] In the following description, the use of suffixes such as “module,” “part,” or “unit” to denote elements is solely for the purpose of illustration in this application and has no particular meaning in itself. Therefore, “module,” “part,” or “unit” may be used interchangeably.
[0026] In the embodiments of this application, the role of LP-WUS is to carry low-power wake-up information.
[0027] The functions of LP-SS include at least one of the following: performing radio resource management (RRM) measurements by detecting LP-SS, performing downlink synchronization by detecting LP-SS, or performing frequency offset correction by detecting LP-SS.
[0028] The functions of LP-Preamble include at least one of the following: performing RRM measurement by detecting LP-Preamble, performing downlink synchronization by detecting LP-Preamble, or performing frequency offset correction by detecting LP-Preamble.
[0029] In some application embodiments, the transmission of LP-Preamble is performed before LP-WUS, and the terminal performs downlink synchronization and / or frequency domain correction by detecting LP-Preamble, thereby improving the terminal's detection performance of LP-WUS.
[0030] The waveforms of the aforementioned LP-WUS / LP-SS / LP-Preamble signals can be generated using the OOK adjustment method, becoming OOK-based LP-WUS / LP-SS / LP-Preamble. Furthermore, in this embodiment, the signals can also be carried by multiple subcarriers; that is, when the OOK-based LP-WUS / LP-SS / LP-Preamble occupies more than one subcarrier in frequency, it is called a multiple subcarrier (MC)-OOK-based LP-WUS / LP-SS / LP-Preamble.
[0031] In some application embodiments, the MC-OOK based LP-WUS generation method may include method one, as shown in Figure 1, which can generate the time-domain representation of M MC-OOK based LP-WUS symbols, where M is greater than or equal to 1. The MC-OOK based LP-WUS generation process may include the following steps:
[0032] Step 1: The data information sent on M OOK symbols is S M Define S M =[s0,s1,s2,s3...,s M-1 ], and its length is M;
[0033] Step 2: Transfer the data information S according to the following formula. M Convert to data information Q K , where Q K The length of is K, where K is greater than or equal to 1;
[0034] or
[0035] Where A0+A1+…A i +…+A M-1 =K.
[0036] Among them, data The value of can be configured, where 0≤i≤M-1.
[0037] Step 3: Transfer data information Q K The data information D is obtained after K-point Discrete Fourier Transform / Fast Fourier Transform (DFT / FFT) operations. K =[d0,d1,d2,d3,...,d K-1 ];
[0038] Optionally, D can also be used. K Perform at least one of the following operations:
[0039] For D K Perform an upward circular shift operation, the size of which is or Or K / 2; where, This is the round-up operator. This is the floor operator;
[0040] For D K Perform a downward circular shift operation, the size of which is or Or K / 2; where, This is the round-up operator. This is the floor operator;
[0041] For D K Perform a left circular shift operation, the size of which is or Or K / 2; where, This is the round-up operator. This is the floor operator;
[0042] For D K Perform a right circular shift operation, the size of which is or Or K / 2; where, This is the round-up operator. The round-down operator; or
[0043] For D K Perform the FFT operation, where FFT is a function used to shift the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFT(X) swaps the left and right halves of X or swaps the top and bottom halves of X. For a matrix X, FFT(X) swaps the first and third quadrants, and the second and fourth quadrants.
[0044] Step 4: Transfer data information D K The data is padded onto K subcarriers in the frequency domain. When the overall frequency bandwidth of the system includes N subcarriers, N-point Inverse Discrete Fourier Transform / Inverse Fast Fourier Transform (IDFT / IFFT) operations are performed on the padded data on the N subcarriers to obtain time-domain data T with N sampling points. N=[t0,t1,t2,t3,...,t N-1 Where N is greater than or equal to 1;
[0045] Among them, T N =[t0,t1,t2,t3,...,t N-1 ] represents the sampling point data of M OOK time-domain symbols.
[0046] Where, [t0,t1,t2,t3,...,t N / M-1 ] represents the sampling point data of the first OOK time-domain symbol out of M OOK time-domain symbols, [t N / M ,t N / M+1 ,...,t 2N / M-1 ] represents the sampling point data of the second OOK time-domain symbol out of M OOK time-domain symbols, and so on, [t (M-1)N / M ,t(M-1)N / M+1,...,t N-1 ] represents the sampling point data of the Mth OOK time-domain symbol out of M OOK time-domain symbols.
[0047] Optionally, before performing the N-point IDFT / IFFT operation, at least one of the following operations can be performed on the data filled on the N subcarriers:
[0048] Perform an upward circular shift operation on the data, with the shift size being... or Or N / 2; where, This is the round-up operator. This is the floor operator;
[0049] Perform a downward circular shift operation on the data, with the shift size being... or Or N / 2; where, This is the round-up operator. This is the floor operator;
[0050] Perform a left circular shift operation on the data, with the shift size being... or Or N / 2; where, This is the round-up operator. This is the floor operator;
[0051] Perform a right circular shift operation on the data, with the shift size being... or Or N / 2; where, This is the round-up operator. The round-down operator; or
[0052] The data is subjected to an FFT operation, where FFT is a function used to shift the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFT(X) swaps the left and right halves of X or swaps the top and bottom halves of X. For a matrix X, FFT(X) swaps the first and third quadrants, and the second and fourth quadrants.
[0053] Step 5: Time-domain data T from N sampling points N =[t0,t1,t2,t3,...,t N-1 Before transmission, a cyclic prefix (CP) operation needs to be performed, which involves adding a cyclic prefix to the time-domain data T of N sampling points. N N at the tail cp The time-domain data T, which is copied from the information of one sampling point to N sampling points, is... N The head forms (N+N) cp The time-domain data of (N+N) sampling points, and then the (N+N) cp Data from ) sampling points is sent out.
[0054] In other embodiments, when the number of frequency domain subcarriers allocated to an MC-OOK based LP-WUS symbol is not equal to K, for example, when the number of frequency domain subcarriers allocated to an MC-OOK based LP-WUS symbol is K1, where K1 is not equal to K, then step 4 can be replaced with:
[0055] Step 4.1, process data information D K =[d0,d1,d2,d3,...,d K-1 Process D K Convert to E K1 , of which E K1 =[e0,e1,e2,e3,...,e K1-1 ];
[0056] Optionally, based on the above-described embodiments, E can also be modified. K1 Perform at least one of the following operations:
[0057] For D EK1 Perform an upward circular shift operation, the size of which is Or K1 / 2; where, This is the round-up operator. This is the floor operator;
[0058] For E K1Perform a downward circular shift operation, the size of which is Or K1 / 2; where, This is the round-up operator. This is the floor operator;
[0059] For E K1 Perform a left circular shift operation, the size of which is Or K1 / 2; where, This is the round-up operator. This is the floor operator;
[0060] For E K1 Perform a right circular shift operation, the size of which is Or K1 / 2; where, This is the round-up operator. The round-down operator; or
[0061] For E K1 Perform the FFT operation, where FFT is a function used to shift the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFT(X) swaps the left and right halves of X or swaps the top and bottom halves of X. For a matrix X, FFT(X) swaps the first and third quadrants, and the second and fourth quadrants.
[0062] Step 4.2: Transfer data information E K1 Fill the K1 subcarriers in the frequency domain;
[0063] Step 4.3: When the overall frequency domain bandwidth of the system includes N subcarriers, perform N-point IDFT / IFFT operations on the padding data on the N subcarriers to obtain time domain data T at N sampling points. N =[t0,t1,t2,t3,...,t N-1 ]. Where N is greater than or equal to 1.
[0064] Among them, T N =[t0,t1,t2,t3,...,t N-1 ] represents the sampling point data of M OOK time-domain symbols.
[0065] Where, [t0,t1,t2,t3,...,t N / M-1 ] represents the sampling point data of the first OOK time-domain symbol out of M OOK time-domain symbols, [t N / M ,t N / M+1 ,...,t 2N / M-1 ] represents the sampling point data of the second OOK time-domain symbol out of M OOK time-domain symbols, and so on, [t(M-1)N / M ,t(M-1)N / M+1,...,t N-1 ] represents the sampling point data of the Mth OOK time-domain symbol out of M OOK time-domain symbols.
[0066] Optionally, before performing the N-point IDFT / IFFT operation, at least one of the following operations can be performed on the data filled on the N subcarriers:
[0067] Perform an upward circular shift operation on the data, with the shift size being... or Or N / 2; where, This is the round-up operator. This is the floor operator;
[0068] Perform a downward circular shift operation on the data, with the shift size being... or Or N / 2; where, This is the round-up operator. This is the floor operator;
[0069] Perform a left circular shift operation on the data, with the shift size being... or Or N / 2; where, This is the round-up operator. This is the floor operator;
[0070] Perform a right circular shift operation on the data, with the shift size being... or Or N / 2; where, This is the round-up operator. The round-down operator; or
[0071] The data is subjected to an FFT operation, where FFT is a function used to shift the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFT(X) swaps the left and right halves of X or swaps the top and bottom halves of X. For a matrix X, FFT(X) swaps the first and third quadrants, and the second and fourth quadrants. The time-domain representation of M MC-OOK based LP-WUS symbols is shown in Figure 2.
[0072] In some embodiments, the MC-OOK based LP-WUS generation method may include Method 2. Referring to Figure 3, the MC-OOK based LP-WUS generation method provided in this embodiment generates a time-domain representation of M MC-OOK based LP-WUS symbols, where M is greater than or equal to 1. The generation process of Method 2 may include the following steps:
[0073] Step 1: The data information sent on M OOK symbols is S M Define S M =[s0,s1,s2,s3...,s M-1 And its length is M;
[0074] Step 2: According to the following formula, S M Generate data information
[0075] or
[0076] in, in, It is an integer greater than or equal to 1.
[0077] Optional, The preferred value for is N. Here, N represents the number of subcarriers included in the system bandwidth.
[0078] Among them, data The value of can be configured. Where 0 ≤ i ≤ M-1.
[0079] Step 3: Transfer the data information After the first processing module, data information D is obtained. K =[d0,d1,d2,d3,...,d K-1 ] T The first processing module includes at least one of the following operations:
[0080] (1) To Generate data information D according to the following formula. K :
[0081] in, For example, Let F be the generalized inverse matrix. Where (X) -1 To find the inverse of matrix X, (X) is the operation. H To find the conjugate transpose of matrix X, (X) T To find the transpose of matrix X, perform the matrix operation.
[0082] Where F is a matrix consisting of K columns of elements in the IDFT matrix, matrix F is A matrix with K rows and K columns.
[0083] The expression for the IDFT matrix is:
[0084] or
[0085] Optionally, the K columns of elements in the IDFT matrix that make up F are in the IDFT matrix. The position of a column element is determined at least by the data information D. K The positions or indices of the K subcarriers filled into the frequency domain are determined.
[0086] (2) Then D K Perform at least one of the following operations:
[0087] For D K During the upward circular shift operation, the size of the circular shift is... Or K / 2; where, This is the round-up operator. This is the floor operator;
[0088] For D K During the downward circular shift operation, the size of the circular shift is... Or K / 2; where, This is the round-up operator. This is the floor operator;
[0089] For D K During a left circular shift operation, the size of the shift is... Or K / 2; where, This is the round-up operator. This is the floor operator;
[0090] For D K During a right circular shift operation, the size of the circular shift is... Or K / 2; where, This is the round-up operator. The round-down operator; or
[0091] For D KPerform the FFT operation, where FFT is a function used to shift the zero-frequency component of the Fourier transform to the center of the spectrum. For a vector X, FFT(X) swaps the left and right halves of X or swaps the top and bottom halves of X. For a matrix X, FFT(X) swaps the first and third quadrants, and the second and fourth quadrants.
[0092] Step 4: Transfer data information D K The data is padded onto K subcarriers in the frequency domain. When the overall frequency bandwidth of the system includes N subcarriers, N-point IDFT / IFFT operations are performed on the padded data on the N subcarriers to obtain time-domain data T at N sampling points. N =[t0,t1,t2,t3,...,t N-1 ]. Where N is greater than or equal to 1.
[0093] Among them, T N =[t0,t1,t2,t3,...,t N-1 ] represents the sampling point data of M OOK time-domain symbols.
[0094] Where, [t0,t1,t2,t3,...,t N / M-1 ] represents the sampling point data of the first OOK time-domain symbol out of M OOK time-domain symbols, [t N / M ,t N / M+1 ,...,t 2N / M-1 ] represents the sampling point data of the second OOK time-domain symbol out of M OOK time-domain symbols, and so on, [t (M-1)N / M ,t(M-1)N / M+1,...,t N-1 ] represents the sampling point data of the Mth OOK time-domain symbol out of M OOK time-domain symbols.
[0095] Step 5: Time-domain data T from N sampling points N =[t0,t1,t2,t3,...,t N-1 Before sending, a CP operation needs to be performed, which involves adding time-domain data T from N sampling points. N N at the tail cp The time-domain data T, which is copied from the information of one sampling point to N sampling points, is... N The head forms (N+N) cp The time-domain data of (N+N) sampling points, and then these (N+N) cp Data from ) sampling points is sent out.
[0096] In some other 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, then the process of step 4 is as follows:
[0097] Step 4.1: Process data information D K =[d0,d1,d2,d3,...,d K-1 Process D K Convert to E K1 , of which E K1 =[e0,e1,e2,e3,...,e K1-1 ];
[0098] Step 4.2: Transfer data information E K1 Fill the K1 subcarriers in the frequency domain;
[0099] Step 4.3: When the overall frequency domain bandwidth of the system includes N subcarriers, perform N-point IDFT / IFFT operations on the padding data on the N subcarriers to obtain time domain data T at N sampling points. N =[t0,t1,t2,t3,...,t N-1 ]. Where N is greater than or equal to 1.
[0100] Among them, T N =[t0,t1,t2,t3,...,t N-1 ] represents the sampling point data of M OOK time-domain symbols.
[0101] Where, [t0,t1,t2,t3,...,t N / M-1 ] represents the sampling point data of the first OOK time-domain symbol out of M OOK time-domain symbols, [t N / M ,t N / M+1 ,...,t 2N / M-1 ] represents the sampling point data of the second OOK time-domain symbol out of M OOK time-domain symbols, and so on, [t (M-1)N / M ,t(M-1)N / M+1,...,t N-1 ] represents the sampling point data of the Mth OOK time-domain symbol out of M OOK time-domain symbols.
[0102] Based on methods one and two mentioned above, data information S can also be processed in the following ways. M The data information Q is obtained through processing. K or data information
[0103] Method 1: The data information transmitted on M OOK symbols is S M S M It contains M elements, namely S M The length is M, denoted as S. M =[s0,s1,s2,s3...,s M-1 ].
[0104] Step 1: Based on data information S M element s in i Generate Es i .
[0105] For example, Es i It can satisfy at least one of the following formulas:
[0106] Where, x i =0 or x i =s i y i =0 or y i =s i .
[0107] Step 2: Based on Es i Generate data information Q K or data information
[0108] Among them, Q K =[Es0,Es1,...,Es M-1 ], Among them, Q K The length is K, where K is greater than or equal to 1.
[0109] For example, K can be the number of subcarriers occupied by LP-WUS / LP-SS / LP-Preamble in the frequency domain.
[0110] It should be noted that the number of subcarriers corresponding to the protection bandwidth configured in the frequency domain for LP-WUS / LP-SS / LP-Preamble is not counted in the K subcarriers.
[0111] The length is in, It is an integer greater than or equal to 1. For example, The value of can be N. Here, N represents the number of subcarriers included in the system bandwidth.
[0112] Method 2: The data information sent on M OOK symbols is S M S M It contains M elements, namely SM The length is M, denoted as S. M =[s0,s1,s2,s3...,s M-1 ].
[0113] Step 1: Based on data information S M element s in i Generate Es i .
[0114] For example, Es i It can satisfy at least one of the following formulas:
[0115] in, or for B in i Elements, for example It can be The last B in i There are n elements, 0 ≤ b i ≤B i -1.
[0116] or for C in i Elements, for example It can be The first C i There are elements, 0 ≤ c i ≤C i -1.
[0117] Among them, data The value can be configured, 0≤i≤M-1.
[0118] In some embodiments, data It consists of at least one of the following:
[0119] (1) Length is sequence
[0120] (2) Length is sequence for Center front an element or A zero element or A padding element, where the padding element can be any predefined element; or
[0121] (3) Length is sequence for Mid-back an element or A zero element or A padding element.
[0122] For example, sequence It can be a binary random sequence, such as the Zadoff-Chu (ZC) sequence, the maximum length linear feedback shift register (M-sequence), or a pseudo noise (PN) sequence. It can also be a repetition of a binary random sequence.
[0123] In some embodiments, data It can be a combination of the following sequences, for example:
[0124] For example, data It can also be obtained by processing the elements of the above sequence. For example, one of the elements is Where 0≤a≤A i -1, can be used for Multiply by and / or divide by and / or add and / or subtract an element.
[0125] Step 2: Based on Es i Generate data information Q K or data information
[0126] Among them, Q K =[Es0,Es1,...,Es M-1 ],
[0127] Q K The length is K, where K is greater than or equal to 1. For example, K can be the number of subcarriers occupied by LP-WUS / LP-SS / LP-Preamble in the frequency domain.
[0128] It should be noted that the number of subcarriers corresponding to the protection bandwidth configured in the frequency domain for LP-WUS / LP-SS / LP-Preamble is not counted in the K subcarriers.
[0129] The length is in, It is an integer greater than or equal to 1. For example, The value of can be N. Here, N represents the number of subcarriers included in the system bandwidth.
[0130] This application provides an information processing method, applicable to situations where LP-WUS / LP-SS / LP-Preamble signals carry sequence information. This method can be executed by an information processing device, and includes the following steps:
[0131] Step 110: Generate target information according to the specified operation based on the first information.
[0132] The first information can be a sequence of length N, where N is an integer greater than or equal to 1. The first information can be represented as b0, b1, ..., b N-1 The first information may include UE indication information, UE packet indication information, and padding information, etc. The specified operation may be a processing operation that generates target information. The specified operation may include a first operation that generates second information, and / or a second operation that generates third information. The first operation may include at least one of repetition, scrambling, first encoding, second encoding, adding padding bits, adding check information, or rate matching. The second operation may include at least one of scrambling, adding padding bits, or adding check information. The target information may include the second information and / or the third information. The second and third information may be generated information to be transmitted, and the second and third information may be sequence information with the same or different sequence lengths.
[0133] In this embodiment of the application, target information can be generated according to the first information and a specified operation. This process may include, but is not limited to, generating second information according to the first information and a first operation, and / or generating third information according to the first information and a second operation.
[0134] In some embodiments of the application, target information is generated according to the first information and a specified operation, including:
[0135] The second information is generated according to the first operation based on the first information, wherein the second information is sent in a first number of first-class symbols.
[0136] In other embodiments, target information is generated according to the first information and a specified operation, including:
[0137] The third information is generated according to the second operation based on the first information, wherein the third information is sent in the second number of first-class symbols.
[0138] Figure 4 is a flowchart of an information processing method provided in an embodiment of this application. This embodiment is applicable to situations where sequence information is carried by signals such as LP-WUS / LP-SS / LP-Preamble signals. The method can be executed by an information processing device. Referring to Figure 4, the method provided in this embodiment includes the following steps:
[0139] Step 110: Generate second information according to the first operation based on the first information, wherein the second information is sent in the first number of first type symbols.
[0140] 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: UE indication information, UE packet indication information, or padding information. The UE or UE packet corresponding to the above indication information may be a UE or UE packet that needs to perform a wake-up operation. The size and format of information transmitted in wireless communication must conform to a specific standard. This specific size of information is called an information block. When the information to be transmitted is smaller than the information block size, padding information needs to be used after the transmitted information to make the size of the information to be transmitted reach the requirements of the information block. This padding information may be specific characters or binary data.
[0141] In some application embodiments, the first operation may be a processing operation that generates 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.
[0142] In some embodiments, when the first information is greater than 2 bits, the first operation includes at least one of the following:
[0143] The first operation includes the first encoding;
[0144] The first operation includes first encoding and rate matching;
[0145] The first operation includes a first encoding and repetition, where repetition is the process of repeating the output information after the first encoding; or
[0146] The first operation includes first encoding, rate matching, and repetition, where repetition is the process of repeating the output information after "first encoding" and "rate matching".
[0147] In some application embodiments, the first code is a Reed-Muller code (RM code).
[0148] In other embodiments, when the first information is 2 bits, the first operation includes at least one of the following:
[0149] The first operation includes the second encoding;
[0150] The first operation includes second encoding and rate matching;
[0151] The first operation includes a second encoding and repetition, where repetition can be a repetition of the output information after the second encoding; or
[0152] The first operation includes second encoding, rate matching, and repetition, wherein repetition can be a repetition of the output information after "second encoding" and "rate matching".
[0153] In some other application embodiments, when the first information is 1 bit, the first operation includes repetition.
[0154] In one exemplary implementation, 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 The length is N, and the output information is d0, d1, d2, ..., d N-1 It can be obtained in the following ways:
[0155] Where i = 0, 1, ..., N-1, N = 32. M i,k The values are selected from Table 1:
[0156] Table 1 M i,k The value of
[0157] 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)mod2.
[0158] In some application embodiments, rate matching is implemented in the following ways:
[0159] The input information for the rate matching operation is d0, d1, d2, ..., d N-1 The length is N, where N is an integer greater than or equal to 1. The output information after rate matching is f0, f1, f2, ..., f E-1 Where E represents the output information f0, f1, f2, ..., f E-1 The length of the output information f0, f1, f2, ..., f E-1 Obtained through the following methods:
[0160] for k=0 to E-1
[0161] f k =d kmodN ;
[0162] end for
[0163] That is, each element f in the output information k It is determined by the k mod N element in the input information, where the value of k ranges from 0 to E-1.
[0164] Step 120: Generate third information according to the second operation based on the first information, wherein the third information is sent in the second number of first type symbols.
[0165] In some embodiments of the application, the second quantity is less than or equal to the first quantity.
[0166] In the embodiments of this application, the second operation includes at least one of the following: scrambling, adding padding bits, or adding check information.
[0167] In some application embodiments, the second operation includes at least adding padding bits.
[0168] Based on the above-described embodiments, the methods for adding padding bits include at least one of the following:
[0169] Method 1: d0, d1, d2, ..., d N-1 =p0,p1,…,p X-1 ,c0,c1,c2,...,c K-1 ;
[0170] Where c0, c1, c2, ..., c K-1 The first information; d0, d1, d2, ..., d N-1 The output information after adding padding bits, also known as the third information, p0, p1, ..., p X-1 To fill in bit information.
[0171] Method 2: d0, d1, d2, ..., d N-1 =c0,c1,c2,...,c K-1 p0, p1, ..., p Y-1 ;
[0172] Where c0, c1, c2, ..., c K-1 The first information is d0, d1, d2, ..., d N-1 The output information after adding padding bits, that is, the third information, 1p0,p1,…,p Y-1 To fill in bit information.
[0173] Method 3: d0, d1, d2, ..., d N-1 =p0,p1,…,p X-1 ,c0,c1,c2,...,c K-1 p0, p1, ..., p Y-1 ;
[0174] Where c0, c1, c2, ..., c K-1 The first information; d0, d1, d2, ..., d N-1 The output information after adding padding bits, also known as the third information, p0, p1, ..., p Y-1 To fill in bit information.
[0175] Based on the above-described embodiments, when the first operation includes rate matching, 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:
[0176] The value of E is between [3, 64].
[0177] The value of E is between [4, 64].
[0178] The value of E is between [3, 32].
[0179] The value of E is between [4, 32].
[0180] The value of E is a multiple of 3;
[0181] E must be a multiple of 4;
[0182] The value of E is a multiple of 5; or
[0183] E must be a multiple of 6;
[0184] Among them, the different first information corresponds to lengths E of f0, f1, f2, ..., f E-1 The minimum Hamming distance is greater than or equal to the first threshold TH1; different first information corresponds to lengths E of f0, f1, f2, ..., f E-1 The minimum Hamming distance ratio is greater than or equal to the second threshold TH2, where the value of the second threshold TH2 can be in the range of [0.4, 0.5].
[0185] In this embodiment of the application, the first operation may include at least rate matching, and the output information after rate matching processing includes f0, f1, f2, ..., f E-1E represents the length of the output information, which can include at least one of the following:
[0186] Between [3,64], between [4,64], between [3,32], between [4,32], multiples of 3, multiples of 4, multiples of 5, or multiples of 6.
[0187] For example, for different first information of length E, the output information f0, f1, f2, ..., f E-1 The output information is f0, f1, f2, ..., f E-1 The minimum Hamming distance is greater than or equal to the first threshold TH1, or the output information f0, f1, f2, ..., f E-1 The minimum Hamming distance ratio is greater than or equal to the second threshold TH2. The values of the first threshold TH1 or the second threshold TH2 can be configured by the system or use the default value.
[0188] It is understood that, in the embodiments of this application, the first operation for processing the first information is not limited to rate matching, but may also include other operations. The examples of the first operation are for illustrative purposes only and are not intended to be limiting.
[0189] Based on the above-described embodiments, when the first operation includes rate matching, 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:
[0190] The value of E is between [3, 64].
[0191] The value of E is between [4, 64].
[0192] The value of E is between [3, 32].
[0193] The value of E is between [4, 32].
[0194] E can be a multiple of 3; or
[0195] The value of E is a multiple of 6.
[0196] In this embodiment of the application, when the first operation includes rate matching, and the length of the first information is 2, the output information generated after the rate matching processing included in the first operation is f0, f1, f2, ..., f E-1 The output information is f0, f1, f2, ..., f E-1The length of E is E, and the value of E can 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], or between [4, 32].
[0197] In other embodiments, when the first operation includes rate matching, 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 can take at least one of the following values:
[0198] The value of E is between [3, 64].
[0199] The value of E is between [4, 64].
[0200] The value of E is between [3, 32].
[0201] The value of E is between [4, 32]; or
[0202] The value of E is an integer multiple of the value of K.
[0203] For example, the length of the first information is K, where K is an integer greater than 2, and the output information generated by rate matching in the first operation is f0, f1, f2, ..., f E-1 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], [4,64], [3,32], [4,32], etc.
[0204] In one exemplary implementation, the range of values for E can change based on the value of K when K takes different values. The correspondence between the values of K and E can be shown in the table below:
[0205] When K=3, the value of E can be one of 6, 12, 24, 48, or 64. When K=4, the value of E can be one of 8, 16, 32, or 64. When K=5, the value of E can be one of 10, 20, 40, or 64.
[0206] In other embodiments, when the first operation includes repetition, first encoding, and rate matching, 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.
[0207] In this embodiment, the first operation may include at least 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 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 number of repetitions R. 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 number of repetitions R and the length K of the first information.
[0208] In other embodiments, when the first operation includes first encoding and rate matching, 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.
[0209] In this embodiment of the application, when the first operation includes first encoding and rate matching, the length of the first information is K, and the output information of the first information after the first encoding and rate matching in the first operation includes f0, f1, f2, ..., f E-1 E is the length of the output information, E = K * R, where R is an integer greater than or equal to 1.
[0210] Based on the above application embodiments, the value of E also includes 32 and / or 64.
[0211] In other embodiments, when the first operation includes rate matching, 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:
[0212] 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 or 64.
[0213] In one exemplary implementation, the first information is c0, c1, c2, ..., c K-1 K=5, first information c0,c1,c2,...,c K-1 The output information after the first encoding is d0, d1, d2, ..., d N-1 Where N = 32, d0, d1, d2, ..., d N-1The output information after rate matching is f0, f1, f2, ..., f E-1 The value of E is between [3, 64].
[0214] In this embodiment of the application, the first information c0, c1, c2, ..., c K-1 Different values of f0, f1, f2, ..., f E-1 Tables 2 and 3 show the different first information c0, c1, c2, ..., c for different values of E. K-1 The corresponding different f0, f1, f2, ..., f E-1 The minimum Hamming distance between them.
[0215] To ensure that the first information c0, c1, c2, ..., c K-1 The detection performance, f0, f1, f2, ..., f E-1 The preferred values for the length E are f0, f1, f2, ..., f E-1 The value of E when the minimum Hamming distance is greater than or equal to the threshold TH1.
[0216] Table 2 shows the f0, f1, f2, ..., f corresponding to the first information of different lengths. E-1 Example of minimum Hamming distance between
[0217] Table 3 shows the f0, f1, f2, ..., f values corresponding to the first information of different lengths. E-1 Example of minimum Hamming distance between
[0218] In another exemplary implementation, the first information is c0, c1, c2, ..., c K-1 K=5, first information c0,c1,c2,...,c K-1 The 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 The value of E is between [3, 64].
[0219] In this embodiment of the application, the first information c0, c1, c2, ..., c K-1 Different values of f0, f1, f2, ..., f E-1 Tables 4 and 5 show the different first information c0, c1, c2, ..., c for different values of E. K-1The corresponding different f0, f1, f2, ..., f E-1 The minimum Hamming distance ratio between them, where minimum Hamming distance ratio = minimum Hamming distance / E.
[0220] To ensure that the first information c0, c1, c2, ..., c K-1 The detection performance, f0, f1, f2, ..., f E-1 The preferred values for the length E are f0, f1, f2, ..., f E-1 The value of E when the corresponding minimum Hamming distance ratio is greater than or equal to TH.
[0221] Table 4 shows the f0, f1, f2, ..., f values corresponding to different lengths of the first information. E-1 Example of minimum Hamming distance ratio between
[0222] Table 5 shows the f0, f1, f2, ..., f values corresponding to the first information of different lengths. E-1 Example of minimum Hamming distance ratio between
[0223] In some application embodiments, the first information c0, c1, c2, ..., c K-1 =00001, when E=8, the second information f0,f1,f2,...,f E-1 =00000111.
[0224] Optionally, for f0, f1, f2, ..., f E-1 Each bit f i Perform Manchester encoding. The Manchester encoding rules are as follows:
[0225] f i When f = 0, the code generated after Manchester encoding is [0,1], f i When = 1, the code generated after Manchester encoding is [1,0];
[0226] or,
[0227] f i When f = 0, the code generated after Manchester encoding is [1,0], f i When = 1, the code generated after Manchester encoding is [0, 1].
[0228] In this embodiment of the application, the Manchester encoding rule is: f i When f = 0, the code generated after Manchester encoding is [0,1], f iWhen f = 1, the code generated after Manchester encoding is [1, 0], then f0, f1, f2, ..., f E-1 After Manchester encoding, the generated data information is h0, h1, h2, ..., h H-1 =01 01 01 01 01 10 10 10.
[0229] Optional, h0, h1, h2, ..., h H-1 M elements are carried in M OOK symbols for transmission, and in this embodiment, the time domain length occupied by the M OOK symbols is the same as the length of one OFDM symbol or is contained within one OFDM symbol. The M elements are defined as S. M S M =[s0,s1,s2,s3...,s M-1 The data information S generated during the MC-OOK based LP-WUS generation process provided in the embodiments of this application can be used. M The generation steps are implemented.
[0230] In this embodiment of the application, h0, h1, h2, ..., h H-1 =01 01 01 01 01 10 10 10 needs to be carried in 16 OOK symbols for transmission. That is, M=4, meaning that the time domain length occupied by 4 OOK symbols is the same as the length of one OFDM symbol or is contained within one OFDM symbol. The length of one OFDM symbol is calculated as: the length of the CP plus the length of the OFDM symbol corresponding to the CP, or the length of one OFDM symbol excluding the length of the CP, then h0, h1, h2, ..., h H-1 =01 01 01 01 01 10 10 10 needs to be carried in 4 OOK symbols for transmission.
[0231] In this embodiment of the application, the four OOK symbols in the first OFDM symbol carry "0101", the four OOK symbols in the second OFDM symbol carry "0101", the four OOK symbols in the third OFDM symbol carry "0101", and the four OOK symbols in the fourth OFDM symbol carry "1010", as shown in Figure 5.
[0232] Based on the above-described embodiments, a first sequence is transmitted in a first number of first-class symbols, the first sequence comprising at least one of the following:
[0233] The first sequence transmitted in each of the first class symbols is the same; or
[0234] The first sequence transmitted on the target binary keying modulation symbol in each of the first type of symbols is the same, wherein the data carried in the target binary keying modulation symbol is 1.
[0235] In this embodiment, the first sequence can be transmitted in a first number of first-class symbols. The first sequence transmitted in each first-class symbol can be the same, or the first sequence transmitted on each target binary keying modulation symbol in each first-class symbol can be the same, and the data carried by the target binary keying modulation symbol is 1. It can be understood that the binary bit value carried by the target binary keying modulation symbol is 1.
[0236] Based on the above-described embodiments, it also includes:
[0237] The index of the first sequence is 0 or N. seq -1, N seq The number of elements in the first sequence; or, the cyclic shift of the ZC sequence that generates the first sequence is 0.
[0238] For example, the index of the first sequence on the first number of first class symbols is 0 or N. seq -1, or the cyclic shift of the ZC sequence that generates the first sequence is 0, that is, the cyclic shift value is C. v =0.
[0239] In some embodiments, the method further includes: dividing the third information into S third sub-information, with one third sub-information being transmitted on a target binary keying modulation symbol, wherein the data carried in the target binary keying modulation symbol is 1.
[0240] For example, the third information can be divided into multiple third sub-information, and at least one third sub-information is transmitted on a target binary keying modulation symbol carrying data 1.
[0241] In some embodiments of the application, it also includes:
[0242] The third sub-information is indicated by the first sequence, wherein the cyclic shift step size N for generating the first sequence is... cs The value of is determined according to one of the following formulas:
[0243] or
[0244] Where, N cs N represents the cyclic shift step size for generating the first sequence. seq N represents the number of items in the first sequence. root B represents the number of root sequences that generate the first sequence. ZC M represents the length of the ZC sequence corresponding to the first sequence.bitbyseq This indicates the number of information bits carried in a third sub-message.
[0245] In this embodiment, the third sub-information can be indicated by the first sequence to generate the cyclic shift step size N of the first sequence. cs It can be determined using one of the following formulas:
[0246] or
[0247] Where, N cs N represents the cyclic shift step size used to generate the first sequence. seq N represents the number of the first sequence. root B represents the number of root sequences that generated the first sequence. ZC M represents the length of the ZC sequence corresponding to the first sequence. bitbyseq This indicates the number of information bits carried in one of the third sub-information.
[0248] Based on the above application embodiments, N seq The value of includes one of the following:
[0249] When M=1, N seq =At least one of 2, 4, 8, and 16;
[0250] When M=2, N seq =At least one of 2, 4, and 8; or
[0251] When M=4, N seq =At least one of 2 and 4;
[0252] Where M is the number of OOK symbols included in an OFDM symbol, or the amount of data carried by an OFDM symbol.
[0253] For example, the values of M and N seq The possible values for N are shown in Table 6 below. seq M represents the number of the first sequence, while M represents the number of OOK symbols included in an OFDM symbol, or the amount of data carried by an OFDM symbol.
[0254] Table 6 N seq Examples of possible values
[0255] Based on the above-described embodiments, M bitbyseq The value of includes one of the following:
[0256] M = 1, M bitbyseq=At least one of 1, 2, 3, and 4;
[0257] M = 2, M bitbyseq =At least one of 1, 2, and 3;
[0258] M = 4, M bitbyseq = at least one of 1 and 2; or
[0259] M represents the number of OOK symbols included in an OFDM symbol, or the amount of data carried in an OFDM symbol.
[0260] For example, the values of M and M bitbyseq The possible values for M are shown in Table 7 below. bitbyseq M represents the number of information bits carried in a third sub-information, while M is the number of OOK symbols included in an OFDM symbol, or the number of data carried in an OFDM symbol.
[0261] Table 7 M bitbyseq Examples of possible values
[0262] In one exemplary implementation, when the third information is 6 bits, it is divided into S = 2 third sub-information. In this embodiment, the third information is "001 100", so the two third sub-information are "001" and "100", which are "1" and "4" in decimal.
[0263] For example, the content of the aforementioned third sub-information is indicated by eight ZC (Zadoff Chu) sequences. For instance, the ZC sequence with index 0 indicates "000", the ZC sequence with index 1 indicates "001", the ZC sequence with index 2 indicates "010", and so on, with the ZC sequence with index 7 indicating "111". Therefore, in this embodiment, the two third sub-information pieces are "001" and "100", indicated by ZC sequences with indices 1 and 4, respectively.
[0264] Optionally, for the selected ZC sequence, it can be transmitted using the following method provided in the embodiments of this application:
[0265] 1. Data generated during the process of generating MC-OOK based LP-WUS signals based on Method 1 Where 0≤i≤M-1;
[0266] 2. Data generated during the process of generating MC-OOK based LP-WUS signals based on Method 2 Where 0≤i≤M-1;
[0267] 3. Based on the data in Supplementary Method Two Where 0≤i≤M-1.
[0268] In this embodiment of the application, the process of generating the ZC sequence may include the following operations:
[0269] (1) Based on the value of u and B ZC Generate sequence X according to the following formula. u (m)
[0270] Where u takes the value from [1,2,3,...,B] ZC -1],B ZC This indicates the length of the ZC sequence corresponding to the first sequence.
[0271] Among them, B ZC The values of M are shown in Table 8 below. When M takes the values of 1, 2, and 4, they correspond to different values of B. ZC The value M represents the number of OOK symbols included in an OFDM symbol, or the amount of data carried by an OFDM symbol.
[0272] Table 8 B ZC Value examples
[0273] (2) Then according to X u (m) and the cyclic shift value C v Generate the first sequence X u,v (m). X u,v (m)=X u ((m+C v )mod B ZC ), m=0,1,…,B ZC -1;
[0274] Among them, C v =v·N CS , N cs The value of is determined according to one of the following formulas:
[0275] or
[0276] For the floor operation, the value of M is equal to the value of N. seq The values of N are shown in Table 9 below, where N seq This indicates the number of ZC sequences configured.
[0277] Table 9 N seq Value examples
[0278] Where, the value of M is related to M bitbyseq The values of M are shown in Table 10 below, where M bitbyseq This indicates the number of information bits carried in a third sub-information.
[0279] Table 10 M bitbyseq Value examples
[0280] Where, N root The value can be 1 or 2.
[0281] (3)X u,v (m) Then, the ZC sequence Y is generated using the following formula. u,v (n), Y u,v (n)=X u,v (n mod B ZC ), n=0,1,…,L ZC -1;
[0282] When M is 1, 2, 4, the corresponding L ZC The values for are shown in Table 11 below.
[0283] Table 11 L ZC Value examples
[0284] The ZC sequence Y generated above u,v (n) corresponds to at least one of the following:
[0285] 1. Data generated during the process of generating MC-OOK based LP-WUS signals based on Method 1 Where 0≤i≤M-1;
[0286] 2. Data generated during the process of generating MC-OOK based LP-WUS signals based on Method 2 Where 0 ≤ i ≤ M-1; or
[0287] 3. Based on the data in Supplementary Method Two Where 0≤i≤M-1.
[0288] Where, A0=A1=…=A M-1 =L ZC .
[0289] Based on the above application embodiments, the third information is transmitted repeatedly, and the number of times the repeated transmission is performed is determined by at least one of the following:
[0290] Instruction information;
[0291] Number of times to send repeatedly in, This is a rounding down operation; the third quantity is the number of target binary keying modulation symbols in the first type of symbols, 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; or
[0292] Number of times to send repeatedly in, This is a floor operation.
[0293] In this embodiment, the third information can be repeatedly transmitted. The number of times the third information is repeatedly transmitted can be determined by an indication message, a third quantity, or a first quantity. Determining the number of retransmissions by the third quantity can include: the number of retransmissions. The third quantity is the number of target binary keying modulation symbols in the first type of symbols, where 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 method for determining the number of repeated transmissions based on the first quantity may include: the number of repeated transmissions. This is a floor operation.
[0294] Based on the above application embodiments, it further includes: the third quantity cannot be divided by S, the fourth quantity of target binary keying symbols carries 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 product of the third quantity minus the number of repeated transmissions and the number of third information subdivided into third sub-information.
[0295] For example, when the third quantity is not divisible 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. The fourth quantity is less than or equal to the product of the third quantity minus the number of repeated transmissions R and the number of third information subdivided into third sub-information S, that is, the fourth quantity ≤ the third quantity - R*S.
[0296] Optionally, based on the above application embodiments, for example, the fourth quantity = the third quantity - R*S.
[0297] Based on the above application embodiments, it further includes: the first quantity cannot be divided by 2*S, the fourth quantity of target binary keying symbols carries 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 1 / 2 times the third quantity minus 2 times the number of repeated transmissions and the number of third information divided into third sub-information.
[0298] In this embodiment of the application, when the first quantity cannot be divided by 2*S, the fourth quantity of target binary keying symbols carries at least part of the third information, that is, the fourth quantity of OOK-ON symbols carries part of the third information, wherein the fourth quantity ≤ (first quantity - 2·R·S) / 2.
[0299] Optional, fourth quantity = (first quantity - 2·R·S) / 2.
[0300] In one exemplary implementation, one method for repeatedly processing the third information is as follows: Where D = d0, d1, d2, ..., d N-1 E represents the output information after repeating D R times.
[0301] When the third information is 6 bits, d0,d1,d2,...,d5 = 001100, and it is divided into S = 2 third sub-information. For example, the third information is "001 100", so the two third sub-information are "001" and "100", which are "1" and "4" in decimal.
[0302] In this embodiment, the content of the third sub-information can be indicated by eight ZC sequences. For example, the ZC sequence with index 0 indicates "000", the ZC sequence with index 1 indicates "001", the ZC sequence with index 2 indicates "010", and so on, with the ZC sequence with index 7 indicating "111". Therefore, in this embodiment, the two third sub-information pieces "001" and "100" are indicated by ZC sequences with indices 1 and 4, respectively.
[0303] For example, the second information transmission occupies 16 OOK symbols, the time domain length corresponds to 4 OFDM symbols, and the length of one OFDM symbol includes the length of 4 OOK symbols. As shown in Figure 6, the indices of the 4 OFDM symbols are 0, 1, 2, and 3. The third information is transmitted repeatedly, with a retransmission count of R, and...
[0304] The third quantity is the number of OOK-ON symbols out of the 16 OOK symbols, which is 8.
[0305] For example, the third information is repeatedly transmitted as follows: ZC1 is transmitted on OOK1 of OFDM symbol 0, ZC4 is transmitted on OOK3 of OFDM symbol 0, ZC1 is transmitted on OOK1 of OFDM symbol 1, ZC4 is transmitted on OOK3 of OFDM symbol 1, ZC1 is transmitted on OOK1 of OFDM symbol 2, ZC4 is transmitted on OOK3 of OFDM symbol 2, ZC1 is transmitted on OOK0 of OFDM symbol 3, and ZC4 is transmitted on OOK2 of OFDM symbol 3.
[0306] In another exemplary implementation, a second method of repeating the operation on the third information is as follows:
[0307] Where D = d0, d1, d2, ..., d N-1 , where R is the number of repetitions.
[0308] Where N1 < N,
[0309] Optional, or or Where j = 1, 2, ..., S-1.
[0310] Where S is the number of third sub-informations in the third information division.
[0311] In this embodiment of the application, when the third information is 6 bits, d0,d1,d2,...,d5 = 001100 and is divided into S = 2 third sub-information.
[0312] In this embodiment, the third information is “001 100”, so the two third sub-information are “001” and “100”, which are “1” and “4” in decimal.
[0313] In this embodiment, eight ZC sequences are used to indicate the content of the third sub-information. For example, the ZC sequence with index 0 indicates "000", the ZC sequence with index 1 indicates "001", the ZC sequence with index 2 indicates "010", and so on, with the ZC sequence with index 7 indicating "111". Therefore, the two third sub-information pieces "001" and "100" are indicated by ZC sequences with indices 1 and 4, respectively.
[0314] In this embodiment, the second information transmission occupies 14 OOK symbols, the time domain length corresponds to 7 OFDM symbols, and the length of one OFDM symbol includes the length of 2 OOK symbols. As shown in Figure 7 below, the indices of the 7 OFDM symbols are 0, 1, 2, 3, 4, 5, and 6.
[0315] In this embodiment of the application, the third information is transmitted repeatedly, and the number of repeated transmissions is R.
[0316] The third quantity is the number of OOK-ON symbols out of the 14 OOK symbols, which is 7.
[0317] In this embodiment of the application, the third information is repeatedly transmitted as follows: ZC1 is transmitted on OOK1 of OFDM symbol 0, ZC4 is transmitted on OOK0 of OFDM symbol 1, ZC1 is transmitted on OOK0 of OFDM symbol 2, ZC4 is transmitted on OOK0 of OFDM symbol 3, ZC1 is transmitted on OOK1 of OFDM symbol 4, and ZC4 is transmitted on OOK1 of OFDM symbol 5.
[0318] Furthermore, since the third quantity is 7 and cannot divide S=2, then... That is, the ZC sequence ZC1 corresponding to d0, d1, d2 = 001 is transmitted on OOK0 of OFDM symbol 6.
[0319] In some embodiments, the output information of the S third sub-information pieces after rate matching through the second operation includes F0, F1, F2, ..., F E-1 The value of E is determined by at least one of the following:
[0320] Instruction information;
[0321] in, This is a rounding down operation; the third quantity is the number of target binary keying modulation symbols in the first type of symbols, 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; or
[0322] in, This is a floor operation.
[0323] In this embodiment of the application, the S third sub-information items can be defined as D0, D1, D2, ..., D S-1 D i It is the (i+1)th third sub-information among S third sub-information pieces, where i = 0, 1, 2, ..., S-1, D i Including M bitbyseqEach bit of information, similarly, F0, F1, F2, ..., F E-1 China F j Size and D i Same, also including M bitbyseq 1 bit, j = 0, 1, 2, ..., E-1.
[0324] Based on the above-described embodiments, the output information of the S third sub-information pieces after rate matching through the second operation includes F0, F1, F2, ..., F E-1 , represented as:
[0325] Based on the above application embodiments, it further includes: the third quantity cannot be divided by S, the fourth quantity of target binary keying symbols carries 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 E and the number (S) of the third information divided into third sub-information, that is, the fourth quantity ≤ the third quantity - E*S.
[0326] Based on the above application embodiments, it further includes: the first quantity cannot be divided by 2*S, the fourth quantity of target binary keying symbols carries at least part of the third information, wherein the data carried in the target binary keying modulation symbols is 1, the fourth quantity is less than or equal to 1 / 2 times the third quantity minus 2 times E and the product of the number of third information divided into third sub-information (S), that is, the fourth quantity ≤ (third quantity - 2·E·S) / 2.
[0327] Based on the above-described embodiments, the generation method of the ZC sequence includes:
[0328] 1) Based on the value of u and B ZC Generate sequence X according to the following formula. u (m),
[0329] Where u takes the value from [1,2,3,...,B] ZC -1].
[0330] (2) Then, based on the cyclic shift value C, v Generate the first sequence X u,v (m), X u,v (m)=X u ((m+C v )mod B ZC ), m=0,1,…,B ZC -1,
[0331] Among them, C v =v·N CS , When M is 1, 2, 4, its corresponding B ZC N CS The values of are shown in Table 12 below.
[0332] Table 12 L ZC B ZC and N CS Value examples
[0333] (3)X u,v (m) Then, the ZC sequence Y is generated using the following formula. u,v (n), Y u,v (n)=X u,v (n mod B ZC ), n=0,1,…,L ZC -1,
[0334] Where, when M is 1, 2, 4, the corresponding L ZC The values of are shown in Table 12 above.
[0335] The ZC sequence Y generated above u,v (n) can correspond to at least one of the following:
[0336] 1. Data generated during the process of generating MC-OOK based LP-WUS signals based on Method 1 Where 0≤i≤M-1;
[0337] 2. Data generated during the process of generating MC-OOK based LP-WUS signals based on Method 2 Where 0 ≤ i ≤ M-1; or
[0338] 3. Based on the data in Supplementary Method Two Where 0≤i≤M-1.
[0339] Where, A0=A1=…=A M-1 =L ZC .
[0340] In some application embodiments, the method further includes: generating fourth information based on the second sequence and sending the fourth information, wherein the fourth information is sent in a third number of first-class symbols.
[0341] In this embodiment of the application, fourth information can be generated based on the second sequence. The fourth information may include LP-SS, and the generated fourth information can be sent in a third number of first-class symbols.
[0342] Based on the above application embodiments, the M elements in the second sequence are sent in M of the first type of symbols, or in 1 of the first type of symbols, where M is an integer greater than or equal to 1.
[0343] In the embodiments of this application, the M elements in the second sequence can be sent in M first-class symbols, or they can be sent in one first symbol. For example, the M elements in the second sequence can be sent in M OOK symbols, or they can be sent in one OFDM symbol.
[0344] In the embodiments of this application, the M elements in the second sequence 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 output information T according to the MC-OOK based LP-WUS generation process provided in the embodiments of this application. N =[t0,t1,t2,t3,...,t N-1 The fourth piece of information can be formed by merging all the output information.
[0345] In some embodiments of the application, the second sequence may be as shown in Tables 13-15 below:
[0346] Table 13 Second sequence corresponding to M=1
[0347] Table 14 The second sequence corresponding to M=2
[0348] Table 15 The second sequence corresponding to M=4
[0349] The generation process of MC-OOK based LP-WUS provided in this application embodiment can use a third sequence, which is at least one of the following:
[0350] 1. Data generated during the process of generating MC-OOK based LP-WUS signals based on Method 1 Where 0≤i≤M-1;
[0351] 2. Data generated during the process of generating MC-OOK based LP-WUS signals based on Method 2 Where 0 ≤ i ≤ M-1; or
[0352] 3. Based on the data in Supplementary Method Two Where 0≤i≤M-1.
[0353] Based on the above-described embodiments, it also includes at least one of the following:
[0354] 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; or
[0355] When the M value when generating the second information is different from the M value when generating the fourth information, the configuration information of the third sequence is indicated by signaling.
[0356] In this embodiment, 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. Optionally, multiple third sequences may have the same sequence index. The index of the third sequence is configured by the system or by a default configuration, which may include the first index or the last index.
[0357] In other embodiments, 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 can be indicated by signaling. The cyclic shift value of the ZC sequence for generating the third sequence is 0. Optionally, it is not necessary to specify the cyclic shift value in the configuration information, as it is 0 by default.
[0358] This application provides an information processing apparatus that can execute the information processing method provided in any embodiment of this application, and has corresponding functional modules and beneficial effects for executing the method. The apparatus can be implemented by software and / or hardware, and is configured to generate target information according to a specified operation based on first information.
[0359] In some embodiments, the information processing device includes a first processing module configured to generate second information according to a first operation based on first information, wherein the second information is sent in a first number of first-class symbols.
[0360] In other embodiments, the information processing apparatus includes a second processing module configured to generate third information according to a second operation based on the first information, wherein the third information is sent in a second number of first-class symbols.
[0361] Figure 8 is a schematic diagram of an information processing device provided in an embodiment of this application. This device can execute the information processing method provided in any embodiment of this application, and possesses the corresponding functional modules and beneficial effects of the method execution. This device can be implemented by software and / or hardware. As shown in Figure 8, the device provided in this embodiment includes:
[0362] The first processing module 210 is configured to generate second information according to the first information and the first operation, wherein the second information is sent in a first number of first type symbols.
[0363] The second processing module 220 is configured to generate third information according to the first information and the second operation, wherein the third information is sent in a second number of first-class symbols.
[0364] Based on the above-described embodiments, the first operation includes at least one of the following:
[0365] Repeat, scramble, first encoding, second encoding, add padding bits, add check information or rate matching.
[0366] Based on the above-described 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:
[0367] The value of E is between [3, 64].
[0368] The value of E is between [4, 64].
[0369] The value of E is between [3, 32].
[0370] The value of E is between [4, 32].
[0371] The value of E is a multiple of 3;
[0372] E must be a multiple of 4;
[0373] The value of E is a multiple of 5; or
[0374] E must be a multiple of 6;
[0375] Among them, the different first information corresponds to lengths E of f0, f1, f2, ..., f E-1 The minimum Hamming distance is greater than or equal to the first threshold TH1, or the lengths of different first information corresponding to f0, f1, f2, ..., f are all greater than or equal to the first threshold TH1. E-1 The minimum Hamming distance ratio is greater than or equal to the second threshold TH2.
[0376] Based on the above-described 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:
[0377] The value of E is between [3, 64].
[0378] The value of E is between [4, 64].
[0379] The value of E is between [3, 32].
[0380] The value of E is between [4, 32].
[0381] E can be a multiple of 3; or
[0382] The value of E is a multiple of 6.
[0383] Based on the above-described embodiments, 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:
[0384] The value of E is between [3, 64].
[0385] The value of E is between [4, 64].
[0386] The value of E is between [3, 32].
[0387] The value of E is between [4, 32]; or
[0388] The value of E is an integer multiple of the value of K.
[0389] Based on the above-described embodiments, 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.
[0390] Based on the above-described embodiments, 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.
[0391] Based on the above application embodiments, the value of E also includes 32 and / or 64.
[0392] Based on the above-described 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:
[0393] 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 or 64.
[0394] Based on the above-described embodiments, the application further includes: a first sequence transmission module, configured to transmit a first sequence in a first number of first-class symbols, wherein the first sequence includes at least one of the following:
[0395] The first sequence transmitted in each of the first class symbols is the same; or
[0396] The first sequence transmitted on the target binary keying modulation symbol in each of the first type of symbols is the same, wherein the data carried in the target binary keying modulation symbol is 1.
[0397] Based on the above-described embodiments, the index of the first sequence is 0 or N. seq- 1, where N seq The value is the number of the first sequence, or the cyclic shift of the ZC sequence that generates the first sequence is 0.
[0398] Based on the above-described embodiments, the second operation includes at least one of the following:
[0399] Scrambling, adding padding bits, or adding check information.
[0400] Based on the above application embodiments, it further includes: a division module, configured to divide the third information into S third sub-information, and one third sub-information is transmitted on a target binary keying modulation symbol, wherein the data carried in the target binary keying modulation symbol is 1, and S is an integer greater than or equal to 1.
[0401] Based on the above-described embodiments, it further includes: an information indication module, configured to indicate third sub-information through a first sequence, wherein the cyclic shift step size N for generating the first sequence is... cs The value of is determined according to one of the following formulas:
[0402] or
[0403] Where, N cs N represents the cyclic shift step size for generating the first sequence. seq N represents the number of items in the first sequence. root B represents the number of root sequences that generate the first sequence. ZC M represents the length of the ZC sequence corresponding to the first sequence. bitbyseqThis indicates the number of information bits carried in a third sub-message.
[0404] Based on the above application embodiments, N seq The value of includes one of the following:
[0405] When M=1, N seq =At least one of 2, 4, 8, and 16;
[0406] When M=2, N seq =At least one of 2, 4, and 8; or
[0407] When M=4, N seq =At least one of 2 and 4;
[0408] Where M is the number of OOK symbols included in an OFDM symbol, or the amount of data carried in an OFDM symbol.
[0409] Based on the above-described embodiments, M bitbyseq The value of includes one of the following:
[0410] When M=1, M bitbyseq =At least one of 1, 2, 3, and 4;
[0411] When M=2, M bitbyseq =At least one of 1, 2, and 3; or
[0412] When M=4, M bitbyseq =At least one of 1 and 2;
[0413] Where M is the number of OOK symbols included in an OFDM symbol, or the amount of data carried in an OFDM symbol.
[0414] Based on the above application embodiments, the third information is transmitted repeatedly, and the number of times the repeated transmission is performed is determined by at least one of the following:
[0415] Instruction information;
[0416] Number of times to send repeatedly in, This is a rounding down operation; the third quantity is the number of target binary keying modulation symbols in the first type of symbols, 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; or
[0417] Number of times to send repeatedly in, This is a floor operation.
[0418] Based on the above application embodiments, it further includes: the third quantity cannot be divided by S, the fourth quantity of target binary keying symbols carries 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 product of the third quantity minus the number of repeated transmissions and the number of third information subdivided into third sub-information.
[0419] Based on the above-described embodiments, it also includes:
[0420] The first quantity cannot be divided by 2*S. The fourth quantity of target binary keying symbols carries at least part of the third information. The data carried in the target binary keying modulation symbols is 1. The fourth quantity is less than or equal to 1 / 2 times the third quantity minus 2 times the number of repeated transmissions and the product of the third information divided into third sub-information.
[0421] Based on the above-described embodiments, the output information of the S third sub-information after rate matching through the second operation includes F0, F1, F2, ..., F E-1 The value of E is determined by at least one of the following:
[0422] Instruction information;
[0423] in, This is a rounding down operation; the third quantity is the number of target binary keying modulation symbols in the first type of symbols of the first quantity, wherein 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; or
[0424] in, This is a floor operation.
[0425] Based on the above application embodiments, it further includes: the third quantity cannot be divided by S, the fourth quantity of target binary keying symbols carries 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 E and the number of the third information divided into the third sub-information.
[0426] Based on the above application embodiments, it further includes: the first quantity cannot be divided by 2*S, the fourth quantity of target binary keying symbols carries 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 1 / 2 times the third quantity minus 2 times the E and the product of the number of the third information divided into the third sub-information.
[0427] Based on the above application embodiments, it further includes: a third processing module, configured to generate fourth information according to the second sequence and send the fourth information, wherein the fourth information is sent in a third number of first type symbols.
[0428] Based on the above application embodiments, the M elements in the second sequence are sent in M first-class symbols, or in 1 first-class symbol, where M is an integer greater than or equal to 1.
[0429] In some embodiments, a third sequence determination module is also included, configured to: select a third sequence from the first sequence when the M value when generating the second information is the same as the M value when generating the fourth information; and indicate the configuration information of the third sequence through signaling when the M value when generating the second information is different from the M value when generating the fourth information.
[0430] Figure 9 is a schematic diagram of the structure of an electronic device provided in an embodiment of this 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 can be one or more. Figure 9 shows one processor 10 as an example. The processor 10, memory 11, input device 12, and output device 13 in the electronic device can be connected by a bus or other means. Figure 9 shows a connection via a bus as an example.
[0431] 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 (first processing module 310 and second processing module 320) corresponding to the image information processing device in this embodiment of the application. 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, thereby implementing the above-described method.
[0432] The memory 11 may primarily include a program storage area and a data storage area. The program storage area may store the operating system and at least one application program required for a given function; the data storage area may store data created based on the use of the electronic device. Furthermore, the memory 11 may include high-speed random access memory and non-volatile memory, such as at least one disk storage device, flash memory, or other non-volatile solid-state storage device. In some instances, the memory 11 may further include memory remotely located relative to the processor 10, which can be connected to the electronic device via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
[0433] Input device 12 can be used to receive input digital or character information, and to generate key signal inputs related to user settings and function control of the electronic device. Output device 13 may include display devices such as a display screen.
[0434] In the embodiments of this application, the foregoing disclosure provides illustrations and descriptions, but is not intended to be exhaustive or to limit aspects to the precise form disclosed. Modifications and alterations can be made based on the foregoing disclosure, and can also be obtained from practice in these aspects.
[0435] In embodiments of this application, unless explicitly described, no element, action, or instruction used herein should be construed as critical or necessary. Furthermore, the articles “a” and “an” used herein are intended to include one or more items and may be used interchangeably with “one or more.” Additionally, 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 to be used, the phrase “single,” “only one,” or similar language is used.
[0436] In this application embodiment, the term "according to" should not be interpreted as a reference to a closed set of information, one or more conditions, one or more factors, or similar content. In other words, the phrase "according to A" (where "A" can be information, conditions, factors, etc.) should be interpreted as "at least according to A," unless specifically interpreted differently.
[0437] In embodiments of this application, although specific combinations of features are referenced in the claims and / or disclosed in the specification, these combinations are not intended to limit the disclosure of aspects. In fact, many of these features may be combined in ways not specifically referenced 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 aspects includes combinations of each dependent claim with all other claims in the claim set. The phrase “at least one” in the list of referenced items refers to any combination of these items, including individual members. For example, “comprising at least one of: 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).
[0438] In the embodiments of this application, the terms "system" and "network" are often used interchangeably herein. The term "and / or" in this document is merely an association to describe the associated objects, indicating that there can be three relationships, such as A and / or B, which can represent three situations: A exists alone, A and B exist simultaneously, and A and B exist independently of B.
[0439] In the embodiments of this application, "when," "if," and "if" all indicate that the UE or base station will make corresponding processing under certain objective circumstances, rather than within a limited time. They do not require the UE or base station to make a judgment action during implementation, and do not imply any other restrictions.
[0440] Those skilled in the art will understand that all or some of the steps, systems, and apparatuses disclosed above, and their functional modules / units, can be implemented as software, firmware, hardware, or suitable combinations thereof. In hardware implementations, the division between functional modules / units mentioned above does not necessarily correspond to the division of physical units; for example, a physical component may have multiple functions, or a function or step may be performed collaboratively by several physical components. Some or all components may be implemented as processors, such as software executed by a digital channel encoder or microprocessor, or as hardware, or as integrated circuits, such as application-specific integrated circuits (ASICs). Such software can be distributed on a computer-readable medium, which may include computer storage media (or non-transitory media) and communication media (or transient media).
[0441] As is known to those skilled in the art, the processor in this embodiment of the application can be an integrated circuit chip with channel coding capabilities. During implementation, each step of the above method embodiments can be completed by hardware integrated logic circuits or software instructions in the processor. The processor can be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. The methods, steps, and logic block diagrams disclosed in the embodiments of this application can be implemented or executed. The general-purpose processor can be a microprocessor, or any conventional processor or something similar. The steps of the methods disclosed in the various embodiments of this application can be directly implemented by a hardware decoding processor, or by a combination of hardware and software modules in the decoding processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. The storage medium is located in memory; the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method.
[0442] As is well known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technique 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 erasable programmable read-only memory (EEPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. Volatile memory can be random access memory (RAM), which acts as an external cache. For example, many forms of RAM are available, such as Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), Synchronous DRAM, Synchronous Dynamic Random Access Memory (SDRAM), Double Data Rate SDRAM (DDR SDRAM), Enhanced Synchronous SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), and Direct Memory Bus RAM (DR RAM). Furthermore, it is well known to those skilled in the art that communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.
[0443] This application also provides a storage medium containing computer-executable instructions, which, when executed by a computer processor, are used to perform an information processing method, the method comprising:
[0444] Generate target information based on the first information and perform the specified operations.
[0445] Based on the above description of the implementation methods, those skilled in the art can clearly understand that this application can be implemented using software and necessary general-purpose hardware, and of course, it can also be implemented using hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the related technology, can be embodied in the form of a software product. This computer software product can be stored in a computer-readable storage medium, such as a computer floppy disk, read-only memory (ROM), random access memory (RAM), flash memory, hard disk, or optical disk, etc., including several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute the methods described in the various embodiments of this application.
[0446] In some embodiments, the data transmission method may be implemented as a computer program tangibly contained 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 on an electronic device via ROM 12 and / or a communication unit. When the computer program is loaded into RAM and executed by a 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 perform the data transmission method by any other suitable means (e.g., by means of firmware). The computer program used for the methods of embodiments of this application may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general-purpose computer, a special-purpose computer, or other programmable data processing apparatus such that, when executed by the processor, the computer program causes the functions / operations specified in the flowcharts and / or block diagrams to be implemented. The computer program may be executed entirely on a machine, partially on a machine, partially on a machine and partially on a remote machine as a standalone software package, or entirely on a remote machine or server.
[0447] In the context of this application, a computer-readable storage medium can be a tangible medium that may contain or store a computer program for use by or in conjunction with an instruction execution system, apparatus, or device. A 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, a computer-readable storage medium may be a machine-readable signal medium. More specific examples of machine-readable storage media include electrical connections based on one or more wires, portable computer disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM or flash memory), optical fibers, portable compact disk read-only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing.
[0448] It is worth noting that in the embodiments of the above-mentioned 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 realized; in addition, the specific names of each functional unit are only for easy differentiation and are not used to limit the scope of protection of this application.
[0449] Those skilled in the art will understand that all or some of the steps, apparatuses, or functional modules / units in the methods disclosed above can be implemented as software, firmware, hardware, or suitable combinations thereof.
[0450] In hardware implementations, the division between functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed collaboratively by several physical components. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. The corresponding software may be distributed on a computer-readable medium, which may include computer storage media (or non-transitory media) and communication media (or transient media). As is known to those skilled in the art, the term computer storage media 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 disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and is accessible to a computer. Furthermore, as is known to those skilled in the art, communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.
[0451] The above description, with reference to the accompanying drawings, illustrates preferred embodiments of this application, but does not limit the scope of this application. Any modifications, equivalent substitutions, and improvements made by those skilled in the art without departing from the scope and spirit of this application shall be within the scope of this application.
Claims
1. A method for processing information, comprising: generating target information according to first information and a specified operation.
2. The method of claim 1, wherein, The generating target information according to first information and a specified operation comprises: generating second information according to first information and a first operation, wherein the second information is transmitted in a first number of first type symbols.
3. The method of claim 1, wherein, The generating target information according to first information and a specified operation comprises: generating third information according to first information and a second operation, wherein the third information is transmitted in a second number of first type symbols.
4. The method of claim 1, wherein, The generating target information according to first information and a specified operation comprises: generating second information according to first information and a first operation, wherein the second information is transmitted in a first number of first type symbols; generating third information according to first information and 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 of claim 2 or 4, wherein, The first operation comprises at least one of: repetition, scrambling, first encoding, second encoding, adding padding bits, adding check information, or rate matching.
6. The method of claim 5, wherein, When the first operation includes rate matching, 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 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 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. The value of E is an integer multiple of 3. The value of E is an integer multiple of 4. Among them, f0, f1, f2, ..., f, which are of length E, are different from the first information. E-1 The minimum Hamming distance is greater than or equal to the first threshold TH1; the lengths f0, f1, f2, ..., f of the first information are different. E-1 The minimum Hamming distance ratio is greater than or equal to the second threshold TH2.
7. The method of claim 5, wherein, When the first operation includes rate matching, 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 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 3. The value of E is an integer multiple of 6. The value of E is an integer multiple of 3. The value of E is an integer multiple of 4.
8. The method of claim 5, wherein, When the first operation includes rate matching, 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 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 3. The value of E is an integer multiple of 4. The value of E is an integer multiple of 3.
9. The method of claim 5, wherein, When the first operation includes repetition, first encoding, and rate matching, 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 of claim 5, wherein, When the first operation includes first encoding and rate matching, 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. The method of claim 10, wherein, The value of E is an integer multiple of 4.
12. The method of claim 5, wherein, In case that the first operation comprises rate matching, the output information generated by rate matching in the first operation comprises f0, f1, f2,..., f E-1 wherein E is the length of the output information, and the value of E comprises at least one of the following: The value of E is an integer multiple of 3.
13. The method of claim 2 or 4, further comprising: The value of E is an integer multiple of 4. 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 3. the index of the first sequence is 0 or N seq -1, wherein the N seq is the number of the first sequence; The value of E is an integer multiple of 4. The value of E is an integer multiple of 3.
15. The method of claim 3 or 4, wherein, The value of E is an integer multiple of 4. 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, or 64. transmitting a first sequence in the first number of first type symbols, wherein the first sequence comprises at least one of: the first sequence transmitted in each of the first type symbols is identical; or the first sequence transmitted on a target binary keying modulation symbol in each of the first type symbols is identical, wherein the target binary keying modulation symbol carries data of 1.
14. The method of claim 13, wherein or a cyclic shift value of a ZC sequence generating the first sequence is 0. The second operation comprises at least one of: scrambling, adding padding bits, or adding check information.
16. The method of claim 15, wherein The third information is divided into S third sub-information, and one third sub-information is transmitted on a target binary keying modulation symbol, wherein 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 of claim 16, further comprising: The third sub-information is indicated by a first sequence, wherein a cyclic shift step length N of the first sequence is determined according to one of the following formulas: cs The value of N is determined according to one of the following formulas: or wherein, N cs denotes a cyclic shift step size for generating the first sequence, N seq denotes a number of the first sequences, N root denotes a number of root sequences for generating the first sequence, B ZC denotes a length of a ZC sequence corresponding to the first sequence, M bitbyseq denotes a number of information bits carried in the third sub-information.
18. The method of claim 17, wherein, The N seq values include one of the following: M = 1, N seq = at least one of 2, 4, 8, and 16; M = 2, N seq = at least one of 2, 4, and 8; M = 4, N seq = 2 and at least one of 4; or Where M is the number of On / Off Keying (OOK) symbols included in an OFDM symbol, or the amount of data carried in an OFDM symbol.
19. The method of claim 17, wherein, The M bitbyseq values include one of the following: M = 1, M bitbyseq = at least one of 1, 2, 3, and 4; M = 2, M bitbyseq = at least one of 1, 2, and 3; or M = 4, M bitbyseq = 1 and 2 at least one of Where M is the number of OOK symbols included in an OFDM symbol, or the amount of data carried in an OFDM symbol.
20. The method of claim 16, wherein, The third information is transmitted repeatedly, and the number of times the repeated transmission is performed is determined by at least one of the following: Instruction information; the number of times of repeated transmission wherein This is a rounding down operation; the third quantity is the number of target binary keying modulation symbols in the first type of symbols of the first quantity, wherein 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; or the number of times of repeated transmission wherein This is a floor operation.
21. The method of claim 16, wherein, The output information after rate matching by the second operation of the S third sub-information includes F0, F1, F2,..., F E-1 wherein a value of E is determined by at least one of the following: Instruction information; wherein, This is a rounding down operation; the third quantity is the number of target binary keying modulation symbols in the first type of symbols of the first quantity, wherein 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; or wherein This is a floor operation.
22. The method according to claim 20, wherein, The third quantity cannot be divided by S, and the fourth quantity of target binary keying symbols carries 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 the third information divided into the third sub-information.
23. The method according to claim 20, wherein, The first quantity is not divisible by 2*S, the fourth quantity of target binary keying symbols carries 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 1 / 2 times the third quantity minus 2 times the number of repeated transmissions and the number of the third information divided into the third sub-information.
24. The method of claim 21, wherein, The third quantity cannot be divided by S, the fourth quantity of target binary keying symbols carries 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 E and the number of the third information divided into the third sub-information.
25. The method according to claim 21, wherein, The first quantity is not divisible by 2*S, and the fourth quantity of target binary keying symbols carries 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 1 / 2 times the third quantity minus 2 times the E and the product of the number of the third information divided into the third sub-information.
26. The method according to claim 2 or 4, further comprising: The fourth information is generated based on the second sequence and sent, wherein the fourth information is sent in a third number of first-class symbols.
27. The method of claim 26, wherein, In the second sequence, M elements are sent in M first-class symbols, or in 1 first-class symbol, where M is an integer greater than or equal to 1.
28. The method of claim 27, further comprising 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 the third sequence from the first sequence; or When the M value when generating the second information is different from the M value when generating the fourth information, the configuration information of the third sequence is indicated by signaling.
29. An electronic device, the electronic device comprising: One or more processors; Memory, configured to store 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 as described in any one of claims 1-28.
30. A computer-readable storage medium storing one or more programs, the one or more programs being executed by one or more processors to implement the information processing method as described in any one of claims 1-28.
31. A computer program product comprising a computer program that, when executed by a processor, implements the information processing method according to any one of claims 1-28.
