Data modulation method, communication node and storage medium

Abstract

The present application provides a data modulation method, a communication node and a storage medium. The method comprises: performing convolutional modulation on a first data sequence and a first preset data sequence to obtain a second data sequence; combining the second data sequence and the first data sequence to obtain a third data sequence; and performing convolutional modulation on the third data sequence and a second preset data sequence to obtain a fourth data sequence, wherein a non-zero element contained in the first preset data sequence is p0, formula (I), and a non-zero element contained in the second preset data sequence is p1, formula (II).

Description

Data modulation method, communication node and storage medium Technical Field

[0001] The present application relates to the field of data processing technology, for example, to a data modulation method, a communication node and a storage medium. Background Art

[0002] In high-frequency scenarios, data transmission path loss and shadow fading are significant, resulting in very low signal-to-noise ratios (SNRs) in some areas at the cell edge. Furthermore, power amplifier efficiency is relatively low in high-frequency scenarios. To improve the SNR and conserve battery power in user equipment (UE), the peak-to-average power ratio (PAPR) of the UE's transmitted signal must be low.

[0003] Furthermore, in massive machine-type communication (mMTC) scenarios, some UEs desire significant battery savings, such as achieving a battery life of more than ten years. Therefore, to improve the PA efficiency of these UEs, the PAPR of the UE's transmitted signals must be low. In particular, when a large number of users access the system in non-orthogonal fashion, the Signal to Interference plus Noise Ratio (SINR) can be very low. Therefore, a low-PAPR signal modulation scheme or waveform is urgently needed.

[0004] In the existing New Radio (NR) standard, the PAPR of Discrete Fourier Transform Spread Orthogonal Frequency Division Multiplexing (DFT-s-OFDM) π / 2 Binary Phase Shift Keying (BPSK) signals has been effectively reduced. However, this still cannot meet the application scenarios requiring even lower PAPR, such as those for beyond 5G (B5G) or 6G. Summary of the Invention

[0005] The present application provides a data modulation method, a communication node and a storage medium.

[0006] The present invention provides a data modulation method, including:

[0007] Performing convolution modulation on the first data sequence and the first preset data sequence to obtain a second data sequence;

[0008] Combining the second data sequence with the first data sequence to obtain a third data sequence;

[0009] Performing convolution modulation on the third data sequence and the second preset data sequence to obtain a fourth data sequence;

[0010] The non-zero element contained in the first preset data sequence is p0, The non-zero element contained in the second preset data sequence is p1,

[0011] The present application also provides a data modulation method, including:

[0012] The first data sequence is convoluted with the preset data sequence to obtain a second data sequence, wherein the non-zero elements contained in the preset data sequence are p n ;

[0013] When n is less than N-1, combine the second data sequence with the first data sequence to obtain a third data sequence, use the third data sequence as a new first data sequence, update n to n+1, and return to performing the convolution modulation operation on the first data sequence;

[0014] When n is equal to N-1, transmitting the second data sequence;

[0015] The initial value of n is 0. N is the total number of convolution modulations, N≥3.

[0016] An embodiment of the present application further provides a communication node, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the above-mentioned data modulation method when executing the program.

[0017] An embodiment of the present application further provides a computer-readable storage medium, on which a computer program is stored. When the program is executed by a processor, the above-mentioned data modulation method is implemented. BRIEF DESCRIPTION OF THE DRAWINGS

[0018] FIG1 is a flow chart of a data modulation method provided by an embodiment;

[0019] FIG2 is a flow chart of another data modulation method provided by an embodiment;

[0020] FIG3 is a schematic diagram of a π / 2BPSK modulation constellation diagram provided by an embodiment;

[0021] FIG4 is a schematic diagram of another π / 2BPSK modulation constellation diagram provided by an embodiment;

[0022] FIG5 is a schematic diagram of a first data sequence provided by an embodiment;

[0023] FIG6 is a schematic diagram of performing a multipath delay operation on a first data sequence according to an embodiment;

[0024] FIG7 is a schematic diagram of performing a multipath delay operation on a third data sequence according to an embodiment;

[0025] FIG8 is a schematic structural diagram of a data modulation device provided by an embodiment;

[0026] FIG9 is a schematic structural diagram of another data modulation device provided by an embodiment;

[0027] FIG10 is a schematic diagram of the hardware structure of a communication node provided by an embodiment. DETAILED DESCRIPTION

[0028] The present application is described below in conjunction with the accompanying drawings and embodiments. It will be understood that the specific embodiments described herein are merely intended to explain the present application and are not intended to limit the present application. It should be noted that, unless there is a conflict, the embodiments and features within the embodiments of the present application may be combined with each other in any manner. It should also be noted that, for ease of description, the accompanying drawings only illustrate portions relevant to the present application, not all structures.

[0029] Figure 1 is a flow chart of a data modulation method provided by an embodiment. The method can be applied to a communication node, which can be a data transmitter or a data modulator. As shown in Figure 1, the method provided by this embodiment includes the following steps:

[0030] Step 110: Perform convolution modulation on the first data sequence and the first preset data sequence to obtain a second data sequence.

[0031] Step 120: Combine the second data sequence and the first data sequence to obtain a third data sequence.

[0032] Step 130: Convolutionally modulate the third data sequence with the second preset data sequence to obtain a fourth data sequence.

[0033] The non-zero element contained in the first preset data sequence is p0, The non-zero element contained in the second preset data sequence is p1,

[0034] In this embodiment, the first data sequence primarily refers to the data sequence to be convolutionally modulated. The first preset data sequence is a data sequence including a non-zero element p0. The result of convolutionally modulating the first data sequence with the first preset data sequence is a second data sequence. The second data sequence is combined with the first data sequence to obtain a third data sequence, which is then convolutionally modulated again with the second preset data sequence to obtain a fourth data sequence. The second preset data sequence is a data sequence including a non-zero element p1. Convolution modulation can be a circular convolution operation or a multipath delay operation.

[0035] On this basis, in the fourth data sequence, the modulus value of each data element is equal to 1, and the phase difference between adjacent data elements is 0 or ±π / 4. Therefore, the peak-to-average ratio of the fourth data sequence is relatively low. Furthermore, in the fourth data sequence, each element of the original first data sequence remains orthogonal, with no interference between them. When the receiving end demodulates the fourth data sequence, the complexity is reduced, and demodulation performance is not compromised while maintaining the same spectral efficiency. Through multiple cyclic convolution and combining operations, the peak-to-average ratio of the transmitted data is significantly reduced.

[0036] In one embodiment, the first data sequence is a data sequence modulated by π / 2 binary phase shift keying (BPSK).

