Data modulation method, communication node and storage medium

Abstract

The invention provides a data modulation method, a communication node and a storage medium. The method comprises the following steps: inserting one data between every two adjacent data in a first data sequence to form a second data sequence; performing Fourier transform on the second data sequence to form a third data sequence; and intercepting R times of data from the third data sequence to form a fourth data sequence, where R is less than 1.

Description

Technical Field

[0001] This application relates to the field of data processing technology, such as a data modulation method, a communication node, and a storage medium. Background Technology

[0002] With the development of wireless communication technology, the capacity and coverage of communication systems are constantly expanding, and the requirements for signal quality are becoming increasingly stringent. The peak-to-average power ratio (PAPR) of a communication signal is a key indicator for measuring signal quality and power amplifier efficiency. An excessively high PAPR can lead to reduced power amplifier efficiency, thereby affecting the coverage capability and signal transmission quality of the communication system.

[0003] In existing communication systems, the PAPR (Power Amount Reduction Ratio) of multi-carrier Orthogonal Frequency Division Multiplexing (OFDM) signals is very high. A high PAPR means that the peak power of the signal is much greater than the average power. This not only leads to nonlinear distortion in the power amplifier but also forces the power amplifier to operate at high power, increasing energy consumption and heat loss, and reducing its efficiency. Although the PAPR of single-carrier OFDM (DFT-s-OFDM) signals based on Discrete Fourier Transform is relatively low, it is still difficult to meet the low PAPR requirements of future communications. Therefore, a modulation method that can further reduce PAPR is needed. Summary of the Invention

[0004] This application provides a data modulation method, a communication node, and a storage medium.

[0005] This application provides a data modulation method, including:

[0006] Insert one data point between every two adjacent data points in the first data sequence to form the second data sequence;

[0007] Perform a Fourier transform on the second data sequence to form a third data sequence;

[0008] R times the data is extracted from the third data sequence to form a fourth data sequence, wherein R is less than 1.

[0009] This application also provides a communication node, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the program to implement the above-described data modulation method.

[0010] This application also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the above-described data modulation method. Attached Figure Description

[0011] Figure 1 A flowchart of a data modulation method provided in one embodiment;

[0012] Figure 2 A schematic diagram of a data modulation process provided in one embodiment;

[0013] Figure 3 A schematic diagram of another data modulation process provided in one embodiment;

[0014] Figure 4 A schematic diagram of yet another data modulation process provided in one embodiment;

[0015] Figure 5 A schematic diagram of the power spectral density of a third data sequence provided in one embodiment;

[0016] Figure 6 A schematic diagram of the power spectral density of another third data sequence provided in one embodiment;

[0017] Figure 7 A schematic diagram of a rooted cosine function provided in one embodiment;

[0018] Figure 8 A schematic diagram of a third data sequence modulus provided in one embodiment;

[0019] Figure 9 A schematic diagram of a third data sequence modulus provided in one embodiment;

[0020] Figure 10 A schematic diagram of the structure of a data modulation apparatus provided in one embodiment;

[0021] Figure 11 This is a schematic diagram of the hardware structure of a communication node provided in one embodiment. Detailed Implementation

[0022] The present application will now be described in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the application and not intended to limit it. It should be noted that, unless otherwise specified, the embodiments and features described herein can be arbitrarily combined with each other. Furthermore, it should be noted that, for ease of description, only the parts relevant to the present application are shown in the accompanying drawings, not the entire structure.

[0023] Figure 1This is a flowchart illustrating a data modulation method as provided in one embodiment. This method can be applied to a data modulation device or a data transmission device. Figure 1 As shown, the method provided in this embodiment includes the following steps:

[0024] Step 110: Insert one data point between every two adjacent data points in the first data sequence to form the second data sequence.

[0025] Step 120: Perform a Fourier transform on the second data sequence to form a third data sequence.

[0026] Step 130: Extract R times the amount of data from the third data sequence to form a fourth data sequence, where R is less than 1.

[0027] The data modulation method in this embodiment improves spectral efficiency and reduces out-of-band leakage by inserting data between every two adjacent data points, performing a Fourier transform, and then truncating a portion of the data to form the final data sequence. This results in a lower peak-to-average power ratio and less performance loss. Furthermore, coverage can be enhanced, improving the efficiency of the power amplifier.

[0028] In one embodiment, the value of R satisfies at least one of the following:

[0029] The value is 3 / 4; the value is 3 / 5; the value range is [1 / 2, 3 / 4]; the value range is [1 / 2, 17 / 20].

[0030] In this embodiment, based on the average power spectral density (PSD) plot of the third data sequence, the modulus of the third data sequence is exactly at the minimum value at 3 / 4 bandwidth. By referencing this position, the third data sequence is truncated, resulting in lower out-of-band leakage, lower peak-to-average power ratio, and less performance loss.

