Data transmission method, and device and storage medium
By convolutional modulation and merging the data sequence, the problem of high PAPR in high-frequency communication is solved, the power amplifier efficiency and signal-to-noise ratio are improved, and the low PAPR needs of 6G communication is met.
Patent Information
- Application Number
- PCT/CN2024/129903
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2024-02-01
- Filing Date
- 2024-11-05
- Publication Date
- 2025-08-07
AI Technical Summary
In high-frequency scenarios, the Peak to Average Power Ratio (PAPR) of the signal is high, resulting in low power amplifier efficiency, insufficient signal-to-noise ratio and signal-to-interference plus noise ratio (SINR) and cannot meet the low PAPR requirements of 6G communication.
By convolutionally modulating the pre-generated first data sequence and the second data sequence, the third data sequence is formed and merged into the fourth data sequence, ensuring that the non-zero elements in the second data sequence are conjugated and not equal, and PAPR is reduced.
It effectively reduces the signal modulation method PAPR, improves the power amplifier efficiency, improves the signal-to-noise ratio and SINR, and meets the low PAPR requirements of 6G communication.
Smart Images

Figure CN2024129903_07082025_PF_FP_ABST
Abstract
Description
Data transmission method, device and storage medium Technical Field
[0001] The present application relates to the field of communication technology, and in particular to a data transmission method, device and storage medium. Background Art
[0002] In high-frequency scenarios, path loss and shadow fading are significant, resulting in very low signal-to-noise ratios (SNRs) in certain areas at the cell edge. Furthermore, in high-frequency scenarios, power amplifier (PA) efficiency is relatively low. To improve the SNR while also conserving battery power in user equipment (UE), the peak-to-average power ratio (PAPR) of the UE's transmitted signal needs to be low.
[0003] In the massive machine type communication (mMTC) scenario, some user terminals hope to significantly save battery power consumption, for example, expecting a battery life of more than ten years. Therefore, in order to improve the efficiency of the power amplifier (PA) of the terminal, the peak to average power ratio (PAPR) of the UE transmitted signal needs to be relatively low. In the case of non-orthogonal access by a large number of users, the signal to interference plus noise ratio (SINR) will be very low. Therefore, there is an urgent need to use a signal modulation method with a low coding and coding scheme (MCS) and low PAPR.
[0004] Although discrete Fourier transform-spread-orthogonal frequency division multiplexing (DFT-s-OFDM) signals have a relatively low PAPR, they cannot meet the lower PAPR requirements of 6G applications. Therefore, designing a modulation technology to reduce PAPR is an urgent problem to be solved.
[0005] Summary of the Invention
[0006] In view of this, embodiments of the present application provide a data transmission method, device, and storage medium, which effectively reduce the PAPR of a signal modulation method.
[0007] The present invention provides a data transmission method, including:
[0008] Performing convolution modulation on the pre-generated first data sequence and the second data sequence to obtain a third data sequence;
[0009] Combining the first data sequence and the third data sequence to form a fourth data sequence;
[0010] Transmitting the fourth data sequence on physical time-frequency resources;
[0011] The values of the two non-zero elements in the second data sequence are conjugate to each other, and the values of the two non-zero elements are not equal.
[0012] An embodiment of the present application provides a communication device, comprising: a memory, and one or more processors;
[0013] The memory is configured to store one or more programs;
[0014] When the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any one of the above embodiments.
[0015] An embodiment of the present application provides a storage medium storing a computer program. When the computer program is executed by a processor, the method described in any one of the above embodiments is implemented. BRIEF DESCRIPTION OF THE DRAWINGS
[0016] FIG1 is a flow chart of a data transmission method provided in an embodiment of the present application;
[0017] FIG2 is a schematic diagram of a configuration of a constellation diagram provided in an embodiment of the present application;
[0018] FIG3 is a schematic diagram of a configuration of a first data sequence provided in an embodiment of the present application;
[0019] FIG4 is a schematic diagram of an implementation of a multipath delay operation provided in an embodiment of the present application;
[0020] FIG5 is a schematic diagram of waveform modulation of a fourth data sequence provided by an embodiment of the present application;
[0021] FIG6 is a structural block diagram of a data transmission device provided in an embodiment of the present application;
[0022] FIG7 is a schematic structural diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION
[0023] The following describes the embodiments of the present application in conjunction with the accompanying drawings. The following describes the present application in conjunction with the accompanying drawings. The examples are only used to explain the present application and are not used to limit the scope of the present application.
[0024] In one embodiment, FIG1 is a flow chart of a data transmission method provided by an embodiment of the present application. This embodiment is applied to designing a signal modulation method for reducing PAPR. As shown in FIG1 , this embodiment includes: S110-S130.
[0025] S110 , perform convolution modulation on the pre-generated first data sequence and the second data sequence to obtain a third data sequence.
[0026] The values of the two non-zero elements in the second data sequence are conjugate to each other, and the values of the two non-zero elements are unequal. In one example, the first data sequence, the second data sequence, and the third data sequence are all time domain data. In one example, the second data sequence includes two non-zero elements, and the values of the two non-zero elements are conjugate to each other, and the values of the two non-zero elements are unequal.
[0027] S120: Combine the first data sequence and the third data sequence to form a fourth data sequence.
[0028] The process of merging the first data sequence with the third data sequence can be understood as the process of interpolating elements from the first data sequence with elements from the third data sequence to generate a fourth data sequence. This ensures that each element in the original first data sequence remains orthogonal and does not interfere with each other, thereby lowering the peak-to-average value ratio of the fourth data sequence. In one example, the fourth data sequence is also time-domain data.
[0029] S130. Transmit a fourth data sequence on physical time-frequency resources.
[0030] In one embodiment, the second data sequence includes the following two non-zero elements: a first element and a second element.
[0031] In one embodiment, the modulus of the first element is equal to the modulus of the second element. In one example, the modulus of the first element and the modulus of the second element can be
[0032] In one embodiment, the complex phase of the first element and the complex phase of the second element are opposite to each other. The complex phase of the first element refers to the phase of the first element taken as a complex number; the complex phase of the second element refers to the phase of the second element taken as a complex number. In one example, the opposite complex phase of the first element and the complex phase of the second element can be understood as the sum of the complex phases of the first element and the second element being 0.
[0033] In one embodiment, the complex phase of the first element and the complex phase of the second element each include one of the following:
[0034] The complex phase of the ratio between the first and second elements is In one example, the complex phase of the first element is In the case of , the corresponding complex phase of the second element is In one example, the complex phase of the first element is In the case of , the corresponding complex phase of the second element is
[0035] In one embodiment, the second data sequence includes one of the following: In one example, the value of the first element is In the case of , the corresponding second element is In one example, the value of the first element is In the case of , the corresponding second element is
[0036] In one embodiment, the sum of the first element and the second element is equal to 1. In one example, the sum of the value of the first element and the value of the second element is 1.
[0037] In one embodiment, the data transmission method further includes: performing constellation point modulation on a pre-generated binary data sequence to obtain a first data sequence; wherein the binary data sequence and the first data sequence each include at least two elements. The binary data sequence is a data sequence consisting of 0s and 1s, and the number of elements in the binary data sequence is greater than 1. Constellation point modulation may include, but is not limited to, binary phase shift keying (BPSK) constellation point modulation. In one example, a binary data sequence may be pre-generated and BPSK constellation point modulation may be performed on the binary data sequence to obtain the first data sequence.
[0038] In one embodiment, the first data sequence is a binary phase shift keying (BPSK) modulation sequence.
[0039] In one embodiment, the first data sequence includes one of the following: constellation point modulation data; constellation point modulation data and reference signal data. The number of reference signal data may be at least one, and both the reference signal data and the constellation point modulation data are BPSK modulated.
[0040] In one embodiment, combining the first data sequence and the third data sequence to form a fourth data sequence includes one of the following:
[0041] Inserting each element of the third data sequence between every two elements of the first data sequence;
[0042] Each element of the first data sequence is inserted between every two elements of the third data sequence; wherein the last extra element is placed at the last position or the first position of the fourth data sequence.
[0043] In one embodiment, in the fourth data sequence, each element originally in the first data sequence is not adjacent, and each element originally in the third data sequence is not adjacent. In the generated fourth data sequence, each element originally in the first data sequence is not adjacent, and each element originally in the third data sequence is not adjacent.
[0044] In one embodiment, the convolution modulation operation includes one of the following: circular convolution; and multipath delay operation.
[0045] In one embodiment, when the convolution modulation operation includes a multipath delay operation and the second data sequence includes two non-zero elements, the two non-zero elements in the second data sequence are coefficients of two delay paths. For example, assuming that the second data sequence includes two non-zero elements, namely [a, c], that is, a and c are coefficients of two delay paths.
[0046] In one embodiment, the delay difference of the delay path corresponding to the first element in the second data sequence is 0; the delay difference of the delay path corresponding to the second element in the second data sequence is 1. For example, assuming that the first element is a and the second element is c, the delay difference of the delay path corresponding to the first element (i.e., the first element) in the second data sequence is 0; the delay difference of the delay path corresponding to the second element in the second data sequence is 1.
[0047] In one embodiment, performing convolution modulation on a pre-generated first data sequence and a second data sequence to obtain a third data sequence includes: performing a multipath cyclic delay operation on the pre-generated first data sequence with a delay path of a first value to obtain the third data sequence; wherein the first value is the sum of the product value between the first element in the second data sequence and the corresponding delay path, and the product value between the second element in the second data sequence and the corresponding delay path. In this embodiment, the first value may be aD 0 +cD 1 , accordingly, the first data sequence experiences a delay path of aD 0 +cD 1 The third data sequence can be obtained by performing multipath cyclic delay operation. 0 Corresponding to the path with a delay difference of 0 (i.e. no delay), D 1The corresponding path has a delay difference of 1. In the first data sequence, the distance between adjacent elements is equal to the delay difference of ±1.
[0048] In one embodiment, convolution modulation is performed on a pre-generated first data sequence and a second data sequence to obtain a third data sequence, including: performing circular convolution on the pre-generated first data sequence and the second data sequence to obtain the third data sequence; wherein the coefficient of the delay path with a delay difference of 0 is equal to the first element in the second data sequence, and the coefficient of the delay path with a delay difference of 1 is equal to the second element in the second data sequence. Exemplarily, the two non-zero elements in the second data sequence are denoted as [d(0), d(1)], the first element is denoted as a, and the second element is denoted as c, wherein d(0) = a, d(1) = c. The first data sequence can be circularly convolved with the data sequence [d(0), d(1)] to obtain the corresponding third data sequence.
[0049] In one embodiment, convolution modulation is performed on a pre-generated first data sequence and a second data sequence to obtain a third data sequence, including: performing circular convolution on the pre-generated first data sequence and the second data sequence to obtain the third data sequence; wherein the first element in the second data sequence is the first element, the second element is the second element, and the other elements are 0; the length of the second data sequence is equal to the length of the first data sequence. Assuming that the second data sequence is recorded as data sequence [d(v)], the first element is recorded as a, and the second element is recorded as c, then the first element d(0) in the second data sequence is a, the second element d(1) is c, and the other elements d(v) are 0, v is 0, 1, 2, ..., V-1; V is equal to the length of the first data sequence.
[0050] In one embodiment, convolution modulation is performed on a pre-generated first data sequence and a second data sequence to obtain a third data sequence, including: performing convolution modulation on the pre-generated first data sequence and the second data sequence to obtain the third data sequence; wherein the second data sequence and the first data sequence contain the same number of elements. Assuming that the non-zero elements in the second data sequence are denoted as [a, c], after appropriately padding [a, c] with zeros, a second data sequence [d(v)] containing zero elements and non-zero elements is formed, and then the first data sequence is convolutionally modulated with the second data sequence [d(v)] to obtain the third data sequence.
[0051] In one embodiment, the data transmission method further includes: multiplying the fourth data sequence by a preconfigured complex constant to obtain a new fourth data sequence; wherein the fourth data sequence is subjected to at least one of the following operations: adding a reference sequence; Fourier transform; frequency domain shaping; inverse Fourier transform; or filtering. In one example, the fourth data sequence may be subjected to a Fourier transform, a frequency domain shaping, and an inverse Fourier transform in sequence to obtain the new fourth data sequence; or the fourth data sequence may be subjected to a Fourier transform, a frequency domain shaping, an inverse Fourier transform, and filtering in sequence to obtain the new fourth data sequence, and then the new fourth data sequence is transmitted on the physical time-frequency resources.
[0052] It should be noted that in the following examples, the data modulation process is described by taking the second data sequence including two non-zero elements (ie, a first element and a second element) as an example, wherein the first element is denoted as a and the second element is denoted as c.
[0053] Example 1: This embodiment is an example of performing convolution modulation on a first data sequence and a second data sequence including two non-zero elements [a, c].
[0054] In this embodiment, a first data sequence is convolved with a second data sequence containing two non-zero elements [a, c] to form a third data sequence. The first and third data sequences are then combined to form a fourth data sequence. The elements a and c of the two non-zero elements [a, c] in the second data sequence satisfy the following conditions: a = conjugate(c), a ≠ c, and conjugate(.) is a conjugate operation. For example, Table 1 illustrates the case where the second data sequence contains two non-zero elements [a, c].
[0055] Table 1 The second data sequence contains two non-zero elements [a, c]
[0056] The elements a and c in the two non-zero elements [a, c] of the second data sequence include the following features:
[0057] (1) module(.) is the modulus operation;
[0058] (2)φ(a)=-φ(c)=±π / 4;φ(a / c)=±π / 2;φ(.) is the phase of the complex number;
[0059] (3)a+c=1.
[0060] Example 2: This embodiment is an example of forming a first data sequence [x(i)].
[0061] A binary data sequence [b(m)] consisting of 0s and 1s is constellation-modulated to form a first data sequence [x(i)]. In this embodiment, the first data sequence [x(i)] is a BPSK-modulated sequence. The constellation set of the first data sequence [x(i)] is: [exp(j*θ), exp(j*(pi+θ))], where the moduli of these two constellation points are both 1 and the phase difference is pi. Figure 2 is a schematic diagram of a constellation diagram configuration provided in an embodiment of the present application.
[0062] As shown in (1) in FIG2 , when θ=0, the constellation set of the first data sequence [x(i)] is: [1, -1];
[0063] As shown in (2) in FIG2 , when θ=pi / 4, the constellation set of the first data sequence [x(i)] is:
[0064] As shown in (3) in FIG2 , when θ=pi / 2, the constellation set of the first data sequence [x(i)] is: [j, -j];
[0065] As shown in (4) in FIG2 , when θ=3*pi / 4, the constellation set of the first data sequence [x(i)] is:
[0066] Example 3: This embodiment is an example in which the first data sequence [x(i)] includes reference signal data and constellation point modulation data.
[0067] FIG3 is a schematic diagram illustrating the configuration of a first data sequence according to an embodiment of the present application. As shown in FIG3 , assuming there are n OFDM symbols, each OFDM symbol includes reference signal data and constellation point modulated data. The same header reference signal sequence is inserted before each OFDM symbol, and the same tail reference signal sequence is inserted after each OFDM symbol. Both the reference signal data and the constellation point modulated data are modulated using BPSK. A first data sequence [x(i)] is transmitted over the OFDM symbols.
[0068] Example 4: This embodiment is an example of performing convolution modulation on a first data sequence modulated by BPSK and a second data sequence including two non-zero elements [a, c].
[0069] In this embodiment, a first data sequence is convolutionally modulated with a second data sequence containing two non-zero elements [a, c] to form a third data sequence; and the first data sequence and the third data sequence are combined to form a fourth data sequence. The convolution modulation implementation process includes:
[0070] (1) First, a binary data sequence [b(m)] consisting of 0s and 1s is modulated by the BPSK constellation point to form the first data sequence [x(i)];
[0071] (2) Then the first data sequence [x(i)] is circularly convolved with the second data sequence containing two non-zero elements [a, c] to form a third data sequence;
[0072] (3) Each element of the third data sequence is then inserted between every two elements of the first data sequence to form a fourth data sequence. The extra element is placed at the last or first position of the fourth data sequence.
[0073] Example 5: This embodiment is an example of performing convolution modulation on a first data sequence modulated by BPSK and a second data sequence including two non-zero elements [a, c].
[0074] In this embodiment, a first data sequence is convolutionally modulated with a second data sequence containing two non-zero elements [a, c] to form a third data sequence; and the first data sequence and the third data sequence are combined to form a fourth data sequence. The convolution modulation implementation process includes:
[0075] (1) First, a binary data sequence [b(m)] consisting of 0s and 1s is modulated by BPSK constellation points to form a first data sequence [x(i)]. Assume that the first data sequence [x(i)] = [1, 1, -1, -1, 1].
[0076] (2) Then the first data sequence [x(i)] is circularly convolved with the second data sequence containing two non-zero elements [a, c] to form a third data sequence; assuming that the second data sequence contains two non-zero elements Then the third data sequence is:
[0077] (3) Then insert each element of the third data sequence between every two elements of the first data sequence to form a fourth data sequence; then the fourth data sequence is: [1,1,1,-j,-1,-1,-1,j,1,1].
[0078] Example 6: This embodiment is an example of performing convolution modulation on a first data sequence modulated by BPSK and a second data sequence including two non-zero elements [a, c].
[0079] In this embodiment, a first data sequence is convolutionally modulated with a second data sequence containing two non-zero elements [a, c] to form a third data sequence; and the first data sequence and the third data sequence are combined to form a fourth data sequence. The convolution modulation implementation process includes:
[0080] (1) First, a binary data sequence [b(m)] consisting of 0s and 1s is modulated by BPSK constellation points to form a first data sequence [x(i)]. Assume that the first data sequence [x(i)] = [1, 1, -1, -1, 1].
[0081] (2) Then the first data sequence [x(i)] is circularly convolved with the second data sequence containing two non-zero elements [a, c] to form a third data sequence; assuming that the second data sequence contains two non-zero elements Then the third data sequence is:
[0082] (3) Then insert each element of the third data sequence between every two elements of the first data sequence to form a fourth data sequence; then the fourth data sequence is: [1,1,1,j,-1,-1,-1,-j,1,1].
[0083] Example 7: This embodiment is an example of performing convolution modulation on a first data sequence modulated by BPSK and a second data sequence including two non-zero elements [a, c].
[0084] In this embodiment, a first data sequence is convolutionally modulated with a second data sequence containing two non-zero elements [a, c] to form a third data sequence; and the first data sequence and the third data sequence are combined to form a fourth data sequence. The convolution modulation implementation process includes:
[0085] (1) First, a binary data sequence [b(m)] consisting of 0 and 1 is modulated by the BPSK constellation point to form a first data sequence [x(i)]. Assume that the first data sequence
[0086] (2) Then the first data sequence [x(i)] is circularly convolved with the second data sequence containing two non-zero elements [a, c] to form a third data sequence; assuming that the second data sequence contains two non-zero elements [a, c] = Then the third data sequence is:
[0087] (3) Then, each element of the third data sequence is inserted between every two elements of the first data sequence to form a fourth data sequence. The fourth data sequence is:
[0088] Example 8: This embodiment is an example of performing convolution modulation on a first data sequence modulated by BPSK and a second data sequence including two non-zero elements [a, c].
[0089] In this embodiment, a first data sequence is convolutionally modulated with a second data sequence containing two non-zero elements [a, c] to form a third data sequence; and the first data sequence and the third data sequence are combined to form a fourth data sequence. The convolution modulation implementation process includes:
[0090] (1) First, a binary data sequence [b(m)] consisting of 0 and 1 is modulated by the BPSK constellation point to form a first data sequence [x(i)]. Assume that the first data sequence
[0091] (2) Then the first data sequence [x(i)] is circularly convolved with the second data sequence containing two non-zero elements [a, c] to form a third data sequence; assuming that the second data sequence contains two non-zero elements [a, c] = Then the third data sequence is:
[0092] (3) Then, each element of the third data sequence is inserted between every two elements of the first data sequence to form a fourth data sequence. The fourth data sequence is:
[0093] Example 9: This embodiment is an example of performing convolution modulation on a first data sequence modulated by BPSK and a second data sequence including two non-zero elements [a, c].
[0094] In this embodiment, a first data sequence is convolutionally modulated with a second data sequence containing two non-zero elements [a, c] to form a third data sequence; and the first data sequence and the third data sequence are combined to form a fourth data sequence. The convolution modulation implementation process includes:
[0095] (1) First, a binary data sequence [b(m)] consisting of 0s and 1s is modulated by the BPSK constellation point to form a first data sequence [x(i)]. Assume that the first data sequence [x(i)] = [j, j, -j, -j, j].
[0096] (2) Then the first data sequence [x(i)] is circularly convolved with the second data sequence containing two non-zero elements [a, c] to form a third data sequence; assuming that the second data sequence contains two non-zero elements Then the third data sequence is:
[0097] (3) Then insert each element of the third data sequence between every two elements of the first data sequence to form a fourth data sequence; then the fourth data sequence is: [j, j, j, 1, -j, -j, -j, -1, j, j].
[0098] Example 10: This embodiment is an example of performing convolution modulation on a first data sequence modulated by BPSK and a second data sequence including two non-zero elements [a, c].
[0099] In this embodiment, a first data sequence is convolutionally modulated with a second data sequence containing two non-zero elements [a, c] to form a third data sequence; and the first data sequence and the third data sequence are combined to form a fourth data sequence. The convolution modulation implementation process includes:
[0100] (1) First, a binary data sequence [b(m)] consisting of 0s and 1s is modulated by the BPSK constellation point to form a first data sequence [x(i)]. Assume that the first data sequence [x(i)] = [j, j, -j, -j, j].
[0101] (2) Then the first data sequence [x(i)] is circularly convolved with the second data sequence containing two non-zero elements [a, c] to form a third data sequence; assuming that the second data sequence contains two non-zero elements Then the third data sequence is:
[0102] (3) Then insert each element of the third data sequence between every two elements of the first data sequence to form a fourth data sequence; then the fourth data sequence is: [j, j, j, -1, -j, -j, -j, 1, j, j].
[0103] Example 11: This embodiment is an example of performing convolution modulation on a first data sequence modulated by BPSK and a second data sequence including two non-zero elements [a, c].
[0104] In this embodiment, a first data sequence is convolutionally modulated with a second data sequence containing two non-zero elements [a, c] to form a third data sequence; and the first data sequence and the third data sequence are combined to form a fourth data sequence. The convolution modulation implementation process includes:
[0105] (1) First, a binary data sequence [b(m)] consisting of 0s and 1s is modulated by the BPSK constellation point to form the first data sequence [x(i)];
[0106] (2) Then the first data sequence [x(i)] is circularly convolved with the second data sequence containing two non-zero elements [a, c] to form a third data sequence;
[0107] (3) Each element of the first data sequence is then inserted between every two elements of the third data sequence to form a fourth data sequence. The extra element is placed at the last or first position of the fourth data sequence.
[0108] Example 12: This embodiment is an example of performing convolution modulation on a first data sequence modulated by BPSK and a second data sequence including two non-zero elements [a, c].
[0109] In this embodiment, a first data sequence is convolutionally modulated with a second data sequence containing two non-zero elements [a, c] to form a third data sequence; and the first data sequence and the third data sequence are combined to form a fourth data sequence. The convolution modulation implementation process includes:
[0110] (1) First, a binary data sequence [b(m)] consisting of 0s and 1s is modulated by BPSK constellation points to form a first data sequence [x(i)]. Assume that the first data sequence [x(i)] = [1, 1, -1, -1, 1].
[0111] (2) Then the first data sequence [x(i)] is circularly convolved with the second data sequence containing two non-zero elements [a, c] to form a third data sequence; assuming that the second data sequence contains two non-zero elements Then the third data sequence is:
[0112] (3) Then insert each element of the first data sequence between every two elements of the third data sequence to form a fourth data sequence; then the fourth data sequence is: [1,1,-j,-1,-1,-1,j,1,1,1].
[0113] Example 13: This embodiment is an example of performing convolution modulation on a first data sequence modulated by BPSK and a second data sequence including two non-zero elements [a, c].
[0114] In this embodiment, a binary data sequence [b(m)] consisting of 0s and 1s is first modulated by the BPSK constellation points to form a first data sequence [x(i)]. The first data sequence is then convolution-modulated with a second data sequence containing two non-zero elements [a, c] to form a third data sequence. The first data sequence and the third data sequence are then combined to form a fourth data sequence.
[0115] The process of merging the first data sequence and the third data sequence includes the following two steps:
[0116] (1) Assume that each element of the third data sequence is inserted between every two elements of the first data sequence to form a fourth data sequence [s(k)]1;
[0117] (2) Assume that each element of the first data sequence is inserted between every two elements of the third data sequence to form a fourth data sequence [s(k)]2.
[0118] The fourth data sequence [s(k)]1 and the fourth data sequence [s(k)]2 are the same data sequence, and the elements in the fourth data sequence [s(k)]1 and the fourth data sequence [s(k)]2 are cyclically shifted.
[0119] Example 14: This embodiment is an example of performing convolution modulation on a first data sequence modulated by BPSK and a second data sequence including two non-zero elements [a, c].
[0120] In this embodiment, a first data sequence is convolutionally modulated with a second data sequence containing two non-zero elements [a, c] to form a third data sequence; and the first data sequence and the third data sequence are combined to form a fourth data sequence. The convolution modulation implementation process includes:
[0121] (1) First, a binary data sequence [b(m)] consisting of 0s and 1s is modulated by the BPSK constellation point to form the first data sequence [x(i)];
[0122] (2) Then the first data sequence experiences a delay path of aD 0 +cD 1 A multipath cyclic delay operation is performed to form a third data sequence;
[0123] Among them, the elements a and c in the two non-zero elements [a, c] contained in the second data sequence are the coefficients of the two delay paths respectively. The delay difference of the delay path corresponding to the first element a is 0, and the delay difference of the delay path corresponding to the second element c is 1. 0 Corresponding to the path with a delay difference of 0 (i.e. no delay), D 1 The path corresponding to the delay difference is 1.
[0124] (3) Then, each element of the third data sequence is inserted between every two elements of the first data sequence to form a fourth data sequence. Alternatively, each element of the first data sequence is inserted between every two elements of the third data sequence to form a fourth data sequence.
[0125] Example 15. This embodiment is an example of performing convolution modulation on a first data sequence modulated by BPSK and a second data sequence including two non-zero elements [a, c].
[0126] Figure 4 is a schematic diagram of an implementation of a multipath delay operation provided by an embodiment of the present application. As shown in Figure 4, it is assumed that the first data sequence [x(i)] after BPSK constellation point modulation is [1,1,-1,-1,1], and passes through a path with a delay difference of 0 and a path with a delay difference of 1 respectively to form a third data sequence.
[0127] Assume that the first data sequence [x(i)] after BPSK constellation point modulation is [1,1,-1,-1,1], and the second data sequence contains two non-zero elements Then the second data sequence is [a+c, ac, -ac, -a+c, a+c] = [1, -j, -1, j, 1].
[0128] Example 16: This embodiment is an example of performing convolution modulation on a first data sequence modulated by BPSK and a second data sequence including two non-zero elements [a, c].
[0129] In this embodiment, a first data sequence is convolutionally modulated with a second data sequence containing two non-zero elements [a, c] to form a third data sequence; and the first data sequence and the third data sequence are combined to form a fourth data sequence. The convolution modulation implementation process includes:
[0130] (1) First, the first data sequence [x(i)] is formed after BPSK constellation point modulation;
[0131] (2) Then the first data sequence [x(i)] is circularly convolved with the second data sequence [d(v)], where the first element d(0) = a and the second element d(1) = c in the second data sequence. When v is a value other than 0 and 1, d(v) = 0; v = 0, 1, 2, ..., V-1, where V is equal to the length of the first data sequence; and the value range of i is 0, 1, 2 ... M-2, I-1. That is, the third data sequence is:
[0132] (3) Then, each element of the third data sequence is inserted between every two elements of the first data sequence to form a fourth data sequence. Alternatively, each element of the first data sequence is inserted between every two elements of the third data sequence to form a fourth data sequence.
[0133] Example 17: This embodiment is an example of waveform modulation of the third data sequence.
[0134] Figure 5 is a schematic diagram of waveform modulation of a fourth data sequence provided by an embodiment of the present application. As shown in Figure 5, the fourth data sequence can undergo DFT, resource mapping, and frequency domain shaping, and data 0 is placed at the position of some subcarriers to achieve oversampling, inverse Fourier transform (IDFT), digital-to-analog conversion, etc., and then be transmitted on the RF link.
[0135] In other embodiments, reference sequences may be added to both ends of the fourth data sequence, or filtering may be performed after Inverse Fast Fourier Transform (IFFT).
[0136] In one embodiment, FIG6 is a block diagram of a data transmission device provided by an embodiment of the present application. As shown in FIG6 , the data transmission device in this embodiment includes: a convolution modulation module 610 , a merging module 620 , and a transmission module 630 .
[0137] The convolution modulation module 610 is configured to perform convolution modulation on the pre-generated first data sequence and the second data sequence to obtain a third data sequence.
[0138] The values of two adjacent non-zero elements in the second data sequence are conjugate to each other, and the values of two adjacent non-zero elements are not equal.
[0139] The merging module 620 is configured to merge the first data sequence and the third data sequence to form a fourth data sequence.
[0140] The transmission module 630 is configured to transmit a fourth data sequence on physical time-frequency resources.
[0141] In one embodiment, the second data sequence includes the following two non-zero elements: a first element and a second element. In one embodiment, the modulus value of the first element is equal to the modulus value of the second element.
[0142] In one embodiment, the complex phase of the first element and the complex phase of the second element are opposite to each other.
[0143] In one embodiment, the complex phase of the first element and the complex phase of the second element each include one of the following:
[0144] The complex phase of the ratio between the first and second elements is
[0145] In one embodiment, the second data sequence includes one of the following:
[0146] In one embodiment, the sum of the first element and the second element is equal to 1.
[0147] In one embodiment, the data transmission device further includes:
[0148] The constellation point modulation module is configured to perform constellation point modulation on a pre-generated binary data sequence to obtain a first data sequence.
[0149] In one embodiment, the first data sequence is a binary phase shift keying (BPSK) modulation sequence.
[0150] In one embodiment, the first data sequence includes one of the following: constellation point modulation data; constellation point modulation data and reference signal data.
[0151] In one embodiment, combining the first data sequence and the third data sequence to form a fourth data sequence includes one of the following:
[0152] Inserting each element of the third data sequence between every two elements of the first data sequence;
[0153] Each element of the first data sequence is inserted between every two elements of the third data sequence; wherein the last extra element is placed at the last position or the first position of the fourth data sequence.
[0154] In one embodiment, in the fourth data sequence, each element originally in the first data sequence is not adjacent, and each element originally in the third data sequence is not adjacent.
[0155] In one embodiment, the convolution modulation operation includes one of the following: circular convolution; and multipath delay operation.
[0156] In one embodiment, when the convolution modulation operation includes a multipath delay operation and the second data sequence includes two non-zero elements, the two non-zero elements in the second data sequence are coefficients of two delay paths.
[0157] In one embodiment, the delay difference of the delay path corresponding to the first element in the second data sequence is 0; the delay difference of the delay path corresponding to the second element in the second data sequence is 1.
[0158] In one embodiment, performing convolution modulation on a pre-generated first data sequence and a second data sequence to obtain a third data sequence includes:
[0159] A multipath cyclic delay operation with a delay path of a first value is performed on a pre-generated first data sequence to obtain a third data sequence; wherein the first value is the sum of the product value between the first element in the second data sequence and the corresponding delay path, and the product value between the second element in the second data sequence and the corresponding delay path.
[0160] In one embodiment, performing convolution modulation on a pre-generated first data sequence and a second data sequence to obtain a third data sequence includes:
[0161] Perform circular convolution on the pre-generated first data sequence and the second data sequence to obtain a third data sequence; wherein the coefficient of the delay path with a delay difference of 0 is equal to the first element in the second data sequence, and the coefficient of the delay path with a delay difference of 1 is equal to the second element in the second data sequence.
[0162] In one embodiment, performing convolution modulation on a pre-generated first data sequence and a second data sequence to obtain a third data sequence includes:
[0163] Performing circular convolution on a pre-generated first data sequence and a second data sequence to obtain a third data sequence; wherein the first element in the second data sequence is the first element, the second element is the second element, and the other elements are 0; and the length of the second data sequence is equal to the length of the first data sequence.
[0164] In one embodiment, performing convolution modulation on a pre-generated first data sequence and a second data sequence to obtain a third data sequence includes:
[0165] Convolution modulation is performed on a pre-generated first data sequence and a second data sequence to obtain a third data sequence; wherein the second data sequence and the first data sequence contain the same number of elements.
[0166] In one embodiment, the data transmission method further includes: multiplying the fourth data sequence by a preconfigured complex constant to obtain a new fourth data sequence; wherein the fourth data sequence performs at least one of the following operations: adding a reference sequence; Fourier transform; frequency domain shaping; inverse Fourier transform; filtering.
[0167] The data transmission device provided in this embodiment is configured to implement the data transmission method of the embodiment shown in FIG1 . The implementation principle and technical effects of the data transmission device provided in this embodiment are similar and will not be described in detail here.
[0168] In one embodiment, FIG7 is a schematic diagram of the structure of a communication device provided by an embodiment of the present application. As shown in FIG7 , the device provided by the present application includes: a processor 710, a memory 720, and a communication module 730. The number of processors 710 in the device can be one or more, and FIG7 takes one processor 710 as an example. The number of memories 720 in the device can be one or more, and FIG7 takes one memory 720 as an example. The processor 710, memory 720, and communication module 730 of the device can be connected via a bus or other means, and FIG7 takes connection via a bus as an example. In this embodiment, the device can be on the terminal side or on the network side.
[0169] The memory 720, as a computer-readable storage medium, can be configured to store software programs, computer executable programs, and modules, such as program instructions / modules corresponding to the device of any embodiment of the present application (for example, the convolution modulation module 610, the merging module 620, and the transmission module 630 in the data transmission device). The memory 720 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and application programs required for at least one function; the data storage area may store data created based on the use of the device, etc. In addition, the memory 720 may include a high-speed random access memory and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 720 may further include a memory remotely located relative to the processor 710, and these remote memories may be connected to the device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.
[0170] The device provided above can be configured to execute the data transmission method provided in any of the above embodiments, and have corresponding functions and effects.
[0171] An embodiment of the present application also provides a storage medium containing computer-executable instructions, which, when executed by a computer processor, are used to perform a data transmission method, the method comprising: performing convolution modulation on a pre-generated first data sequence and a second data sequence to obtain a third data sequence; merging the first data sequence and the third data sequence to form a fourth data sequence; and transmitting the fourth data sequence on physical time-frequency resources; wherein the values of two non-zero elements in the second data sequence are conjugate to each other, and the values of the two non-zero elements are not equal.
[0172] It will be appreciated by those skilled in the art that the term user equipment encompasses any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable web browser or a car-mounted mobile station.
[0173] In general, various embodiments of the present application may be implemented in hardware or dedicated circuits, software, logic, or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that can be executed by a controller, microprocessor, or other computing device, although the present application is not limited thereto.
[0174] Embodiments of the present application may be implemented by executing computer program instructions by a data processor of a mobile device, for example, in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages.
[0175] The block diagram of any logic flow in the drawings of the present application may represent program steps, or may represent interconnected logic circuits, modules and functions, or may represent a combination of program steps and logic circuits, modules and functions. A computer program may be stored on a memory. The memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random access memory (RAM), optical storage devices and systems (digital versatile discs (DVD) or compact disks (CD)), etc. Computer-readable media may include non-transient storage media. A data processor may be of any type suitable for the local technical environment, such as, but not limited to, a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), and a processor based on a multi-core processor architecture.
[0176] The above are merely optional embodiments of the present application and are not intended to limit the present application. Various modifications and variations are possible for those skilled in the art. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application shall be included within the scope of protection of the present application.
Claims
1. A data transmission method, comprising: Performing convolution modulation on the pre-generated first data sequence and the second data sequence to obtain a third data sequence; Combining the first data sequence and the third data sequence to form a fourth data sequence; Transmitting the fourth data sequence on physical time-frequency resources; The values of the two non-zero elements in the second data sequence are conjugate to each other, and the values of the two non-zero elements are not equal.
2. The method according to claim 1, wherein The second data sequence includes the following two non-zero elements: a first element and a second element.
3. The method according to claim 2, wherein: The modulus value of the first element is equal to the modulus value of the second element.
4. The method according to claim 2, wherein: The complex phase of the first element and the complex phase of the second element are opposite to each other.
5. The method according to claim 2, wherein: The complex phase of the first element and the complex phase of the second element each include one of the following: The complex phase of the ratio between the first element and the second element is 6. The method according to claim 2, wherein: The second data sequence includes one of the following:
7. The method according to claim 2, wherein: The sum of the first element and the second element is equal to 1.
8. The method according to claim 1, further comprising: Constellation point modulation is performed on a pre-generated binary data sequence to obtain a first data sequence.
9. The method according to claim 1 or 8, wherein The first data sequence is a binary phase shift keying (BPSK) modulation sequence.
10. The method according to claim 1 or 8, wherein The first data sequence includes one of the following: constellation point modulation data; constellation point modulation data and reference signal data.
11. The method according to claim 1, wherein The combining the first data sequence and the third data sequence to form a fourth data sequence includes one of the following: inserting each element of the third data sequence between every two elements of the first data sequence; Each element of the first data sequence is inserted between every two elements of the third data sequence; wherein the last extra element is placed at the last position or the first position of the fourth data sequence.
12. The method according to claim 1 or 11, wherein: In the fourth data sequence, each element originally in the first data sequence is not adjacent, and each element originally in the third data sequence is not adjacent.
13. The method according to claim 2, wherein: The convolution modulation operation includes one of the following: circular convolution; multipath delay operation.
14. The method according to claim 13, wherein In a case where the convolution modulation operation includes a multipath delay operation and the second data sequence includes two non-zero elements, the two non-zero elements in the second data sequence are coefficients of two delay paths.
15. The method according to claim 13, wherein The delay difference of the delay path corresponding to the first element in the second data sequence is 0; the delay difference of the delay path corresponding to the second element in the second data sequence is 1.
16. The method according to claim 13, wherein The performing convolution modulation on the pre-generated first data sequence and the second data sequence to obtain the third data sequence includes: A multipath cyclic delay operation with a delay path of a first value is performed on a pre-generated first data sequence to obtain a third data sequence; wherein the first value is the sum of the product value between the first element in the second data sequence and the corresponding delay path, and the product value between the second element in the second data sequence and the corresponding delay path.
17. The method according to claim 13, wherein: The performing convolution modulation on the pre-generated first data sequence and the second data sequence to obtain the third data sequence includes: Perform circular convolution on the pre-generated first data sequence and the second data sequence to obtain a third data sequence; wherein the coefficient of the delay path with a delay difference of 0 is equal to the first element in the second data sequence, and the coefficient of the delay path with a delay difference of 1 is equal to the second element in the second data sequence.
18. The method according to claim 13, wherein The performing convolution modulation on the pre-generated first data sequence and the second data sequence to obtain the third data sequence includes: Performing circular convolution on a pre-generated first data sequence and a second data sequence to obtain a third data sequence; wherein the first element in the second data sequence is the first element, the second element is the second element, and the other elements are 0; and the length of the second data sequence is equal to the length of the first data sequence.
19. The method according to claim 13, wherein The performing convolution modulation on the pre-generated first data sequence and the second data sequence to obtain the third data sequence includes: Convolution modulation is performed on a pre-generated first data sequence and a second data sequence to obtain a third data sequence; wherein the second data sequence and the first data sequence contain the same number of elements.
20. The method of claim 1, further comprising: The fourth data sequence is multiplied by a preconfigured complex constant to obtain a new fourth data sequence; wherein the fourth data sequence performs at least one of the following operations: adding a reference sequence; Fourier transform; frequency domain shaping; inverse Fourier transform; filtering.
21. A communication device comprising: memory, and one or more processors; The memory is 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 method according to any one of claims 1 to 20.
22. A storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the method according to any one of claims 1 to 20.
Citation Information
Patent Citations
Communication receiving apparatus, signal receiving method thereof, signal processing method, and signal transmitting method
US20170195078A1
Method and transmitter for generating a waveform with optimized papr
US20190052486A1
Time-domain modulation scheme for low peak average power ratio
US20220385513A1
Non-zero insertion based modulation scheme for low peak average power ratio
US20220385514A1