Data modulation method, communication device, and storage medium

Abstract

The present application provides a data modulation method, a communication device, and a storage medium. The data modulation method, when applied to a sending end, comprises: performing first encoding on a first data sequence, to obtain a second data sequence, the process of the first encoding comprising repeating each element in the first data sequence N times, N being a positive integer (S110); and modulating the second data sequence, to obtain a third data sequence (S120).

Description

Data modulation method, communication device and storage medium TECHNICAL FIELD

[0001] The present application relates to the technical field of communication, in particular to a data modulation method, a communication device and a storage medium. BACKGROUND

[0002] With the development of wireless communication technology, the capacity and coverage of communication systems are constantly expanding, and the requirements for signal quality are also increasing. The peak-to-average power ratio (PAPR) of a communication signal has become a key indicator for measuring signal quality and power amplifier efficiency. Generally speaking, a high PAPR will lead to a decrease in power amplifier efficiency, which in turn affects the coverage capability and signal transmission quality of the communication system.

[0003] In the related art communication system, the PAPR of a multicarrier orthogonal frequency division multiplexing (OFDM) signal is very high, and a high PAPR means that the peak power of the communication signal is much larger than the average power. This not only causes non-linear distortion of the power amplifier, but also causes the power amplifier to work in a high power state, thereby increasing energy consumption and heat loss and reducing its working efficiency. Although the PAPR of a single-carrier discrete Fourier transform-spread-orthogonal frequency division multiplexing (DFT-s-OFDM) signal is low, it is still not low enough to meet the low PAPR requirements of future communications. Therefore, how to design a modulation technology to reduce the PAPR is a problem that needs to be solved. SUMMARY

[0004] Therefore, the embodiments of the present application provide a data modulation method, a communication device and a storage medium, which effectively reduce the PAPR of data.

[0005] The embodiments of the present application provide a data modulation method applied to a sending end, comprising:

[0006] performing first encoding on a first data sequence to obtain a second data sequence; wherein the process of the first encoding comprises: repeating each element in the first data sequence N times; wherein N is a positive integer;

[0007] performing modulation on the second data sequence to obtain a third data sequence.

[0008] The embodiments of the present application provide a data demodulation method applied to a receiving end, comprising:

[0009] performing waveform demodulation on the received fourth data sequence to obtain a third data sequence;

[0010] performing demodulation on the third data sequence; wherein the modulation process of the third data sequence comprises:

[0011] performing first encoding on the first data sequence to obtain a second data sequence; wherein the process of the first encoding comprises: repeating each element in the first data sequence N times; wherein N is a positive integer;

[0012] performing modulation on the second data sequence to obtain a third data sequence.

[0013] An embodiment of the present application provides a communication device, comprising: a memory and one or more processors;

[0014] The memory is configured to store one or more programs;

[0015] When the one or more programs are executed by the one or more processors, the one or more processors implement the method in any of the above embodiments.

[0016] An embodiment of the present application provides a storage medium, which stores a computer program, and the computer program is executed by a processor to implement the method in any of the above embodiments. BRIEF DESCRIPTION OF DRAWINGS

[0017] FIG. 1 is a flow chart of a data modulation method according to an embodiment of the present application;

[0018] FIG. 2 is a flow chart of a data demodulation method according to an embodiment of the present application;

[0019] FIG. 3 is a configuration schematic diagram of a QPSK constellation according to an embodiment of the present application;

[0020] FIG. 4 is a generation schematic diagram of a third data sequence according to an embodiment of the present application;

[0021] FIG. 5 is a generation schematic diagram of a third data sequence according to an embodiment of the present application;

[0022] FIG. 6 is an implementation schematic diagram of waveform modulation on a third data sequence according to an embodiment of the present application;

[0023] FIG. 7 is a structural block diagram of a data modulation apparatus according to an embodiment of the present application;

[0024] FIG. 8 is a structural block diagram of a data demodulation apparatus according to an embodiment of the present application;

[0025] FIG. 9 is a structural schematic diagram of a communication device according to an embodiment of the present application. DETAILED DESCRIPTION

[0026] The embodiments of the present application will be described below with reference to the accompanying drawings. The present application is described below with reference to the accompanying drawings, and the examples are only used to explain the present application, but not to limit the scope of the present application.

[0027] In an embodiment, FIG. 1 is a flowchart of a data modulation method according to an embodiment of the present application. The present embodiment is applied to the case of reducing the phase difference between two adjacent elements. The present embodiment can be executed by a sending end. The sending end can be a communication device, which is used to implement the process of modulating and / or encoding a data sequence. As shown in FIG. 1, the present embodiment includes S110-S120.

[0028] S110, first encoding a first data sequence to obtain a second data sequence; wherein the process of first encoding includes repeating each element in the first data sequence N times; wherein N is a positive integer.

[0029] In an example, the first data sequence can be an unmodulated data sequence. In an example, if the first data sequence is a bit data sequence, the corresponding second data sequence can also be a bit data sequence. The bit data sequence refers to a sequence composed of binary data. Exemplarily, the bit data sequence can be 0 and 1, or the bit data sequence can be 1 and -1. In an example, the process of first encoding includes transforming each element in the first data sequence into N repeated elements. The process of repeating each element in the first data sequence N times can also be understood as the process of transforming each element in the first data sequence into N repeated elements. In an example, repeating each element in the first data sequence N times means that the number of times of the element originally belonging to the first data sequence is N. If the number of times of the element originally belonging to the first data sequence is counted, each element in the first data sequence is repeated N times; if the number of times of the element originally belonging to the first data sequence is not counted, each element in the first data sequence is repeated N-1 times.

[0030] In an example, repeating each element in the first data sequence N times to obtain the second data sequence, the second data sequence contains N times the number of elements contained in the first data sequence. Exemplarily, assuming N=2, each element in the first data sequence is repeated twice, i.e., the same element in the second data sequence is two; correspondingly, the second data sequence contains 2 times the number of elements contained in the first data sequence.

