A data modulation method, device and computer storage medium

Abstract

The present application discloses a data modulation method, device and storage medium, wherein the method comprises: modulating a first data sequence to obtain a second data sequence; inserting a third data sequence into the second data sequence to obtain a fourth data sequence; in the fourth data sequence, except for the first data and the last data, each data of the third data sequence inserted into the fourth data sequence satisfies: the power of the data is equal to the average power of two adjacent data, and the phase of the data is within the angle between the two adjacent data; and transmitting the fourth data sequence.

Description

[0001] This application is a divisional application of the patent application with application number 201810834174.6 (the application date of the original application is July 26, 2018, and the name of the invention is A data modulation method, device and computer storage medium). Technical Field

[0002] The present application relates to, but is not limited to, the field of coding and modulation, and in particular to a data modulation method, device, and computer storage medium. Background Art

[0003] In high-frequency scenarios, path loss and shadow attenuation are significant, resulting in very low signal-to-noise ratios (SNRs) in some areas at the cell edge. Furthermore, amplifier (PA) efficiency is relatively low at high frequencies. To improve the SNR while also conserving UE battery power, the UE's transmitted signal's peak-to-average power ratio (PAPR) must be low.

[0004] In massive machine-type communications (mMTC) scenarios, also known as massive machine-type communications (MTC) scenarios, some terminal devices require significant battery savings, such as achieving a battery life of more than ten years. Therefore, to improve the PA efficiency of these terminals, 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, there is a need for a signal modulation scheme with both a low MCS and a low PAPR.

[0005] In summary, the PAPR of existing communication signals remains relatively high, making it difficult to meet the lower PAPR requirements of some communication scenarios, such as mMTC. Therefore, it is necessary to design signal modulation methods that can lower the PAPR. Alternatively, it is necessary to develop modulation technologies that can further reduce the PAPR. Currently, no effective solution exists for this problem. Summary of the Invention

[0006] The embodiments of the present application provide a data modulation method, device, and computer storage medium, which solve the problem of high PAPR.

[0007] A data modulation method according to an embodiment of the present application includes:

[0008] modulating the first data sequence to obtain a second data sequence;

[0009] inserting the third data sequence into the second data sequence to obtain a fourth data sequence;

[0010] In the fourth data sequence, except for the first data and the last data, each data of the third data sequence inserted into the fourth data sequence satisfies: the power of the data is equal to the average power of two adjacent data, and the phase of the data is within the angle between the two adjacent data;

[0011] The fourth data sequence is transmitted.

[0012] In the above solution, the phase of the data is within the angle between the two adjacent data, that is, the angle between the data and the two adjacent data is equal.

[0013] In the above solution, the modulating the first data sequence is constellation point modulation of the first data sequence.

[0014] In the above solution, inserting the third data sequence into the second data sequence includes:

[0015] inserting data between all adjacent data in the second data sequence; or,

[0016] Data are inserted between adjacent data in part of the second data sequence.

[0017] In the above solution, transmitting the fourth data sequence includes: carrying the fourth data sequence on physical time-frequency resources for transmission.

[0018] In the above solution, when the first data sequence is the data sequence [b(m)] and the second data sequence is [x(i)], inserting the third data sequence into the second data sequence includes:

[0019] Inserting the third data y(j) between all or part of the adjacent first data x(i) and second data x(i+1) in the [x(i)] forms a data sequence [s(k)], where [s(k)] is the fourth data sequence;

[0020] The angle between the first data and the second data is in the range of [0, π]; wherein m, i, j and k are all non-negative integers.

[0021] In the above solution, inserting the third data y(j) between all or part of the adjacent first data x(i) and second data x(i+1) in [x(i)] includes:

[0022] When i takes values ​​from the data sequence [0, 1, ..., N-2],

[0023]

[0024] φ(y(j))-φ(x(i))=φ(x(i+1))-φ(y(j)); wherein |.| is a modulo operator, φ(.) is a complex phase operator, and N is the number of elements of the second data sequence [x(i)].

[0025] In the above solution, inserting the third data y(j) between all or part of the adjacent first data x(i) and second data x(i+1) in [x(i)] includes:

[0026] When i=N-1, j=J-1, N is the number of elements in the second data sequence [x(i)], and J is the number of elements in the third data sequence [y(j)];

[0027] The third data y(J-1) is:

[0028]

[0029] φ(y(J-1))-φ(x(N-1))=φ(x(0))-φ(y(J-1));

[0030] Among them, |.| is the modulus operator, and φ(.) is the complex phase operator.

[0031] Alternatively, the third data y(J-1) is other values.

[0032] In the above solution, the method further includes:

[0033] Obtain data x(i) and x(i+1) from [x(i)], i=0, 1, ..., N-2, N-1;

[0034] Get each pair of adjacent data among x(0) and x(1), x(1) and x(2), x(2) and x(3), ..., x(N-1) and x(N), x(N) and x(0);

[0035] Inserting third data y(j) between all or part of the adjacent first data x(i) and second data x(i+1) in the [x(i)] comprises:

[0036] Inserting the third data y(j) between each pair of first data formed by the adjacent data; or,

[0037] Part of adjacent data is selected from each pair of adjacent data, and third data y(j) is inserted between the second data pairs formed by the part of adjacent data.

[0038] In the above solution, the method further includes:

[0039] Place y(J-1) at the first or last position in the fourth data sequence.

[0040] In the above solution, when the first data sequence is modulated using constellation point modulation of π / 2-BPSK,

[0041] After the third data y(j) is inserted between each adjacent first data x(i) and second data x(i+1), the modulus of the y(j) is equal to the modulus of the π / 2-BPSK modulated data, the phase of the y(j) is within the angle between x(i) and x(i+1), and the angle value between y(j) and x(i) and the angle value between y(j) and x(i+1) are both π / 4.

[0042] In the above solution, when the first data sequence is modulated using constellation point modulation QPSK,

[0043] After inserting the third data y(j) between each adjacent first data x(i) and second data x(i+1), the modulus of the y(j) is equal to the modulus of the QPSK modulated data, the phase of the y(j) is within the angle between x(i) and x(i+1), and the angle values ​​of y(j) with x(i) and x(i+1) are equal.

[0044] A data modulation method according to an embodiment of the present application includes:

[0045] The data sequence [b(i)] is modulated to be [s(k)]; wherein [s(k)] has the following characteristics:

[0046] The modulos of all s(k) are equal; and

[0047] s(2i+2) / s(2i+1)-s(2i+1) / s(2i)=0;

[0048] Wherein, i and k are both non-negative integers.

[0049] In the above scheme, the data sequence [b(i)] consists of 0 and 1.

[0050] In the above solution, the [s(k)] also includes the following features: the angle between s(k) and s(k+1) is π / 4;

[0051] In the above solution, the [s(k)] also includes the following features: the angle between s(k) and s(k+1) is 0 or π / 4 or π / 2;

[0052] In the above solution, [s(k)] also includes the following features:

[0053] When k = 2i,

[0054] or,

[0055]

[0056] When k = 2i-1,

[0057] or,

[0058]

[0059] Wherein, i and k are both non-negative integers, and θ is a preset constant.

[0060] In the above solution, [s(k)] also includes the following features:

[0061] When k = 2i,

[0062]

[0063] When k = 2i-1,

[0064]

[0065] Wherein, i and k are both non-negative integers, and θ is a preset constant.

[0066] A data modulation device according to an embodiment of the present application includes:

[0067] a modulation unit, configured to modulate the first data sequence to obtain a second data sequence;