[0037] In one embodiment, the number of non-zero elements included in the first preset data sequence is 2; and / or the number of non-zero elements included in the second preset data sequence is 2.

[0038] In one embodiment, the first preset data sequence includes two equal non-zero elements; and the second preset data sequence includes two equal non-zero elements.

[0039] In one embodiment, the elements included in the first preset data sequence are equal to the product of the first power factor and the elements included in the fourth preset data sequence; and / or

[0040] The elements included in the second preset data sequence are equal to the product of the second power factor and the elements included in the fifth preset data sequence.

[0041] In one embodiment, the convolution modulation includes one of the following:

[0042] The first data sequence is multiplied by a first power factor and then convolution-modulated with a fourth preset data sequence;

[0043] Alternatively, the first data sequence is convolution-modulated with a fourth preset data sequence and then multiplied by a first power factor;

[0044] The second data sequence is multiplied by a second power factor and then convolution-modulated with a fifth preset data sequence;

[0045] The second data sequence is convolution-modulated with the fifth preset data sequence and then multiplied by a second power factor.

[0046] For example, performing convolution modulation on the first data sequence and the first preset data sequence is equivalent to performing convolution modulation on the first data sequence and the first preset data sequence and then multiplying the result by a power factor p0 / a; or performing convolution modulation on the first data sequence and the first preset data sequence, where the first preset data sequence includes a non-zero element.

[0047] Convolutionally modulating the third data sequence with the second preset data sequence is equivalent to convolutionally modulating the third data sequence with the second preset data sequence and then multiplying the result by a power factor p1 / b; or multiplying the first data sequence by the power factor p1 / b and then convolutionally modulating the result with the second preset data sequence, where the second preset data sequence contains b as a non-zero element.

[0048] The non-zero element a included in the first preset data sequence and the non-zero element b included in the second preset data sequence have the same value or different values.

[0049] In one embodiment, the non-zero element included in the fourth preset data sequence is 1; and / or

[0050] The non-zero element included in the fifth preset data sequence is 1.

[0051] In one embodiment, the convolution modulation includes one of the following: a circular convolution operation; a multipath delay operation.

[0052] In one embodiment, convolution modulation is a multipath delay operation; each element in the first preset data sequence is a coefficient of a corresponding delay path; in the first preset data sequence, the delay difference of the delay path corresponding to the first non-zero element is 0, and the delay difference of the delay path corresponding to the second non-zero element is 1.

[0053] In one embodiment, performing convolution modulation on the first data sequence and the first preset data sequence to obtain the second data sequence includes:

[0054] The first data sequence is delayed by a distance p0D 0 +p0D 1 A multipath cyclic delay operation is performed to obtain a second data sequence;

[0055] Among them, D 0 Corresponding to the path with a delay difference of 0, D 1 The path corresponding to the delay difference is 1.

[0056] In one embodiment, convolution modulation is a multipath delay operation; each element in the second preset data sequence is a coefficient of a corresponding delay path; in the second preset data sequence, the delay difference of the delay path corresponding to the first non-zero element is 0, and the delay difference of the delay path corresponding to the second non-zero element is 1.

[0057] In one embodiment, performing convolution modulation on the third data sequence and the second preset data sequence to obtain a fourth data sequence includes:

[0058] The third data sequence is delayed by a path of p1D 0 +p1D 1 A multipath cyclic delay operation is performed to obtain a fourth data sequence;

[0059] Among them, D 0 Corresponding to the path with a delay difference of 0, D 1 The path corresponding to the delay difference is 1.

[0060] In one embodiment, the convolution modulation is a circular convolution operation; the first preset data sequence is [d(m)], m=0, 1, ..., M-1, and M is the length of the first data sequence; when m=0 or m=1, d(m)=p0; when m≠0 and m≠1, d(m)=0.

[0061] In one embodiment, the method further includes: padding non-zero elements included in the first preset data sequence with zeros to obtain a first preset data sequence; the first preset data sequence and the first data sequence include the same number of elements.

[0062] In one embodiment, combining the second data sequence with the first data sequence to obtain a third data sequence includes:

[0063] Insert each element except the last element in the second data sequence between every two elements of the first data sequence, and place the last element in the second data sequence at the first or last position of the third data sequence;

[0064] Alternatively, each element except the last element in the first data sequence is inserted between every two elements in the second data sequence, and the last element in the first data sequence is placed at the first or last position of the third data sequence.

[0065] In one embodiment, the convolution modulation is a circular convolution operation; the second preset data sequence is [d(z)], z=0,1,...,Z-1; Z is the length of the third data sequence; when z=0 or z=1, d(z)=p1; when z≠0 and z≠1, d(z)=0.

[0066] In one embodiment, the method further comprises:

[0067] Padding non-zero elements included in the second preset data sequence with zeros to obtain a second preset data sequence;

[0068] The second preset data sequence and the third data sequence contain the same number of elements.

[0069] In one embodiment, the number of elements included in the first data sequence is an even number;

[0070] The number of elements included in the third data sequence is twice the number of elements included in the first data sequence.

[0071] In one embodiment, the first data sequence includes: constellation point modulation data and L reference signal data, where L≥0.

[0072] In one embodiment, the method further comprises:

[0073] combining the fourth data sequence with the third data sequence to obtain a new third data sequence;

[0074] Performing convolution modulation on the new third data sequence and the third preset data sequence to obtain a new fourth data sequence;

[0075] The non-zero element contained in the third preset data sequence is p2,

[0076] In one embodiment, before transmitting the fourth data sequence, the method further includes performing at least one of the following operations on the fourth data sequence:

[0077] Add reference sequence; Fourier transform; frequency domain shaping; inverse Fourier transform; filtering.

[0078] For example, a reference sequence is added in the fourth data sequence or at both ends of the fourth data sequence;

[0079] performing a Fast Fourier Transform (FFT) on the fourth data sequence to obtain a fourth frequency domain data sequence;

[0080] performing frequency domain spectral shaping (FDSS) on the fourth frequency domain data sequence;

[0081] performing an inverse fast Fourier transform (IFFT) on the fourth frequency domain data sequence to obtain a fourth time domain data sequence;

[0082] The fourth time-domain data sequence is filtered.

[0083] Figure 2 is a flow chart of a data modulation method provided by an embodiment. The method can be applied to a communication node, which can be a data transmitter or a data modulator. As shown in Figure 2, the method provided by this embodiment includes the following steps:

[0084] Step 210: Convolutionally modulate the first data sequence with a preset data sequence to obtain a second data sequence, wherein the non-zero elements of the preset data sequence are p n .

[0085] In step 220, is n less than N-1? If so, proceed to step 230; otherwise, proceed to step 240.

