Data transmission method, communication device and readable storage medium

Abstract

The present application relates to the technical field of communications. Disclosed are a data transmission method, a communication device, and a readable storage medium. The method comprises: acquiring M / 2 data bits b(k) to be sent, wherein k = 0, 1, 2,..., M / 2-1, M being a positive integer; on the basis of the M / 2 data bits b(k), acquiring N complex modulation symbols d(i), i = 0, 1, 2,..., N-1, and N = M, or N = M-1, wherein when i = 2k, d(i) is formed by the data bit b(k), and when i = 2k +1, d(i) is formed by the data bit b(k) and the data bit b(k+1); and transmitting the N complex modulation symbols d(i).

Description

Data transmission methods, communication devices and readable storage media

[0001] Cross-references

[0002] This application claims priority to Chinese Patent Application No. 202410787820.3, filed on June 18, 2024, entitled "Data Transmission Method, Communication Device and Readable Storage Medium", the entire contents of which are incorporated herein by reference. Technical Field

[0003] This application relates to the field of communication technology, and in particular to a data transmission method, communication device, and readable storage medium. Background Technology

[0004] In communication systems, the peak-to-average power ratio (PAPR) of multi-carrier orthogonal frequency division multiplexing (OFDM) signals is generally high, meaning that the peak power of the signal is much greater than the average power. This not only leads to nonlinear distortion of the power amplifier, but also causes the power amplifier to operate at high power, thereby increasing energy consumption and heat loss and reducing its operating efficiency. Summary of the Invention

[0005] This application provides a data transmission method, a communication device, and a readable storage medium.

[0006] This application is implemented as follows:

[0007] In a first aspect, a data transmission method is provided, comprising: acquiring M / 2 bits of data b(k) to be transmitted, where k = 0, 1, 2, ..., M / 2-1, and M is a positive integer; acquiring N complex modulation symbols d(i) based on the M / 2 bits of data b(k), where i = 0, 1, 2, ..., N-1, and N = M, or N = M-1, wherein when i = 2k, d(i) is formed by data bits b(k), and when i = 2k+1, d(i) is formed by data bits b(k) and data bits b(k+1); and transmitting the M or M-1 complex modulation symbols d(i).

[0008] In a second aspect, a communication device is provided, the communication device comprising a processor and a memory, the memory storing at least one computer program, the at least one computer program being loaded and executed by the processor to implement the above-described data transmission method.

[0009] Thirdly, a readable storage medium is provided, wherein at least one computer program is stored in the readable storage medium, the computer program being loaded and executed by a processor to implement the above-described data transmission method.

[0010] Fourthly, a computer program product is provided, the computer program product comprising at least one computer program, the computer program being loaded and executed by a processor to implement the above-described data transmission method.

[0011] It should be understood that the above general description and the following detailed description are exemplary and explanatory only, and do not limit this application. Attached Figure Description

[0012] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.

[0013] Figure 1 shows a flowchart illustrating a data transmission method provided in an exemplary embodiment of this application;

[0014] Figure 2 shows a schematic diagram of a waveform modulation provided in an exemplary embodiment of this application;

[0015] Figure 3 shows a schematic diagram of a waveform modulation provided in an exemplary embodiment of this application;

[0016] Figure 4 shows a flowchart illustrating a data transmission method provided in another exemplary embodiment of this application;

[0017] Figure 5 shows a schematic diagram of a complex modulation symbol d(i) provided in an exemplary embodiment of this application;

[0018] Figure 6 shows a schematic diagram of another complex modulation symbol d(i) provided in an exemplary embodiment of this application;

[0019] Figure 7 shows a schematic diagram of yet another complex modulation symbol d(i) provided in an exemplary embodiment of this application;

[0020] Figure 8 is a structural block diagram of a communication device according to an exemplary embodiment;

[0021] Figure 9 shows a structural block diagram of another communication device provided in an exemplary embodiment of this application. Detailed Implementation

[0022] Exemplary embodiments will now be described in detail, examples of which are illustrated in the accompanying drawings. When the following description relates to the drawings, unless otherwise indicated, the same numbers in different drawings denote the same or similar elements. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with this application. Rather, they are merely examples of apparatuses and methods consistent with some aspects of this application as detailed in the appended claims.

[0023] Figure 1 shows a flowchart of a data transmission method according to an exemplary embodiment of this application. The method can be executed by a communication device. As shown in Figure 1, the data transmission method 100 mainly includes the following steps.

[0024] S101, obtain the M / 2-bit data bits b(k) to be sent.

[0025] Where k = 0, 1, 2, ..., M / 2-1, and M is a positive integer.

[0026] In this embodiment, the data bits to be transmitted can be modulated in units of M / 2 bits. Optionally, M can be a positive even number, for example, M can take the values ​​2, 4, 6, 8, etc., thus ensuring that M / 2 is an integer, facilitating data acquisition. In practical applications, data bits b(k) are data sequences containing 0 and 1 bits.