[0031] In one embodiment, extracting R times the amount of data from the third data sequence to form a fourth data sequence includes:

[0032] R times the data is extracted from the third data sequence, and the remaining data in the third data sequence other than the extracted data is discarded or set to 0 to form a fourth data sequence.

[0033] In one embodiment, extracting R times the amount of data from the third data sequence to form a fourth data sequence includes:

[0034] The third data sequence is multiplied by the fifth data sequence to obtain the multiplied data sequence. The zero data obtained by multiplying the zero data in the fifth data sequence is discarded or retained to form the fourth data sequence. The number of non-zero data in the fifth data sequence is R times the number of data in the third data sequence, and the number of zero data in the fifth data sequence is 1-R times the number of data in the third data sequence.

[0035] In one embodiment, the number of data with a value of 1 in the fifth data sequence is R times the number of data in the third data sequence.

[0036] In one embodiment, the fifth data sequence is the discrete values ​​of a filter function.

[0037] In one embodiment, extracting R times the amount of data from the third data sequence to form a fourth data sequence includes:

[0038] The frequency domain of the third data sequence is filtered using a filtering function to form the fourth data sequence;

[0039] The width of the frequency domain of the filter function is R times the width of the frequency domain of the third data sequence.

[0040] In one embodiment, the filtering function is a root raised cosine function or a raised cosine function, wherein the roll-off coefficient ranges from [0, 0.7]; or, the filtering function is a rectangular function, wherein the roll-off coefficient is 0.

[0041] In one embodiment, performing a Fourier transform on the second data sequence to form a third data sequence includes:

[0042] The second data sequence is subjected to a discrete Fourier transform and then cyclically shifted to form a third data sequence;

[0043] Among them, cyclic shift can be a semi-cyclic shift;

[0044] A fourth data sequence is formed by extracting R times the amount of data from the third data sequence, including:

[0045] R times the continuous data is extracted from the third data sequence to form the fourth data sequence.

[0046] In one embodiment, performing a Fourier transform on the second data sequence to form a third data sequence includes:

[0047] Perform a discrete Fourier transform on the second data sequence to form a third data sequence;

[0048] A fourth data sequence is formed by extracting R times the amount of data from the third data sequence, including:

[0049] R times the data is truncated from both ends of the third data sequence to form a fourth data sequence.

[0050] In one embodiment, extracting R times the data from the third data sequence to form a fourth data sequence includes: extracting R times the data from both ends of the third data sequence and performing a cyclic shift to form the fourth data sequence.

[0051] In one embodiment, performing a Fourier transform on the second data sequence to form a third data sequence includes:

[0052] Perform a discrete Fourier transform on the second data sequence to form a third data sequence;

[0053] A fourth data sequence is formed by extracting R times the amount of data from the third data sequence, including:

[0054] R times the amount of data is extracted from the middle of the third data sequence to form the fourth data sequence.

[0055] In one embodiment, for every two adjacent data,

[0056] The power of the inserted data is equal to the power of the adjacent data;

[0057] The phase of the inserted data is between the phases of the adjacent data, or the phase of the opposite of the inserted data is between the phases of the adjacent data.

[0058] In one embodiment, for every two adjacent data, the inserted data is the sum of the adjacent data and... The product of, or, the inserted data is the sum of the adjacent data and The product of.

[0059] In one embodiment, in addition to inserting one data between every two adjacent data in the first data sequence, one data is also inserted before or after the first data sequence to form a second data sequence.

[0060] In one embodiment, the data sequence obtained by inserting one data point between every two adjacent data points in the first data sequence is convolved with p1[1,1] or p1[1,-1] to form a second data sequence, where p1 is a constant and is a power factor.

[0061] In one embodiment, R is based on or The position of the frequency point at or near the zero value in the power spectral density is determined, where p2 is a constant and is the power factor.

[0062] In one embodiment, the value of p1 satisfies at least one of the following:

[0063] The value is 1; the value is 1 / (2cos(π / 8)); the value is...

[0064] In one embodiment, the value of p2 satisfies at least one of the following:

[0065] The value is 1; the value is

[0066] In one embodiment, the first data sequence is a π / 2BPSK data sequence or a BPSK sequence.

[0067] In one embodiment, the first data sequence is a part of a sixth data sequence, the length of which is greater than the length of the first data sequence.

[0068] In one embodiment, the method further includes:

[0069] The fourth data sequence is subjected to an oversampled inverse Fourier transform to form time-domain data; the time-domain data is then transmitted.

[0070] In one embodiment, the method further includes:

[0071] The fourth data sequence is filtered and then subjected to an oversampled inverse Fourier transform to form time-domain data;

[0072] Transmit the time-domain data.

[0073] In one embodiment, before performing the oversampled inverse Fourier transform, the method further includes:

[0074] Multiply the fourth data sequence by a power factor.

[0075] This application also provides a data modulation method, including:

[0076] Step 210: Insert one data point between every two adjacent data points in the first data sequence to form the second data sequence;

[0077] Step 220: For the spectrum corresponding to the second data sequence, take the zero frequency as the center and extract frequency domain data of a set period multiple within one frequency domain period to form a fourth data sequence, where R is less than 1.

[0078] In one embodiment, when the number of data in the fourth data sequence is even, frequency domain data of a set period multiple is extracted within one frequency domain period centered on zero frequency, satisfying that: one more frequency domain data is extracted on one side of zero frequency than on the other side of zero frequency.

[0079] In one embodiment, the fourth data sequence is mapped to frequency domain resources allocated by the user for transmission.

[0080] The data modulation method of this application is illustrated by some embodiments below.

[0081] Example 1

[0082] Figure 2 This is a schematic diagram illustrating a data modulation process according to one embodiment. Figure 2 As shown, in this embodiment, one data point is inserted between every two adjacent data points in the first data sequence to form the second data sequence. Then, a Fourier transform is performed on the second data sequence to form the third data sequence. Next, R times the data is truncated from the third data sequence to form the fourth data sequence. Finally, an oversampled inverse Fourier transform is performed on the fourth data sequence to form time-domain data, which is then transmitted. Here, R < 1, and truncating R times the data can be understood as directly taking R times the data from the third data sequence, while the remaining (1-R) ​​times the data from the third data sequence is discarded or becomes 0.

[0083] Example 2

[0084] Figure 3 This is a schematic diagram of another data modulation process provided in one embodiment. For example... Figure 3 As shown, in this embodiment, one data point is inserted between every two adjacent data points in the first data sequence to form the second data sequence. Then, a Fourier transform is performed on the second data sequence to form the third data sequence. Next, R times the amount of data is truncated from the third data sequence to form the fourth data sequence. Finally, an oversampled inverse Fourier transform is performed on the fourth data sequence to form time-domain data, which is then transmitted. Here, R < 1. Truncating R times the amount of data can be understood as performing a dot product between the third and fifth data sequences. The number of non-zero data points in the fifth data sequence is R times the number of data points in the third data sequence, and the number of zero data points in the fifth data sequence is (1-R) ​​times the number of data points in the third data sequence. Zero data points after the dot product between the third and fifth data sequences are either discarded or retained.

[0085] Example 3

[0086] Figure 4 This is a schematic diagram of yet another data modulation process provided in one embodiment. For example... Figure 4As shown, in this embodiment, one data point is inserted between every two adjacent data points in the first data sequence to form the second data sequence. Then, a Fourier transform is performed on the second data sequence to form the third data sequence. Next, R times the data is truncated from the third data sequence to form the fourth data sequence. Finally, an oversampled inverse Fourier transform is performed on the fourth data sequence to form time-domain data, which is then transmitted. Here, R < 1, and truncating R times the data can be understood as using a filtering function to filter the third data sequence. The width (non-zero width) of the filtering function in the frequency domain is R times the frequency domain width of the third data sequence.

[0087] Example 4

[0088] In this embodiment, data can be truncated by a factor of R based on the average PSD shape of the third data sequence. The first data sequence is a π / 2BPSK data sequence. In the first data sequence, one new data point is inserted between every two adjacent π / 2BPSK data points to form the second data sequence. Each inserted data point can be the sum of its two adjacent π / 2BPSK data points multiplied by a factor of R. The second data sequence is obtained by performing a Fourier transform and a semi-circular shift to form a third data sequence. Then, R times the data is extracted from the third data sequence to form a fourth data sequence, which is then transmitted.

[0089] Figure 5 This is a schematic diagram of the average power spectral density of a third data sequence provided as an embodiment. Figure 5 As shown, the horizontal axis represents relative frequency (Hz), and the vertical axis represents power spectral density (PSD) (dB). The length of the horizontal axis is equal to the data bandwidth of the third data sequence. Figure 5 Nine scales are evenly marked in the middle. The horizontal axis [0] is the center frequency or the 0th subcarrier. The negative values ​​of the horizontal axis [-1 / 2, -3 / 8, -1 / 4, -1 / 8] are negative frequencies, and the positive values ​​of the horizontal axis [1 / 8, 1 / 4, 3 / 8, 1 / 2] are positive frequencies. The power spectral density of the third data sequence is the smallest at the position of the horizontal axis [-3 / 8, 3 / 8]. The length of the horizontal axis range [-3 / 8, 3 / 8] is exactly 3 / 4 times the length of the third data sequence.

[0090] Extracting R times the data from the third data sequence, where R can be 3 / 4. Extracting R times the data to form the fourth data sequence means extracting the data from the third data sequence within the x-coordinate range [-3 / 8, 3 / 8].