[0031] S120, modulating the second data sequence to obtain a third data sequence.

[0032] In an example, the modulation manner of the second data sequence can include Quadrature Phase Shift Keying (QPSK) modulation. In an example, the sending end can repeat each element in the first data sequence N times, which is equivalent to performing an interpolation operation on the first data sequence to obtain the second data sequence; and then modulate the second data sequence to obtain a third data sequence, in which the phase difference between adjacent two elements is reduced, and thus the PAPR of the data in the third data sequence is reduced.

[0033] In an embodiment, the first encoding of the first data sequence to obtain the second data sequence includes: repeating each element in the first data sequence N times to obtain a repeated first data sequence; and cyclically shifting the repeated first data sequence by an odd number of elements to obtain the second data sequence. In an example, the odd number can be a positive number or a negative number. In an example, after repeating each element in the first data sequence N times, the repeated first data sequence can be cyclically shifted by an odd number of elements, and the data sequence after the cyclic shift is taken as the second data sequence.

[0034] In an embodiment, the cyclically shifting the repeated first data sequence by an odd number of elements to obtain the second data sequence includes: cyclically shifting the first odd number of elements in the repeated first data sequence to the tail to obtain the second data sequence. In an example, the first odd number of elements refers to the first odd number of elements in the repeated first data sequence. The process of cyclically shifting the first odd number of elements in the repeated first data sequence to the tail can be understood as the process of cyclically shifting the first odd number of elements in the repeated first data sequence to the left, or the process of cyclically shifting the last odd number of elements in the repeated first data sequence to the left.

[0035] In an embodiment, the cyclically shifting the repeated first data sequence by an odd number of elements to obtain the second data sequence includes: cyclically shifting the last odd number of elements in the repeated first data sequence to the head to obtain the second data sequence. In an example, the last odd number of elements refers to the last odd number of elements in the repeated first data sequence. The process of cyclically shifting the last odd number of elements in the repeated first data sequence to the head can be understood as the process of cyclically shifting the last odd number of elements in the repeated first data sequence to the right, or the process of cyclically shifting the first odd number of elements in the repeated first data sequence to the right.

[0036] In an embodiment, each element in the first data sequence is repeated N times, and is arranged in the original order. In an example, the arrangement in the original order can be understood as that each element in the second data sequence is arranged in the relative position between each element in the first data sequence. For example, assuming that the first data sequence is [a1, a2,..., aL], where L is the number of elements contained in the first data sequence, and N=3, i.e., each element in the first data sequence is repeated 3 times, the second data sequence obtained is [a1, a1, a1, a2, a2, a2,..., aL, aL, aL], i.e., the relative position of each element in the second data sequence is still a1, a2,..., aL. i ...,a L . i ...,a i . i ...,a L . L ...,a L . i ...,a L .

[0037] In an embodiment, the value of N includes 4. In an example, if N=4, each element in the first data sequence is transformed into 4 repeated elements, i.e., each element in the second data sequence contains 4.

[0038] In an embodiment, the cyclic shift includes left cyclic shift or right cyclic shift. In an example, an odd number can be set as a positive number, and the direction of the cyclic shift can be configured by itself. In an example, if the odd number is 1, the repeated first data sequence can be cyclically shifted by 1 element, and the repeated first data sequence can be configured to be cyclically shifted by 1 element to the left to obtain the second data sequence, i.e., the first element of the repeated first data sequence is cyclically shifted to the tail to form the second data sequence; or the repeated first data sequence can be configured to be cyclically shifted by 1 element to the right, i.e., the tail element of the repeated first data sequence is cyclically shifted to the head to form the second data sequence.

[0039] In an embodiment, if the odd number is negative, the left cyclic shift is performed; if the odd number is positive, the right cyclic shift is performed. In an example, the positive and negative of the odd number can be used to configure the direction of the cyclic shift, for example, if the odd number is positive, the cyclic shift can be performed by 1 element to the right; if the odd number is negative, the cyclic shift can be performed by 1 element to the left.

[0040] In an embodiment, the second data sequence is modulated to obtain a third data sequence, including: the second data sequence is QPSK modulated to obtain the third data sequence.

[0041] In an embodiment, the first data sequence is a bit data sequence. In an example, the first data sequence can be an uncoded data sequence. In an example, if the first data sequence is a bit data sequence, correspondingly, the second data sequence can also be a bit data sequence. A bit data sequence refers to a sequence composed of binary data.

[0042] In an embodiment, the bit data sequence comprises one of the following: 0 and 1; 1 and -1. Exemplarily, the bit data sequence can be 0 and 1, i.e., the first data sequence can be a bit data sequence composed of 0 and 1 as elements; or, the bit data sequence can be 1 and -1, i.e., the first data sequence can be a bit data sequence composed of 1 and -1 as elements.

[0043] In an embodiment, before the first encoding of the first data sequence to obtain the second data sequence, further comprising: second encoding of a pre-generated bit data sequence to obtain the first data sequence. In an example, the pre-generated bit data sequence can be second encoded to obtain the first data sequence, and then the first data sequence can be first encoded to obtain the second data sequence. In an example, the communication device as a sending end can second encode the pre-generated bit data sequence to obtain an encoded data sequence as the first data sequence, i.e., the first data sequence is a second encoded data sequence.

[0044] In an embodiment, the second encoding comprises one of the following: Low Density Parity Check (LDPC) encoding, polar encoding, Turbo encoding, convolutional encoding. In an example, the bit data sequence can be encoded by using at least one of the following encoding methods: LDPC encoding, polar encoding, Turbo encoding, and convolutional encoding, to obtain the first data sequence.

