Communication method and apparatus, and storage medium

Through MC-OOK based on LP-WUS waveform generation and data sequence conversion, the high power consumption problem of 5G terminal devices in the idle state of wireless resource control is solved, the battery life is extended, and the operation complexity of the signal transmitter is reduced. Suitable for 5G and future communication systems.

WO2024234866A1PCT designated stage expired Publication Date: 2024-11-21ZTE CORP
View PDF 5 Cites 0 Cited by

Patent Information

Application Number
PCT/CN2024/086466
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-05-12
Filing Date
2024-04-07
Publication Date
2024-11-21

AI Technical Summary

Technical Problem

Existing 5G terminal devices consume high power in idle state of wireless resource control, resulting in short battery life. The introduced extended discontinuous reception mode may lead to high latency and cannot meet both battery life and low latency requirements.

Method used

Using MC-OOK based on LP-WUS waveform generation method, the data is filled in the frequency domain through DFT/FFT operation, reducing the operation complexity of the signal transmitting end, and reducing the operation complexity through preset formulas and data sequence conversion, supporting scrambling codes and Scenarios are not supported.

Benefits of technology

It effectively reduces the operation complexity of the signal transmitter, extends battery life, reduces power consumption, and does not increase additional hardware or software costs. It is suitable for 5G and future communication systems.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN2024086466_21112024_PF_FP_ABST
    Figure CN2024086466_21112024_PF_FP_ABST
Patent Text Reader

Abstract

Provided are a communication method and apparatus, and a storage medium. The communication method comprises: determining a second data sequence according to a first data sequence, wherein the number of elements comprised in the first data sequence is the same as the number of elements comprised in the second data sequence.
Need to check novelty before this filing date? Find Prior Art

Description

Communication method and device, and storage medium

[0001] This disclosure claims priority to Chinese patent application No. 202310541288.2, filed on May 12, 2023, the entire contents of which are incorporated herein by reference. Technical Field

[0002] The embodiments of the present disclosure relate to the field of communication technology, and in particular to a communication method and apparatus, and a storage medium. Background Art

[0003] To extend battery life, the 3rd Generation Partnership Project (3GPP) Rel-18 is considering introducing a low power wake-up (LP-WUS) mechanism. This mechanism involves a terminal device using a separate receiver to receive or detect a low power wake-up signal sent by a base station. Upon receiving or detecting the wake-up signal, the terminal device wakes up the main radio, turns it on, or puts it into operation, allowing it to transmit and receive data. When the terminal device does not receive or detect the low power wake-up signal, the main radio enters a deep sleep state or is turned off. This further reduces the power consumption of the terminal device.

[0004] Summary of the Invention

[0005] In one aspect, an embodiment of the present disclosure provides a communication method that determines a second data sequence based on a first data sequence, wherein the number of elements included in the first data sequence is the same as the number of elements included in the second data sequence.

[0006] In another aspect, an embodiment of the present disclosure provides a communication method, which includes: determining a fourth data sequence based on a first data sequence, wherein the fourth data sequence includes a greater number of elements than the first data sequence.

[0007] In another aspect, an embodiment of the present disclosure provides a communication device including: a determining unit configured to determine a second data sequence based on a first data sequence, wherein the number of elements included in the first data sequence is the same as the number of elements included in the second data sequence.

[0008] In another aspect, an embodiment of the present disclosure provides a communication device including: a determining unit configured to determine, based on a first data sequence, a fourth data sequence, wherein the fourth data sequence includes a greater number of elements than the first data sequence.

[0009] In yet another aspect, embodiments of the present disclosure provide a communication node. This communication node can implement the functions performed in the aforementioned aspects or possible designs, and the functions can be implemented in hardware. In one design, the communication node may include a processor and a communication interface, which can be used to support the communication node in implementing the functions involved in any of the aforementioned aspects or possible designs.

[0010] In yet another embodiment, the communication node may further include a memory for storing computer-executable instructions and data necessary for the apparatus. When the apparatus is in operation, the processor executes the computer-executable instructions stored in the memory to cause the apparatus to perform the communication method described in any one of the above aspects.

[0011] On the other hand, an embodiment of the present disclosure provides a computer-readable storage medium, which may be a readable non-volatile storage medium. The computer-readable storage medium stores computer instructions or programs, which, when run on a computer, enables the computer to execute the communication method described in any one of the above aspects.

[0012] On the other hand, an embodiment of the present disclosure provides a computer program product containing instructions, which, when executed on a computer, enables the computer to execute the communication method described in any one of the above aspects. BRIEF DESCRIPTION OF THE DRAWINGS

[0013] To more clearly illustrate the technical solutions of the present disclosure, the following briefly introduces the drawings required for use in some embodiments of the present disclosure. Obviously, the drawings described below are only drawings of some embodiments of the present disclosure, and those skilled in the art can also derive other drawings based on these drawings.

[0014] FIG1 is a schematic diagram of a method for determining time domain data according to some embodiments.

[0015] FIG2 is a schematic structural diagram of a communication system according to some embodiments.

[0016] FIG3 is a schematic diagram of a communication method according to some embodiments.

[0017] FIG4 is a schematic diagram of another communication method according to some embodiments.

[0018] FIG5 is a schematic diagram of a method for determining time domain data according to some embodiments.

[0019] FIG6 is a schematic diagram of a communication method according to some embodiments.

[0020] FIG7 is a schematic diagram of another communication method according to some embodiments.

[0021] FIG8 is a schematic structural diagram of a communication device according to some embodiments.

[0022] FIG9 is a schematic structural diagram of another communication device according to some embodiments. DETAILED DESCRIPTION

[0023] The technical solutions in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure.