[0068] an inserting unit, configured to insert the third data sequence into the second data sequence to obtain a fourth data sequence; in the fourth data sequence, except for the first data and the last data, each data of the third data sequence inserted into the fourth data sequence satisfies: a power of the data is equal to an average power of two adjacent data, and a phase of the data is within an angle between the two adjacent data;

[0069] A transmission unit, configured to transmit the fourth data sequence.

[0070] In the above solution, the phase of the data is within the angle between the two adjacent data, that is, the angle between the data and the two adjacent data is equal.

[0071] In the above solution, the insertion unit is further used to:

[0072] inserting data between all adjacent data in the second data sequence; or,

[0073] Data are inserted between adjacent data in part of the second data sequence.

[0074] In the above solution, the insertion unit is further used to:

[0075] When the second data sequence is [x(i)], third data y(j) is inserted between all or part of the adjacent first data x(i) and second data x(i+1) in [x(i)].

[0076] When i takes values ​​from the data sequence [0, 1, ..., N-2],

[0077]

[0078] φ(y(j))-φ(x(i))=φ(x(i+1))-φ(y(j)); wherein |.| is a modulo operator, φ(.) is a complex phase operator, and N is the number of elements of the second data sequence [x(i)].

[0079] In the above solution, the insertion unit is further used to:

[0080] When the second data sequence is [x(i)], third data y(j) is inserted between all or part of the adjacent first data x(i) and second data x(i+1) in [x(i)].

[0081] When i=N-1, j=J-1, N is the number of elements in the second data sequence [x(i)], and J is the number of elements in the third data sequence [y(j)];

[0082] The third data y(J-1) is:

[0083]

[0084] φ(y(J-1))-φ(x(N-1))=φ(x(0))-φ(y(J-1));

[0085] Among them, |.| is the modulus operator, and φ(.) is the complex phase operator.

[0086] Alternatively, the third data y(J-1) is other values.

[0087] In the above solution, the insertion unit is further used to:

[0088] Place y(J-1) at the first or last position in the fourth data sequence.

[0089] A data modulation device according to an embodiment of the present application includes:

[0090] The modulation unit is configured to modulate the data sequence [b(i)] to obtain a data sequence [s(k)]; wherein [s(k)] includes the following features:

[0091] The modulos of all s(k) are equal; and

[0092] s(2i+2) / s(2i+1)-s(2i+1) / s(2i)=0;

[0093] Wherein, i and k are both non-negative integers.

[0094] In the above solution, [s(k)] also includes the following features:

[0095] When k = 2i,

[0096] or,

[0097]

[0098] When k = 2i-1,

[0099] or,

[0100]

[0101] Wherein, i and k are both non-negative integers, and θ is a preset constant.

[0102] In the above solution, [s(k)] also includes the following features:

[0103] When k = 2i,

[0104]

[0105] When k = 2i-1,

[0106]

[0107] Wherein, i and k are both non-negative integers, and θ is a preset constant.

[0108] A data modulation device according to an embodiment of the present application includes:

[0109] a memory storing a computer program;

[0110] A processor is configured to implement the steps of the method described in any of the above solutions when executing the computer program.

[0111] A computer storage medium in an embodiment of the present application stores a computer program, which, when executed by a processor, implements the steps of the method described in any one of the above solutions.

[0112] In the technical solution of the embodiments of the present application, a first data sequence is modulated to obtain a second data sequence; a third data sequence is inserted into the second data sequence to obtain a fourth data sequence; in the fourth data sequence, except for the first and last data, each data of the third data sequence inserted into the fourth data sequence satisfies: the power of the data is equal to the average power of the two adjacent data, and the phase of the data is within the angle between the two adjacent data; and the fourth data sequence is transmitted. The signal modulation method of inserting data between two adjacent modulated data can effectively reduce the phase difference between adjacent data in the time domain, thereby significantly reducing the PAPR. BRIEF DESCRIPTION OF THE DRAWINGS

[0113] The accompanying drawings illustrate generally, by way of example and not limitation, various embodiments discussed herein.

[0114] Figure 1 This is a schematic diagram of an application scenario of Example 1 of the present application;

[0115] Figure 2 is a flow chart of a method according to the first embodiment of the present invention;

[0116] Figure 3 is a flow chart of another method of this embodiment;

[0117] Figure 4 is a flow chart of another method of this embodiment;

[0118] Figure 5 is a flow chart of another method of this embodiment;

[0119] Figure 6 This is a structural diagram of the components of the device of Example 1;

[0120] Figure 7-8 is the constellation diagram corresponding to the π / 2-BPSK modulation method of this embodiment;

[0121] Figure 9 s(k) constellation diagram obtained by adopting the π / 2-BPSK modulation method of this embodiment;

[0122] Figure 10 : This is the QPSK modulation constellation diagram of this embodiment;

[0123] Figure 11 s(k) constellation diagram obtained by adopting the QPSK modulation method of this embodiment. DETAILED DESCRIPTION

[0124] The present application will be further described in detail below in conjunction with the accompanying drawings and examples. It should be understood that the embodiments provided herein are merely intended to explain the present application and are not intended to limit the present application. In addition, the embodiments provided below are partial embodiments for implementing the present application, rather than providing all embodiments for implementing the present application. In the absence of conflict, the technical solutions described in the embodiments of the present application may be implemented in any combination.

[0125] It should be noted that, in the embodiments of the present application, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a method or apparatus comprising a series of elements includes not only the elements explicitly stated, but also other elements not explicitly listed, or also includes elements inherent to the implementation of the method or apparatus. In the absence of further restrictions, an element defined by the sentence "comprising a ..." does not exclude the presence of other related elements (such as steps in the method or units in the apparatus, for example, a unit may be a portion of a circuit, a portion of a processor, a portion of a program or software, etc.) in the method or apparatus comprising the element.

[0126] For example, the data modulation method provided in the embodiment of the present application includes a series of steps, but the data modulation method provided in the embodiment of the present application is not limited to the recorded steps. Similarly, the data modulation device provided in the embodiment of the present application includes a series of units, but the data modulation device provided in the embodiment of the present application is not limited to including the units explicitly recorded, and may also include units required to obtain relevant information or perform processing based on the information.

[0127] It should be noted that the terms "first, second, third, and fourth" used in the embodiments of the present application are merely used to distinguish similar objects and do not represent a specific ordering of the objects. It is understood that the terms "first, second, third, and fourth" may be interchanged to represent a specific order or precedence, where permitted. It should be understood that the terms "first, second, third, and fourth" may be interchanged to represent objects distinguished by the terms "first, second, third, and fourth" as appropriate, so that the embodiments of the present application described herein can be implemented in an order other than that illustrated or described herein.

[0128] Before further explaining the embodiments of the present application in detail, the key technical terms involved in the embodiments of the present application are explained as follows:

[0129] Acronym Full Name Chinese Translation PAPR Peak Average Power Ratio Peak-to-average ratio BPSK Binary Phase Shift Keying Binary Phase Shift Keying QPSK Quadrature Phase Shift Keying Quadrature Phase Shift Keying QAM Quadrature Amplitude Modulation Quadrature Amplitude Modulation