[0045] In an embodiment, the second data sequence contains four times the number of elements contained in the first data sequence. In an example, if N = 4, i.e., each element in the first data sequence is transformed into 4 repeated elements, correspondingly, the second data sequence contains four times the number of elements contained in the first data sequence.

[0046] In an embodiment, the modulating the second data sequence to obtain a third data sequence comprises: grouping two adjacent elements in the second data sequence as a group to form a new second data sequence; and performing QPSK modulation on the new second data sequence to obtain the third data sequence. In an example, two adjacent elements in the second data sequence can be grouped as a group to obtain a new second data sequence; and then QPSK modulation is performed on the new second data sequence to obtain the third data sequence. In an example, the new second data sequence contains half the number of elements contained in the second data sequence. For example, the first data sequence contains L elements, N=4, and correspondingly, the second data sequence contains 4L elements, the new second data sequence contains 2L groups of elements, and the third data sequence contains 2L elements.

[0047] In an embodiment, the data modulation method applied to the sending end further comprises: transmitting the third data sequence. In an example, the communication device as the sending end can transmit the third data sequence to the communication device as the receiving end, so that the communication device as the receiving end demodulates the received data sequence.

[0048] In an embodiment, the transmitting the third data sequence comprises: performing phase rotation processing on the third data sequence to obtain a new third data sequence; and transmitting the new third data sequence. In an example, the communication device as the sending end can first perform phase rotation processing on the third data sequence to obtain a new third data sequence, i.e., the third data sequence after phase rotation; and then transmit the third data sequence after phase rotation to the communication device as the receiving end.

[0049] In an embodiment, the transmitting the third data sequence comprises: performing filtering and digital-to-analog conversion on the third data sequence to obtain a new third data sequence; and transmitting the new third data sequence. In an example, the communication device as the sending end can first perform filtering on the third data sequence, then perform digital-to-analog conversion on the third data sequence after filtering to obtain a new third data sequence, and transmit the new third data sequence to the communication device as the receiving end. In an example, the third data sequence can be first converted into an analog signal, and then the analog signal is filtered to obtain a new third data sequence, and the new third data sequence is transmitted to the communication device as the receiving end. After filtering and digital-to-analog conversion on the third data sequence, the new third data sequence obtained is the signal after digital-to-analog conversion.

[0050] In an embodiment, filtering and digital-to-analog conversion on the third data sequence comprises: obtaining real parts and imaginary parts in the third data sequence to obtain corresponding real part data sequence and imaginary part data sequence; filtering and digital-to-analog converting the real part data sequence and the imaginary part data sequence respectively to obtain a new third data sequence. In an example, the real parts and the imaginary parts in the third data sequence can be filtered and digital-to-analog converted separately, that is, first obtaining real part elements in the third data sequence to form a corresponding real part data sequence, and obtaining imaginary part elements in the third data sequence to form a corresponding imaginary part data sequence; then filtering and digital-to-analog converting the real part data sequence to obtain a new real part data sequence, and filtering and digital-to-analog converting the imaginary part data sequence to obtain a new imaginary part data sequence; and then combining the new real part data sequence and the new imaginary part data sequence to obtain a new third data sequence.

[0051] In an embodiment, transmitting the third data sequence comprises: performing Fourier transform on the third data sequence by a communication device as a sending end to obtain a transformed third data sequence; performing subcarrier mapping on the transformed third data sequence to obtain a mapped third data sequence; performing inverse Fourier transform on the mapped third data sequence to obtain a new third data sequence; and transmitting the new third data sequence to a communication device as a receiving end. In an example, the process of subcarrier mapping comprises zero padding, that is, placing data 0 on both sides of the data subcarriers of the transformed third data sequence, so that oversampling can be achieved.

[0052] In an example, the Fourier transform can comprise one of: fast Fourier transform; discrete Fourier transform; and correspondingly, the inverse Fourier transform can comprise one of: fast inverse Fourier transform; and discrete inverse Fourier transform. In an example, if the Fourier transform is fast Fourier transform, the corresponding inverse Fourier transform is fast inverse Fourier transform; in an example, if the Fourier transform is discrete Fourier transform, the corresponding inverse Fourier transform is discrete inverse Fourier transform.

[0053] In an embodiment, FIG. 2 is a flowchart of a data demodulation method provided by the embodiment of the application. The embodiment is applied to the case of reducing the phase difference between two adjacent elements. The embodiment can be executed by a receiving end. The receiving end can be a communication device for implementing the process of demodulating and / or decoding a data sequence. As shown in FIG. 2, the embodiment comprises S210-S220.

[0054] S210, performing waveform demodulation on the received fourth data sequence to obtain a third data sequence.

[0055] S220, demodulating the third data sequence; wherein the modulation process of the third data sequence comprises:

[0056] performing first encoding on the first data sequence to obtain a second data sequence; wherein the first encoding comprises repeating each element in the first data sequence N times; wherein N is a positive integer;

[0057] modulating the second data sequence to obtain a third data sequence.

[0058] In an example, before the communication device as the sending end transmits the third data sequence to the communication device as the receiving end, the third data sequence can be subjected to waveform modulation, and during the transmission of the third data sequence, there can be noise and other interference signals, so that the communication device as the receiving end receives a fourth data sequence subjected to waveform modulation and addition of noise and other interference signals; then the communication device as the receiving end can perform waveform demodulation on the fourth data sequence to recover the third data sequence, and perform demodulation on the third data to recover the corresponding bit data sequence.

[0059] In an embodiment, the performing first encoding on the first data sequence to obtain a second data sequence comprises: repeating each element in the first data sequence N times to obtain a repeated first data sequence; and cyclically shifting an odd number of elements of the repeated first data sequence to obtain the second data sequence.

[0060] In an embodiment, the cyclically shifting an odd number of elements of the repeated first data sequence to obtain the second data sequence comprises: cyclically shifting an odd number of elements at a head of the repeated first data sequence to a tail to obtain the second data sequence.