[0027] In one optional implementation, obtaining the M / 2-bit data bits b(k) to be transmitted may include: performing channel coding on the data to be transmitted to obtain the M / 2-bit data bits b(k). In this optional implementation, the M / 2-bit data bits b(k) to be transmitted can be obtained by performing channel coding on the data to be transmitted. Channel coding can improve data transmission efficiency, reduce the bit error rate, and help increase the reliability of communication.

[0028] S102, based on the M / 2-bit data bits b(k), obtain N complex modulation symbols d(i), i = 0, 1, 2, ..., N-1, N = M, or N = M-1.

[0029] In the case of i = 2k, d(i) is formed by data bit b(k), and in the case of i = 2k+1, d(i) is formed by data bit b(k) and data bit b(k+1).

[0030] In the embodiments of this application, when i = 2k (i.e., when i is even), d(i) is formed using data bits b(k); when i = 2k+1 (i.e., when i is odd), d(i) is formed using data bits b(k) and data bits b(k+1). That is, even-numbered complex modulation symbols and odd-numbered complex modulation symbols can be formed using data bits b(k) that are not entirely identical.

[0031] In this embodiment, M / 2 data bits b(k) can be modulated into N complex modulation symbols d(i). During modulation, when i = 2k, the complex modulation symbol d(i) can be formed using data bits b(k). When i = 2k+1, the complex modulation symbol d(i) can be formed using data bits b(k) and b(k+1).