[0130] An application scenario of the data modulation method of the present application is as follows Figure 1 As shown, it includes: base stations 101-102, there are three terminals 11-13 within the cell coverage of base station 101, and there are five terminals 21-25 within the cell coverage of base station 102. Figure 1 The figure shows a mobile phone terminal, which can also be various IoT terminals in the mMTC scenario. In high-frequency scenarios, the path loss and shadow attenuation of each terminal communicating with the base station will be relatively large. In some areas at the edge of the cell, such as the terminal 13 under the jurisdiction of the base station 101, which is located at the edge of the cell coverage, its signal-to-noise ratio will be very low. In order to improve the signal-to-noise ratio and significantly save battery power consumption, for example, if the battery life is expected to reach more than ten years, the PAPR of the UE transmitted signal needs to be lower. In other words, in order to improve the PA efficiency of the terminal, the PAPR of the UE transmitted signal needs to be relatively low. Using the embodiment of the present application, the first data sequence [b(0), b(1), ..., b(m), ..., b(M-1)] is modulated, where M is the number of sequence elements and m is the element number, which is an integer between 0 and M-1. For the convenience of description, the present invention simply represents the sequence [b(0), b(1), ..., b(m), ..., b(M-1)] as [b(m)]. Similarly, the other sequence descriptions of the present invention are also similarly simply represented accordingly. The sequence [b(m)] can be composed of 0 and 1, or 1 and -1. Constellation point modulation can be used to modulate [b(m)], and after modulation, a second data sequence [x(i)] can be obtained. The third data sequence [y(j)] is inserted into [x(i)], and this can be done by inserting all data between adjacent data in [x(i)] or by inserting data between some adjacent data in [x(i)], to obtain a fourth data sequence [s(k)]. In [s(k)], except for the first and last data, each data of the third data sequence inserted into the fourth data sequence satisfies the following conditions: the power of the data is equal to the average power of the two adjacent data, and the phase of the data is within the angle between the two adjacent data. After the coding modulation is completed, [s(k)] is carried on the physical time-frequency resource for transmission. Of course, the first and last data can also satisfy the following conditions: from the perspective of [s(k)] being cyclically connected end to end, the power of the data is equal to the average power of the two adjacent data, and the phase of the data is within the angle between the two adjacent data. The present invention does not impose any restrictions on the requirements for the first and last data. Since the phase of the inserted data is between the angles of two adjacent modulated data, and the angles between the inserted data and the two modulated data are equal, the phase difference between adjacent data in the time domain can be effectively reduced, thereby significantly reducing the PAPR.

[0131] A data modulation method according to an embodiment of the present application, such as Figure 2 As shown, the method includes:

[0132] Step 201: Obtain a first data sequence. The processing before the first data sequence is input into the modulation module generally includes obtaining the first data sequence. In other words, the process of inputting the first data sequence into the modulation module is called obtaining the first data sequence.

[0133] Step 202: Modulate the first data sequence to obtain a second data sequence.

[0134] The first data sequence may be modulated by constellation point modulation or other modulation methods, such as Inverse Discrete Fourier Transform (IDFT) processing.

[0135] Step 203: Insert the third data sequence into the second data sequence to obtain a fourth data sequence.

[0136] Step 204: In the fourth data sequence, except for the first data and the last data, each data of the third data sequence inserted into the fourth data sequence satisfies: the power of the data is equal to the average power of the two adjacent data, and the phase of the data is within the angle between the two adjacent data.

[0137] Step 205: Transmit the fourth data sequence.

[0138] In an embodiment of the present application, the first data sequence [b(m)] can be composed of 0 and 1, or 1 and -1. The first data sequence is modulated, for example, constellation point modulation is performed. After constellation point modulation, a second data sequence, such as a data sequence [x(i)], can be obtained. Adjacent first data x(i) and second data x(i+1) are extracted from the second data sequence. For example, third data y(j) is inserted between the first data x(i) and the second data x(i+1) of (partial or every) adjacent elements in the data sequence [x(i)]. The power of y(j) is equal to the average power of x(i) and x(i+1), and the phase of y(j) is within the angle between x(i) and x(i+1). After inserting the third data sequence such as [y(j)], a fourth data sequence [s(k)] can be obtained. By modulating the data according to the constellation points in the time domain, data is inserted between adjacent modulated data in the time domain. Since the inserted data is associated with the adjacent modulated data, for example, the power of y(j) is equal to the average power of x(i) and x(i+1), and the phase of y(j) is within the angle between x(i) and x(i+1), the PAPR of the transmitted signal can be reduced accordingly.

[0139] It should be noted that in the fourth data sequence, in addition to the original second data sequence, the remaining inserted data forms the third data sequence. In the constellation point coordinate system, the phase difference is the difference between the phases of two data. In the present invention, when the two phase differences differ by 2nπ, they are considered to be equal phase differences, where n is an integer. The phase value of the data is the phase difference between the data and a certain reference coordinate. In the present invention, the angle between two data is the angular range space formed by the lines connecting the two data and the origin, and the angle value is the angle value of the angle. In the present invention, the angle value is between [0,π]. One of the differences between the phase difference and the angle value is: if the phase difference between data A and data B is θ, then the phase difference between data B and data A is -θ; if the angle value between data A and data B is θ, then the angle value between data B and data A is also θ.

[0140] In one implementation of the embodiment of the present application, the inserted third data sequence, such as [y(j)], has a data phase within the angle between the two adjacent data, that is, the data is equal to the angle value between the two adjacent data.

[0141] In the first embodiment of the present application, for the data inserted in the fourth data sequence, the modulus of the data is equal to the average modulus of the two adjacent data. When the power of each data in the second data sequence is equal, the modulus of the inserted data is equal to the average modulus of the two adjacent data, which is equivalent to the power of the inserted data being equal to the average power of the two adjacent data.

[0142] In one embodiment of the present application, the third data is equal to the angle value of the first data and the second data respectively. For example, a third data sequence is inserted between x(i) and x(i+1) of (part of or every) adjacent elements in the data sequence [x(i)], such as [y(j)]. In addition to the power of y(j) being equal to the average power of x(i) and x(i+1), the phase value of y(j) is within the angle between x(i) and x(i+1). Furthermore, y(j) is equal to the angle value of x(i) and x(i+1). Since the phase of the inserted data is between the angles of two adjacent modulated data, and the inserted data is equal to the angle value of the two modulated data, the demodulation signal-to-noise ratio can be improved, thereby further significantly reducing the PAPR.

[0143] It should be pointed out that: inserting the third data sequence into the second data sequence specifically includes: inserting the third data sequence between adjacent data in the second data sequence, for example, the data can be inserted between all adjacent data; or, the data can be inserted between part of the adjacent data in the second data sequence.

[0144] When the second data sequence is [x(i)], the method further includes:

[0145] Obtain data x(i) and x(i+1) from [x(i)], i=0, 1, ..., N-2, N-1;

[0146] Get each pair of adjacent data from x(0) and x(1), x(1) and x(2), x(2) and x(3), ..., x(N-1) and x(N), and x(N) and x(0). x(N) and x(0) may or may not be adjacent data. That is, x(N) and x(0) may or may not be included in each pair of adjacent data.

[0147] 1. Inserting third data y(j) between the adjacent first data x(i) and second data x(i+1) in [x(i)]. Inserting data between all adjacent data includes: inserting the third data y(j) between each pair of first data formed by the adjacent data.

[0148] 2. Inserting third data y(j) between the adjacent first data x(i) and second data x(i+1) in [x(i)]. For inserting data between partial adjacent data, the method includes: selecting partial adjacent data between each pair of adjacent data, and inserting the third data y(j) between the second data pair formed by the partial adjacent data.

[0149] A data modulation method according to an embodiment of the present application, such as Figure 3 As shown, the method includes:

[0150] Step 301: Acquire a first data sequence.

[0151] Step 302: Modulate the first data sequence to obtain a second data sequence.

[0152] The first data sequence may be modulated by constellation point modulation or other modulation such as IDFT processing.