[0024] In the description of the present disclosure, unless otherwise specified, " / " means "or", for example, A / B can mean A or B. "And / or" in this article is only a description of the association relationship of associated objects, indicating that there can be three relationships, for example, A and / or B can mean: only A, only B, and A and B. In addition, "at least one" means one or more, and "plurality" means two or more. Expressions such as "first" and "second" do not limit the quantity and execution order, and expressions such as "first" and "second" do not necessarily mean different. "At least one of the following items" or similar expressions refers to any combination of these items, including any combination of single items or plural items. For example, at least one of a, b, or c can mean: a, b, c, ab, ac, bc, or abc, and a, b, c can be single or multiple.

[0025] It should be noted that in this disclosure, expressions such as "exemplarily" or "for example" are used to indicate examples, illustrations, or explanations. Any embodiment or design described in this disclosure as "exemplary" or "for example" should not be construed as being preferred or advantageous over other embodiments or designs. Rather, the use of expressions such as "exemplarily" or "for example" is intended to present the relevant concepts in an illustrative manner.

[0026] In the embodiments of the present disclosure, "indication" can include direct indications and indirect indications. For example, using the indication information below as an example, the indication information can directly carry information A itself or its index to achieve the purpose of directly indicating information A. Alternatively, the indication information can also carry information B that is associated with information A, thereby achieving the purpose of indirectly indicating information A while indicating information B.

[0027] For fifth-generation (5G) communication systems, in addition to latency, reliability, and availability, energy efficiency of terminal devices is also crucial. Currently, 5G devices may need to be charged weekly or daily, depending on individual usage. Typically, 5G devices consume tens of milliwatts of power in the radio resource control (RRC) idle / inactive state and hundreds of milliwatts of power in the RRC connected state. Therefore, extending battery life is a prerequisite for improving energy efficiency and enhancing user experience.

[0028] The power consumption of a terminal device depends on the length of the configured wake-up cycle, such as the paging cycle. To meet battery life requirements, the higher-value extended discontinuous reception (eDRX) cycle can be used. However, this mode can result in high latency, making it unsuitable for services that require both battery life and low latency. Therefore, 3GPP Release 18 is considering introducing a low-power wake-up signaling mechanism.

[0029] The waveform of the LP-WUS may be generated using an on-off keying (OOK) modulation method.

[0030] When the LP-WUS waveform is generated using OOK modulation, since the OOK symbol occupies multiple subcarriers in the generated time-frequency domain, it is also called MC-OOK symbol, and the LP-WUS can be called MC-OOK based LP-WUS.

[0031] Based on the MC-OOK modulation mode, M consecutive MC-OOK based LP-WUS can be generated at one time, where M is a positive integer.

[0032] For example, the data sequence sent on M OOK symbols is S M =[s0,s1,s2,s3...,s M-1 ] as an example. Based on the preset formula, S M Convert and get the data sequence Q K .Q K The length of is K. K is a positive integer.

[0033] The preset formula may be the following equation.

[0034] A is a positive integer.

[0035] Alternatively, the preset formula may be the following equation.

[0036] In the above formula, A0+A1+…+A i …+A M-1 =K, 0≤i≤M-1. is the coefficient. The size can be set as needed and is not limited.

[0037] As shown in Figure 1, for the data sequence Q K Perform K-point discrete Fourier transform (DFT) / fast Fourier transform (FFT) operations to obtain the data sequence D K =[d0,d1,d2,d3,...,d K-1 ], and the data sequence D K Fill the K subcarriers corresponding to LP-WUS in the frequency domain.

[0038] When the bandwidth of the frequency domain includes N subcarriers, an N-point inverse discrete Fourier transform (IDFT) / inverse fast Fourier transform (IFFT) operation can be performed on the padding data on the N subcarriers to obtain the time domain data T of N sampling points. N =[t0,t1,t2,t3,...,t N-1 ].

[0039] In the above formula, T N =[t0,t1,t2,t3,...,t N-1 ] is the sampling data of M OOK time domain symbols. [t0,t1,t2,t3,...,t N / M-1 ] is the sampling point data of the first OOK time domain symbol in M ​​OOK time domain symbols, [t N / M ,t N / M+1 ,...,t 2N / M-1 ] is the sampling point data of the second OOK time domain symbol in M ​​OOK time domain symbols, and so on, [t (M-1)N / M ,t (M -1)N / M+1,...,t N-1 ] is the sampling point data of the Mth OOK time domain symbol among M OOK time domain symbols.

[0040] In the embodiment of the present disclosure, when sending the time domain data T of the N sampling points N Before that, you need to NA CP (cyclic prefix) operation is performed to obtain time domain data of (N+Ncp) sampling points, and then the time domain data of the (N+Ncp) sampling points can be sent.

[0041] Adding CP operation means adding data T N The last Ncp elements in the data are filled into the data T by cyclic shift N The starting position of the data is N+Ncp long.

[0042] In the above process of generating M MC-OOK based LP-WUS, K-point DFT / FFT operations and N-point IDFT / IFFT operations need to be performed, which increases the operation complexity of the signal transmitting end.

[0043] In view of this, an embodiment of the present disclosure provides an information transmission method for reducing the operational complexity of a signal transmitting end. In this method, the signal transmitting end can determine a second data sequence or a fourth data sequence based on a first data sequence. The number of elements included in the second data sequence is the same as the number of elements included in the first data sequence. The number of elements included in the fourth data sequence is greater than the number of elements included in the first data sequence. That is, in an embodiment of the present disclosure, the second data sequence can be determined based on the first data sequence, reducing the operations that need to be performed, thereby reducing the operational complexity of the signal transmitting end when generating an LP-WUS.

[0044] In addition, the method provided by the embodiment of the present disclosure does not require additional hardware / software, so there is no need to increase additional costs. At the same time, since no additional hardware / software is required, it can be sent simultaneously with other communication signals (such as 5G signals).