[0091] The minimum value of R is 1 / 2, which means that the data sequence within the range of x-coordinate [-1 / 4, 1 / 4] of the third data sequence can be truncated to form the fourth data sequence; the maximum value of R is 17 / 20, which means that the data sequence within the range of x-coordinate [-17 / 40, 17 / 40] of the third data sequence can be truncated to form the fourth data sequence.

[0092] power spectral density and Figure 5 The average power spectral density shape of the third data sequence described in the text is the same, and R is based on... The position of the frequency point at or near the zero value in the power spectral density is determined. The power spectral density plot contains a large peak and a small peak. The position of the large peak is used to determine the location of the extracted data and the R value in the third data sequence. The frequency points at or near the zero value in the power spectral density are used as boundaries. The data portion of the third data sequence corresponding to the intermediate frequency domain interval within the two boundaries is extracted to form the fourth data sequence.

[0093] Example 5

[0094] This embodiment is an example of the average PSD shape of the third data sequence and the value of R in the data truncation of R times.

[0095] A fourth data sequence is formed by using a first data sequence, where the first data sequence is a π / 2BPSK data sequence. In the first data sequence, a new data point is inserted between every two adjacent π / 2BPSK data points to form a second data sequence. This new data point is the sum of the two adjacent π / 2BPSK data points multiplied by a certain factor. The second data sequence is then subjected to a Fourier transform to form a third data sequence. Then, R times the amount of data is truncated to form a fourth data sequence, which is then transmitted.

[0096] The average power spectral density of the third data sequence is as follows: Figure 6 As shown, the horizontal axis represents relative frequency (Hz), and the vertical axis represents power spectral density (PSD) (dB). The length of the horizontal axis is equal to the data bandwidth of the third data sequence. Figure 6 Nine scales are evenly marked in the middle, with the horizontal coordinates [0:N-1] representing the 0th subcarrier, the 1st subcarrier, and so on. The power spectral density of the third data sequence is the smallest at the horizontal coordinate [1 / 8, 7 / 8], and the length of the horizontal coordinate range [1 / 8, 7 / 8] is exactly 3 / 4 times the length of the third data sequence.

[0097] In the phrase "the fourth data sequence is formed by truncating R times the data", R takes the value of 3 / 4. The phrase "the fourth data sequence is formed by truncating R times the data" means truncating the data sequence within the range of the horizontal coordinate [1 / 8, 7 / 8] of the third data sequence to form the fourth data sequence.

[0098] Wherein, the minimum value of R in the phrase "truncating R times the data to form the fourth data sequence" is 1 / 2, that is, truncating R times the data to form the fourth data sequence means truncating the data sequence within the range of the horizontal coordinate [1 / 4, 3 / 4] of the third data sequence to form the fourth data sequence. The maximum value of R in the phrase "truncating R times the data to form the fourth data sequence" is 17 / 20, that is, truncating R times the data to form the fourth data sequence means truncating the data sequence within the range of the horizontal coordinate [1.5 / 20, 18.5 / 20] of the third data sequence to form the fourth data sequence.

[0099] power spectral density and Figure 6 The average power spectral density shape of the third data sequence described in the text is the same, and R is based on... The position of the frequency point at or near the zero value in the power spectral density is determined. The power spectral density plot contains a large peak and a small peak. The position of the large peak is used to determine the location of the extracted data and the R value in the third data sequence. The frequency points at or near the zero value in the power spectral density are used as boundaries. The data portion of the third data sequence corresponding to the intermediate frequency domain interval within the two boundaries is extracted to form the fourth data sequence.

[0100] Example 6

[0101] In this embodiment, the first data sequence is a π / 2BPSK data sequence. In the first data sequence, a new data point is inserted between every two adjacent π / 2BPSK data points to form a second data sequence. Each inserted data point can be the sum of its two adjacent π / 2BPSK data points multiplied by a certain factor. The obtained data sequence is subjected to Fourier transform and semi-circular shift to form a third data sequence. The third data sequence is then filtered to form a fourth data sequence, which is then transmitted.

[0102] The width (non-zero width) of the filter function in the frequency domain is R times the width of the third data sequence in the frequency domain.

[0103] For example, the filter function is the root-raised cosine function, the half-power width of the root-raised cosine function is half the frequency domain width of the third data sequence, and the roll-off factor of the root-raised cosine function is in the range of [0, 0.7]. Figure 7 This is a schematic diagram of a root-raised cosine function provided as an embodiment. For example... Figure 7As shown in the figure, the vertical axis represents the modulus of the third data sequence, and the root-raised cosine functions for roll-off factors of 0, 0.1, 0.3, 0.5, and 0.7 are shown in the figure.