[0153] Step 303: inserting a third data sequence into the second data sequence, that is, inserting data between all adjacent data in the second data sequence to obtain a fourth data sequence.

[0154] For example, y(j) is inserted between x0 and x1, x1 and x2, x2 and x3, x3 and x4, ..., and x(i) and x(i+1). This insertion method reduces the PAPR of the transmitted signal because the inserted data is associated with adjacent modulated data. It should be noted that the data inserted between two adjacent data in the second data sequence is one or more data. In the above example, inserting y(j) between x(i) and x(i+1) is an embodiment of inserting one data. In this embodiment, if y(J-1) is also inserted between x(N-1) and x(0), then J=N, i.e., the number of elements in the second data sequence is equal to the number of elements in the third data sequence. In this embodiment, if no data is inserted between x(N-1) and x(0), then J=N-1, i.e., the number of elements in the second data sequence is one more than the number of elements in the third data sequence.

[0155] Step 304: In the fourth data sequence, except for the first data and the last data, each data of the third data sequence inserted into the fourth data sequence satisfies: the power of the data is equal to the average power of the two adjacent data, and the phase of the data is within the angle between the two adjacent data.

[0156] Step 305: Transmit the fourth data sequence.

[0157] A data modulation method according to an embodiment of the present application, such as Figure 4 As shown, the method includes:

[0158] Step 401: Acquire a first data sequence.

[0159] Step 402: Modulate the first data sequence to obtain a second data sequence.

[0160] The first data sequence may be modulated by constellation point modulation or other modulation methods, such as Inverse Discrete Fourier Transform (IDFT) processing.

[0161] Step 403: inserting a third data sequence into the second data sequence, that is, inserting data between some adjacent data in the second data sequence to obtain a fourth data sequence.

[0162] For example, y(j) is inserted between x1 and x2, not between x2 and x3, between x3 and x4, and so on. This means that third data, such as data y(j), is inserted between some adjacent elements x(i) and x(i+1) in the data sequence [x(i)]. Because the inserted data is associated with adjacent modulated data, the PAPR of the transmitted signal can be reduced accordingly. It should be noted that the data inserted between two adjacent data in the second data sequence is one or more data.

[0163] Step 404: In the fourth data sequence, except for the first data and the last data, each data of the third data sequence inserted into the fourth data sequence satisfies: the power of the data is equal to the average power of the two adjacent data, and the phase of the data is within the angle between the two adjacent data.

[0164] Step 405: Transmit the fourth data sequence.

[0165] In one embodiment of the present application, transmitting the fourth data sequence includes: transmitting the fourth data sequence on physical time-frequency resources. In one embodiment, the data sequence [s(k)] is transmitted on physical time-frequency resources. After being transmitted to a receiving end, the receiving end receives data containing the data sequence [s(k)] and then uses a correlation detection algorithm such as maximum ratio combining to obtain data containing the data sequence [x(i)]. The data sequence [b(m)] is then recovered through decoding and a constellation point demodulation module or other modules. Compared to existing common modulation schemes, the receiving end of the present invention only adds a maximum ratio combining detection algorithm, resulting in relatively low added complexity. Furthermore, during demodulation, no error propagation occurs between data elements of the data sequence. Although the length of [s(k)] is longer than that of [x(i)] at the transmitting end of the data modulation, meaning that more physical resources are required for transmission, the maximum ratio combining detection algorithm can be used at the receiving end, thereby improving the demodulation performance and signal-to-noise ratio (SNR) of [s(k)]. This benefit can offset the loss in transmission efficiency. For example, when the length of [s(k)] is twice the length of [x(i)], twice the physical resources are required for transmission. At low bit rates, occupying 1x more resources is equivalent to losing 3dB of gain. However, since the maximum ratio combining detection algorithm can be used at the receiving end, the SNR can be improved by up to 3dB, which can almost make up for the loss of transmission efficiency.

[0166] In one embodiment of the present application, the first data sequence is a data sequence [b(m)], and the second data sequence is [x(i)]. Inserting a third data sequence into the second data sequence includes: inserting the third data y(j) between partially adjacent or every adjacent first data x(i) and second data x(i+1) in [x(i)] to form a data sequence [s(k)], wherein [s(k)] is the fourth data sequence. The angle between the first data and the second data is in the range [0,π]. Wherein, m, i, j, and k are all non-negative integers, specifically, m is a non-negative integer of 0, 1, ..., M-1, i is a non-negative integer of 0, 1, ..., N-1, j is a non-negative integer of 0, 1, ..., J-1, k is a non-negative integer of 0, 1, ..., K-1, and M, N, J, and K are positive integers.

[0167] In one embodiment of the present application, inserting third data y(j) between all or part of the adjacent first data x(i) and second data x(i+1) in [x(i)] includes:

[0168] When i is a value in the data sequence [0, 1, ..., N-2],

[0169] φ(y(j))-φ(x(i))=φ(x(i+1))-φ(y(j)); wherein |.| is a modulo operator, φ(.) is a complex phase operator, and N is the number of elements of the second data sequence [x(i)].

[0170] In one embodiment of the present application, inserting third data y(j) between all or part of the adjacent first data x(i) and second data x(i+1) in [x(i)] includes:

[0171] When i=N-1, j=J-1, N is the number of elements in the second data sequence [x(i)], and J is the number of elements in the third data sequence [y(j)];

[0172] The third data y(J-1) is:

[0173]

[0174] φ(y(J-1))-φ(x(N-1))=φ(x(0))-φ(y(J-1));

[0175] Among them, |.| is the modulus operator, and φ(.) is the complex phase operator.

[0176] Alternatively, the third data y(J-1) is other values, that is, the value of y(J-1) is not limited.

[0177] No data may be inserted between x(N-1) and x(0). In this embodiment, third data, such as data y(J-1), is inserted between x(N-1) and x(0).

[0178] In one embodiment of the present application, y(J-1) is placed at the first or last position in the fourth data sequence. Placing y(J-1) at the first position in the fourth data sequence is equivalent to placing y(J-1) at the last position in the fourth data sequence and then cyclically shifting it once.

[0179] In one implementation manner of an embodiment of the present application, when the first data sequence is modulated using constellation point modulation of π / 2-BPSK, after the third data y(j) is inserted between each adjacent first data x(i) and second data x(i+1), the modulus of the y(j) is equal to the modulus of the π / 2-BPSK modulated data, the phase of the y(j) is within the angle between x(i) and x(i+1), and the angle value between y(j) and x(i) and the angle value between y(j) and x(i+1) are both π / 4.

[0180] In one implementation manner of an embodiment of the present application, when the first data sequence is modulated using constellation point modulation as QPSK, after the third data y(j) is inserted between each adjacent first data x(i) and second data x(i+1), the modulus of the y(j) is equal to the modulus of the QPSK modulated data, the phase of the y(j) is within the angle between x(i) and x(i+1), and the angle value between y(j) and x(i+1) is equal.

[0181] A data modulation method according to an embodiment of the present application, such as Figure 5 As shown, the method includes:

[0182] Step 501: Obtain a first data sequence [b(i)].

[0183] Step 502: Modulate the first data sequence [b(i)] to obtain a second data sequence [s(k)], where the moduli of all s(k)s are equal; and s(2i+2) / s(2i+1)-s(2i+1) / s(2i)=0.

[0184] Wherein, i and k are both non-negative integers. Specifically, i is a non-negative integer of 0, 1, ..., N-1, and k is a non-negative integer of 0, 1, ..., 2N-2 or k is a non-negative integer of 0, 1, ..., 2N-1.