[0045] If the signal transmitting end does not support scrambling, the signal transmitting end can determine the second data sequence based on the first data sequence. For example, see the embodiment shown in FIG3 below. If the signal transmitting end supports scrambling, the signal transmitting end can determine the third data sequence based on the first data sequence. For example, see the embodiment shown in FIG6 below.

[0046] It should be noted that the technical solutions provided by the embodiments of the present disclosure can be applied to various communication systems, such as 6G communication systems, future evolution systems, or multiple communication convergence systems.

[0047] For example, FIG2 shows a schematic diagram of the structure of a communication system provided by an embodiment of the present disclosure. The communication system may include a signal transmitting end and a signal receiving end. The signal transmitting end may be communicatively connected to the signal receiving end. For example, the signal transmitting end and the signal receiving end may be communicatively connected via a wireless channel.

[0048] The signal transmitting end may be a network device or a terminal, and the signal receiving end may be a terminal or a network device.

[0049] Network devices can be used to implement functions such as terminal resource scheduling, wireless resource management, and wireless access control. For example, a network device can be a small base station, a wireless access point, one or a group of transmission receive points (TRPs), a transmission point (TP), or any other access node.

[0050] A terminal may also be referred to as a terminal device, user equipment (UE), mobile station, or mobile terminal. A terminal device may be a mobile phone, tablet computer, computer with wireless transceiver capabilities, virtual reality terminal device, augmented reality terminal device, wireless terminal for industrial control, wireless terminal for unmanned driving, wireless terminal for remote surgery, wireless terminal for transportation safety, wireless terminal for smart cities, or wireless terminal for smart homes. The embodiments of the present disclosure do not limit the device form factor of the terminal device.

[0051] It should be noted that FIG2 is merely exemplary, and the number of devices included in FIG2 and the names of the devices are not limited. In addition to the devices shown in FIG2 , the communication system may also include other devices, such as core network devices.

[0052] The application scenarios of the embodiments of the present disclosure are not limited. The system architecture and business scenarios described in the embodiments of the present disclosure are intended to more clearly illustrate the technical solutions of the embodiments of the present disclosure and do not constitute a limitation on the technical solutions provided by the embodiments of the present disclosure. It is known to those skilled in the art that with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided by the embodiments of the present disclosure are also applicable to similar technical problems.

[0053] The communication method provided by the embodiment of the present disclosure is described below in conjunction with the communication system shown in Figure 2. The actions, terms, etc. involved in the various embodiments of the present disclosure can refer to each other without limitation.

[0054] FIG3 shows a communication method according to some embodiments. As shown in FIG3 , the method may include S301 .

[0055] S301. A signal transmitting end determines a second data sequence according to a first data sequence.

[0056] The first data sequence can be the above data sequence S MThe first data sequence may also be referred to as first data information or first data signal or other names without limitation.

[0057] In some application scenarios, after acquiring the first data sequence, the signal transmitting end may obtain the LP-WUS based on the first data sequence. For example, reference may be made to the subsequent description.

[0058] In the embodiment of the present disclosure, the second data sequence may be F M =[f0,f1,f2,f3...,f M-1 ]. M is the number of elements included in the second data sequence, and M is a positive integer.

[0059] In the embodiment of the present disclosure, the first data sequence may carry one or more bits of information.

[0060] In an example, when the first data sequence carries one bit of information, the first data sequence is used to indicate one bit of information (eg, 1, 0).

[0061] For example, M=2, and the elements in the first data sequence may be as shown in Table 1.

[0062] Table 1

[0063] In Table 1, 1 and 2 in the first row are the index numbers of the elements in the first data sequence. 1 and 2 in the first column can be used to represent the index of the first data sequence. Different indexes correspond to different first data sequences. In Table 1, the bit information carried by each row of data can be set as needed. For example, when the first data sequence is {0, 1}, the bit information carried by the first data sequence can be 1; when the first data sequence is {1, 0}, the bit information carried by the first data sequence can be 0.

[0064] As another example, when the first data sequence is {0, 1}, the bit information carried by the first data sequence may also be 0; when the first data sequence is {1, 0}, the bit information carried by the first data sequence may also be 1.

[0065] In another example, M=4, the elements in the first data sequence may be as shown in Table 2.

[0066] Table 2

[0067] In Table 2, 1 to 4 in the first row are the index numbers of the elements in the first data sequence. 1 and 2 in the first column can be used to represent different indexes of the first data sequence. Different indexes correspond to different first data sequences. The bit information carried by each row of data in Table 2 can be set as needed. For example, when the first data sequence is {0, 1, 0, 1}, the bit information carried by the first data sequence can be 1; when the first data sequence is {1, 0, 1, 0}, the bit information carried by the first data sequence can be 0.

[0068] As another example, when the first data sequence is {0, 1, 0, 1}, the bit information carried by the first data sequence may also be 0; when the first data sequence is {1, 0, 1, 0}, the bit information carried by the first data sequence may also be 1.

[0069] In another example, M=8, the elements in the first data sequence may be as shown in Table 3.

[0070] Table 3

[0071] In Table 3, 1 to 8 in the first row are the index numbers of the elements in the first data sequence. 1 and 2 in the first column can be used to represent the indexes of different first data sequences. Different indexes correspond to different first data sequences. The bit information carried by each row of data in Table 3 can be set as needed. For example, when the first data sequence is {0, 1, 0, 1, 0, 1, 0}, the bit information carried by the first data sequence can be 1; when the first data sequence is {1, 0, 1, 0, 1, 0, 1, 0}, the bit information carried by the first data sequence can be 0.

[0072] As another example, when the first data sequence is {0, 1, 0, 1, 0, 1, 0, 1}, the bit information carried by the first data sequence may be 0; when the first data sequence is {1, 0, 1, 0, 1, 0, 1, 0}, the bit information carried by the first data sequence may be 1.

[0073] In another example, when the first data sequence carries multiple bits of information, one bit of information may correspond to multiple elements in the first data sequence.