[0104] Specifically, when the roll-off factor of the root-raised cosine function is 0, the filtering function is a rectangular function, and the non-zero width of the filtering function in the frequency domain is 1 / 2 times the frequency domain width of the third data sequence; when the roll-off factor of the root-raised cosine function is 0.1, the non-zero width of the filtering function in the frequency domain is 11 / 20 times the frequency domain width of the third data sequence; when the roll-off factor of the root-raised cosine function is 0.3, the non-zero width of the filtering function in the frequency domain is 13 / 20 times the frequency domain width of the third data sequence; when the roll-off factor of the root-raised cosine function is 0.5, the non-zero width of the filtering function in the frequency domain is 15 / 20 times the frequency domain width of the third data sequence; and when the roll-off factor of the root-raised cosine function is 0.7, the non-zero width of the filtering function in the frequency domain is 17 / 20 times the frequency domain width of the third data sequence.

[0105] It should be noted that in some embodiments, the filtering function can also be a raised cosine function.

[0106] Example 7

[0107] In this embodiment, the first data sequence is a π / 2BPSK data sequence. In the first data sequence, a new data point is inserted between every two adjacent π / 2BPSK data points to form a second data sequence. Each inserted data point can be the sum of its two adjacent π / 2BPSK data points multiplied by a certain factor. The obtained data sequence is subjected to Fourier transform and semi-circular shift to form the third data sequence. Then, the third data sequence is multiplied by the fifth data sequence. Zero data after the multiplication is discarded or retained to form the fourth data sequence, which is then transmitted.

[0108] In the fifth data sequence, the number of non-zero data is R times the number of data in the third data sequence, and the number of zero data in the fifth data sequence is (1-R) ​​times the number of data in the third data sequence.

[0109] Figure 8 This is a schematic diagram illustrating the modulus of a third data sequence as provided in one embodiment. For example... Figure 8 As shown, the modulus of the third data sequence is obtained by averaging multiple third data sequences, with R taking a value of 3 / 4. The fifth data sequence is... Figure 8 The data sequence represented by the dashed line in the middle of the fifth data sequence includes data 1 that is R times the number of data in the third data sequence in the middle, and data 0 that is (1-R) / 2 times the number of data in the third data sequence on both sides, for a total of (1-R) ​​times 0.

[0110] In this embodiment, the fifth data sequence is also the discrete value of a rectangular function with a width of 3 / 4.

[0111] Example 8

[0112] In this embodiment, the first data sequence is a π / 2BPSK data sequence. In the first data sequence, a new data point is inserted between every two adjacent π / 2BPSK data points to form a second data sequence. Each inserted data point can be the sum of its two adjacent π / 2BPSK data points multiplied by a certain factor. The second data sequence is obtained by performing a Fourier transform on it to form a third data sequence. Then, R times the amount of data is extracted from the third data sequence to form a fourth data sequence.

[0113] The second data sequence is subjected to a Fourier transform to form a third data sequence. The third data sequence may be sorted according to [0th subcarrier, positive frequency, negative frequency]. Therefore, the third data sequence is semi-circularly shifted and sorted according to [negative frequency, 0th subcarrier, positive frequency]. R times the continuous data is extracted from it to form a fourth data sequence.

[0114] or, Figure 9 This is a schematic diagram illustrating the modulus of a third data sequence as provided in one embodiment. For example... Figure 9 As shown, R / 2 times the data is truncated from both sides of the third data sequence, and then a semi-circular shift is performed to form the fourth data sequence.

[0115] This application also provides a data modulation apparatus. Figure 10 This is a schematic diagram of a data modulation apparatus provided in one embodiment. Figure 10 As shown, the data modulation device includes:

[0116] The insertion module 210 is configured to insert one data point between every two adjacent data points in the first data sequence to form a second data sequence;

[0117] Transformation module 220 is configured to perform a Fourier transform on the second data sequence to form a third data sequence;

[0118] The interception module 230 is configured to intercept R times the data from the third data sequence to form a fourth data sequence, wherein R is less than 1.

[0119] In one embodiment, the value of R satisfies at least one of the following:

[0120] The value is 3 / 4; the value is 3 / 5; the value range is [1 / 2, 3 / 4]; the value range is [1 / 2, 17 / 20].

[0121] In one embodiment, the interception module 230 is configured to: intercept the R times of data from the third data sequence, and discard or set the remaining data in the third data sequence other than the intercepted data to 0, to form a fourth data sequence.

[0122] In one embodiment, the interception module 230 is configured to: multiply the third data sequence and the fifth data sequence by a dot product to obtain a multiplied data sequence, and discard or retain the zero data obtained by multiplying the zero data in the fifth data sequence by a dot product to form a fourth data sequence;

[0123] Wherein, the number of non-zero data in the fifth data sequence is R times the number of data in the third data sequence, and the number of zero data in the fifth data sequence is 1-R times the number of data in the third data sequence.

[0124] In one embodiment, the number of data with a value of 1 in the fifth data sequence is R times the number of data in the third data sequence.

[0125] In one embodiment, the fifth data sequence is the discrete values ​​of a filter function.

[0126] In one embodiment, the interception module 230 is configured as follows:

[0127] The frequency domain of the third data sequence is filtered using a filtering function to form the fourth data sequence;