[0061] In an embodiment, the cyclically shifting an odd number of elements of the repeated first data sequence to obtain the second data sequence comprises: cyclically shifting an odd number of elements at a tail of the repeated first data sequence to a head to obtain the second data sequence.

[0062] In an embodiment, each element in the first data sequence is repeated N times and is arranged in the original order.

[0063] In an embodiment, the value of N comprises 4.

[0064] In an embodiment, the cyclic shifting comprises left cyclic shifting or right cyclic shifting.

[0065] In an embodiment, if the odd number is negative, the left cyclic shifting is performed; if the odd number is positive, the right cyclic shifting is performed.

[0066] In an embodiment, the modulating the second data sequence to obtain a third data sequence comprises: performing QPSK modulation on the second data sequence to obtain the third data sequence.

[0067] In an embodiment, the first data sequence is a bit data sequence.

[0068] In an embodiment, the bit data sequence comprises one of the following: 0 and 1; 1 and -1.

[0069] In an embodiment, before the first encoding of the first data sequence to obtain the second data sequence, the method further comprises: second encoding a pre-generated bit data sequence to obtain the first data sequence.

[0070] In an embodiment, the second encoding comprises one of the following: low density parity check (LDPC) encoding, polar encoding, Turbo encoding, convolutional encoding.

[0071] In an embodiment, the second data sequence comprises four times as many elements as the first data sequence.

[0072] In an embodiment, the modulation of the second data sequence to obtain the third data sequence comprises: grouping two adjacent elements in the second data sequence as a group to form a new second data sequence; and QPSK modulation of the new second data sequence to obtain the third data sequence.

[0073] In an embodiment, the fourth data sequence is a data sequence obtained by phase rotation processing of the third data sequence.

[0074] In an embodiment, the fourth data sequence is a data sequence obtained by filtering and digital-to-analog conversion of the third data sequence.

[0075] In an embodiment, the filtering and digital-to-analog conversion of the third data sequence comprises:

[0076] In an embodiment, the filtering and digital-to-analog conversion of the third data sequence comprises:

[0077] In an embodiment, the fourth data sequence is a data sequence obtained by sequentially performing Fourier transform processing, subcarrier mapping, and inverse Fourier transform processing on the third data sequence.

[0078] It should be noted that the explanations of the first data sequence, the second data sequence, the third data sequence, the first encoding, the QPSK modulation, the cyclic shift, and other parameters involved in the data demodulation method applied to the receiving end can be referred to the descriptions of the corresponding parameters in the data modulation method applied to the transmitting end, which will not be repeated here.

[0079] In the following embodiments 1 to 8, a first data sequence, a first encoding process for the first data sequence, QPSK modulation of the second data sequence, generation of a third data sequence, and waveform modulation of the third data sequence are described. In the following embodiments, an odd number is denoted as p, meaning that the repeated first data sequence is cyclically shifted by p elements.

[0080] Example 1

[0081] This embodiment is an example in which the first data sequence is a bit data sequence.

[0082] In this embodiment, the first data sequence is a bit data sequence, and the bit data may be 0 or 1; or the bit data may be 1 or -1.

[0083] Example 2

[0084] This embodiment is an example of performing a first encoding on a first data sequence. In this embodiment, assuming N = 4 and p = -1, each element in the first data sequence is repeated 4 times, and then the first data sequence after the repetition is cyclically shifted to the left by 1 element, that is, the first element in the repeated first data sequence is cyclically shifted to the end to form a second data sequence;

[0085] Assume that the first data sequence is [a1,a2,...,a i ...,a L ], where L is the number of elements in the first data sequence. Correspondingly, the second data sequence is:

[0086] [b1,b2,...,b 4i ...,b 4L ]=[a1,a1,a1,a2,a2,a2,a2,...,a i ,a i ,a i ,a i ,...,a L ,a L ,a L ,a L ,a1]; where 4L is the number of elements contained in the second data sequence.

[0087] In other embodiments, the second encoding is first performed on the bit data sequence to obtain a first data sequence; and then the first encoding is performed on the first data sequence obtained by the second encoding to obtain a second data sequence.

[0088] Example 3

[0089] This embodiment is an example of performing a first encoding on a first data sequence. In this embodiment, assuming N = 4 and p = 1, each element in the first data sequence is repeated 4 times, and then the first data sequence after the repetition is cyclically shifted right by 1 element, that is, the last element in the repeated first data sequence is cyclically shifted to the beginning to form a second data sequence;

[0090] Assume that the first data sequence is [a1, a2, ..., a i ...,a L ], where L is the number of elements in the first data sequence. Correspondingly, the second data sequence is:

[0091] [b1,b2,...,b 4i ...,b 4L ]=[a L ,a1,a1,a1,a1,a2,a2,a2,a2,...,a i ,a i ,a i ,a i ,...,a L ,a L ,a L ]; where 4L is the number of elements contained in the second data sequence.

[0092] Example 4

[0093] This embodiment is an example of first encoding of a first data sequence. In this embodiment, assuming N=4, with an odd number p, each element in the first data sequence is repeated 4 times, and then p elements are cycled to form a second data sequence.

[0094] Assume that in this embodiment, the first data sequence is [a1, a2, ..., a i ...,a L ], where L is the number of elements in the first data sequence, and p is 5, which means that the first data sequence after repetition is cyclically shifted 5 elements to the right or 5 elements to the left. Correspondingly, the second data sequence is: [b1,b2,...,b 4i ...,b 4L ]=[a L-1 ,a L ,a L ,a L ,a L ,a1,a1,a1,a1,a2,a2,a2,a2,...,a i ,a i ,a i ,a i ,...,a L-1 ,aL-1 a L-1 ];