[0074] For example, M=4, and the first data sequence carries 2 bits of information (such as 00, 01, 10, 11). The elements in the first data sequence may be as shown in Table 4.

[0075] Table 4

[0076] In Table 4, 1 to 4 in the first row are the index numbers of the elements in the first data sequence. 1 to 4 in the first column can be used to represent the indexes of different first data sequences. Different indexes correspond to different first data sequences. The bit information carried by each row of data in Table 4 can be set as needed. For example, when the first data sequence is {0,1,0,1}, the bit information carried by the first data sequence can be 00; when the first data sequence is {0,1,1,0}, the bit information carried by the first data sequence can be 01; when the first data sequence is {1,0,0,1}, the bit information carried by the first data sequence can be 10; when the first data sequence is {1,0,1,0}, the bit information carried by the first data sequence can be 11.

[0077] As another example, when the first data sequence is {1, 0, 1, 0}, the bit information carried by the first data sequence may be 00; when the first data sequence is {1, 0, 0, 1}, the bit information carried by the first data sequence may be 01; when the first data sequence is {0, 1, 1, 0}, the bit information carried by the first data sequence may be 10; when the first data sequence is {0, 1, 0, 1}, the bit information carried by the first data sequence may be 11.

[0078] For example, M=8, and the first data sequence carries 2 bits of information (such as 00, 01, 10, 11). The elements in the first data sequence may be as shown in Table 5.

[0079] Table 5

[0080] In Table 5, 1 to 8 in the first row are the index numbers of the elements in the first data sequence. 1 to 4 in the first column can be used to represent the indexes of different first data sequences. Different indexes correspond to different first data sequences. The bit information carried by each row of data in Table 5 can be set as needed. For example, when the first data sequence is {0,1,0,1,0,1,0,1}, the bit information carried by the first data sequence can be 00; when the first data sequence is {0,1,0,1,1,0,1,0}, the bit information carried by the first data sequence can be 01; when the first data sequence is {1,0,1,0,0,1,0,1}, the bit information carried by the first data sequence can be 10; when the first data sequence is {1,0,1,0,1,0,1,0}, the bit information carried by the first data sequence can be 11.

[0081] As another example, when the first data sequence is {1, 0, 1, 0, 1, 0, 1, 0}, the bit information carried by the first data sequence may be 00; when the first data sequence is {1, 0, 1, 0, 0, 1, 0, 1}, the bit information carried by the first data sequence may be 01; when the first data sequence is {0, 1, 0, 1, 1, 0, 1, 0}, the bit information carried by the first data sequence may be 10; when the first data sequence is {0, 1, 0, 1, 0, 1, 0, 1}, the bit information carried by the first data sequence may be 11.

[0082] For example, M=8, and the first data sequence carries 4 bits of information (e.g., 0000, 0001, 0010, 0011, 0100, 0101, 0110, 0111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111). The first data sequence may be as shown in Table 6.

[0083] Table 6

[0084] In Table 6, 1 to 8 in the first row represent the index numbers of the elements in the first data sequence. 1 to 16 in the first column can be used to represent different indexes of the first data sequence. Different indexes correspond to different first data sequences. The bit information carried by each row of data in Table 6 can be set as needed. For example, the bit information carried by the first row of data may be 0000, the bit information carried by the second row of data may be 0001, the bit information carried by the third row of data may be 0010, the bit information carried by the fourth row of data may be 0011, the bit information carried by the fifth row of data may be 0100, the bit information carried by the sixth row of data may be 0101, the bit information carried by the seventh row of data may be 0110, the bit information carried by the eighth row of data may be 0111, the bit information carried by the ninth row of data may be 1000, the bit information carried by the tenth row of data may be 1001, the bit information carried by the eleventh row of data may be 1010, the bit information carried by the twelfth row of data may be 1011, the bit information carried by the thirteenth row of data may be 1100, the bit information carried by the fourteenth row of data may be 1101, the bit information carried by the fifteenth row of data may be 1110, and the bit information carried by the sixteenth row of data may be 1111.

[0085] In another example, the bit information carried by the first row of data can be 1111, the bit information carried by the second row of data can be 1110, the bit information carried by the third row of data can be 1101, the bit information carried by the fourth row of data can be 1100, the bit information carried by the fifth row of data can be 1011, the bit information carried by the sixth row of data can be 1010, the bit information carried by the seventh row of data can be 1001, the bit information carried by the eighth row of data can be 1000, the bit information carried by the ninth row of data can be 0111, the bit information carried by the tenth row of data can be 0110, the bit information carried by the eleventh row of data can be 0101, the bit information carried by the twelfth row of data can be 0100, the bit information carried by the thirteenth row of data can be 0011, the bit information carried by the fourteenth row of data can be 0010, the bit information carried by the fifteenth row of data can be 0001, and the bit information carried by the sixteenth row of data can be 0000.

[0086] In one implementation, the signal transmitting end may process the first data sequence according to the first method to obtain the second data sequence.

[0087] The first method may include one of the following 1-1 to 1-5.

[0088] 1-1. M-point DFT.

[0089] In one example, each element in the second data sequence can be determined by a corresponding element in the first data sequence. For example, f0 can be determined by S0.

[0090] For example, the elements in the second data sequence In the above formula, 0≤k≤M-1.

[0091] Based on this approach, the signal transmitting end can perform an M-point DFT on the first data sequence to obtain the second data sequence, which is simple and convenient.

[0092] 1-2. M-point FFT.

[0093] The M-point FFT can refer to the existing technology and will not be described in detail.

[0094] Based on this approach, the signal transmitting end can perform an M-point FFT on the first data sequence to obtain the second data sequence, which is simple and convenient.

[0095] 1-3. M-point IDFT.

[0096] The M-point IDFT can refer to the existing technology and will not be described in detail.