[0185] The modulation process described in this embodiment of the present application may include constellation point modulation and insertion modulation. In the insertion modulation operation, one or no data may be inserted between the last and first data elements of the constellation point modulated data sequence. Therefore, the length of the data sequence [s(k)] can be 2N-1 or 2N. The value of s(2N-1) is not limited in this embodiment of the present application.

[0186] Step 503: Transmit the second data sequence.

[0187] In one embodiment of the present application, the data sequence [b(i)] consists of 0s and 1s.

[0188] In one embodiment of the present application, the [s(k)] further includes the following feature: the angle between s(k) and s(k+1) is π / 4.

[0189] In one embodiment of the present application, the [s(k)] further includes the following features: the angle between s(k) and s(k+1) is 0 or π / 4 or π / 2.

[0190] In one embodiment of the present application, [s(k)] further includes the following features:

[0191] When k = 2i,

[0192] or,

[0193]

[0194] When k = 2i-1,

[0195] or,

[0196]

[0197] Wherein, i and k are both non-negative integers. Specifically, i is a non-negative integer of 0, 1, ..., N-1, k is a non-negative integer of 0, 1, ..., 2N-2 or k is a non-negative integer of 0, 1, ..., 2N-1, N is a positive integer, and θ is a preset constant.

[0198] In one embodiment of the present application, [s(k)] further includes the following features:

[0199] When k = 2i,

[0200]

[0201] When k = 2i-1,

[0202]

[0203] Wherein, i and k are both non-negative integers, specifically, i is a non-negative integer of 0, 1, ..., N-1, k is a non-negative integer of 0, 1, ..., 2N-2 or k is a non-negative integer of 0, 1, ..., 2N-1, N is a positive integer, and θ is a preset constant.

[0204] A data modulation device according to an embodiment of the present application, such as Figure 6 As shown, the device includes:

[0205] An acquisition unit 31 is used to acquire a first data sequence; a modulation unit 32 is used to modulate the first data sequence to obtain a second data sequence; an insertion unit 33 is used to insert, into the fourth data sequence, each data of the third data sequence, except for the first data and the last data, so that: the power of the data is equal to the average power of the two adjacent data, and the phase of the data is within the angle between the two adjacent data; a transmission unit 34 is used to transmit the fourth data sequence.

[0206] Those skilled in the art should understand that Figure 6 The functions implemented by each unit in the illustrated device can be understood by referring to the relevant description of the aforementioned signal sending method. Figure 6 The functions of each unit in the device shown can be implemented by a program running on a processor or by a specific logic circuit. In practical applications, the functions implemented by each unit in the data modulation device can be implemented by a CPU, a microcontroller unit (MPU), a digital signal processor (DSP), or a field-programmable gate array (FPGA) located in the data modulation device.

[0207] In one implementation of the embodiment of the present application, the phase of the data is within the angle between the two adjacent data, that is, the angle between the data and the two adjacent data is equal.

[0208] In an implementation manner of an embodiment of the present application, the modulation unit is further configured to modulate the first data sequence by performing constellation point modulation on the first data sequence.

[0209] In one implementation of the embodiment of the present application, the inserting unit is further configured to: insert data between all adjacent data in the second data sequence; or insert data between part of adjacent data in the second data sequence.

[0210] In an implementation manner of an embodiment of the present application, the transmission unit is further used to: carry the fourth data sequence on physical time-frequency resources for transmission.

[0211] In one embodiment of the present application, the insertion unit is further configured to: when the first data sequence is the data sequence [b(m)] and the second data sequence is [x(i)], insert the third data y(j) between some or every adjacent first data x(i) and second data x(i+1) in [x(i)] to form a data sequence [s(k)], where [s(k)] is the fourth data sequence. The angle between the first data and the second data is formed in the range [0, π]; wherein m, i, j, and k are all non-negative integers.

[0212] In one embodiment of the present application, the insertion unit is further used to:

[0213] When i is a value in the data sequence [0, 1, ..., N-2],

[0214]

[0215] φ(y(j))-φ(x(i))=φ(x(i+1))-φ(y(j)); wherein |.| is a modulo operator, φ(.) is a complex phase operator, and N is the number of elements of the second data sequence [x(i)].

[0216] In one embodiment of the present application, the insertion unit is further used to:

[0217] When i=N-1, j=J-1, N is the number of elements in the second data sequence [x(i)], and J is the number of elements in the third data sequence [y(j)];

[0218] The third data y(J-1) is:

[0219]

[0220] φ(y(J-1))-φ(x(N-1))=φ(x(0))-φ(y(J-1)); where |.| is a modulo operator, and φ(.) is a complex phase operator. Alternatively, the third data y(J-1) can be any other value. That is, the value of y(J-1) is not limited.

[0221] No data may be inserted between x(N-1) and x(0). In this embodiment, third data, such as data y(J-1), is inserted between x(N-1) and x(0).

[0222] The insertion unit is further configured to place y(J-1) at the first or last position in the fourth data sequence. Placing y(J-1) at the first position in the fourth data sequence is equivalent to placing y(J-1) at the last position in the fourth data sequence and then performing a cyclic shift.

[0223] In one embodiment of the present application, the insertion unit is further used to:

[0224] When the first data sequence is modulated using constellation point modulation (π / 2-BPSK), after inserting third data y(j) between each adjacent first data x(i) and second data x(i+1), the modulus of y(j) is equal to the modulus of the π / 2-BPSK modulated data, the phase of y(j) is within the angle between x(i) and x(i+1), and the angle between y(j) and x(i) and the angle between y(j) and x(i+1) are both π / 4. After inserting y(j), a data sequence [s(k)] carried on the physical time-frequency resource for transmission is obtained.

[0225] In an example, when the constellation point modulation is π / 2-BPSK, the following scheme is designed:

[0226] The data sequence [b(i)] consisting of 0s and 1s is modulated into a data sequence [s(k)]. [s(k)] has the following characteristics:

[0227] When k = 2i,

[0228] or,

[0229]

[0230] When k = 2i-1,

[0231] or,

[0232]

[0233] Wherein, i and k are both non-negative integers (specifically, i is a non-negative integer of 0, 1, ..., N-1, k is a non-negative integer of 0, 1, ..., 2N-2 or k is a non-negative integer of 0, 1, ..., 2N-1), N is a positive integer, and θ is a preset constant.

[0234] In one embodiment of the present application, the insertion unit is further used to:

[0235] When the first data sequence is modulated using QPSK constellation point modulation, after inserting third data y(j) between each adjacent first data x(i) and second data x(i+1), the modulus of y(j) is equal to the modulus of the QPSK modulated data, the phase of y(j) is within the angle between x(i) and x(i+1), and y(j) is equal to the angle between x(i) and x(i+1). After inserting y(j), a data sequence [s(k)] carried on the physical time-frequency resource for transmission is obtained.

[0236] In an example, when the constellation point modulation is QPSK, the following scheme is designed:

[0237] The data sequence [b(i)] consisting of 0s and 1s is modulated into a data sequence [s(k)]. [s(k)] has the following characteristics:

[0238] When k = 2i,

[0239]

[0240] When k = 2i-1,

[0241]

[0242] Wherein, i and k are both non-negative integers (specifically, i is a non-negative integer of 0, 1, ..., N-1, k is a non-negative integer of 0, 1, ..., 2N-2 or k is a non-negative integer of 0, 1, ..., 2N-1), N is a positive integer, and θ is a preset constant.

[0243] A data modulation device according to an embodiment of the present application includes: a modulation unit configured to modulate a data sequence [b(i)] to obtain a data sequence [s(k)]. [s(k)] includes the following features:

[0244] Said [s(k)] includes the following features: the modules of all s(k) are equal; and s(2i+2) / s(2i+1)-s(2i+1) / s(2i)=0. Wherein, i and k are both non-negative integers.

[0245] In one embodiment of the present application, the data sequence [b(i)] consists of 0s and 1s.

[0246] In an embodiment of the present application, the [s(k)] further includes the following features: the angle between s(k) and s(k+1) is π / 4;

[0247] In one embodiment of the present application, the [s(k)] further includes the following features: the angle between s(k) and s(k+1) is 0, π / 4, or π / 2;

[0248] In one embodiment of the present application, [s(k)] further includes the following features:

[0249] When k = 2i,

[0250] or,

[0251]

[0252] When k = 2i-1,

[0253] or,

[0254]

[0255] Where i and k are both non-negative integers, and θ is a preset constant.

[0256] In one embodiment of the present application, [s(k)] further includes the following features:

[0257] When k = 2i,

[0258]

[0259] When k = 2i-1,

[0260]

[0261] Where i and k are both non-negative integers, and θ is a preset constant.

[0262] A data modulation device according to an embodiment of the present application includes:

[0263] a memory storing a computer program;

[0264] A processor is configured to implement the steps of the method described in any one of the above embodiments when executing the computer program.

[0265] A computer storage medium according to an embodiment of the present application stores a computer program thereon, and when the computer program is executed by a processor, the steps of the method described in any one of the above embodiments are implemented.

[0266] The various application scenarios of the embodiments of the present application are described in detail as follows:

[0267] According to an embodiment of the present application, when the data sequence [b(m)] consists of 0 and 1, the data sequence after constellation point modulation is [x(i)]. Data y(j) is inserted between x(i) and x(i+1) of (part of or every) adjacent elements in the data sequence [x(i)]. The power of y(j) is equal to the average power of x(i) and x(i+1), the phase of y(j) is within the angle between x(i) and x(i+1), and y(j) is equal to the angle between x(i) and x(i+1). The data sequence [x(i)] is inserted into [y(j)] to form the data sequence [s(k)]. The data sequence [s(k)] is carried on the physical time-frequency resources for transmission. After receiving the data containing the data sequence [s(k)], the receiving end uses a correlation detection algorithm such as maximum ratio combining to obtain the data containing the data sequence [x(i)], and then recovers the data sequence [b(m)] through decoding and constellation point demodulation modules or other modules.