[0086] Step 230 : Combine the second data sequence and the first data sequence to obtain a third data sequence, use the third data sequence as a new first data sequence, update n to n+1, and return to step 210 .

[0087] Step 240: Transmit the second data sequence.

[0088] The initial value of n is 0. N is the total number of convolution modulations, N≥3.

[0089] In this embodiment, the first data sequence mainly refers to the data sequence to be convolutionally modulated. The preset data sequence includes two equal non-zero elements, for example, two non-zero elements p n The preset data sequence may also include element 0, and the number of elements included in the preset data sequence may be equal to that of the first data sequence.

[0090] In the current convolution modulation process, the first data sequence is convolution-modulated with the preset data sequence, and the result of the convolution modulation is a second data sequence. The second data sequence can be combined with the first data sequence to obtain a third data sequence. The third data sequence can be used as a new first data sequence and the next convolution modulation is performed until the corresponding second data sequence is obtained after the Nth convolution modulation is performed (n=N-1). The convolution modulation is completed and the second data sequence obtained at this time can be transmitted.

[0091] The convolution modulation can be a circular convolution operation or a multipath delay operation. The total number of convolution modulation operations can be set according to actual needs.

[0092] On this basis, the modulus value of each data in the second data sequence is equal to 1, and the phase difference between adjacent data is 0 or ±π / 2 N, thus lowering the peak-to-average ratio of the second data sequence. Furthermore, within the second data sequence, each element of the original first data sequence remains orthogonal, with no interference. This reduces the demodulation complexity of the second data sequence at the receiving end, maintaining the same spectral efficiency without sacrificing demodulation performance. Multiple cyclic convolution and combining operations significantly reduce the peak-to-average ratio of the transmitted data.

[0093] In one embodiment, performing convolution modulation on a first data sequence and a preset data sequence to obtain a second data sequence includes: performing a convolution modulation on the first data sequence with a time delay path of p n D 0 +p n D 1 The multipath cyclic delay operation is used to obtain the second data sequence, where D 0 Corresponding to the path with a delay difference of 0, D 1 The path corresponding to the delay difference is 1.

[0094] In one embodiment, the preset data sequence is [d(k)], k=0, 1, ..., K-1; K is the length of the first data sequence; in the case of k=0 or k=1, d(k)=p n ; When k≠0 and k≠1, d(k)=0.

[0095] In one embodiment, the method further comprises:

[0096] The non-zero elements included in the preset data sequence are padded with zeros to obtain a preset data sequence; the preset data sequence and the first data sequence include the same number of elements.

[0097] In one embodiment, the first data sequence is a data sequence modulated by π / 2 binary phase shift keying (BPSK).

[0098] In one embodiment, the number of non-zero elements included in the preset data sequence is 2.

[0099] In one embodiment, the predetermined data sequence includes two equal non-zero elements.

[0100] In one embodiment, the elements included in the preset data sequence are equal to the product of the power factor and the elements included in the setting data sequence.

[0101] In one embodiment, the convolution modulation includes one of the following:

[0102] The first data sequence is multiplied by a power factor and then convolutionally modulated with a set data sequence;

[0103] Alternatively, the first data sequence is convolution-modulated with the set data sequence and then multiplied by the power factor.

[0104] In one embodiment, the non-zero elements included in the setting data sequence are 1.

[0105] In one embodiment, the convolution modulation includes one of the following: a circular convolution operation; a multipath delay operation.

[0106] In one embodiment, convolution modulation is a multipath delay operation; each element in the preset data sequence is a coefficient of a corresponding delay path; in the preset data sequence, the delay difference of the delay path corresponding to the first non-zero element is 0, and the delay difference of the delay path corresponding to the second non-zero element is 1.

[0107] In one embodiment, the second data sequence and the first data sequence are combined to obtain a third data sequence, including: inserting each element except the last element in the second data sequence between every two elements of the first data sequence, and placing the last element in the second data sequence at the first or last position of the third data sequence, to obtain the third data sequence; or, inserting each element except the last element in the first data sequence between every two elements of the second data sequence, and placing the last element in the first data sequence at the first or last position of the third data sequence, to obtain the third data sequence.

[0108] In one embodiment, the number of elements included in the first data sequence is an even number; the number of elements included in the third data sequence is twice the number of elements included in the first data sequence.

[0109] In one embodiment, the first data sequence includes: constellation point modulation data and L reference signal data, where L≥0.

[0110] In one embodiment, before transmitting the second data sequence, the method further includes performing at least one of the following operations on the second data sequence:

[0111] Add reference sequence; Fourier transform; frequency domain shaping; inverse Fourier transform; filtering.

[0112] For example, a reference sequence is added in the second data sequence or at both ends of the second data sequence;

[0113] Performing FFT or DFT on the second data sequence to obtain a second frequency domain data sequence;

[0114] Performing frequency domain shaping on the second frequency domain data sequence;

[0115] Performing IFFT or IDFT on the second frequency domain data sequence to obtain a second time domain data sequence;

[0116] The second time-domain data sequence is filtered.

[0117] The data modulation method of the present application is exemplarily described below through some embodiments.

[0118] Example 1

[0119] This embodiment exemplifies the process of forming the first data sequence.

[0120] In this embodiment, a data sequence [b(i)] consisting of 0s and 1s is modulated by constellation points to form a first data sequence. The first data sequence is a sequence modulated by π / 2 BPSK.

[0121] The constellation point set of the first data sequence is: [exp(j*θ), exp(j*(θ+π / 2)), exp(j*(θ+π)), exp(j*(θ+3*π / 2))]. The data at odd positions in the data sequence [b(i)] are mapped to constellation points at odd positions in the constellation point set, and the data at even positions in the data sequence [b(i)] are mapped to constellation points at even positions in the constellation point set, to obtain the first data sequence; alternatively, the data at even positions in the data sequence [b(i)] are mapped to constellation points at odd positions in the constellation point set, and the data at odd positions in the data sequence [b(i)] are mapped to constellation points at even positions in the constellation point set, to obtain the first data sequence. On this basis, the modulus of the data in the first data sequence is 1, and the phase difference between adjacent data is ±π / 2.

[0122] Figure 3 is a schematic diagram of a π / 2BPSK modulation constellation diagram provided by an embodiment. As shown in Figure 3, when θ=0, the constellation point set is: [1, j, -1, -j].

[0123] FIG4 is a schematic diagram of another π / 2BPSK modulation constellation diagram provided by an embodiment. As shown in FIG4 , when θ=π / 4, the constellation point set is:

[0124] Example 2