[0097] Based on this approach, the signal transmitting end can perform M-point IDFT on the first data sequence to obtain the second data sequence, which is simple and convenient.

[0098] 1-4. M-point IFFT.

[0099] The M-point IFFT can refer to the existing technology and will not be described in detail.

[0100] Based on this approach, the signal transmitting end can perform an M-point IFFT on the first data sequence to obtain the second data sequence, which is simple and convenient.

[0101] 1-5. Generate according to the first preset formula.

[0102] The first preset formula may be preconfigured by the signal transmitting end. Alternatively, the first preset formula may be obtained by the signal transmitting end from another device, such as a core network device. The first preset formula may convert the first data sequence into the second data sequence using a transformation matrix. The transformation matrix includes multiple rows and multiple columns, and the number of elements included in the rows and the number of elements included in the columns are the same as the number of elements in the first data sequence.

[0103] In one example, the first preset formula may be the following equation.

[0104] In the above formula, m and k are both greater than or equal to 0 and less than or equal to M-1.

[0105] In yet another example, the first preset formula may be the following equation.

[0106] For example, when M=2, the first preset formula may be:

[0107] Alternatively, the first preset formula may also be:

[0108] For another example, when M=4, the first preset formula may be the following equation.

[0109] Alternatively, the first preset formula may also be the following equation.

[0110] For another example, when M=8, the first preset formula may be the following equation.

[0111] Alternatively, the first preset formula may also be the following equation.

[0112] Based on the implementation method, the signal sending end can operate on the first data sequence according to a preset formula to obtain the second data sequence, which is fast and convenient, and requires fewer operations, thereby reducing the operational complexity of the signal sending end.

[0113] Based on this approach, the signal sending end can preset a formula and perform operations on the first data sequence to obtain the second data sequence, which is fast and convenient.

[0114] In yet another implementation, the signal transmitting end may determine the second data sequence according to a preset correspondence between the first data sequence and the second data sequence.

[0115] For example, the signal transmitting end may be pre-configured with a preset correspondence between multiple data sequences, where the multiple data sequences include a first data sequence and a second data sequence.

[0116] Based on the method shown in FIG3 , in embodiments of the present disclosure, a second data sequence can be determined based on a first data sequence, reducing the number of operations required, thereby reducing the operational complexity of the signal transmitting end when generating an LP-WUS. For example, if the signal transmitting end does not support scrambling, the signal transmitting end can obtain a second data sequence containing the same number of elements as the first data sequence based on the first data sequence. This reduces the number of operations required while still allowing the second data sequence to be obtained, thus expanding the application scenarios of this method.

[0117] In addition, the method provided by the embodiment of the present disclosure does not require additional hardware / software, so there is no need to increase additional costs. At the same time, since no additional hardware / software is required, it can be sent simultaneously with other communication signals (such as 5G signals).

[0118] In some embodiments, the method provided by the embodiments of the present disclosure may further include: obtaining the first data sequence from the third data sequence according to the second method.

[0119] The second manner may include at least one of coding, modulation, modulation coding, or a mapping rule from the third data sequence to the first data sequence.

[0120] Coding, modulation, and modulation-coding can refer to existing technologies and are not described in detail here. The mapping rule from the third data sequence to the first data sequence can refer to a corresponding relationship or an operation method between the third data sequence and the second data sequence. For example, the mapping rule can be a mapping rule table or a formula. The mapping rule can be pre-configured by the signal transmitting end.

[0121] The third data sequence is used to carry bit information. The bit information can be the bit information carried by the first data sequence. For example, the third data sequence B X =[b0, b1, ..., bx-1 ]. X is a positive integer.

[0122] In the embodiment of the present disclosure, for the third data sequence B X Element b in i For different values ​​of , the corresponding processed data sequence can be In the above formula, Y is an integer greater than or equal to 1, and 0≤i≤X-1.

[0123] For example, when Y=2, b i and The corresponding relationship can be shown in Table 7 or Table 8.

[0124] Table 7

[0125] Table 8

[0126] For example, when Y=4, b i and The corresponding relationship is shown in Table 9 or Table 10.

[0127] Table 9

[0128] Table 10

[0129] When Y=8, b i and The corresponding relationship is shown in Table 11 or Table 12.

[0130] Table 11

[0131] Table 12

[0132] It should be noted that the data in Tables 7 to 12 above are only examples, and the data may also be other elements without limitation.

[0133] Based on this embodiment, the signal receiving end can accurately determine the first data sequence according to the third data sequence.

[0134] In some embodiments, as shown in FIG4 , the method provided by the embodiment of the present disclosure may further include S401 to S402 .

[0135] S401: Perform data padding on K subcarriers based on a second data sequence to obtain a padded data sequence.

[0136] K is an integer greater than or equal to 1. The K subcarriers are subcarriers occupied by the LU-LPS in the frequency domain.

[0137] For example, the data filled on K subcarriers can be D K =[d0,d1,d2,d3,...,d K-1 ].

[0138] The data filled on the subcarrier with index k is d k .d k According to the formula d k =b·a(k)·f k′ Generate.f k′ is an element in the above second data sequence.