[0095] Alternatively, [b1,b2,...,b 4i ...,b 4L ] = [a2,a2,a2,a3,...,a i ,a i ,a i ,a i ,...,a L-1 ,a L-1 ,a L-1 ,a L-1 ,a L ,a L ,a L ,a L ,a1,a1,a1,a1,a2]

[0096] wherein 4L is the number of elements in the second data sequence. In other embodiments, p is another non-zero integer and is odd.

[0097] Embodiment Five

[0098] This embodiment is an example of QPSK modulation of the second data sequence. FIG. 3 is a diagram illustrating a configuration of a QPSK constellation according to an embodiment of the present application. In this embodiment, it is assumed that N = 4, the first data sequence is encoded to form the second data sequence, and every two adjacent elements in the second data sequence are grouped to perform QPSK modulation to form the third data sequence. In this embodiment, the number of groups in the second data sequence is twice the number of elements in the first data sequence, and the number of elements in the third data sequence is twice the number of elements in the first data sequence.

[0099] It is assumed that the first data sequence is [a1,a2,...,a i ...,a L ]; wherein L is the number of elements in the first data sequence.

[0100] The second data sequence is [b1,b2,...,b 4L-1 ,b 4L ] = [a L ,a1,a1,a1,a1,a2,a2,a2,a2,...,a L-1 ,a L ,a L ,a L ]; wherein the number of elements in the second data sequence before grouping every two adjacent elements in the second data sequence is 4L.

[0101] Every two adjacent elements in the second data sequence form a group, that is:

[0102] [(b1,b2),...,(b 4L-1 ,b 4L )]=[(a L ,a1),(a1,a1),(a1,a2),(a2,a2),...,(a L-1 ,a L ),(a L ,a L )]; wherein, after every two adjacent elements in the second data sequence are grouped together, the number of groups included in the second data sequence is 2L;

[0103] Then, each group in the second data sequence is sequentially QPSK modulated, and the constellation mapping rule of QPSK modulation is: bit 00 is mapped to constellation point S1; bit 01 is mapped to constellation point S2; bit 11 is mapped to constellation point S3; bit 10 is mapped to constellation point S4, as shown in (1) in Figure 3.

[0104] In other embodiments, the constellation points S1, S2, S3, and S4 may also be respectively: {exp(-j·θ), exp(-j·(θ+pi / 2)), exp(-j·(θ+pi)), exp(-j·(θ+3pi / 2)), θ=any value from 0 to 2pi}, as shown in (2) in FIG3 , or {exp(-j·θ), exp(-j·(θ+3pi / 2)), exp(-j·(θ+pi)), exp(-j·(θ+pi / 2)), θ=any value from 0 to 2pi}, as shown in (3) in FIG3 .

[0105] Example 6

[0106] This embodiment illustrates an example in which a first data sequence is first encoded to form a second data sequence, and the second data sequence is QPSK modulated to form a third data sequence. In this embodiment, assuming N = 4 and p = -1, the first data sequence is first encoded to form a second data sequence. The first encoding rule is as follows: each element in the first data sequence is repeated four times, and then cyclically shifted left by one element to form the second data sequence.

[0107] Then, QPSK modulation is performed on the second data sequence to form a third data sequence. The QPSK modulation rule is as follows: every two adjacent elements in the second data sequence form a group, and QPSK modulation is performed on each group to form a QPSK data sequence. The QPSK modulation constellation mapping rule is as follows: bit 00 is mapped to constellation point S1, bit 01 is mapped to constellation point S2, bit 11 is mapped to constellation point S3, and bit 10 is mapped to constellation point S4.

[0108] Then the third data sequence is transmitted.

[0109] Figure 4 is a schematic diagram of generating a third data sequence according to an embodiment of the present application. As shown in Figure 4, in this embodiment, it is assumed that the first data sequence is [0010110101001101];

[0110] Then the first data sequence is first encoded to form a second data sequence, and the second data sequence is [0000000111100001111111100001111000011110000000011111111000011110],

[0111] Then the second data sequence is QPSK modulated to form a third data sequence, and the third data sequence is [S1S1S1S2S3S4S1S2S3S3S3S4S1S2S3S4S1S2S3S4S1S1S1S2S3S3S3S4S1S2S3S4];

[0112] Then the third data sequence is transmitted.

[0113] Embodiment Seven

[0114] This embodiment is an example of first encoding the first data sequence to form a second data sequence, and QPSK modulating the second data sequence to form a third data sequence. In this embodiment, it is assumed that N=4 and p=1. First, the first data sequence is first encoded to form a second data sequence, wherein the first encoding rule is that each element in the first data sequence is repeated 4 times, and then the second data sequence is formed by right circularly shifting 1 element.

[0115] Then the second data sequence is QPSK modulated to form a third data sequence, wherein the QPSK modulation rule is that each adjacent 2 elements in the second data sequence is a group, and each group is QPSK modulated to form a QPSK data sequence. The QPSK modulation constellation mapping rule is that bit 00 is mapped to constellation point S1, bit 01 is mapped to constellation point S2, bit 11 is mapped to constellation point S3, and bit 10 is mapped to constellation point S4.

[0116] Then the third data sequence is transmitted.

[0117] Figure 5 is a schematic diagram of generating a third data sequence according to an embodiment of the present application. As shown in Figure 5, in this embodiment, it is assumed that the first data sequence is [0010110101001101];

[0118] Then, the first data sequence is first encoded to form a second data sequence, and the second data sequence is [1000000001111000011111111000011110000111100000000111111110000111].

[0119] Then, the second data sequence is QPSK modulated to form a third data sequence, and the third data sequence is [S4S1S1S1S2S3S4S1S2S3S3S3S4S1S2S3S4S1S2S3S4S1S1S1S2S3S3S3S4S1S2S3].

[0120] Then, the third data sequence is transmitted.

[0121] Embodiment Eight