[0128] The width of the frequency domain of the filter function is R times the width of the frequency domain of the third data sequence.

[0129] In one embodiment, the filtering function is a root-raised cosine function or a raised cosine function, wherein the roll-off coefficient ranges from [0, 0.7]; or,

[0130] The filtering function is a rectangular function, where the roll-off factor is 0.

[0131] In one embodiment, the transformation module 220 is configured as follows:

[0132] The second data sequence is subjected to a discrete Fourier transform and then cyclically shifted to form a third data sequence;

[0133] A fourth data sequence is formed by extracting R times the amount of data from the third data sequence, including:

[0134] R times the continuous data is extracted from the third data sequence to form the fourth data sequence.

[0135] In one embodiment, the transformation module 220 is configured as follows:

[0136] Perform a discrete Fourier transform on the second data sequence to form a third data sequence;

[0137] A fourth data sequence is formed by extracting R times the amount of data from the third data sequence, including:

[0138] R times the data is truncated from both ends of the third data sequence to form a fourth data sequence.

[0139] In one embodiment, the interception module 230 is further configured to: intercept R times the data at both ends of the third data sequence and perform cyclic shifting to form a fourth data sequence.

[0140] In one embodiment, performing a Fourier transform on the second data sequence to form a third data sequence includes: performing a discrete Fourier transform on the second data sequence to form a third data sequence;

[0141] The interception module 230 is configured to: intercept R times the data from the third data sequence to form a fourth data sequence, including:

[0142] R times the amount of data is extracted from the middle of the third data sequence to form the fourth data sequence.

[0143] In one embodiment, for every two adjacent data,

[0144] The power of the inserted data is equal to the power of the adjacent data;

[0145] The phase of the inserted data is between the phases of the adjacent data, or the phase of the opposite of the inserted data is between the phases of the adjacent data.

[0146] In one embodiment, for every two adjacent data, the inserted data is the sum of the adjacent data and... The product of, or, in one embodiment, for every two adjacent data, the inserted data is the sum of the adjacent data and... The product of.

[0147] In one embodiment, the insertion module 210 is further configured to insert one data item before or after the first data sequence to form a second data sequence.

[0148] In one embodiment, the device further includes a convolution module configured to: convolve the data sequence obtained by inserting one data between every two adjacent data in the first data sequence with p1[1,1] or p1[1,-1] to form a second data sequence, wherein p1 is a constant and is a power factor.

[0149] In one embodiment, the value of p1 satisfies at least one of the following:

[0150] The value is 1; the value is 1 / (2cos(π / 8)); the value is...

[0151] In one embodiment, R is based on or The position of the frequency point at or near the zero value in the power spectral density is determined, where p2 is a constant and is the power factor.

[0152] In one embodiment, the value of p2 satisfies at least one of the following:

[0153] The value is 1; the value is

[0154] In one embodiment, the first data sequence is a π / 2BPSK data sequence or a BPSK sequence.

[0155] In one embodiment, the first data sequence is a part of a sixth data sequence, the length of which is greater than the length of the first data sequence.

[0156] In one embodiment, the device further includes:

[0157] The first inverse transform module is configured to perform an oversampled inverse Fourier transform on the fourth data sequence to form time-domain data;

[0158] The transmission module is configured to transmit the time-domain data.

[0159] In one embodiment, the device further includes:

[0160] The second inverse transform module is configured to perform filtering operations on the fourth data sequence and perform oversampling Fourier inverse transform to form time-domain data;

[0161] The transmission module is configured to transmit the time-domain data.

[0162] In one embodiment, the device further includes, prior to performing the oversampled inverse Fourier transform:

[0163] The power control module is configured to multiply the fourth data sequence by a power factor.

[0164] The data modulation device proposed in this embodiment belongs to the same inventive concept as the data modulation method proposed in the above embodiments. Technical details not described in detail in this embodiment can be found in any of the above embodiments. Furthermore, this embodiment has the same beneficial effects as performing the data modulation method.

[0165] This application also provides a communication node. Figure 11 This is a schematic diagram of the hardware structure of a communication node provided in one embodiment, such as... Figure 11As shown, the communication node provided in this application includes a processor 310 and a memory 320; the processor 310 in the communication node can be one or more. Figure 11 Taking a processor 310 as an example; the memory 320 is configured to store one or more programs; the one or more programs are executed by the one or more processors 310, causing the one or more processors 310 to implement the data modulation method as described in the embodiments of this application.

[0166] The communication node also includes: a communication device 330, an input device 340, and an output device 350.

[0167] The processor 310, memory 320, communication device 330, input device 340, and output device 350 in the communication node can be connected via a bus or other means. Figure 11 Taking the example of a connection between China and Israel via a bus.

[0168] Input device 340 can be used to receive input digital or character information, and to generate key signal inputs related to user settings and function control of the communication node. Output device 350 may include display devices such as a display screen.