[0139] In the above formula, 0≤k≤K-1, k′==mod(k,N s mod means remainder or modulus. For example, mod(x, y) returns the remainder after dividing x by y.

[0140] When 1≤k≤K-1, When k = 0, a(k) = N r In the above formula, N s =M.N r =K / N s b=sqrt(N s / K) or b=sqrt(1 / N r ).

[0141] S402 , performing N-point IDFT / IFFT operations on the padded data to obtain time domain data of N sampling points.

[0142] N sampling point data T N =[t0,t1,t2,t3,...,t N-1 ]. The N sampling point data may be the above-mentioned LP-WUS.

[0143] In one example, as shown in FIG5 , when the frequency domain includes N subcarriers, N-point IDFT / IFFT operations are performed on the padding data on the N subcarriers to obtain the time domain data T of N sampling points. N =[t0,t1,t2,t3,...,t N-1 ].

[0144] In the above formula, T N =[t0,t1,t2,t3,...,t N-1 ] is the sampling point data of M OOK time domain symbols. Time domain data T N In [t0,t1,t2,t3,...,t N / M-1 ] is the sampling point data of the first OOK time domain symbol in M ​​OOK time domain symbols, [tN / M ,t N / M+1 ,...,t 2N / M-1 ] is the sampling point data of the second OOK time domain symbol among the M OOK time domain symbols.

[0145] By analogy, [t (M-1)N / M ,,t(M-1)N / M+1,...,t N-1 ] is the sampling point data of the Mth OOK time domain symbol among M OOK time domain symbols.

[0146] In the embodiment of the present disclosure, after obtaining the time domain data of N sampling points, a CP operation may be performed on the time domain data of the N sampling points, and the time domain data after the CP operation is added may be sent to a signal receiving end.

[0147] The signal receiving end may be the signal receiving end in Figure 2. The operation of adding a CP may refer to the above description and will not be described in detail.

[0148] Based on this embodiment, in the embodiment of the present disclosure, after obtaining the data sequence to be transmitted, the corresponding time domain data can be obtained by filling the subcarriers occupied by the LU-WPS and performing an N-point IDFT / IFFT operation.

[0149] As shown in FIG6 , another communication method is provided in an embodiment of the present disclosure. As shown in FIG6 , the method may include S601 .

[0150] S601: A signal transmitting end determines a fourth data sequence according to a first data sequence.

[0151] The related description and determination method of the first data sequence can refer to the above S301 and will not be described in detail. The number of elements included in the fourth data sequence is greater than the number of elements included in the first data sequence.

[0152] In one implementation, the signal transmitting end may generate a fifth data sequence based on the first data sequence, and determine a fourth data sequence based on the fifth data sequence.

[0153] The fifth data sequence includes the same number of elements as the fourth data sequence.

[0154] In one example, the signal transmitting end may generate the fifth data sequence from the first data sequence according to a second preset formula. For example, the second preset formula may be the following equation.

[0155] In the above formula, P H is the fifth data sequence, M and Z are both positive integers, H is the number of elements included in the fifth data sequence, H=Z*M, is the coefficient.

[0156] In another example, the signal transmitting end may process the fifth data sequence according to the third method to obtain a fourth data sequence.

[0157] For example, the third method may include one of 2-1 to 2-5.

[0158] 2-1. H-point discrete Fourier transform.

[0159] The H-point discrete Fourier transform can refer to the existing technology and will not be described in detail.

[0160] 2-2. H-point fast Fourier transform.

[0161] The H-point fast Fourier transform can refer to the existing technology and will not be described in detail.

[0162] 2-3. H-point discrete Fourier inverse transform.

[0163] The H-point inverse discrete Fourier transform can refer to the existing technology and will not be described in detail.

[0164] 2-4. Inverse fast Fourier transform of point H.

[0165] The H-point inverse fast Fourier transform can refer to the existing technology and will not be described in detail.

[0166] 2-5. Generate according to the third preset formula.

[0167] The third preset formula may be the following equation.

[0168] Alternatively, the third preset formula may be the following equation.

[0169] In the above formula, m and k are both greater than or equal to 0 and less than or equal to H-1, R0 to R H-1 are the elements in the fourth data sequence, P0 to P H-1 is an element in the fifth data sequence.

[0170] Based on the technical solution of FIG6 , in an embodiment of the present disclosure, the signal transmitting end can obtain a data sequence including more data elements based on the first data sequence. This data sequence can be the data sequence to be transmitted. In this way, the signal transmitting end does not need to perform DFT / FFT operations and IDFT / IFFT operations on the first data sequence, reducing the number of operations and thus reducing the complexity of the operation. For example, when the signal transmitting end supports scrambling, the signal transmitting end can obtain a second data sequence including more elements than the first data sequence based on the first data sequence. While reducing the number of operations to be performed, the second data sequence can also be obtained, expanding the application scenarios of the method.

[0171] In some embodiments, as shown in FIG7 , the method provided by the embodiment of the present disclosure may further include S701 and S702 .

[0172] S701: Perform data padding on K subcarriers based on a fourth data sequence to obtain a padded data sequence.

[0173] S702 : Perform an N-point IDFT / IFFT operation on the padded data sequence to obtain time domain data of N sampling points.

[0174] The above S701 and S702 can refer to the relevant descriptions of the above S401 and S402 and are not described in detail.

[0175] The various solutions in the above embodiments of the present disclosure can be combined without contradiction.

[0176] It is understandable that, in order to implement the above functions, the communication device includes hardware structures and / or software modules corresponding to the execution of each function. It should be easily appreciated by those skilled in the art that, in combination with the algorithm steps of each example described in the embodiments of the present disclosure, the present disclosure can be implemented in the form of hardware or a combination of hardware and computer software. Whether a function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Professional and technical personnel can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of the present disclosure.

[0177] The embodiments of the present disclosure can divide the functional modules of the communication device according to the above-mentioned method embodiments. For example, each functional module can be divided corresponding to each function, or two or more functions can be integrated into one functional module. The above-mentioned integrated modules can be implemented in the form of hardware or software. It should be noted that the division of modules in the embodiments of the present disclosure is schematic and is only a logical functional division. In actual implementation, there may be other division methods. The following is an example of dividing each functional module corresponding to each function.

[0178] FIG8 is a schematic diagram of the structure of a communication device provided by an embodiment of the present disclosure, which can execute the communication method provided by the above method embodiment. As shown in FIG8 , the communication device includes a determining unit 801 .

[0179] The determining unit 801 is configured to determine a second data sequence based on the first data sequence. The number of elements included in the first data sequence is the same as the number of elements included in the second data sequence.

[0180] In one example, determining unit 801 is configured to process a first data sequence according to a first method to obtain a second data sequence. The first method includes one of the following: an M-point discrete Fourier transform; or an M-point fast Fourier transform; or an M-point inverse discrete Fourier transform; or an M-point inverse fast Fourier transform; or generating according to a first preset formula, where M is the number of elements included in the first data sequence, and M is a positive integer.

[0181] In one example, the first preset formula is the following equation.

[0182] or,

[0183] In the above formula, m and k are both greater than or equal to 0 and less than or equal to M-1, f0~f M-1 are the elements in the second data sequence, s0~s M-1 is an element in the first data sequence.

[0184] In one example, M=2, and the first preset formula is the following equation.

[0185] or,

[0186] In one example, M=4, and the first preset formula is the following equation.

[0187] or,

[0188] In one example, M=8, and the first preset formula is the following equation.

[0189] or,

[0190] In some examples, the determination unit 801 is configured to determine the second data sequence based on a preset correspondence between the first data sequence and the second data sequence.

[0191] In some examples, the first data sequence carries one or more bits of information.

[0192] In some examples, when the first data sequence carries one bit of information, the one bit of information corresponds to all elements in the first data sequence. When the first data sequence carries multiple bits of information, each bit of the multiple bits of information corresponds to multiple elements in the first data sequence.

[0193] In some examples, as shown in Figure 8, the device may also include a processing unit 802 for: obtaining a first data sequence from a third data sequence according to a second method; the second method includes at least one of the following: encoding; or modulation; or modulation coding; or a mapping rule from the third data sequence to the first data sequence.

[0194] In some examples, the third data sequence is used to carry bit information.

[0195] In some embodiments, the determining unit 801 in the communication device shown in FIG8 is configured to: determine a fourth data sequence based on the first data sequence; the number of elements included in the fourth data sequence is greater than the number of elements included in the first data sequence.

[0196] In some examples, the determining unit 801 is configured to generate a fifth data sequence based on the first data sequence, and determine a fourth data sequence based on the fifth data sequence, wherein the number of elements included in the fifth data sequence is the same as the number of elements included in the fourth data sequence.

[0197] In some examples, the determining unit 801 is configured to generate the fifth data sequence from the first data sequence according to a second preset formula. The second preset formula is the following equation.

[0198] In the above formula, P H is the fifth data sequence, M and Z are both positive integers, H is the number of elements included in the fifth data sequence, H=Z*M, is the coefficient, s0~s M-1 The elements included in the first data sequence.

[0199] In some examples, determination unit 801 is used to: process the fifth data sequence according to a third method to obtain a fourth data sequence; the third method includes one of the following: H-point discrete Fourier transform; or, H-point fast Fourier transform; or, H-point inverse discrete Fourier transform; or, H-point inverse fast Fourier transform; or, generated according to a third preset formula.

[0200] In some examples, the third preset formula is the following equation.

[0201] or,

[0202] In the above formula, m and k are both greater than or equal to 0 and less than or equal to H-1, R0 to R H-1 are the elements in the fourth data sequence, P0 to P H-1 is an element in the fifth data sequence.

[0203] In some examples, the first data sequence carries one or more bits of information.

[0204] In some examples, when the first data sequence carries one bit of information, the one bit of information corresponds to all elements in the first data sequence. When the first data sequence carries multiple bits of information, each bit of the multiple bits of information corresponds to multiple elements in the first data sequence.

[0205] In some examples, the processing unit 802 is used to: obtain the first data sequence from the third data sequence according to the second method; the second method includes at least one of the following: encoding; or modulation; or modulation coding; or a mapping rule from the third data sequence to the first data sequence.

[0206] In some examples, the third data sequence is used to carry bit information.

[0207] In the case of implementing the functions of the above-mentioned integrated modules in hardware, the embodiments of the present disclosure provide another structure of the communication device involved in the above-mentioned embodiments. As shown in Figure 9, the communication device 90 includes: a processor 902 and a bus 904. In some embodiments, the communication device may also include a memory 901; in some embodiments, the communication device may also include a communication interface 903.

[0208] Processor 902 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the embodiments of this disclosure. Processor 902 may be a central processing unit, a general-purpose processor, a digital signal processor, an application-specific integrated circuit, a field-programmable gate array, or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Processor 902 may implement or execute the various exemplary logic blocks, modules, and circuits described in conjunction with the embodiments of this disclosure. Processor 902 may also be a combination that implements computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

[0209] The communication interface 903 is used to connect to other devices via a communication network, such as Ethernet, wireless access network, wireless local area network (WLAN), etc.

[0210] The memory 901 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of dynamic storage device that can store information and instructions, or an electrically erasable programmable read-only memory (EEPROM), a disk storage medium or other magnetic storage device, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto.

[0211] As an implementation, the memory 901 may exist independently of the processor 902. The memory 901 may be connected to the processor 902 via a bus 904 and used to store instructions or program codes. When the processor 902 calls and executes the instructions or program codes stored in the memory 901, the communication method provided in the embodiments of the present disclosure can be implemented.

[0212] In another implementation, the memory 901 may also be integrated with the processor 902 .

[0213] Bus 904 can be an Extended Industry Standard Architecture (EISA) bus, etc. Bus 904 can be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, FIG9 shows only one thick line, but this does not mean that there is only one bus or only one type of bus.

[0214] Some embodiments of the present disclosure provide a computer-readable storage medium (e.g., a non-transitory computer-readable storage medium), which stores computer program instructions. When the computer program instructions are executed on a computer, the computer executes the communication method described in any of the above embodiments.

[0215] Exemplarily, the above-mentioned computer-readable storage media may include, but are not limited to: magnetic storage devices (e.g., hard disks, floppy disks, or magnetic tapes, etc.), optical disks (e.g., compact disks (CDs), digital versatile disks (DVDs), etc.), smart cards, and flash memory devices (e.g., erasable programmable read-only memories (EPROMs), cards, sticks, or key drives, etc.). The various computer-readable storage media described in the present disclosure may represent one or more devices and / or other machine-readable storage media for storing information. The term "machine-readable storage medium" may include, but is not limited to, wireless channels and various other media capable of storing, containing, and / or carrying instructions and / or data.

[0216] An embodiment of the present disclosure provides a computer program product comprising instructions. When the computer program product is run on a computer, the computer is enabled to execute the communication method described in any one of the above embodiments.

[0217] The above is only a specific embodiment of the present disclosure, but the scope of protection of the present disclosure is not limited thereto. Any changes or replacements within the technical scope disclosed in the present disclosure should be included in the scope of protection of the present disclosure. Therefore, the scope of protection of the present disclosure should be based on the scope of protection of the claims.

Claims

1. A communication method, comprising: A second data sequence is determined based on a first data sequence; wherein the number of elements included in the first data sequence is the same as the number of elements included in the second data sequence.

2. The method according to claim 1, wherein: The step of determining the second data sequence according to the first data sequence includes: According to a first method, the first data sequence is processed to obtain the second data sequence; wherein the first method includes one of the following: M-point discrete Fourier transform; or, M-point fast Fourier transform; or, M-point inverse discrete Fourier transform; or, M-point inverse fast Fourier transform; or, Generated according to a first preset formula; Wherein, M is the number of elements included in the first data sequence, and M is a positive integer.

3. The method according to claim 2, wherein: The first preset formula is: or, Where m and k are both greater than or equal to 0 and less than or equal to M-1, f0~f M-1 are the elements in the second data sequence, s0 to s M-1 is an element in the first data sequence.

4. The method according to claim 2, wherein: M=2, the first preset formula is: or, 5. The method according to claim 2, wherein: M=4, the first preset formula is: or, 6. The method according to claim 2, wherein: M=8, the first preset formula is: or, 7. The method according to claim 1, wherein: The determining the second data sequence according to the first data sequence includes: The second data sequence is determined according to a preset corresponding relationship between the first data sequence and the second data sequence.

8. The method according to claim 1, wherein: The first data sequence carries one or more bits of information.

9. The method according to claim 8, wherein: In the case where the first data sequence carries one bit of information, the one bit of information corresponds to all elements in the first data sequence; In the case where the first data sequence carries multiple bits of information, each bit of the multiple bits of information corresponds to multiple elements in the first data sequence.

10. The method according to claim 1, further comprising: According to a second method, the first data sequence is obtained from a third data sequence; wherein the second method includes at least one of the following: Encoding; or, Modulation; or Modulation coding; or, A mapping rule from the third data sequence to the first data sequence.

11. The method according to claim 10, wherein: The third data sequence is used to carry bit information.

12. A communication method, comprising: A fourth data sequence is determined based on the first data sequence; wherein the number of elements included in the fourth data sequence is greater than the number of elements included in the first data sequence.

13. The method according to claim 12, wherein: The step of determining the fourth data sequence according to the first data sequence includes: A fifth data sequence is generated based on the first data sequence, and the fourth data sequence is determined based on the fifth data sequence, wherein the number of elements included in the fifth data sequence is the same as the number of elements included in the fourth data sequence.

14. The method according to claim 13, wherein: Generating a fifth data sequence according to the first data sequence includes: The fifth data sequence is generated from the first data sequence according to a second preset formula; wherein the second preset formula is: Among them, P H is the fifth data sequence, M and Z are both positive integers, H is the number of elements included in the fifth data sequence, H=Z*M, is the coefficient, s0~s M-1 The elements included in the first data sequence.

15. The method according to claim 13 or 14, wherein: The step of determining the fourth data sequence according to the fifth data sequence comprises: According to a third method, the fifth data sequence is processed to obtain the fourth data sequence; wherein the third method includes the following One of: H-point discrete Fourier transform; or, H-point fast Fourier transform; or, H-point inverse discrete Fourier transform; or, H-point inverse fast Fourier transform; or, Generated according to a third preset formula.

16. The method according to claim 15, wherein: The third preset formula is: or, Where m and k are both greater than or equal to 0 and less than or equal to H-1, R0~R H-1 are elements in the fourth data sequence, P0~P H-1 is an element in the fifth data sequence.

17. The method according to claim 12, wherein: The first data sequence carries one or more bits of information.

18. The method according to claim 17, wherein: In the case where the first data sequence carries one bit of information, the one bit newly corresponds to all elements in the first data sequence; In the case where the first data sequence carries multiple bits of information, each bit of information in the multiple bits corresponds to multiple elements in the first data sequence.

19. The method according to claim 12, further comprising: According to a second method, the first data sequence is obtained from a third data sequence; wherein the second method includes at least one of the following: coding; Modulation; or Modulation coding; A mapping rule from the third data sequence to the first data sequence.

20. The method according to claim 19, wherein: The third data sequence is used to carry bit information.

21. A communication device, comprising a memory, a processor, and computer program instructions stored in the memory and executable on the processor, wherein the processor implements the method according to any one of claims 1 to 20 when executing the computer program instructions.

22. A computer-readable storage medium, wherein: The computer-readable storage medium includes computer instructions; Wherein, when the computer instructions are executed, the method according to any one of claims 1-20 is implemented.

Citation Information

Patent Citations

  • Communication method and device and storage medium

    CN117955789A

  • Signal generation method, signal receiving method, communication equipment and storage medium

    CN115883046A

  • Communication method and device

    CN116073971A

  • Wireless communication apparatus

    US20100118692A1

  • Signal transmission method and apparatus

    WO2023039766A1