[0125] In this embodiment, the first data sequence includes reference signal data and constellation point modulation data. FIG5 is a schematic diagram of a first data sequence provided by an embodiment. As shown in FIG5, assuming there are s OFDM symbols, the first data sequence is transmitted on the OFDM symbols. Wherein, each OFDM symbol x(m) i (i=0,1,…,s-1) includes reference signal data and constellation point modulation 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. The reference signal data and constellation point modulation data are both π / 2BPSK modulated.

[0126] Example 3

[0127] This embodiment provides an exemplary description of the process of forming the fourth data sequence. The process of forming the fourth data sequence includes:

[0128] (1) A data sequence [b(i)] consisting of 0s and 1s is modulated by a π / 2BPSK constellation point to form a first data sequence. Assume that the first data sequence is [1, j, -1, -j, 1, -j].

[0129] (2) The first data sequence is convolution-modulated with the first preset data sequence to form a second data sequence, wherein the non-zero element contained in the first preset sequence is p0, Then the second data sequence is:

[0130] (3) Merge the second data sequence with the first data sequence: insert each element of the second data sequence between every two corresponding elements of the first data sequence to form a third data sequence. The third data sequence is:

[0131] The modulus values ​​of the data in the third data sequence are all 1, and the phase difference between adjacent data is ±π / 4.

[0132] (4) The third data sequence is convolution-modulated with the second preset data sequence to form a fourth data sequence, wherein the non-zero element contained in the second preset sequence is p1, Then the fourth data sequence is:

[0133] The modulus values ​​of the data in the fourth data sequence are all 1, and the phase difference between adjacent data is 0 or ±π / 4.

[0134] Example 4

[0135] This embodiment provides an exemplary description of the process of forming a new fourth data sequence. The process of forming a new fourth data sequence includes:

[0136] (1) A data sequence [b(i)] consisting of 0s and 1s is modulated by the π / 2BPSK constellation point to form a first data sequence. Assume that the first data sequence is [b0, b1, b2, b3, b4, b5].

[0137] (2) The first data sequence is convolution-modulated with the first preset data sequence to form a second data sequence, wherein the non-zero element contained in the first preset sequence is p0, Then the second data sequence is:

[0138] (3) Merge the second data sequence with the first data sequence: insert each element of the second data sequence between every two elements of the first data sequence to form a third data sequence; the third data sequence is:

[0139] The modulus values ​​of the data in the third data sequence are all 1, and the phase difference between adjacent data is ±π / 4.

[0140] (4) The third data sequence is convolution-modulated with the second preset data sequence to form a fourth data sequence, wherein the non-zero element contained in the second preset sequence is p1, Then the fourth data sequence is:

[0141] The modulus values ​​of the data in the fourth data sequence are all 1, and the phase difference between adjacent data is 0 or ±π / 4.

[0142] (5) The fourth data sequence is combined with the third data sequence to form a new third data sequence; the new third data sequence is:

[0143] (6) Convolutionally modulate the new third data sequence with the third preset data sequence to form a new fourth data sequence; and transmit the new fourth data sequence. The non-zero element contained in the third preset sequence is p2, Then the new fourth data sequence is:

[0144] The modulus values ​​of the data in the new fourth data sequence are all 1, and the phase difference between adjacent data is 0 or ±π / 8.

[0145] Example 5

[0146] This embodiment provides an exemplary description of the process of forming the fourth data sequence. The process of forming the fourth data sequence includes:

[0147] (1) A data sequence [b(i)] consisting of 0s and 1s is modulated by a π / 2BPSK constellation point to form a first data sequence. Assume that the first data sequence is [1, j, -1, -j, 1, -j].

[0148] (2) The first data sequence is convolution-modulated with the first preset data sequence to form a second data sequence, wherein the non-zero element contained in the first preset sequence is p0, Then the second data sequence is:

[0149] (3) Merge the second data sequence with the first data sequence: insert each element of the first data sequence between every two elements of the second data sequence to form a third data sequence; then the third data sequence is:

[0150] (4) The third data sequence is convolution-modulated with the second preset data sequence to form a fourth data sequence, wherein the non-zero element contained in the second preset sequence is p1, Then the fourth data sequence is:

[0151] Example 6

[0152] This embodiment exemplifies the process of forming the fourth data sequence.

[0153] The first data sequence is convoluted and modulated with the first preset data sequence to form a second data sequence; the second data sequence is then combined with the first data sequence to form a third data sequence; and the third data sequence is convoluted and modulated with the second preset data sequence to form a fourth data sequence. The modulation process specifically includes:

[0154] (1) A data sequence [b(i)] consisting of 0s and 1s is modulated by the π / 2BPSK constellation point to form a first data sequence;

[0155] (2) The first data sequence experiences a delay path of p0D 0 +p0D 1 The multipath cyclic delay operation is performed to form a second data sequence; wherein the elements p0 are the coefficients of the two delay paths, D 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.

[0156] (3) Merge the second data sequence with the first data sequence: insert each element of the second data sequence between every two elements of the first data sequence to form a third data sequence. Alternatively, insert each element of the first data sequence between every two elements of the second data sequence to form a third data sequence.

[0157] (4) The third data sequence experiences a delay path of p1D 0 +p1D 1 The multipath cyclic delay operation is performed to form a fourth data sequence; wherein the elements p1 are the coefficients of the two delay paths, D 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.

[0158] Example 7

[0159] This embodiment provides an exemplary description of the process of forming the fourth data sequence. The modulation process specifically includes:

[0160] (1) A data sequence [b(i)] consisting of 0s and 1s is modulated by a π / 2BPSK constellation point to form a first data sequence. Assume that the first data sequence is [1, j, -1, -j, 1, -j].

[0161] (2) As shown in Figure 6, the first data sequence passes through a path with a delay difference of 0 and a path with a delay difference of 1, forming a second data sequence, where the coefficient of the two delay paths is p0. Therefore, the second data sequence is: [p0+p0*j, -p0+p0*j, -p0-p0*j, p0-p0*j, p0+p0*j, p0+p0*j].

[0162] (3) Merge the second data sequence with the first data sequence: insert each element of the second data sequence between every two elements of the first data sequence to form a third data sequence. Therefore, the third data sequence is: [1, p0+p0*j, j, -p0+p0*j, -1, -p0-p0*j, -j, p0-p0*j, 1, p0+p0*j, j, p0+p0*j]

[0163] (4) As shown in FIG7 , the third data sequence passes through the path with a delay difference of 0 and the path with a delay difference of 1, respectively, to form a fourth data sequence, where the coefficient of the two delay paths is p1. Therefore, the fourth data sequence is: [r+o*j, o+r*j, -o+r*j, -r+o*j, -ro*j, -or*j, or*j, ro*j, r+o*j, o+r*j, o+r*j, r+o*j]