[0169] The communication device 330 may include a receiver and a transmitter. The communication device 330 is configured to perform information transmission and reception communication under the control of the processor 310.

[0170] The memory 320, 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 this application (e.g., the insertion module 210, transformation module 220, and interception module 230 in the data modulation apparatus). The memory 320 may include a program storage area and a data storage area, wherein the program storage area may store the operating system and at least one application program required for a function; the data storage area may store data created based on the use of the communication node, etc. Furthermore, the memory 320 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 storage device. In some instances, the memory 320 may further include memory remotely located relative to the processor 310, and these remote memories can be connected to the communication node via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0171] This application also provides a storage medium storing a computer program. When executed by a processor, the computer program implements any of the data modulation methods described in this application. The data modulation method includes: inserting one data point between every two adjacent data points in a first data sequence to form a second data sequence; performing a Fourier transform on the second data sequence to form a third data sequence; and extracting R times the amount of data from the third data sequence to form a fourth data sequence, where R is less than 1.

[0172] This application also provides a computer program product, including a computer program / instructions, which, when executed by a processor, implement any of the data modulation methods described in this application. The data modulation method includes: inserting one data point between every two adjacent data points in a first data sequence to form a second data sequence; performing a Fourier transform on the second data sequence to form a third data sequence; and extracting R times the amount of data from the third data sequence to form a fourth data sequence, wherein R is less than 1.

[0173] The computer storage medium in this application embodiment can be 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. For example, a computer-readable storage medium can be, but is not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination thereof. More specific examples of computer-readable storage media (a non-exhaustive list) include: an electrical connection having one or more wires, a portable computer disk, a hard disk, random access memory (RAM), read-only memory (ROM), erasable programmable read-only memory (EPROM), flash memory, optical fiber, portable CD-ROM, optical storage device, magnetic storage device, or any suitable combination thereof. The computer-readable storage medium can be any tangible medium containing or storing a program that can be used by or in conjunction with an instruction execution system, apparatus, or device.

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

[0175] Program code contained on a computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless, wire, optical fiber, radio frequency (RF), etc., or any suitable combination thereof.

[0176] Computer program code for performing the operations of this application can be written in one or more programming languages ​​or a combination thereof, including object-oriented programming languages ​​such as Java, Smalltalk, and C++, as well as 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 a standalone software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving remote computers, the remote computer can be connected to the user's computer via any type of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computer (e.g., via the Internet using an Internet service provider).

[0177] This application also provides a computer program product, including a computer program / instructions, which, when executed by a processor, implement the data modulation method as described in any of the above embodiments.

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

[0179] Those skilled in the art will understand that the term user terminal encompasses any suitable type of wireless user equipment, such as mobile phones, portable data processing portable web browsers, or vehicle-mounted mobile stations.

[0180] Generally, the various embodiments of this application can be implemented in hardware or dedicated circuitry, software, logic, or any combination thereof. For example, some aspects can be implemented in hardware, while others can be implemented in firmware or software that can be executed by a controller, microprocessor, or other computing device, although this application is not limited thereto.

[0181] Embodiments of this application can be implemented by executing computer program instructions through the data processor of a mobile device, for example, in a processor entity, or through hardware, or through a combination of software and hardware. The computer program instructions can be assembly instructions, Instruction Set Architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, status setting data, or source code or object code written in any combination of one or more programming languages.

[0182] Any block diagram of logical flow in the accompanying drawings of this 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. The computer program may be stored in memory. The memory may be of any type suitable to 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 Video Disc (DVD) or Compact Disk (CD), etc.). Computer-readable media may include non-transitory storage media. The data processor may be of any type suitable to the local technical environment, such as, but not limited to, general-purpose computers, special-purpose computers, microprocessors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), and processors based on multi-core processor architectures.

[0183] A detailed description of exemplary embodiments of this application has been provided above through exemplary and non-limiting examples. However, various modifications and adjustments to the above embodiments will be apparent to those skilled in the art when considered in conjunction with the accompanying drawings and claims, without departing from the scope of this application. Therefore, the proper scope of this application will be determined by the claims.

Claims

1. A data modulation method, characterized in that, include: Insert one data point between every two adjacent data points in the first data sequence to form the second data sequence; Perform a Fourier transform on the second data sequence to form a third data sequence; R times the data is extracted from the third data sequence to form a fourth data sequence, where R is less than 1.

2. The method according to claim 1, characterized in that, The value of R satisfies at least one of the following: The value is 3 / 4; The value is 3 / 5; The value range is [1 / 2, 3 / 4]; The value range is [1 / 2, 17 / 20].

3. The method according to claim 1, characterized in that, A fourth data sequence is formed by extracting R times the amount of data from the third data sequence, including: R times the data is extracted from the third data sequence, and the remaining data in the third data sequence other than the extracted data is discarded or set to 0 to form a fourth data sequence.