[0268] It should be noted that, in addition to the data sequence [b(m)] consisting of two element types, 0 and 1, it can also consist of two element types, 1 and -1, such as the data sequence [b'(m)]. This sequence can be transformed into a sequence consisting of two element types, 0 and 1, for example, using the transformation formula: b'(m) = 1-2b(m), and then performing the subsequent modulation processing, or directly processing [b'(m)] using the corresponding transformed modulation method, the effects are equivalent.

[0269] The angle range is [0, π], m, i, and k are all non-negative integers (specifically, m is a non-negative integer of 0, 1, ..., M-1, i is a non-negative integer of 0, 1, ..., N-1, k is a non-negative integer of 0, 1, ..., K-1, and M, N, and K are positive integers.)

[0270] In an embodiment of the present application, data y(j) is inserted between x(i) and x(i+1) of adjacent elements in the data sequence [x(i)], which is to insert data y(j) between x(i) and x(i+1) of each adjacent element in the data sequence [x(i)]. In this case, K=2N or 2N-1.

[0271] The specific data formula is described as follows:

[0272] The data sequence [b(m)] consists of 0s and 1s. After constellation point modulation, the data sequence is [x(i)]. Data y(j) is inserted between each adjacent x(i) and x(i+1). y(j) satisfies the following characteristics:

[0273] When i=0, 1, ..., N-2,

[0274]

[0275] φ(y(j))-φ(x(i))=φ(x(i+1))-φ(y(j)); wherein |.| is a modulo operator, φ(.) is a complex phase operator, and N is the number of elements of the second data sequence [x(i)].

[0276] When i=N-1, y(N-1) is not inserted or inserted with other values ​​or other possibilities, as described below:

[0277] When i=N-1, j=J-1, N is the number of elements in the second data sequence [x(i)], and J is the number of elements in the third data sequence [y(j)];

[0278] The third data y(J-1) is:

[0279]

[0280] φ(y(J-1))-φ(x(N-1))=φ(x(0))-φ(y(J-1)); where |.| is a modulo operator, and φ(.) is a complex phase operator. Alternatively, the third data y(J-1) may be any other value. That is, the value of y(J-1) is not limited.

[0281] The data sequence [x(i)] is inserted into [y(j)] to form the data sequence [s(k)].

[0282] Wherein, m, i and k are all non-negative integers (specifically, m is a non-negative integer of 0, 1, ..., M-1, i is a non-negative integer of 0, 1, ..., N-1, k is a non-negative integer of 0, 1, ..., 2N-2 or k is a non-negative integer of 0, 1, ..., 2N-1), and M and N are positive integers.

[0283] In the embodiment of the present application, when the phase values ​​differ by 2nπ, they are considered equal, where n is an integer.

[0284] In the embodiments of the present application, constellation point modulation includes: π / 2-BPSK, BPSK, QPSK, π / 4-QPSK, 16QAM, 64QAM, 256QAM, etc. The relationship between M and N is related to the constellation point modulation. For example, when the constellation point is π / 2-BPSK or BPSK, M = N; when the constellation point is QPSK or π / 4-QPSK, M = 2N. In particular, when the constellation point is π / 2-BPSK, BPSK, QPSK, or π / 4-QPSK, the angles between y(j) and x(i) and x(i+1) are equal, which is equivalent to the Euclidean distances between y(j) and x(i) and x(i+1) being equal.

[0285] Furthermore, when the phase difference is limited to (-π,π], we have:

[0286]

[0287] The schemes using different constellation point modulation are described as follows:

[0288] 1. When the constellation point modulation is π / 2-BPSK, the specific design can refer to the following scheme:

[0289] Step 601: A data sequence [b(i)] consisting of 0s and 1s is modulated as follows to generate a data sequence [x(i)].

[0290]

[0291] or

[0292] Here, i is a non-negative integer of 0, 1, ..., N-1, and N is a positive integer.

[0293] θ is a preset constant. In some embodiments, θ=0 or θ=-π / 4.

[0294] In formulas (1) and (2) is the power normalization factor and “j” is the label of the complex imaginary part.

[0295] Step 602: The data sequence [x(i)] is modulated as follows to generate a data sequence [s(k)].

[0296] When k = 2i, s(k) = x(i) (3)

[0297] When k = 2i-1,

[0298] or

[0299] Where i is a non-negative integer of 0, 1, ..., N-1, and k is a non-negative integer of 0, 1, ..., 2N-2 or 0, 1, ..., 2N-1. Formulas (4) and (5) are equivalent in generating s(k). (Other formulas may be included as long as the results are equivalent.)

[0300] There are two possible approaches for S(2N-1):

[0301] (1) S(2N-1) is not generated.

[0302] (2)

[0303] 2. When the constellation point modulation is QPSK, the specific design can refer to the following scheme:

[0304] Step 701: A data sequence [b(m)] consisting of 0s and 1s is modulated as follows to generate a data sequence [x(i)].

[0305]

[0306] Wherein, m is a non-negative integer ranging from 0, 1, ..., M-1, i is a non-negative integer ranging from 0, 1, ..., N-1, M and N are positive integers, and M=2N. θ is a preset constant. In some embodiments, θ=0 or θ=-π / 4.

[0307] Step 702: The data sequence [x(i)] is modulated as follows to generate a data sequence [s(k)].

[0308] When k = 2i, s(k) = x(i) (8)

[0309] When k = 2i-1,

[0310] Where i is a non-negative integer of 0, 1, ..., N-1, and k is a non-negative integer of 0, 1, ..., 2N-2 or 0, 1, ..., 2N-1. Formulas (9) and (10) are equivalent in generating s(k). (Other formulas may also be included to achieve this, as long as the results are equivalent.)

[0311] There are two possible approaches for S(2N-1):

[0312] (1) S(2N-1) is not generated.

[0313] (2)

[0314] In the embodiment of the present application, when the data sequence [b(m)] consists of 0 and 1, the data sequence after constellation point modulation is [x(i)]. Assuming that the phase difference between x(i) and x(i+1) is α, after inserting data y(j) between adjacent x(i) and x(i+1), the adjacent phase difference is reduced to α / 2. The phase difference is reduced. Therefore, compared with the data sequence [x(i)], the peak-to-average ratio (PAPR) of the analog continuous signal output by the data sequence s(k) after passing through the digital-to-analog conversion module DAC is reduced. Take the constellation point modulation of π / 2-BPSK as an example to further illustrate. The data sequence [x(i)] generated by step 301 has the following characteristics: (1) the amplitude of all data is 1, and (2) the phase difference between adjacent data is π / 2. Then, the data sequence [s(k)] generated by step 302 has the following characteristics: (1) the amplitude of all data is 1, and (2) the phase difference between adjacent data is π / 4. Step 302 reduces the phase difference between adjacent data from π / 2 to π / 4. Consequently, the peak-to-average-value ratio (PAPR) of the analog continuous signal output by the data sequence [s(k)] after passing through the digital-to-analog converter (DAC) is reduced. After receiving the data containing the data sequence [s(k)], the receiving end uses a correlation detection algorithm, such as maximum ratio combining, to obtain data containing the data sequence [x(i)].

[0315] Compared with existing common modulation methods, the modulation method of the present application only adds a maximum ratio combining detection algorithm at the receiving end, which increases the complexity relatively low. Moreover, when the data sequence [x(i)] is demodulated, no error propagation occurs between the data elements.

[0316] In addition, although the length of [s(k)] is doubled that of [x(i)], which means that more physical resources are required for transmission, the maximum ratio combining detection algorithm can be used at the receiving end, so the demodulation performance signal-to-noise ratio (SNR) of [s(k)] can be improved by 3dB. This benefit can offset the loss in transmission efficiency.

[0317] Scenario 1: The constellation point modulation is π / 2-BPSK.

[0318] The data sequence [b(i)] consisting of 0 and 1 is modulated by π / 2-BPSK to generate the data sequence [x(i)]. Assume that π / 2-BPSK modulation uses formula (1) and θ = -π / 4, then its constellation points are as follows: Figure 7-8 As shown, Figure 7-8 is the constellation diagram corresponding to the π / 2-BPSK modulation method. When i=0, 2, 4, ... , that is, an even number, x(i)=1 or -1, its constellation diagram is Figure 7 When i=1, 3, 5, ..., that is, an odd number, x(i)=j or -j, the constellation point diagram is Figure 8shown.

[0319] The data sequence [x(i)] is modulated by formulas (3) and (4) to generate the data sequence [s(k)], and its constellation points are as follows: Figure 9 As shown, Figure 9 is the constellation diagram of s(k). When k=2i, the constellation point of s(k) is Figure 9 On the real coordinates or imaginary coordinates in . When k = 2i-1, the constellation point of s(k) is Figure 9 In the four quadrants.

[0320] Specific examples are as follows:

[0321] Assume that the binary data sequence [b(i)] to be transmitted is [0101101100], and the symbol data sequence [x(i)] after π / 2-BPSK modulation is [1,-j,1,-j,-1,j,-1,-j,1,j]. It can be seen that the phase difference between adjacent symbols of the [x(i)] sequence is ±π / 2. After [x(i)] is modulated by formulas (3) and (4), the generated data sequence [s(k)] is [1,exp(-j*pi / 4),-j,exp(-j*pi / 4),1,exp(-j*pi / 4),-j,exp(-j*3pi / 4),-1,exp(j*3pi / 4),j,exp(j*3pi / 4),-1,exp(-j*3pi / 4),-j,exp(-j*pi / 4),1,exp(j*pi / 4),j,exp(j*pi / 4)]. The phase difference between adjacent symbols in this symbol sequence is now ±π / 4. This reduced phase difference reduces the peak-to-average ratio (PAPR) of the analog continuous signal output by the data sequence [s(k)] after passing through the DAC module compared to the data sequence [x(i)]. The last data point in the data sequence [s(k)], exp(j*pi / 4), is calculated according to formula (6). This data point exp(j*pi / 4) can also be omitted.

[0322] Scenario 2: When the constellation point modulation is QPSK, the data sequence [b(m)] consists of 0s and 1s.

[0323] The data sequence [b(m)] consisting of 0 and 1 is modulated by QPSK to generate the data sequence [x(i)]. Assuming that QPSK modulation uses formula (7) and θ = -π / 4, the constellation points are as follows Figure 10 As shown, Figure 10 is the QPSK modulation constellation diagram. x(i)=1 or -1 or j or -j, and its constellation diagram is Figure 10 shown.

[0324] The data sequence [x(i)] is modulated by formulas (8) and (9) to generate the data sequence [s(k)], and its constellation points are as follows: Figure 11 As shown, Figure 11 is the constellation diagram of s(k). When k=2i, the constellation point of s(k) is Figure 7 On the real coordinates or imaginary coordinates in . When k = 2i-1, the constellation point of s(k) is Figure 7 In the four quadrants.

[0325] Specific examples are as follows:

[0326] If the binary data sequence [b(m)] to be transmitted is [0101101100], the symbol data sequence [x(i)] after QPSK modulation is [-j,-j,j,-1,1]. It can be seen that the phase difference between adjacent symbols of the [x(i)] sequence is 0 or ±π / 2 or π. After [x(i)] is modulated by formulas (8) and (9), the generated data sequence [s(k)] is [-j,-j,-j,1,j,exp(j*3pi / 4),-1,-j,1,exp(-j*pi / 4)]. Now the phase difference between two adjacent symbols of this symbol sequence is 0 or ±π / 4 or ±π / 2. The last data exp(-j*pi / 4) of the data sequence [s(k)] is calculated according to formula (10). This data exp(-j*pi / 4) can also be omitted.

[0327] In scenario three, the constellation point modulation is QPSK, and the data sequence [b'(m)] consists of 1 and -1.

[0328] The data sequence [b'(m)] consisting of two element types, 1 and -1, is QPSK modulated using the transformation form of formula (7) to generate the data sequence [x(i)]. The transformation formula is b'(m) = 1-2b(m), that is, formula (7) is transformed into the following formula:

[0329]

[0330] It can be seen that directly processing [b'(m)] using the corresponding transformed modulation method has an equivalent effect.

[0331] Assume the above formula θ=-π / 4, then x(i)=1 or -1 or j or -j, and the constellation point diagrams are as follows: Figure 10 As shown in Figure 1, the phase difference between adjacent symbols of the data sequence [x(i)] is 0 or ±π / 2 or π. After the data sequence [x(i)] is modulated by formulas (8) and (9) to generate the data sequence [s(k)], the phase difference between two adjacent symbols of the sequence [s(k)] is 0 or ±π / 4 or ±π / 2.

[0332] Invention embodiment If the above-mentioned device is implemented in the form of a software function module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiment of the present application can be embodied in the form of a software product in essence or in other words, the part that contributes to the prior art. The computer software product is stored in a storage medium and includes a number of instructions for enabling a computer device (which can be a personal computer, a server, or a network device, etc.) to execute all or part of the methods described in each embodiment of the present application. The aforementioned storage medium includes various media that can store program codes, such as a U disk, a mobile hard disk, a read-only memory (ROM, Read Only Memory), a magnetic disk or an optical disk. In this way, the embodiment of the present application is not limited to any specific combination of hardware and software.

[0333] Although the preferred embodiments of the present application have been disclosed for illustrative purposes, those skilled in the art will appreciate that various modifications, additions and substitutions are possible, and therefore the scope of the present application should not be limited to the above embodiments.

Claims

1. A data modulation method, characterized in that: The method comprises: Modulating the first data sequence [b(m)] to obtain a second data sequence [x(i)]; Insert the third data sequence [y(j)] into the second data sequence to obtain a fourth data sequence [s(k)] ； The inserting the third data sequence into the second data sequence comprises: A fourth data sequence [s(k)] is formed by inserting a third data y(j) between the adjacent first data x(i) and second data x(i+1) in the [x(i)]; The angle value constituting the first data and the second data is in the range of [0, π]; m, i, j and k are all non-negative integers; The fourth data sequence [s(k)] includes: when k=2i-1, In the fourth data sequence, the angle value of all adjacent data is π / 4; The fourth data sequence is transmitted.

2. The method according to claim 1, characterized in that The data are respectively equal to the angle values ​​of the two adjacent data, and also include: s(2i+2) / s(2i+1)-s(2i+1) / s(2i)=0.

3. The method according to claim 1, characterized in that The modulating the first data sequence is to perform binary phase shift keying (BPSK) modulation on the first data sequence.

4. The method according to claim 1, characterized in that: Inserting a third data sequence into the second data sequence comprises: inserting data between all adjacent data in the second data sequence; or, Data are inserted between adjacent data of part of the second data sequence.

5. The method according to claim 1, characterized in that Transmitting the fourth data sequence includes: carrying the fourth data sequence on physical time-frequency resources for transmission.

6. The method according to claim 1, characterized in that Inserting third data y(j) between adjacent first data x(i) and second data x(i+1) in the [x(i)] comprises: When i takes values ​​from the data sequence [0, 1, ..., N-2], φ(y(j))-φ(x(i))=φ(x(i+1))-φ(y(j)); wherein |.| is a modulo operator, φ(.) is a complex phase operator, and N is the number of elements of the second data sequence [x(i)].

7. The method according to claim 1, characterized in that Inserting third data y(j) between adjacent first data x(i) and second data x(i+1) in [x(i)] comprises: When i=N-1, j=J-1, N is the number of elements of the second data sequence [x(i)], and J is the number of elements of the third data sequence [y(j)]; The third data y(J-1) is: φ(y(J-1))-φ(x(N-1))=φ(x(0))-φ(y(J-1)); Among them, |.| is the modulus operator, and φ(.) is the complex phase operator; Or the third data y(J-1) is other values.

8. The method according to claim 6 or 7, characterized in that: The method further comprises: Obtain data x(i) and x(i+1) from [x(i)], i=0, 1, ..., N-2, N-1; Get each pair of adjacent data among x(0) and x(1), x(1) and x(2), x(2) and x(3), ..., x(N-1) and x(N), x(N) and x(0); Inserting third data y(j) between adjacent first data x(i) and second data x(i+1) in [x(i)] comprises: Inserting the third data y(j) between each pair of first data formed by the adjacent data; or, Part of adjacent data is selected from each pair of adjacent data, and the third data y(j) is inserted between the second data pairs formed by the part of adjacent data.

9. The method according to claim 7, characterized in that: The method further comprises: Place y(J-1) at the first or last position in the fourth data sequence.

10. A data modulation method, characterized in that: The method comprises: The data sequence [b(i)] is modulated to be [s(k)]; wherein [s(k)] includes the following features: The moduli of all s(k) are equal; and s(2i+2) / s(2i+1)-s(2i+1) / s(2i)=0; Where i and k are both non-negative integers; and The angle between s(k) and s(k+1) is π / 4; when k=2i-1, 11. The method according to claim 10, characterized in that The data sequence [b(i)] consists of 0s and 1s.

12. The method according to any one of claims 10 to 11, characterized in that: The [s(k)] also includes the following features: When k = 2i, When k = 2i-1, Wherein, i and k are both non-negative integers, and θ is a preset constant.

13. A data modulation device, characterized in that: The device comprises: A modulation unit, used for modulating the first data sequence [b(m)] to obtain a second data sequence [x(i)]; an inserting unit, configured to insert a third data sequence [y(j)] into the second data sequence to obtain a fourth data sequence [s(k)]; The inserting the third data sequence into the second data sequence comprises: A fourth data sequence [s(k)] is formed by inserting a third data y(j) between the adjacent first data x(i) and second data x(i+1) in the [x(i)]; The angle value constituting the first data and the second data is in the range of [0, π]; m, i, j and k are all non-negative integers; The fourth data sequence [s(k)] includes: when k=2i-1, In the fourth data sequence, the angle value of all adjacent data is π / 4; A transmission unit, configured to transmit the fourth data sequence.

14. The device according to claim 13, characterized in that The insertion unit is further used for: inserting data between all adjacent data in the second data sequence; or, Data are inserted between adjacent data of part of the second data sequence.

15. The device according to claim 13, characterized in that The insertion unit is further used for: When the second data sequence is [x(i)], inserting the third data y(j) between the adjacent first data x(i) and second data x(i+1) in [x(i)] comprises: When i takes values ​​from the data sequence [0, 1, ..., N-2], φ(y(j))-φ(x(i))=φ(x(i+1))-φ(y(j)); wherein |.| is a modulo operator, φ(.) is a complex phase operator, and N is the number of elements of the second data sequence [x(i)].

16. The device according to claim 13, characterized in that The insertion unit is further used for: Inserting third data y(j) between adjacent first data x(i) and second data x(i+1) in [x(i)]; When i=N-1, j=J-1, N is the number of elements of the second data sequence [x(i)], and J is the number of elements of the third data sequence [y(j)], including: The third data y(J-1) is: φ(y(J-1))-φ(x(N-1))=φ(x(0))-φ(y(J-1)); Among them, |.| is the modulus operator, and φ(.) is the complex phase operator; Or the third data y(J-1) is other values.

17. The device according to claim 16, characterized in that The insertion unit is further used for: Place y(J-1) at the first or last position in the fourth data sequence.

18. A data modulation device, characterized in that: The device comprises: The modulation unit is used to modulate the data sequence [b(i)] to obtain a data sequence [s(k)]; wherein [s(k)] includes the following features: The moduli of all s(k) are equal; and s(2i+2) / s(2i+1)-s(2i+1) / s(2i)=0; Where i and k are both non-negative integers; and The angle between s(k) and s(k+1) is π / 4. When k=2i-1, 19. The device according to any one of claims 18, characterized in that The [s(k)] also includes the following features: When k = 2i, When k = 2i-1, Wherein, i and k are both non-negative integers, and θ is a preset constant.

20. A data modulation device, characterized in that: The device comprises: a memory storing a computer program; A processor configured to implement the steps of the method according to any one of claims 1 to 9 and claims 10 to 12 when executing the computer program.

21. A computer storage medium, characterized in that A computer program is stored thereon, and when the computer program is executed by a processor, the steps of the method according to any one of claims 1 to 9 and claims 10 to 12 are implemented.

Images