[0164] Among them, p1*p0=o, (p1+p0*p1)=r.

[0165] Example 8

[0166] This embodiment exemplifies the process of forming the fourth data sequence.

[0167] The first data sequence is convoluted and modulated with the first preset data sequence to form a second data sequence; the second data sequence is then combined with the first data sequence to form a third data sequence; and the third data sequence is convoluted and modulated with the second preset data sequence to form a fourth data sequence. The modulation process specifically includes:

[0168] (1) A data sequence [b(i)] consisting of 0s and 1s is modulated by the π / 2BPSK constellation point to form a first data sequence;

[0169] (2) Convolutionally modulate the first data sequence with the data sequence [d(m)], where d(0) = p0, d(1) = p0, d(m) = 0 for m = the other values ​​(i.e., all elements in [d(m)] except d(0) and d(1) are 0); m = 0, 1, 2, ..., M-1; M is equal to the length of the first data sequence. That is:

[0170] (3) Each element of the second data sequence is inserted between every two elements of the first data sequence to form a third data sequence. Alternatively, each element of the first data sequence is inserted between every two elements of the second data sequence to form a third data sequence.

[0171] (4) Convolutionally modulate the third data sequence with the data sequence [d(z)], where d(0) = p1, d(1) = p1, d(z) = 0 for z = the other values; z = 0, 1, 2, ..., Z-1; and Z equals the length of the third data sequence. That is:

[0172] Example 9

[0173] This embodiment exemplarily illustrates the process of performing N times of convolution modulation on the first data sequence and the preset data sequence.

[0174] The first data sequence is convoluted with the preset data sequence N times, where n=0, 1, 2, ..., N-1, N≥3, and the non-zero elements contained in the preset sequence are p n , The modulation process includes:

[0175] (1) Initialization: n = 0;

[0176] (2) performing convolution modulation on the first data sequence and the preset data sequence to form a second data sequence;

[0177] (3) merging the second data sequence with the first data sequence to form a third data sequence;

[0178] (4) Counter: n = n + 1;

[0179] (5) Using the third data sequence as a new first data sequence, and performing convolution modulation with the preset data sequence to form a new second data sequence;

[0180] (6) Judge: Is n less than N-1?

[0181] If so, execute (3), (4), (5), and (6);

[0182] If not, execute (7).

[0183] (7) Transmit a new second data sequence (i.e., the second data sequence obtained after N times of convolution modulation).

[0184] Example 10

[0185] This embodiment exemplifies the waveform modulation of the fourth data sequence.

[0186] In this embodiment, before transmitting the fourth data sequence:

[0187] A reference sequence may be added in the fourth data sequence or at both ends of the fourth data sequence;

[0188] FFT or DFT may be performed on the fourth data sequence to obtain a fourth frequency domain data sequence;

[0189] The fourth frequency domain data sequence may be subjected to frequency domain shaping;

[0190] IFFT or IDFT may be performed on the fourth frequency domain data sequence to obtain a fourth time domain data sequence;

[0191] The fourth time-domain data sequence may be filtered.

[0192] Exemplarily, the fourth data sequence can be subjected to discrete Fourier transform (DFT), resource mapping, and frequency domain shaping, and data 0 can be placed at the positions of some subcarriers to implement oversampling inverse discrete Fourier transform (IFFT) and digital-to-analog conversion, etc., and then transmitted on the RF link.

[0193] It should be noted that, when the number of convolution modulations N ≥ 3, the second data sequence obtained after N convolution modulations is transmitted. Before transmitting the second data sequence obtained after N convolution modulations:

[0194] A reference sequence may be added in the second data sequence or at both ends of the second data sequence;

[0195] FFT or DFT may be performed on the second data sequence to obtain a second frequency domain data sequence;

[0196] The second frequency domain data sequence may be subjected to frequency domain shaping;

[0197] IFFT or IDFT may be performed on the second frequency domain data sequence to obtain a second time domain data sequence;

[0198] The second time-domain data sequence may be filtered.

[0199] For example, the second data sequence obtained by N times of convolution modulation can be subjected to discrete Fourier transform (DFT), resource mapping, and frequency domain shaping, and data 0 can be placed at the positions of some subcarriers to implement oversampling IFFT and digital-to-analog conversion, etc., and then transmitted on the RF link.

[0200] The present application also provides a data modulation device. FIG8 is a schematic diagram of the structure of a data modulation device provided by an embodiment. As shown in FIG8, the data modulation device includes:

[0201] A first convolution modulation module 310 is configured to perform convolution modulation on the first data sequence and the first preset data sequence to obtain a second data sequence;

[0202] A merging module 320 is configured to merge the second data sequence with the first data sequence to obtain a third data sequence;

[0203] a second convolution modulation module 330 configured to perform convolution modulation on the third data sequence and a second preset data sequence to obtain a fourth data sequence;

[0204] The non-zero element contained in the first preset data sequence is p0, The non-zero element contained in the second preset data sequence is p1,

[0205] In one embodiment, the first data sequence is a data sequence modulated by π / 2 binary phase shift keying (BPSK).

[0206] In one embodiment, the number of non-zero elements included in the first preset data sequence is 2; and / or the number of non-zero elements included in the second preset data sequence is 2.

[0207] In one embodiment, the first preset data sequence includes two equal non-zero elements; and the second preset data sequence includes two equal non-zero elements.

[0208] In one embodiment, the elements included in the first preset data sequence are equal to the product of the first power factor and the elements included in the fourth preset data sequence; and / or

[0209] The elements included in the second preset data sequence are equal to the product of the second power factor and the elements included in the fifth preset data sequence.

[0210] In one embodiment, the convolution modulation includes one of the following:

[0211] The first data sequence is multiplied by a first power factor and then convolution-modulated with a fourth preset data sequence;

[0212] The first data sequence is convolution-modulated with a fourth preset data sequence, and then multiplied by a first power factor;

[0213] The second data sequence is multiplied by a second power factor and then convolution-modulated with a fifth preset data sequence;

[0214] The second data sequence is convolution-modulated with the fifth preset data sequence and then multiplied by a second power factor.

[0215] In one embodiment, the convolution modulation includes one of the following: a circular convolution operation; a multipath delay operation. In one embodiment, the convolution modulation is a multipath delay operation;

[0216] Each element in the first preset data sequence is a coefficient of a corresponding delay path;

[0217] In the first preset data sequence, the delay difference of the delay path corresponding to the first non-zero element is 0, and the delay difference of the delay path corresponding to the second non-zero element is 1.

[0218] In one embodiment, the first convolution modulation module 310 is configured as follows:

[0219] The first data sequence is delayed by a distance p0D 0 +p0D 1 The multipath cyclic delay operation is performed to obtain the second data sequence; wherein, D 0 Corresponding to the path with a delay difference of 0, D 1 The path corresponding to the delay difference is 1.

[0220] In one embodiment, the convolution modulation is a multipath delay operation;

[0221] Each element in the second preset data sequence is a coefficient of a corresponding delay path;

[0222] In the second preset data sequence, the delay difference of the delay path corresponding to the first non-zero element is 0, and the delay difference of the delay path corresponding to the second non-zero element is 1.

[0223] In one embodiment, the second convolution modulation module 330 is configured as follows:

[0224] The third data sequence is subjected to a time delay of p1D 0 +p1D 1 A multipath cyclic delay operation is performed to obtain a fourth data sequence;

[0225] Among them, D 0 Corresponding to the path with a delay difference of 0, D 1The path corresponding to the delay difference is 1.

[0226] In one embodiment, the convolution modulation is a circular convolution operation;

[0227] The first preset data sequence is [d(m)], where m=0, 1, ..., M-1, and M is the length of the first data sequence;

[0228] In the case of m=0 or m=1, d(m)=p0;

[0229] When m≠0 and m≠1, d(m)=0.

[0230] In one embodiment, the apparatus further comprises:

[0231] a first zero-padding module, configured to pad non-zero elements included in the first preset data sequence with zeros to obtain the first preset data sequence;

[0232] The first preset data sequence and the first data sequence contain the same number of elements.

[0233] In one embodiment, the merging module 320 is configured to:

[0234] Insert each element except the last element in the second data sequence between every two elements of the first data sequence, and place the last element in the second data sequence at the first or last position of the third data sequence;

[0235] Alternatively, each element except the last element in the first data sequence is inserted between every two elements of the second data sequence, and the last element in the first data sequence is placed at the first or last position of the third data sequence.

[0236] In one embodiment, the convolution modulation is a circular convolution operation;

[0237] The second preset data sequence is [d(z)], z=0, 1, ..., Z-1; Z is the length of the third data sequence;

[0238] In the case of z=0 or z=1, d(z)=p1;

[0239] When z≠0 and z≠1, d(z)=0.

[0240] In one embodiment, the apparatus further comprises:

[0241] a second zero-padding module, configured to pad the non-zero elements included in the second preset data sequence with zeros to obtain the second preset data sequence;

[0242] The second preset data sequence and the third data sequence include the same number of elements.

[0243] In one embodiment, the number of elements included in the first data sequence is an even number;

[0244] The number of elements included in the third data sequence is twice the number of elements included in the first data sequence.

[0245] In one embodiment, the first data sequence includes: constellation point modulation data and L reference signal data, where L≥0.

[0246] In one embodiment, the merging module is further configured to:

[0247] The fourth data sequence is combined with the third data sequence to obtain a new third data sequence; the non-zero element contained in the third preset data sequence is p2,

[0248] The device also includes a third convolution modulation module, which is configured to perform convolution modulation on the new third data sequence and a third preset data sequence to obtain a new fourth data sequence.

[0249] In one embodiment, the power control module is further configured to:

[0250] Before performing convolution modulation on the new third data sequence and the third preset data sequence, the new third data sequence may be further multiplied by a power factor to obtain the new third data sequence for performing convolution modulation on the third preset data sequence;

[0251] After performing convolution modulation on the new third data sequence and the third preset data sequence, the convolution modulation result may be multiplied by a power factor to obtain a corresponding new fourth data sequence.

[0252] In one embodiment, before transmitting the fourth data sequence, the apparatus further includes a data processing module configured to perform at least one of the following:

[0253] adding a reference sequence in the fourth data sequence or at both ends of the fourth data sequence;

[0254] Performing FFT or DFT on the fourth data sequence to obtain a fourth frequency domain data sequence;

[0255] performing frequency domain shaping on the fourth frequency domain data sequence;

[0256] Performing IFFT or IDFT on the fourth frequency domain data sequence to obtain a fourth time domain data sequence;

[0257] The fourth time-domain data sequence is filtered.

[0258] The data modulation device proposed in this embodiment and the data modulation method proposed in the above embodiment belong to the same inventive concept. Technical details not fully described in this embodiment can be referred to any of the above embodiments, and this embodiment has the same beneficial effects as executing the data modulation method.

[0259] The present application also provides a data modulation device. FIG9 is a schematic diagram of the structure of a data modulation device provided by an embodiment. As shown in FIG9, the data modulation device includes:

[0260] The convolution modulation module 410 is configured to perform convolution modulation on the first data sequence and the preset data sequence to obtain a second data sequence, wherein the non-zero elements included in the preset data sequence are p n ;

[0261] An updating module 420 is configured to, when n is less than N-1, combine the second data sequence with the first data sequence to obtain a third data sequence, use the third data sequence as a new first data sequence, update n to n+1, and return to performing the convolution modulation operation on the first data sequence;

[0262] The transmission module 430 is configured to transmit the second data sequence when n is equal to N-1;

[0263] The initial value of n is 0. N is the total number of convolution modulations, N≥3.

[0264] In one embodiment, the convolution modulation module 410 is configured as follows:

[0265] In one embodiment, the preset data sequence is [d(k)], k=0, 1, ..., K-1; K is the length of the first data sequence;

[0266] In the case of k=0 or k=1, d(k)=p n ;

[0267] When k≠0 and k≠1, d(k)=0.

[0268] In one embodiment, the apparatus further comprises:

[0269] a zero-padding module configured to pad the non-zero elements contained in the preset data sequence with zeros to obtain the preset data sequence;

[0270] The preset data sequence and the first data sequence contain the same number of elements.

[0271] In one embodiment, the first data sequence is a data sequence modulated by π / 2 binary phase shift keying (BPSK).

[0272] In one embodiment, the number of non-zero elements included in the preset data sequence is 2.

[0273] In one embodiment, the convolution modulation module 410 is configured to: multiply the first data sequence by a power factor, and perform convolution modulation on the first data sequence multiplied by the power factor and a preset data sequence; or, perform convolution modulation on the first data sequence and a preset data sequence, and multiply the convolution modulation result by the power factor to obtain a second data sequence.

[0274] In one embodiment, the convolution modulation includes one of the following: a circular convolution operation; a multipath delay operation.

[0275] In one embodiment, the convolution modulation is a multipath delay operation;

[0276] Each element in the preset data sequence is a coefficient of a corresponding delay path;

[0277] In the preset data sequence, the delay difference of the delay path corresponding to the first non-zero element is 0, and the delay difference of the delay path corresponding to the second non-zero element is 1.