4. The method according to claim 1, characterized in that, A fourth data sequence is formed by extracting R times the amount of data from the third data sequence, including: The third data sequence is multiplied by the fifth data sequence to obtain the multiplied data sequence. The zero data obtained by multiplying the zero data in the fifth data sequence by the multiplied data is discarded or retained to form the fourth data sequence. Wherein, the number of non-zero data in the fifth data sequence is R times the number of data in the third data sequence, and the number of zero data in the fifth data sequence is 1-R times the number of data in the third data sequence.

5. The method according to claim 4, characterized in that, The number of data with a value of 1 in the fifth data sequence is R times the number of data in the third data sequence.

6. The method according to claim 4, characterized in that, The fifth data sequence is the discrete value of the filter function.

7. The method according to claim 1, characterized in that, A fourth data sequence is formed by extracting R times the amount of data from the third data sequence, including: The frequency domain of the third data sequence is filtered using a filtering function to form the fourth data sequence; The width of the frequency domain of the filter function is R times the width of the frequency domain of the third data sequence.

8. The method according to claim 6 or 7, characterized in that, The filtering function is a root-raised cosine function or a raised cosine function, wherein the roll-off coefficient ranges from [0, 0.7]; or, The filtering function is a rectangular function, where the roll-off factor is 0.

9. The method according to claim 1, characterized in that, Perform a Fourier transform on the second data sequence to form a third data sequence, including: The second data sequence is subjected to a discrete Fourier transform and then cyclically shifted to form a third data sequence; A fourth data sequence is formed by extracting R times the amount of data from the third data sequence, including: R times the continuous data is extracted from the third data sequence to form the fourth data sequence.

10. The method according to claim 1, characterized in that, Perform a Fourier transform on the second data sequence to form a third data sequence, including: Perform a discrete Fourier transform on the second data sequence to form a third data sequence; A fourth data sequence is formed by extracting R times the amount of data from the third data sequence, including: R times the data is truncated from both ends of the third data sequence to form a fourth data sequence.

11. The method according to claim 10, characterized in that, A fourth data sequence is formed by extracting R times the amount of data from the third data sequence, including: R times the data is truncated from both ends of the third data sequence and cyclically shifted to form a fourth data sequence.

12. The method according to claim 1, characterized in that, Perform a Fourier transform on the second data sequence to form a third data sequence, including: Perform a discrete Fourier transform on the second data sequence to form a third data sequence; A fourth data sequence is formed by extracting R times the amount of data from the third data sequence, including: R times the amount of data is extracted from the middle of the third data sequence to form the fourth data sequence.

13. The method according to claim 1, characterized in that, For every two adjacent data points The power of the inserted data is equal to the power of the adjacent data; The phase of the inserted data is between the phases of the adjacent data, or the phase of the opposite of the inserted data is between the phases of the adjacent data.

14. The method according to claim 1, characterized in that, For every two adjacent data points The inserted data is the sum of the adjacent data and The product of, or, the inserted data is the sum of the adjacent data and The product of.

15. The method according to claim 1, characterized in that, Also includes: Insert one data point before or after the first data sequence to form a second data sequence.

16. The method according to claim 1, characterized in that, Insert one data point between every two adjacent data points in the first data sequence to form the second data sequence, which includes: The data sequence obtained by inserting one data point between every two adjacent data points in the first data sequence is convolved with p1[1,1] or p1[1,-1] to form the second data sequence, where p1 is a constant and is a power factor.

17. The method according to claim 1, characterized in that, R according to or The position of the frequency point at or near the zero value in the power spectral density is determined, where p2 is a constant and is the power factor.

18. The method according to claim 16, characterized in that, The value of p1 satisfies at least one of the following: The value is 1; The value is 1 / (2cos(π / 8)); Values 19. The method according to claim 17, characterized in that, The value of p2 satisfies at least one of the following: The value is 1; Values 20. The method according to claim 1, characterized in that, The first data sequence is a π / 2BPSK data sequence or a BPSK sequence.

21. The method according to claim 1, characterized in that, The first data sequence is a part of the sixth data sequence, and the length of the sixth data sequence is greater than the length of the first data sequence.

22. The method according to claim 1, characterized in that, Also includes: The fourth data sequence is subjected to an oversampled inverse Fourier transform to form time-domain data; Transmit the time-domain data.

23. The method according to claim 1, characterized in that, Also includes: The fourth data sequence is filtered and oversampled inverse Fourier transform is performed to form time-domain data; Transmit the time-domain data.

24. The method according to claim 22 or 23, characterized in that, Before performing the oversampled inverse Fourier transform, the following is also included: Multiply the fourth data sequence by a power factor.

25. A communication node, characterized in that, include: 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 as described in any one of claims 1-24.

26. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the program is executed by the processor, it implements the data modulation method as described in any one of claims 1-24.

Images