[0122] This embodiment is an example of waveform modulation of the third data sequence. FIG. 6 is a schematic diagram of an implementation of waveform modulation of the third data sequence according to an embodiment of the present application. As shown in FIG. 6, the third data sequence is subjected to DFT, resource mapping, and frequency domain shaping, and data 0 is placed in the positions of the two edge subcarriers of the data subcarriers to achieve oversampling, IDFT, digital-to-analog conversion, and the like, and then transmitted on a radio frequency link.

[0123] In an embodiment, FIG. 7 is a structural block diagram of a data modulation apparatus according to an embodiment of the present application. The present embodiment is applied to a sending end. As shown in FIG. 7, the data modulation apparatus in the present embodiment includes an encoder 710 and a modulator 720.

[0124] The encoder 710 is configured to first encode a first data sequence to obtain a second data sequence; wherein the process of first encoding includes repeating each element in the first data sequence N times; wherein N is a positive integer.

[0125] The modulator 720 is configured to modulate the second data sequence to obtain a third data sequence.

[0126] In an embodiment, first encoding the first data sequence to obtain the second data sequence includes: repeating each element in the first data sequence N times to obtain a repeated first data sequence; and cyclically shifting an odd number of elements of the repeated first data sequence to obtain the second data sequence.

[0127] In an embodiment, cyclically shifting an odd number of elements of the repeated first data sequence to obtain the second data sequence includes: cyclically shifting an odd number of elements at the beginning of the repeated first data sequence to the end to obtain the second data sequence.

[0128] In an embodiment, the second data sequence is obtained by cyclically shifting the repeated first data sequence by an odd number of elements, including: cyclically shifting the tail odd number of elements in the repeated first data sequence to the head to obtain the second data sequence.

[0129] In an embodiment, each element in the first data sequence is repeated N times while still arranged in the original order.

[0130] In an embodiment, the value of N includes: 4.

[0131] In an embodiment, the cyclic shift includes: left cyclic shift or right cyclic shift.

[0132] In an embodiment, if the odd number is negative, the left cyclic shift is performed; if the odd number is positive, the right cyclic shift is performed.

[0133] In an embodiment, the third data sequence is obtained by modulating the second data sequence, including: QPSK modulating the second data sequence to obtain the third data sequence.

[0134] In an embodiment, the first data sequence is a bit data sequence.

[0135] In an embodiment, the bit data sequence includes one of: 0 and 1; 1 and -1.

[0136] In an embodiment, before the first data sequence is first encoded to obtain the second data sequence, the method further includes: second encoding a pre-generated bit data sequence to obtain the first data sequence.

[0137] In an embodiment, the second encoding includes one of: low density parity check (LDPC) encoding, polar encoding, Turbo encoding, convolutional encoding.

[0138] In an embodiment, the second data sequence contains four times the number of elements contained in the first data sequence.

[0139] In an embodiment, the third data sequence is obtained by modulating the second data sequence, including: grouping adjacent two elements in the second data sequence as a group to form a new second data sequence; QPSK modulating the new second data sequence to obtain the third data sequence.

[0140] In an embodiment, the data modulation apparatus applied to the sending end further includes: a transmitter configured to transmit the third data sequence.

[0141] In an embodiment, the transmitter includes:

[0142] a phase processing unit configured to perform phase rotation processing on the third data sequence to obtain a new third data sequence;

[0143] The transmission unit is configured to transmit the new third data sequence.

[0144] In an embodiment, the transmitter comprises:

[0145] The filtering and converting unit is configured to filter and digital-to-analog convert the third data sequence to obtain the new third data sequence.

[0146] The transmission unit is configured to transmit the new third data sequence.

[0147] In an embodiment, the filtering and converting unit comprises:

[0148] The obtaining subunit is configured to obtain the real part and the imaginary part in the third data sequence to obtain a corresponding real part data sequence and an imaginary part data sequence.

[0149] The filtering and converting subunit is configured to filter and digital-to-analog convert the real part data sequence and the imaginary part data sequence respectively to obtain the new third data sequence.

[0150] In an embodiment, the transmitter comprises:

[0151] The transforming unit is configured to perform Fourier transform processing on the third data sequence to obtain a transformed third data sequence.

[0152] The mapping unit is configured to perform subcarrier mapping on the transformed third data sequence to obtain a mapped third data sequence.

[0153] The inverse transforming unit is configured to perform inverse Fourier transform processing on the mapped third data sequence to obtain the new third data sequence.

[0154] The transmission unit is configured to transmit the new third data sequence.

[0155] The data modulation apparatus provided in the embodiment is arranged to implement the data modulation method applied to the sending end in the embodiment shown in FIG. 1. The data modulation apparatus provided in the embodiment has similar implementation principles and technical effects, and thus details are not described herein.

[0156] In an embodiment, FIG. 8 is a structural block diagram of a data demodulation apparatus provided in an embodiment of the present application. The embodiment is applied to a receiving end. As shown in FIG. 8, the data modulation apparatus in the embodiment comprises a first demodulator 810 and a second demodulator 820.

[0157] The first demodulator 810 is configured to perform waveform demodulation on the received fourth data sequence to obtain the third data sequence.

[0158] The second demodulator 820 is configured to demodulate the third data sequence; wherein the modulation process of the third data sequence comprises:

[0159] The first data sequence is first encoded to obtain a second data sequence; wherein the process of the first encoding comprises: repeating each element in the first data sequence N times; wherein N is a positive integer;

[0160] The second data sequence is modulated to obtain the third data sequence.

[0161] In an embodiment, the first encoding of the first data sequence to obtain the second data sequence comprises: repeating each element in the first data sequence N times to obtain a repeated first data sequence; and cyclically shifting the repeated first data sequence by an odd number of elements to obtain the second data sequence.

[0162] In an embodiment, the cyclically shifting the repeated first data sequence by an odd number of elements to obtain the second data sequence comprises: cyclically shifting the first odd number of elements in the repeated first data sequence to the tail to obtain the second data sequence.