[0278] In one embodiment, combining the second data sequence with the first data sequence to obtain a third data sequence includes:

[0279] Insert each element except the last element in the second data sequence between every two elements of the first data sequence, and place the last element in the second data sequence at the first or last position of the third data sequence to obtain a third data sequence; or

[0280] Each element except the last element in the first data sequence is inserted between every two elements of the second data sequence, and the last element in the first data sequence is placed at the first or last position of the third data sequence to obtain a third data sequence.

[0281] In one embodiment, the number of elements included in the first data sequence is an even number;

[0282] The number of elements included in the third data sequence is twice the number of elements included in the first data sequence.

[0283] In one embodiment, the first data sequence includes: constellation point modulation data and L reference signal data, where L≥0.

[0284] In one embodiment, the predetermined data sequence includes two equal non-zero elements.

[0285] In one embodiment, the elements included in the preset data sequence are equal to the product of the power factor and the elements included in the setting data sequence.

[0286] In one embodiment, the apparatus further includes a modulation module configured to:

[0287] The first data sequence is multiplied by a power factor and then convolutionally modulated with a set data sequence;

[0288] The first data sequence is convolution-modulated with the set data sequence and then multiplied by a power factor.

[0289] In one embodiment, the non-zero elements included in the setting data sequence are 1.

[0290] In one embodiment, before transmitting the second data sequence, the apparatus further includes a data processing module configured to perform at least one of the following:

[0291] adding a reference sequence in the second data sequence or at both ends of the second data sequence;

[0292] Performing FFT or DFT on the second data sequence to obtain a second frequency domain data sequence;

[0293] performing frequency domain shaping on the second frequency domain data sequence;

[0294] Performing IFFT or IDFT on the second frequency domain data sequence to obtain a second time domain data sequence;

[0295] The second time-domain data sequence is filtered.

[0296] The data modulation device proposed in this embodiment and the data modulation method proposed in the above embodiment belong to the same inventive concept. Technical details not fully described in this embodiment can be referred to any of the above embodiments, and this embodiment has the same beneficial effects as executing the data modulation method.

[0297] An embodiment of the present application also provides a communication node. Figure 10 is a schematic diagram of the hardware structure of a communication node provided by an embodiment. As shown in Figure 10, the communication node provided by the present application includes a processor 510 and a memory 520; the processor 510 in the communication node can be one or more, and Figure 10 takes one processor 510 as an example; the memory 520 is configured to store one or more programs; the one or more programs are executed by the one or more processors 510, so that the one or more processors 510 implement the data modulation method as described in the embodiment of the present application.

[0298] The communication node further includes: a communication device 530 , an input device 540 and an output device 550 .

[0299] The processor 510, memory 520, communication device 530, input device 540 and output device 550 in the communication node may be connected via a bus or other means. FIG10 takes the bus connection as an example.

[0300] The input device 540 may be used to receive input digital or character information and generate key signal input related to user settings and function control of the communication node. The output device 550 may include a display device such as a display screen.

[0301] The communication device 530 may include a receiver and a transmitter. The communication device 530 is configured to perform information transmission and reception communication according to the control of the processor 510.

[0302] The memory 520, 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 data modulation method described in the embodiments of the present application (e.g., the first convolution modulation module 310, the merging module 320, and the second convolution modulation module 330 in the data modulation device). The memory 520 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 communication node, etc. In addition, the memory 520 may include high-speed random access memory and may also include non-volatile memory, such as at least one disk storage device, flash memory device, or other non-volatile solid-state memory device. In some instances, the memory 520 may further include memory remotely located relative to the processor 510, and these remote memories may be connected to the communication node via a network. Examples of the above-mentioned networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0303] The present application also provides a storage medium storing a computer program, which, when executed by a processor, implements the data modulation method described in any one of the embodiments of the present application. The method comprises: performing convolution modulation on a first data sequence and a first preset data sequence to obtain a second data sequence; combining the second data sequence with the first data sequence to obtain a third data sequence; and performing convolution modulation on the third data sequence and the second preset data sequence to obtain a fourth data sequence; wherein the non-zero element contained in the first preset data sequence is p0, The non-zero element contained in the second preset data sequence is p1,

[0304] Alternatively, the method includes: performing convolution modulation on the first data sequence and the preset data sequence to obtain a second data sequence, wherein the non-zero elements contained in the preset data sequence are p nWhen n is less than N-1, the second data sequence is combined with the first data sequence to obtain a third data sequence, the third data sequence is used as the new first data sequence, and n is updated to n+1, and the convolution modulation operation on the first data sequence is performed again; when n is equal to N-1, the second data sequence is transmitted; wherein the initial value of n is 0, N is the total number of convolution modulations, N≥3.

[0305] An embodiment of the present application further provides a computer program product, comprising a computer program / instruction, which, when executed by a processor, implements any of the data modulation methods described in the embodiments of the present application.

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

[0307] A computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, carrying computer-readable program code. Such a propagated data signal may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination thereof. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport a program for use by or in conjunction with an instruction execution system, apparatus, or device.

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

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

[0310] An embodiment of the present application further provides a computer program product, including a computer program / instruction, which, when executed by a processor, implements the video encoding method as described in any of the above embodiments.

[0311] The above description is merely an exemplary embodiment of the present application and is not intended to limit the scope of protection of the present application.

[0312] It will be understood by those skilled in the art that the term user terminal covers any suitable type of wireless user equipment, such as a mobile phone, a portable data processor, a portable web browser or a vehicle-mounted mobile station.

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

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

[0315] The block diagram of any logical flow in the drawings of this application may represent program steps, or may represent interconnected logical circuits, modules and functions, or may represent a combination of program steps and logical circuits, modules and functions. A computer program may be stored on a memory. The memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as but not limited to read-only memory (ROM), random access memory (RAM), optical storage devices and systems (digital versatile discs (DVD) or compact disks (CD), etc.). Computer-readable media may include non-transitory storage media. The 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.

[0316] The above description of exemplary embodiments of the present application has been provided by way of exemplary and non-limiting examples. However, various modifications and adaptations of the above embodiments will be apparent to those skilled in the art, when considered in conjunction with the accompanying drawings and the appended claims, without departing from the scope of the present application. Therefore, the proper scope of the present application will be determined by reference to the appended claims.

Claims

1. A data modulation method, comprising: Performing convolution modulation on the first data sequence and the first preset data sequence to obtain a second data sequence; Combining the second data sequence with the first data sequence to obtain a third data sequence; Performing convolution modulation on the third data sequence and the second preset data sequence to obtain a fourth data sequence; The non-zero element contained in the first preset data sequence is p0, The non-zero element contained in the second preset data sequence is p1, 2. The method according to claim 1, wherein The first data sequence is a data sequence modulated by π / 2 binary phase shift keying (BPSK).