[0032] In an optional implementation of this application, when N = M, and i = 2k (i.e., an even-numbered complex modulation symbol d(i) is formed using data bits b(k), and when i = 2k+1 (i.e., an odd-numbered complex modulation symbol d(i)) is formed using adjacent data bits b(k) and b(k+1), wherein the last bit of b(k+1) is b(M / 2) = b(0). In this optional implementation, the Mth complex modulation symbol d(M-1) is generated using the first data bit b(0) and the last data bit b(M / 2-1) of M / 2 data bits b(k).

[0033] In another optional implementation of this application, when N = M-1, for i = 0, 1, 2, ..., M-2, when i = 2k, i.e., the even-numbered complex modulation symbols d(i) are formed by data bits b(k), and when i = 2k+1, i.e., the odd-numbered complex modulation symbols d(i) are formed by adjacent data bits b(k) and b(k+1). For i = M-1, i.e., the last complex modulation symbol d(M-1) can be formed by the last data bit b(M / 2-1) of the M / 2-bit data bits b(k) and the first data bit b(0) of other data bits, wherein the other data bits can be the next M / 2-bit data bits to be transmitted.

[0034] In the embodiments of this application, the first complex modulation symbol is d(0), the (M-1)th complex modulation symbol is d(M-2), and the Mth complex modulation symbol is d(M-1).

[0035] S103 transmits N complex modulation symbols d(i).

[0036] The technical solution provided in this application embodiment obtains M / 2 bits of data b(k) to be transmitted during data transmission. Based on the M / 2 bits of data b(k), N complex modulation symbols d(i) are obtained. When i = 2k, d(i) is formed using data bits b(k); when i = 2k+1, d(i) is formed using data bits b(k) and data bits b(k+1). The N complex modulation symbols d(i) obtained through this application embodiment have constant modulus, and the phase difference between adjacent complex modulation symbols is ±π / 4. The peak-to-average power ratio (PAPR) of the transmitted time-domain signal is low, thereby reducing energy consumption and heat loss, and improving the working efficiency of the communication equipment.

[0037] In an optional implementation, transmitting the N complex modulation symbols d(i) may include the following steps:

[0038] Step 1: Filter the N complex modulation symbols d(i) and perform digital-to-analog conversion on the filtered N complex modulation symbols d(i).

[0039] Step 2: Transmit the signal obtained from the data conversion.

[0040] For example, as shown in Figure 2, the real and imaginary parts of N complex modulation symbols can be separated to form real part data sequences and imaginary part data sequences. Then, the real part data sequences and imaginary part data sequences are filtered and digital-to-analog conversion (the filtering may also occur before the separation of the real and imaginary parts; the filtering and digital-to-analog conversion may also be in one module). Then, the time-domain signal after digital-to-analog conversion is transmitted (subsequently, it is also included that it is modulated onto the carrier frequency by a mixer for transmission).

[0041] In an optional implementation, transmitting the N complex modulation symbols d(i) may include the following steps:

[0042] Step 1: Perform an N-point discrete Fourier transform on the N complex modulation symbols d(i) to obtain the frequency domain data of the N subcarriers.

[0043] Step 2: Map the frequency domain data of the N subcarriers to the corresponding subcarrier positions.

[0044] Step 3: Perform an R-point inverse discrete Fourier transform on the frequency domain data mapped to the subcarrier position, and transmit the data sequence after the inverse discrete Fourier transform, where R is an integer greater than or equal to N.

[0045] For example, as shown in Figure 3, N complex modulation symbols d(i) can be transmitted on the radio frequency link after undergoing Discrete Fourier Transform (DFT), resource mapping (and oversampling by placing data 0 on both sides of the data subcarrier), Inverse Discrete Fourier Transform (DFT), adding a Cyclic Prefix (CP), digital-to-analog conversion, etc.

[0046] In an optional embodiment of this application, the M / 2 data bits b(k) can be modulated into N complex symbols s(i) first, and N complex modulation symbols can be formed based on the N complex symbols s(i), so that the phase difference between adjacent modulation symbols is ±π / 4, thereby reducing the peak-to-average power ratio of the transmitted time-domain signal.

[0047] Figure 4 shows a flowchart of a data transmission method provided by an exemplary embodiment of this application. As shown in Figure 4, the method 400 mainly includes the following steps.

[0048] S401, obtain the M / 2 bits of data to be sent, b(k), where k = 0, 1, 2, ..., M / 2-1, and M is a positive integer.

[0049] This step is the same as S101 above, and you can refer to the relevant description in S101 above for details, which will not be repeated here.

[0050] S402, based on the M / 2-bit data bits b(k), obtain N complex symbols s(i).

[0051] In the case where i = 2k, i.e. i is an even number, s(i) can be formed by data bits b(k). In the case where i = 2k+1, i.e. i is an odd number, s(i) can be formed by data bits b(k) and data bits b(k+1), i = 0, 1, 2, ..., N-1.

[0052] In this optional embodiment, the real and imaginary parts of even-numbered bits s(i) can be formed by the same data bit b(k), while the real and imaginary parts of odd-numbered bits s(i) can be formed by two data bits b(k) and data bit b(k+1), i = 0, 1, 2, ..., N-1.

[0053] Therefore, in one optional implementation, obtaining N complex symbols s(i) based on the M / 2-bit data bits b(k) can include one of the following:

[0054] (1) When i = 2k, the real and imaginary parts of the complex symbol s(i) are formed by using data bits b(k).

[0055] (2) When i = 2k + 1, use data bits b(k) and b(k + 1) to form the real and imaginary parts of the complex number symbol s(i). For example, use data bits b(k) to form the real part of the complex number symbol s(i) and use data bits b(k + 1) to form the imaginary part of the complex number symbol s(i), or use data bits b(k + 1) to form the real part of the complex number symbol s(i) and use data bits b(k) to form the imaginary part of the complex number symbol s(i).

[0056] S403, based on the N complex symbols s(i), obtain the N complex modulation symbols d(i).

[0057] Optionally, the N complex modulation symbols d(i) can be obtained by performing a phase rotation on the N complex symbols s(i).

[0058] Optionally, when using data bits b(k) to form the real part of the complex symbol s(i) and using data bits b(k+1) to form the imaginary part of the complex symbol s(i), N complex symbols s(i) can be incremented by π / 4 to form N complex modulation symbols. That is, d(i) can be obtained by exp(j*π / 4*i)*s(i).

[0059] Optionally, when using data bits b(k) to form the imaginary part of the complex symbol s(i) and using data bits b(k+1) to form the real part of the complex symbol s(i), the N complex symbols s(i) are reduced by π / 4 to form N complex modulation symbols. That is, d(i) can be obtained by exp(-j*π / 4*i)*s(i).

[0060] In one optional implementation, before obtaining the N complex modulation symbols d(i) based on the N complex symbols s(i), the N complex symbols s(i) are processed. Power normalization processing allows different modulation methods to achieve the same average power.

[0061] For example, when i = 2k + 1, i is an odd number, and the real part of the complex symbol s(i) is formed using data bits b(k), and the imaginary part of the complex symbol s(i) is formed using data bits b(k + 1), the complex modulation symbol d(i), i = 0, 1, 2, ..., N-1, can be obtained according to the following formula:

[0062] Where θ is a preset constant, or it can be equal to 0.

[0063] For example, when i = 2k + 1, i is an odd number, and the real part of the complex symbol s(i) is formed using data bits b(k + 1), and the imaginary part of the complex symbol s(i) is formed using data bits b(k), the complex modulation symbol d(i), i = 0, 1, 2, ..., N-1, can be obtained according to the following formula:

[0064] Where θ is a preset constant, or it can be equal to 0.

[0065] The above implementation method can make the phase difference between adjacent modulation symbols ±π / 4, thus resulting in a low peak-to-average power ratio of the transmitted time-domain signal.

[0066] In an optional implementation of this application, when N = M, when i = 2k, i.e., the complex symbol s(i) with an even number of bits is formed by data bits b(k) to form the real part and the imaginary part of s(i) respectively. When i = 2k+1, i.e., the complex symbol s(i) with an odd number of bits is formed by adjacent data bits b(k) and b(k+1), wherein the last bit of b(k+1) is b(M / 2) = b(0). In this optional implementation, the Mth complex symbol s(M-1) is generated using the first data bit b(0) and the last data bit b(M / 2-1) of an M / 2 data bit b(k). For example, the real part of s(M-1) can be formed using the first data bit b(0) of the M / 2 data bit b(k), and the imaginary part of s(M-1) can be formed using the last data bit b(M / 2-1). Alternatively, the imaginary part of s(M-1) can be formed using the first data bit b(0) of the M / 2 data bit b(k), and the real part of s(M-1) can be formed using the last data bit b(M / 2-1).

[0067] In one alternative implementation, N = M, and b(M / 2) = b(0), then based on the M / 2 data bits b(k), N complex symbols s(i) can be obtained in the following way:

[0068] When i = 2k, the complex number symbol s(i) is determined according to the following formula: s(i) = (1 - 2b(k)) + j(1 - 2b(k));

[0069] In the case of i = 2k + 1, the complex number symbol s(i) is determined according to the following formula: s(i) = (1 - 2b(k)) + j(1 - 2b(k + 1 mod M / 2)).

[0070] For example, in the above optional embodiments, the data bit b(k) can be modulated into M complex modulation symbols d(i), i = 0, 1, 2, ..., M-1, using the following formula:

[0071] Where θ is a preset constant, or it can be equal to 0.

[0072] In another alternative implementation, N = M, and b(M / 2) = b(0), then based on the M / 2 data bits b(k), N complex symbols s(i) can be obtained in the following way:

[0073] When i = 2k, the complex number symbol s(i) is determined according to the following formula: s(i) = (1 - 2b(k)) + j(1 - 2b(k));

[0074] In the case of i = 2k + 1, the complex number symbol s(i) is determined according to the following formula: s(i) = j(1 - 2b(k + 1 mod M / 2)) + (1 - 2b(k)).

[0075] For example, in the above optional implementation, b(k) can be modulated into M complex modulation symbols d(i), i = 0, 1, 2, ..., M-1, using the following formula:

[0076] Where θ is a preset constant, or it can be equal to 0.

[0077] In this implementation, when i = 2k + 1, the complex number symbol s(i) can be formed by data bits b(k) and b(k) shifted 1 bit to the left. That is, the even-numbered bits of the complex number symbol s(i) are formed by the same data bits b(k), and the odd-numbered bits are formed by adjacent data bits b(k) and b(k+1), where the last data bit b(M / 2) = b(0) in b(k+1).

[0078] In another alternative implementation, N = M-1.

[0079] Optionally, when N = M-1, N complex modulation symbols d(i) can be obtained by performing phase rotation on N complex symbols s(i), i = 0, 1, 2, ..., N-1. The Mth complex modulation symbol corresponding to the M / 2 data bit can be obtained by the last data bit b(M / 2-1) of the M / 2 data bit b(k) and the first data bit b(0) of the next M / 2 data bit.

[0080] In one alternative implementation, N = M-1, then based on the M / 2 data bits b(k), obtaining N complex symbols s(i) can be achieved in the following way:

[0081] When i = 2k, the complex number symbol s(i) is determined according to the following formula: s(i) = (1 - 2b(k)) + j(1 - 2b(k));

[0082] In the case of i = 2k + 1, the complex number symbol s(i) is determined according to the following formula: s(i) = (1 - 2b(k)) + j(1 - 2b(k + 1)).

[0083] For example, in the above implementation, b(k) is modulated into M complex modulation symbols d(i), i = 0, 1, 2, ..., M-1, in the following way:

[0084] For i = 0, 1, 2, ..., M-2, we have:

[0085] Where θ is a preset constant, or it can be equal to 0.

[0086] When i = M-1, d(M-1) can be formed by the last data bit b(M / 2-1) of the M / 2 data bits and the first data bit b(0) of the other data bit sequence, where the other data bit sequence can be the next M / 2 data bits after the M / 2 data bits.

[0087] In another alternative implementation, where N = M-1, then based on the M / 2 data bits b(k), obtaining N complex symbols s(i) can be achieved in the following way:

[0088] When i = 2k, the complex number symbol s(i) is determined according to the following formula: s(i) = (1 - 2b(k)) + j(1 - 2b(k));

[0089] In the case of i = 2k + 1, the complex number symbol s(i) is determined according to the following formula: s(i) = (1 - 2b(k + 1)) + j(1 - 2b(k)).

[0090] For example, in the above implementation, b(k) is modulated into M complex modulation symbols d(i), i = 0, 1, 2, ..., M-1, in the following way:

[0091] For i = 0, 1, 2, ..., M-2, we have:

[0092] in, This is the floor sign. θ is a preset constant, which can also be 0.

[0093] When i = M-1, d(M-1) can be formed by the last data bit b(M / 2-1) of the M / 2 data bits and the first data bit b(0) of the other data bit sequence, where the other data bit sequence can be the next M / 2 data bits after the M / 2 data bits.

[0094] S404: Transmit N complex modulation symbols d(i).

[0095] This step is the same as S103 above. For details, please refer to the description of S103 above. It will not be repeated here.

[0096] The technical solution provided by the embodiments of this application enables N complex modulation symbols d(i) modulated by b(k) to have constant modulus, and the phase difference between adjacent modulation symbols is ±π / 4, thus resulting in a low peak-to-average power ratio of the transmitted time-domain signal.

[0097] The technical solutions provided in the embodiments of this application will be described below through specific examples.

[0098] Example 1

[0099] In the embodiment, it is assumed that there are M / 2 data bits b(k) to be transmitted. The data bits b(k) are modulated into M complex modulation symbols d(i) using formula (1), where k = 0, 1, 2, ..., M / 2-1 and i = 0, 1, 2, ..., M-1.

[0100] When i = 2k, that is, when i = 0, 2, 4, ..., M-2 is even:

[0101] In the first sub-formula of formula (1) The result is:

[0102] This formula means: First, a complex number symbol s(i) is formed through b(k), and then the complex number symbol s(i) is sequentially processed... Power normalization and π / 4 phase rotation form a complex modulation signal d(i).

[0103] When i = 2k + 1, that is, when i = 1, 3, 5, ..., M-1 is odd:

[0104] The remainder k+1 mod M / 2 when k+1 is divided by M / 2 in the second sub-formula of formula (1) is: 1, 2, 3, ..., M / 2-1, 0. Therefore, b(k+1 mod M / 2) is equivalent to b(k) being shifted 1 bit to the left.

[0105] In the second sub-formula of formula (1) The result is:

[0106] This formula means: First, the complex number symbol s(i) is formed by shifting b(k) one position to the left in a circular manner. Then, the complex number symbol s(i) is sequentially passed through... Power normalization and π / 4 phase rotation form a complex modulation signal d(i).

[0107] Therefore, as shown in Figure 5, the even-numbered bits of the complex symbol s(i) are formed by the same data bits b(k), and the odd-numbered bits are formed by adjacent data bits b(k) and b(k+1), wherein the last bit of b(k+1) is b(M / 2) = b(0).

[0108] Taking M as 16 and data bits b(k) as [0,1,0,0,1,0,1,1] as an example, when i = 2k, that is, i = 0,2,4,...,14: {s(0),s(2),s(4),s(6),s(8),s(10),s(12),s(14)}=1-2*{b(0),b(1),b(2),b(3),b(4),b(5),b(6), b(7)}+1j*{1-2*{b(0),b(1),b(2),b(3),b(4),b(5),b(6),b(7)}}={1+1j,-1-1j,1+1j,1+1j,-1-1j,1+1j,-1-1j,-1-1j}.

[0109] Then, the complex symbol s(i) passes through in sequence Power normalization and π / 4 phase rotation form a complex modulation signal d(i). When θ is 0, the π / 4 phase rotation is: That is, in the complex signal s(i) after power normalization: After a 0-phase rotation, d(0) is formed. Formed after a 2π / 4 phase rotation The signal is formed by a 6π / 4 phase rotation, resulting in d(14). Assume the complex signal is... Then the symbol signal go through After phase rotation, they are respectively Other complex signals And so on.

[0110] therefore,

[0111] When i=2k+1, that is, i=1,3,5,...,15: {s(1),s(3),s(5),s(7),s(9),s(11),s(13),s(15)}=1-2*{b(0),b(1),b(2),b(3),b(4),b(5),b(6), b(7)}+1j*{1-2*{b(1),b(2),b(3),b(4),b(5),b(6),b(7),b(0)}}={1-1j,-1+1j,1+1j,1-1j,-1+1j,1-1j,-1-1j,-1+1j}.

[0112] Then, the complex symbol s(i) passes through in sequence Power normalization and π / 4 phase rotation form a complex modulation signal d(i). When θ is 0, the π / 4 phase rotation is: That is, in the complex signal s(i) after power normalization: After a π / 4 phase rotation, d(1) is formed. Formed after a 3π / 4 phase rotation The complex signal is formed by a 7π / 4 phase rotation, resulting in d(15). Assume the complex signal is... Then complex signals go through After phase rotation, they are [j, -1, -j, 1], and other complex signals. And so on.

[0113] Therefore, {d(1),d(3),d(5),d(7),d(9),d(11),d(13),d(15)}={1,-j,-j,-j,-1,j,j,j}.

[0114] Finally, as shown in Figure 6, the M complex modulation symbols d(i) are: The modulus of M complex modulation symbols d(i) is 1, and the phase difference between adjacent symbols is...

[0115] Example 2

[0116] In this embodiment, we take the data bit b(k) as an example to modulate the complex modulation signal d(i) using formula (2).

[0117] Suppose there are M / 2 data bits b(k) to be transmitted. Use formula (2) to modulate the data bits b(k) into M complex modulation symbols d(i), where k = 0, 1, 2, ..., M / 2-1 and i = 0, 1, 2, ..., M-1.

[0118] When i = 2k and θ takes the value of 0, assume the complex signal is... Then complex signals go through After phase rotation, they are respectively Other complex signals And so on.

[0119] When i = 2k + 1 and θ takes the value of 0, assume the complex signal is... Then complex signals go through After phase rotation, they are [1, -j, -1, j], and other complex signals. And so on, as shown in Figure 7.

[0120] The difference between this embodiment and Embodiment 1 is that the complex number symbol s(i) passes through... Power normalization and -π / 4 phase rotation form M complex modulation signals d(i).

[0121] Example 3

[0122] In this embodiment, we take the data bit b(k) as an example to modulate the complex modulation signal d(i) using formula (3).

[0123] Suppose there are M / 2 data bits b(k) to be transmitted. The data bits b(k) are modulated into M complex modulation symbols d(i) using formula (3), where k = 0, 1, 2, ..., M / 2-1 and i = 0, 1, 2, ..., M-1.

[0124] In the case of i = 0, 1, 2, ..., M-2, when i = 2k and k = 0, 1, 2, ..., M / 2-1, that is, when i = 0, 2, 4, ..., M-2 is even:

[0125] In the first sub-formula of formula (3) The result is:

[0126] This formula means: First, a complex number symbol s(i) is formed through b(k), and then the complex number symbol s(i) is sequentially processed through... Power normalization and π / 4 phase rotation form a complex modulation signal d(i).

[0127] When i = 2k + 1 and k = 0, 1, 2, ..., M / 2 - 2, that is, when i = 1, 3, 5, ..., M - 3 (odd numbers):

[0128] In the second sub-formula of formula (3) The result is:

[0129] This formula means: First, a complex number symbol s(i) is formed through b(k) and b(k+1), and then the complex number symbol s(i) is sequentially processed through... Power normalization and π / 4 phase rotation form a complex modulation signal d(i).

[0130] In the case of i = M-1, the complex modulation symbol d(M-1) can be formed by the last data bit b(M / 2-1) of the M / 2 data bits and the first data bit b(0) of the other data bit sequence, where the other data bit sequence can be the next M / 2 data bits after the M / 2 data bits.

[0131] Example 4

[0132] In this embodiment, we take the data bit b(k) as an example to modulate the complex modulation signal d(i) using formula (4).

[0133] Suppose there are M / 2 data bits b(k) to be transmitted. Use formula (4) to modulate the data bits b(k) into M complex modulation symbols d(i), where k = 0, 1, 2, ..., M / 2-1 and i = 0, 1, 2, ..., M-1.

[0134] In the case of i = 0, 1, 2, ..., M-2, when i = 2k, the first sub-formula of formula (4) The result is:

[0135] This formula means: First, the complex number symbol s(i) is formed through b(k), and then the complex number symbol s(i) is sequentially processed through... Power normalization and -π / 4 phase rotation form a complex modulation signal d(i).

[0136] When i = 2k + 1, in the second sub-formula of formula (4) The result is:

[0137] This formula means: First, a complex number symbol s(i) is formed using b(k) and b(k+1), and then the complex number symbol s(i) is sequentially processed... Power normalization and -π / 4 phase rotation form a complex modulation signal d(i).

[0138] In the case of i = M-1, the complex modulation symbol d(M-1) can be formed by the last data bit b(M / 2-1) of the M / 2 data bits and the first data bit b(0) of the other data bit sequence, where the other data bit sequence can be the next M / 2 data bits after the M / 2 data bits.

[0139] In this application embodiment, in addition to the above four formulas, other formulas are also included, such as formula (4). If s(i) is kept unchanged, another formula can be used. The complex modulation symbol d(i) is calculated in the following manner.

[0140] The technical solution provided in this application allows for the acquisition of M / 2-bit data bits b(k) to be transmitted, followed by modulation of these M / 2-bit data bits b(k) into N complex modulation symbols d(i), and finally transmission of these N complex modulation symbols d(i). The N complex modulation symbols d(i) obtained through this application have constant modulus, with a phase difference of ±π / 4 between adjacent modulation symbols. This results in a low peak-to-average power ratio (PAPR) in the time domain, reducing energy consumption and heat loss, and improving working efficiency. Furthermore, it can improve the efficiency of the power amplifier, ensuring the coverage and signal transmission quality of the communication system.

[0141] Optionally, as shown in FIG8, this application embodiment also provides a communication device 800, including a processor 801 and a memory 802. The memory 802 stores a program or instructions that can run on the processor 801. When the program or instructions are executed by the processor 801, they implement the various steps of the above-mentioned data transmission method and can achieve the same technical effect. To avoid repetition, they will not be described again here.

[0142] It should be noted that the electronic devices in the embodiments of this application include the mobile electronic devices and non-mobile electronic devices described above.

[0143] Figure 9 shows a structural block diagram of another communication device 900 according to an exemplary embodiment of this application. The communication device 900 can be implemented as a smartphone, tablet computer, laptop computer, desktop computer, smartwatch, and television, etc. The communication device 900 may also be referred to as user equipment, portable terminal, laptop terminal, desktop terminal, or other names. The communication device 900 can also be a network-side device, such as a base station.

[0144] Typically, the communication device 900 includes a processor 901 and a memory 902.

[0145] Processor 901 may include one or more processing cores, such as a quad-core processor or a deca-core processor. Processor 901 may be implemented using at least one hardware form selected from DSP (Digital Signal Processing), FPGA (Field-Programmable Gate Array), and PLA (Programmable Logic Array). Processor 901 may also include a main processor and a coprocessor. The main processor, also known as a CPU (Central Processing Unit), is used to process data in the wake-up state; the coprocessor is a low-power processor used to process data in the standby state. In some embodiments, processor 901 may integrate a GPU (Graphics Processing Unit), which is responsible for rendering and drawing the content required to be displayed on the screen. In some embodiments, processor 901 may also include an AI (Artificial Intelligence) processor, which is used to handle computational operations related to machine learning.

[0146] The memory 902 may include one or more computer-readable storage media, which may be non-transitory. The memory 902 may also include high-speed random access memory and non-volatile memory, such as one or more disk storage devices or flash memory devices. In some embodiments, the non-transitory computer-readable storage media in the memory 902 are used to store at least one instruction, which is executed by the processor 901 to implement all or part of the steps in the data transfer method illustrated in the method embodiments of this application.

[0147] In some embodiments, the communication device 900 may optionally include a peripheral device interface 903 and at least one peripheral device. The processor 901, memory 902, and peripheral device interface 903 can be connected via a bus or signal line. Each peripheral device can be connected to the peripheral device interface 903 via a bus, signal line, or circuit board. Specifically, the peripheral device includes at least one of the following: a radio frequency circuit 904, a display screen 905, a camera assembly 906, an audio circuit 907, and a power supply 908.

[0148] In some embodiments, the communication device 900 further includes one or more sensors 909. The one or more sensors 909 include, but are not limited to, an accelerometer 910, a gyroscope 911, a pressure sensor 912, an optical sensor 913, and a proximity sensor 914.

[0149] Those skilled in the art will understand that the structure shown in FIG9 does not constitute a limitation on the communication device 900, and may include more or fewer components than shown, or combine certain components, or use different component arrangements.

[0150] In one exemplary embodiment, a readable storage medium is also provided, which stores at least one computer program that is loaded and executed by a processor to implement all or part of the steps in the data transmission method described above. For example, the computer-readable storage medium may be a read-only memory (ROM), a random access memory (RAM), a compact disc read-only memory (CD-ROM), magnetic tape, floppy disk, or optical data storage device, etc.

[0151] In one exemplary embodiment, a computer program product is also provided, which includes at least one computer program that is loaded by a processor and executes all or part of the steps of the data transmission method shown in the embodiment of FIG1 above.

[0152] Other embodiments of this application will readily occur to those skilled in the art upon consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of this application that follow the general principles of this application and include common knowledge or customary techniques in the art not disclosed herein. The specification and examples are to be considered exemplary only, and the true scope and spirit of this application are indicated by the claims.

[0153] It should be understood that this application is not limited to the precise structure described above and shown in the accompanying drawings, and various modifications and changes can be made without departing from its scope. The scope of this application is limited only by the appended claims.

Claims

1. A data transmission method, comprising: Obtain the M / 2 bits of data to be sent, b(k), where k = 0, 1, 2, ..., M / 2-1, and M is a positive integer; Based on the M / 2 data bits b(k), N complex modulation symbols d(i) are obtained, i = 0, 1, 2, ..., N-1, N = M, or N = M-1, where, in the case of i = 2k, d(i) is formed by data bits b(k), and in the case of i = 2k+1, d(i) is formed by data bits b(k) and data bits b(k+1). Transmit the N complex modulation symbols d(i).

2. The method according to claim 1, wherein, Based on the M / 2-bit data bits b(k), N complex modulation symbols d(i) are obtained, including: Based on the M / 2 data bits b(k), N complex symbols s(i) are obtained, wherein when i = 2k, s(i) is formed by data bits b(k), and when i = 2k+1, s(i) is formed by data bits b(k) and data bits b(k+1), and n = 0, 1, 2, ..., N-1; Based on the N complex symbols s(i), the N complex modulation symbols d(i) are obtained.

3. The method according to claim 2, wherein, Before obtaining the N complex modulation symbols d(i) based on the N complex symbols s(i), the method further includes: The power normalization process is performed on the N complex symbols s(i).

4. The method according to claim 2, wherein, Based on the N complex symbols s(i), the N complex modulation symbols d(i) are obtained, including: By performing phase rotation on the N complex symbols s(i), the N complex modulation symbols d(i) are obtained.

5. The method according to claim 4, wherein, The N complex symbols s(i) are phase-rotated to form the N complex modulation symbols d(i), including: The N complex symbols s(i) are phase-rotated in a phase-increasing or phase-decreasing manner to form the N complex modulation symbols d(i).

6. The method according to any one of claims 2 to 5, wherein, Based on the M / 2-bit data bits b(k), obtain N complex symbols s(i), including: When i = 2k, the data bits b(k) are used to form the real and imaginary parts of the complex number symbol s(i), respectively; In the case of i = 2k+1, the real and imaginary parts of the complex symbol s(i) are formed using data bits b(k) and b(k+1).

7. The method according to claim 6, wherein, The method of using data bits b(k) and b(k+1) to form the real and imaginary parts of the complex number symbol s(i) includes: The real part of the complex number symbol s(i) is formed using data bits b(k), and the imaginary part of the complex number symbol s(i) is formed using data bits b(k+1); or, The imaginary part of the complex symbol s(i) is formed using data bits b(k), and the real part of the complex symbol s(i) is formed using data bits b(k+1).

8. The method according to claim 7, wherein, The process of obtaining the N complex modulation symbols d(i) based on the N complex symbols s(i) includes: When the real part of the complex symbol s(i) is formed using data bits b(k), and the imaginary part of the complex symbol s(i) is formed using data bits b(k+1), the N complex symbols s(i) are incremented by π / 4 to form N complex modulation symbols; or, When the imaginary part of the complex symbol s(i) is formed using data bits b(k) and the real part of the complex symbol s(i) is formed using data bits b(k+1), the N complex symbols s(i) are reduced by π / 4 to form N complex modulation symbols.

9. The method according to claim 7 or 8, wherein, N = M, and b(M / 2) = b(0).

10. The method according to claim 9, wherein, Based on the M / 2-bit data bits b(k), obtain N complex symbols s(i), including: When i = 2k, the complex number symbol s(i) is determined according to the following formula: s(i)=(1-2b(k))+j(1-2b(k)); Given i = 2k + 1, the complex number symbol s(i) is determined according to the following formula: s(i)=(1-2b(k))+j(1-2b(k+1mod M / 2)).

11. The method according to claim 9, wherein, Based on the M / 2-bit data bits b(k), obtain N complex symbols s(n), including: When i = 2k, the complex number symbol s(i) is determined according to the following formula: s(i)=(1-2b(k))+j(1-2b(k)); Given i = 2k + 1, the complex number symbol s(i) is determined according to the following formula: s(i)=j(1-2b(k+1mod M / 2))+(1-2b(k)).

12. The method according to claim 7 or 8, wherein, N = M-1.

13. The method according to claim 12, wherein, The process of obtaining the N complex modulation symbols d(i) based on the N complex symbols s(i) includes: Phase rotation is performed on N complex symbols s(i) to obtain N complex modulation symbols d(i), i = 0, 1, 2, ..., N-1; The Mth complex modulation symbol corresponding to the M / 2 data bit is obtained by using the last data bit b(M / 2-1) of the M / 2 data bit b(k) and the first data bit b(0) of the next M / 2 data bit.

14. The method according to claim 12, wherein, The process of obtaining N complex symbols s(i) based on the M / 2-bit data bits b(k) includes: When i = 2k, the complex number symbol s(i) is determined according to the following formula: s(i)=(1-2b(k))+j(1-2b(k)); Given i = 2k + 1, the complex number symbol s(i) is determined according to the following formula: s(i)=(1-2b(k))+j(1-2b(k+1)).

15. The method according to claim 12, wherein, The process of obtaining N complex symbols s(i) based on the M / 2-bit data bits b(k) includes: When i = 2k, the complex number symbol s(i) is determined according to the following formula: s(i)=(1-2b(k))+j(1-2b(k)); Given i = 2k + 1, the complex number symbol s(i) is determined according to the following formula: s(i)=(1-2b(k+1))+j(1-2b(k)).

16. The method according to claim 8, wherein, The step of performing a π / 4 increment change on the N complex symbols s(i) to form N complex modulation symbols includes: The complex modulation symbol d(i) is determined according to the following formula: Where θ is a preset constant.

17. The method according to claim 8, wherein, The step of performing a π / 4 subtraction transformation on the N complex symbols s(i) to form N complex modulation symbols includes: The complex modulation symbol d(i) is determined according to the following formula: Where θ is a preset constant.

18. The method according to any one of claims 1 to 5, wherein, The step of obtaining the M / 2-bit data bits b(k) to be sent includes: The data to be transmitted is channel-coded to obtain the M / 2-bit data bits b(k).

19. The method according to any one of claims 1 to 4, wherein, M is a positive even number.

20. The method according to any one of claims 1 to 4, wherein, The transmission of the N complex modulation symbols d(i) includes: The N complex modulation symbols d(i) are filtered, and the filtered N complex modulation symbols d(i) are then converted from digital to analog. The signal obtained by converting transmitted data.

21. The method according to any one of claims 1 to 4, wherein, The transmission of the N complex modulation symbols d(i) includes: Perform an N-point discrete Fourier transform on the N complex modulation symbols d(i) to obtain the frequency domain data of the N subcarriers; Map the frequency domain data of the N subcarriers to the corresponding subcarrier positions; The frequency domain data mapped to the subcarrier position is subjected to an R-point inverse discrete Fourier transform, and the data sequence after the inverse discrete Fourier transform is transmitted, where R is an integer greater than or equal to N.

22. A communication device comprising a processor and a memory, the memory storing a program or instructions executable on the processor, the program or instructions, when executed by the processor, implementing the steps of the data transmission method as claimed in any one of claims 1 to 21.

23. A readable storage medium storing a program or instructions that, when executed by a processor, implement the steps of the data transmission method as claimed in any one of claims 1 to 21.

24. A computer program product comprising a computer program stored on a non-transitory computer-readable storage medium, the computer program including program instructions that, when executed by a computer, cause the computer to perform the steps of the data transmission method as described in any one of claims 1 to 21.

Images