[0163] In an embodiment, the cyclically shifting the repeated first data sequence by an odd number of elements to obtain the second data sequence comprises: cyclically shifting the last odd number of elements in the repeated first data sequence to the head to obtain the second data sequence.

[0164] In an embodiment, each element in the first data sequence is repeated N times, and is still arranged in the original order.

[0165] In an embodiment, the value of N includes 4.

[0166] In an embodiment, the cyclic shift includes left cyclic shift or right cyclic shift.

[0167] In an embodiment, if the odd number is negative, the left cyclic shift is performed; if the odd number is positive, the right cyclic shift is performed.

[0168] In an embodiment, the modulation of the second data sequence to obtain the third data sequence comprises: QPSK modulation of the second data sequence to obtain the third data sequence.

[0169] In an embodiment, the first data sequence is a bit data sequence.

[0170] In an embodiment, the bit data sequence includes one of the following: 0 and 1; 1 and -1.

[0171] In an embodiment, before the first encoding of the first data sequence to obtain the second data sequence, the method further comprises: second encoding of a pre-generated bit data sequence to obtain the first data sequence.

[0172] In an embodiment, the second encoding comprises one of the following: low density parity check (LDPC) encoding, polar encoding, Turbo encoding, and convolutional encoding.

[0173] In an embodiment, the second data sequence comprises four times as many elements as the first data sequence.

[0174] In an embodiment, the third data sequence is obtained by modulating the second data sequence, comprising: grouping two adjacent elements in the second data sequence as a group to form a new second data sequence; and performing QPSK modulation on the new second data sequence to obtain the third data sequence.

[0175] In an embodiment, the fourth data sequence is a data sequence obtained by performing phase rotation processing on the third data sequence.

[0176] In an embodiment, the fourth data sequence is a data sequence obtained by performing filtering and digital-to-analog conversion on the third data sequence.

[0177] In an embodiment, the filtering and digital-to-analog conversion on the third data sequence comprises:

[0178] In an embodiment, the filtering and digital-to-analog conversion on the third data sequence comprises:

[0179] In an embodiment, the fourth data sequence is a data sequence obtained by sequentially performing Fourier transform processing, subcarrier mapping, and inverse Fourier transform processing on the third data sequence.

[0180] The data demodulation apparatus provided in the embodiment is configured to implement the data demodulation method applied to the receiving end of the embodiment shown in FIG. 2, and the data demodulation apparatus provided in the embodiment has similar implementation principles and technical effects, which will not be described herein again.

[0181] In an embodiment, FIG. 9 is a structural schematic diagram of a communication device provided by embodiments of the present application. As shown in FIG. 9, the device provided by embodiments of the present application includes a processor 910, a memory 920 and a communication module 930. The number of processors 910 in the device can be one or more, and FIG. 9 takes one processor 910 as an example. The number of memories 920 in the device can be one or more, and FIG. 9 takes one memory 920 as an example. The processor 910, the memory 920 and the communication module 930 of the device can be connected through a bus or other means, and FIG. 9 takes the connection through the bus as an example. In this embodiment, the device can act as a sending end and also can act as a receiving end. In an example, the communication device acting as the sending end and the communication device acting as the receiving end can be the same communication device or two different communication devices.

[0182] The memory 920, as a computer readable storage medium, can be configured to store software programs, computer executable programs and modules, such as program instructions / modules of the device of any embodiment of the present application (for example, the encoder 710 and the modulator 720 in the data modulation apparatus applied to the sending end). The memory 920 can include a program storage area and a data storage area, wherein the program storage area can store an operating system and at least one application required by a function; and the data storage area can store data created according to the use of the device, etc. In addition, the memory 920 can include a high-speed random access memory, and also can include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device or other non-volatile solid-state memory device. In some examples, the memory 920 can further include a memory remotely arranged with respect to the processor 910, and these remote memories can be connected to the device through a network. Examples of the above network include but are not limited to the Internet, an intranet, a local area network, a mobile communication network and a combination thereof.

[0183] In the case that the communication device acts as the sending end, the above-provided device can be configured to perform the data modulation method applied to the sending end provided by any embodiment, and has the corresponding functions and effects.

[0184] In the case that the communication device acts as the receiving end, the above-provided device can be configured to perform the data demodulation method applied to the receiving end provided by any embodiment, and has the corresponding functions and effects.

[0185] The embodiment of the present application further provides a storage medium comprising computer executable instructions, which, when executed by a computer processor, are used to perform a data modulation method applied to a sending end, the method comprising: performing first encoding on a first data sequence to obtain a second data sequence; wherein the process of the first encoding comprises: repeating each element in the first data sequence N times; wherein N is a positive integer; performing modulation on the second data sequence to obtain a third data sequence.

[0186] The embodiment of the present application further provides a storage medium comprising computer executable instructions, which, when executed by a computer processor, are used to perform a data demodulation method applied to a receiving end, the method comprising: performing waveform demodulation on a received fourth data sequence to obtain a third data sequence; performing demodulation on the third data sequence; wherein the modulation process of the third data sequence comprises: performing first encoding on a first data sequence to obtain a second data sequence; wherein the process of the first encoding comprises: repeating each element in the first data sequence N times; wherein N is a positive integer; performing modulation on the second data sequence to obtain a third data sequence.

[0187] Those skilled in the art will appreciate that the term user equipment encompasses any suitable type of wireless user equipment, such as a mobile phone, a portable data processing apparatus, a portable web browser, or a vehicle-mounted mobile station.

[0188] Generally, the various embodiments of the present application can be implemented in hardware or special-purpose circuits, software, logic or any combination thereof. For example, some aspects can be implemented in hardware, while other aspects can be implemented in

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