3. The method according to claim 1, wherein The number of non-zero elements included in the first preset data sequence is 2; and / or the number of non-zero elements included in the second preset data sequence is 2.

4. The method according to claim 1, wherein The first preset data sequence includes two equal non-zero elements; the second preset data sequence includes two equal non-zero elements.

5. The method according to claim 1, wherein The elements included in the first preset data sequence are equal to the product of the first power factor and the elements included in the fourth preset data sequence; and / or The elements included in the second preset data sequence are equal to the product of the second power factor and the elements included in the fifth preset data sequence.

6. The method according to claim 1 or 4, wherein: The convolution modulation includes one of the following: The first data sequence is multiplied by a first power factor and then convolution-modulated with a fourth preset data sequence; Alternatively, the first data sequence is convolution-modulated with a fourth preset data sequence and then multiplied by a first power factor; Alternatively, the second data sequence is multiplied by a second power factor and then convolution-modulated with a fifth preset data sequence; Alternatively, the second data sequence is convolution-modulated with a fifth preset data sequence and then multiplied by a second power factor.

7. The method according to claim 5, wherein: The non-zero elements included in the fourth preset data sequence are 1; and / or The non-zero element included in the fifth preset data sequence is 1.

8. The method according to claim 1, wherein The convolution modulation includes one of the following: Circular convolution operation; multipath delay operation.

9. The method according to claim 1 or 3, wherein: The convolution modulation is a multipath delay operation; Each element in the first preset data sequence is a coefficient of a corresponding delay path; In the first preset data sequence, the delay difference of the delay path corresponding to the first non-zero element is 0, and the delay difference of the delay path corresponding to the second non-zero element is 1.

10. The method according to claim 9, wherein: The step of performing convolution modulation on the first data sequence and the first preset data sequence to obtain the second data sequence includes: The first data sequence is delayed by a distance p0D 0 +p0D 1 A multipath cyclic delay operation is performed to obtain the second data sequence; Among them, D 0 Corresponding to the path with a delay difference of 0, D 1 The path corresponding to the delay difference is 1.

11. The method according to claim 1 or 3, wherein: The convolution modulation is a multipath delay operation; Each element in the second preset data sequence is a coefficient of a corresponding delay path; In the second preset data sequence, the delay difference of the delay path corresponding to the first non-zero element is 0, and the delay difference of the delay path corresponding to the second non-zero element is 1.

12. The method according to claim 11, wherein The step of performing convolution modulation on the third data sequence and the second preset data sequence to obtain a fourth data sequence includes: The third data sequence is subjected to a time delay of p1D 0 +p1D 1 A multipath cyclic delay operation is performed to obtain the fourth data sequence; Among them, D 0 Corresponding to the path with a delay difference of 0, D 1 The path corresponding to the delay difference is 1.

13. The method according to claim 1, wherein The convolution modulation is a circular convolution operation; The first preset data sequence is [d(m)], where m=0, 1, ..., M-1, and M is the length of the first data sequence; In the case of m=0 or m=1, d(m)=p0; When m≠0 and m≠1, d(m)=0.

14. The method according to claim 1, further comprising: Padding non-zero elements included in the first preset data sequence with zeros to obtain the first preset data sequence; The first preset data sequence and the first data sequence contain the same number of elements.

15. The method according to claim 1, wherein The combining the second data sequence with the first data sequence to obtain a third data sequence includes: Insert each element except the last element in the second data sequence between every two elements of the first data sequence, and place the last element in the second data sequence at the first or last position of the third data sequence; Alternatively, each element except the last element in the first data sequence is inserted between every two elements of the second data sequence, and the last element in the first data sequence is placed at the first or last position of the third data sequence.

16. The method according to claim 1, wherein The convolution modulation is a circular convolution; The second preset data sequence is [d(z)], z=0, 1, ..., Z-1; Z is the length of the third data sequence; In the case of z=0 or z=1, d(z)=p1; When z≠0 and z≠1, d(z)=0.

17. The method according to claim 1, further comprising: Padding non-zero elements included in the second preset data sequence with zeros to obtain the second preset data sequence; The second preset data sequence and the third data sequence include the same number of elements.

18. The method according to claim 1, wherein The number of elements included in the first data sequence is an even number; The number of elements included in the third data sequence is twice the number of elements included in the first data sequence.

19. The method according to claim 1, wherein The first data sequence includes: constellation point modulation data and L reference signal data, where L≥0.

20. The method of claim 1, further comprising: Combining the fourth data sequence with the third data sequence to obtain a new third data sequence; Performing convolution modulation on the new third data sequence and the third preset data sequence to obtain a new fourth data sequence; The non-zero element contained in the third preset data sequence is p2, 21. The method according to claim 1 or 20, further comprising, before transmitting the fourth data sequence, performing at least one of the following operations on the fourth data sequence: Add reference sequence; Fourier transform; frequency domain shaping; inverse Fourier transform; filtering.

22. A data modulation method, comprising: The first data sequence is convoluted with the preset data sequence to obtain a second data sequence, wherein the non-zero elements contained in the preset data sequence are p n ; When n is less than N-1, combine the second data sequence with the first data sequence to obtain a third data sequence, use the third data sequence as a new first data sequence, update n to n+1, and return to performing the convolution modulation operation on the first data sequence; When n is equal to N-1, transmitting the second data sequence; The initial value of n is 0. N is the total number of convolution modulations, and N≥3.

23. The method according to claim 22, wherein The step of performing convolution modulation on the first data sequence and the preset data sequence to obtain the second data sequence includes: The first data sequence is delayed by a distance p n D 0 +p n D 1 The multipath cyclic delay operation is used to obtain the second data sequence, where D 0 Corresponding to the path with a delay difference of 0, D 1 The path corresponding to the delay difference is 1.

24. The method according to claim 22, wherein The preset data sequence is [d(k)], k=0, 1, ..., K-1; K is the length of the first data sequence; In the case of k=0 or k=1, d(k)=p n ; When k≠0 and k≠1, d(k)=0.

25. The method of claim 22, further comprising: Filling the non-zero elements contained in the preset data sequence with zeros to obtain the preset data sequence; The preset data sequence and the first data sequence contain the same number of elements.

26. A communication node, 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 data modulation method according to any one of claims 1 to 25.

27. A computer-readable storage medium having a computer program stored thereon, wherein: When the program is executed by a processor, the data modulation method according to any one of claims 1 to 25 is implemented.

Images