[0190] The block diagrams of any logical flows of the accompanying drawings can represent program steps, or can represent interconnected logical circuits, modules, and functions, or can represent a combination of program steps and logical circuits, modules, and functions. The computer program can be stored on a memory. The memory can have any type suitable for the local technical environment and can be implemented using any suitable data storage technology, such as, but not limited to, random access memory (RAM), read-only memory (ROM), optical storage, magnetic storage, or the like. The computer readable media can include non-transitory storage media. The data processor can be of any type suitable for the local technical environment, and can include one or more of general purpose computers, special purpose computers, microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASIC), field- programmable gate arrays (FPGAs), and processors based on multi-core processor architectures, as examples.

[0191] The embodiments of the present application further provide a computer program product, comprising a computer program which, when executed by a processor, can implement the data modulation method or the data demodulation method provided by any of the embodiments of the present application.

[0192] The computer program product, in the implementation process, can be written in one or more programming languages or combinations thereof to implement computer program codes for performing the operations of the present application, the programming languages including object-oriented programming languages such as Java, Smalltalk, C++, and conventional procedural programming languages such as "C" language or similar programming languages. The program codes can be executed completely on a user computer, partially on a user computer, as an independent software package, partially on a user computer and partially on a remote computer, or completely on a remote computer or server. In the case involving a remote computer, the remote computer can be connected to the user computer through any kind of network, including a local area network (LAN) or a wide area network (WAN), or can be connected to an external computer (for example, through the Internet by using an Internet service provider).

Claims

1. A data modulation method applied to a transmitting end, comprising: first encoding a first data sequence to obtain a second data sequence, wherein the first encoding comprises repeating each element in the first data sequence N times, wherein N is a positive integer; modulating the second data sequence to obtain a third data sequence.

2. The method of claim 1, wherein, The first encoding a first data sequence to obtain a second data sequence comprises: repeating each element in the first data sequence N times to obtain a repeated first data sequence; cyclically shifting an odd number of elements of the repeated first data sequence to obtain the second data sequence.

3. The method of claim 2, wherein, The cyclically shifting an odd number of elements of the repeated first data sequence to obtain the second data sequence comprises: cyclically shifting an odd number of elements at a head of the repeated first data sequence to a tail to obtain the second data sequence.

4. The method of claim 2, wherein, The cyclically shifting an odd number of elements of the repeated first data sequence to obtain the second data sequence comprises: cyclically shifting an odd number of elements at a tail of the repeated first data sequence to a head to obtain the second data sequence.

5. The method of claim 1, wherein, Each element in the first data sequence is repeated N times and arranged in the original order.

6. The method of claim 1, wherein, The value of N comprises 4.

7. The method according to any one of claims 2-4, wherein, The cyclic shift comprises a left cyclic shift or a right cyclic shift.

8. The method of any one of claims 2-4, wherein, In response to determining that the odd number is negative, the left cyclic shift is performed; in response to determining that the odd number is positive, the right cyclic shift is performed.

9. The method of any one of claims 2-4, wherein, The odd number comprises at least one of the following values: 1 and -1.

10. The method according to any one of claims 1-6, wherein, The modulating the second data sequence to obtain a third data sequence comprises: QPSK modulating the second data sequence to obtain the third data sequence.

11. The method of claim 1, wherein, The first data sequence is a bit data sequence.

12. The method of claim 11, wherein, The bit data sequence comprises one of the following: 0 and 1, and 1 and -1. 13.The method of claim 1, before the first encoding a first data sequence to obtain a second data sequence, further comprising: second encoding a pre-generated bit data sequence to obtain the first data sequence.

14. The method of claim 13, wherein, The second encoding comprises one of the following: LDPC encoding, polar encoding, Turbo encoding, and convolutional encoding.

15. The method of claim 6, wherein, The second data sequence contains four times as many elements as the first data sequence.

16. The method of any one of claims 1-6, wherein, The modulating the second data sequence to obtain a third data sequence comprises: grouping two adjacent elements in the second data sequence as a group to form a new second data sequence; QPSK modulating the new second data sequence to obtain the third data sequence. 17.The method of any one of claims 1-6, further comprising: transmitting the third data sequence.

18. The method of claim 17, wherein, The transmitting the third data sequence comprises: phase-rotating the third data sequence to obtain a new third data sequence; transmitting the new third data sequence.

19. The method of claim 17, wherein, The transmitting the third data sequence comprises: filtering and digital-to-analog converting the third data sequence to obtain a new third data sequence; transmitting the new third data sequence.

20. The method of claim 19, wherein, The filtering and digital-to-analog conversion on the third data sequence comprises: obtaining real and imaginary parts in the third data sequence to obtain corresponding real and imaginary data sequences; filtering and digital-to-analog converting the real data sequence and filtering and digital-to-analog converting the imaginary data sequence to obtain a new third data sequence.

21. The method of claim 17, wherein, The transmitting the third data sequence comprises: performing Fourier transform on the third data sequence to obtain a transformed third data sequence; performing subcarrier mapping on the transformed third data sequence to obtain a mapped third data sequence; performing inverse Fourier transform on the mapped third data sequence to obtain a new third data sequence; transmitting the new third data sequence.

22. A data demodulation method applied to a receiving end, comprising: performing waveform demodulation on a received fourth data sequence to obtain a third data sequence; demodulating the third data sequence; wherein a modulation process of the third data sequence comprises: performing first encoding on a first data sequence to obtain a second data sequence; wherein the first encoding process comprises: repeating each element in the first data sequence N times; wherein N is a positive integer; modulating the second data sequence to obtain the third data sequence.

23. A communication device comprising: a memory, and one or more processors; the memory is configured to store one or more programs; when the one or more programs are executed by the one or more processors, the one or more processors implement the method in any one of claims 1-21 or 22.

24. A storage medium, the storage medium storing a computer program, the computer program being executed by a processor to implement the method in any one of claims 1-21 or 22.

Images