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, 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: making every two adjacent elements in the first data sequence a group, and inserting a new group between every two adjacent groups, odd-numbered bit elements in the new group coming from odd-numbered bit elements of the two adjacent groups, and even-numbered bit elements in the new group coming from even-numbered bit elements of the two adjacent groups (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 nonlinear 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, comprising:

[0006] performing first encoding on a first data sequence to obtain a second data sequence; wherein the process of the first encoding comprises: in the first data sequence, every two adjacent elements are taken as a group, and a new group is inserted between every two adjacent groups, the odd-numbered elements in the new group come from the odd-numbered elements of the two adjacent groups, and the even-numbered elements in the new group come from the even-numbered elements of the two adjacent groups;

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

[0008] The embodiment of the present application provides a data demodulation method, comprising:

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

[0010] demodulating the third data sequence;

[0011] The modulation process of the third data sequence comprises: performing first encoding on the first data sequence to obtain a second data sequence; and performing modulation on the second data sequence to obtain the third data sequence; wherein the first encoding process comprises: in the first data sequence, every two adjacent elements are taken as a group, and a new group is inserted between every two adjacent groups, wherein the odd bit elements in the new group are from the odd bit elements of the two adjacent groups, and the even bit elements in the new group are from the even bit elements of the two adjacent groups.

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

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

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

[0015] The embodiment of the present application provides a storage medium, the storage medium 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

[0016] FIG. 1 is a flowchart of a data modulation method provided by the embodiment of the present application;

[0017] FIG. 2 is a flowchart of a data demodulation method provided by the embodiment of the present application;

[0018] FIG. 3 is an implementation schematic diagram of a first encoding provided by the embodiment of the present application;

[0019] FIG. 4 is an implementation schematic diagram of another first encoding provided by the embodiment of the present application;

[0020] FIG. 5 is an implementation schematic diagram of another first encoding provided by the embodiment of the present application;

[0021] FIG. 6 is an implementation schematic diagram of another first encoding provided by the embodiment of the present application;

[0022] FIG. 7 is a configuration schematic diagram of a QPSK constellation provided by the embodiment of the present application;

[0023] FIG. 8 is a schematic diagram of generating a third data sequence according to an embodiment of the present application;

[0024] FIG. 9 is a schematic diagram of generating another third data sequence according to an embodiment of the present application;

[0025] FIG. 10 is a schematic diagram of implementing waveform modulation on the third data sequence according to an embodiment of the present application;

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

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

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

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

[0030] In an embodiment, FIG. 1 is a flow chart of a data modulation method according to an embodiment of the present application. The present embodiment is applied to the case of reducing the envelope jitter 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 encoding and modulating data sequence, etc. As shown in FIG. 1, the present embodiment includes S110-S120.

[0031] S110, first encoding a first data sequence to obtain a second data sequence; wherein the process of the first encoding includes: in the first data sequence, every two adjacent elements are taken as a group, and a new group is inserted between every two adjacent groups, the odd position elements in the new group come from the odd position elements of the two adjacent groups, and the even position elements in the new group come from the even position elements of the two adjacent groups.

[0032] In an example, the first data sequence can be an unmodulated data sequence, such as a bit data sequence. In an example, if the first data sequence is a bit data sequence, the second data sequence can also be a bit data sequence. A bit data sequence refers to a sequence composed of binary data. In an example, each group contains two elements, i.e., the new group contains two elements, and each group of the adjacent two groups also contains two elements. The first element in the group is an odd bit element, and the second element in the group is an even bit element. In an example, the process of first encoding the first data sequence can be understood as the process of interpolation operation in the first data sequence. In an example, if the first data sequence is a bit data sequence, the second data sequence can also be a bit data sequence. A 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.

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

[0034] The sending end can modulate the second data sequence to form a third data sequence. When modulating every adjacent two elements in the first data sequence as a group, there can be a case that the polarity of the elements in the adjacent two groups is reversed, such as

[0000]

[0011] , so that after band-limit filtering, the envelope instantaneously becomes 0, and the jitter is relatively large. In the second data sequence obtained by first encoding the first data sequence, only one element in the adjacent two groups has polarity reversal, so that the envelope jitter of the third data sequence obtained is smaller, thereby reducing the PAPR of the data.

[0035] In an embodiment, modulating the second data sequence to obtain a third data sequence comprises: quadrature phase shift keying (QPSK) modulating the second data sequence to obtain the third data sequence.

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

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

[0038] In an embodiment, before first encoding the first data sequence to obtain the second data sequence, the method further comprises: second encoding the bit data sequence to obtain the first data sequence.

[0039] In an embodiment, the second encoding includes at least one of the following: Low Density Parity Check (LDPC) encoding, polar encoding, Turbo encoding, and convolutional encoding.

[0040] In an embodiment, the odd-position elements in the new group are from the odd-position elements of the two adjacent groups, and the even-position elements in the new group are from the even-position elements of the two adjacent groups, including: the odd-position elements in each new group are from the odd-position elements of the left group of the two adjacent groups, and the even-position elements in each new group are from the even-position elements of the right group of the two adjacent groups. In an example, the odd-position elements of the left group refer to the first element in the first group of the two adjacent groups; the even-position elements of the right group refer to the second element in the second group of the two adjacent groups. The odd-position elements in each new group refer to the first element in the new group; the even-position elements in each new group refer to the second element in the new group.

[0041] In an embodiment, the odd-position elements in the new group are from the odd-position elements of the two adjacent groups, and the even-position elements in the new group are from the even-position elements of the two adjacent groups, including: the odd-position elements in each new group are from the odd-position elements of the right group of the two adjacent groups, and the even-position elements in each new group are from the even-position elements of the left group of the two adjacent groups. In an example, the odd-position elements of the right group refer to the first element in the second group of the two adjacent groups; the even-position elements of the left group refer to the second element in the first group of the two adjacent groups. The odd-position elements in each new group refer to the first element in the new group; the even-position elements in each new group refer to the second element in the new group.

[0042] In an embodiment, a new group is inserted between the last group and the first group in the first data sequence. In an example, the last group in the first data sequence refers to a group of data composed of the last two elements in the first data sequence; the first group in the first data sequence refers to a group of data composed of the first element and the second element in the first data sequence. In an example, the last group and the first group in the first data sequence are also two groups that are cyclically adjacent, and a new group can be inserted between the last group and the first group, for example, the new group can be inserted after the last group, or the new group can be inserted before the first group. In an example, if a new group is inserted between the last group and the first group, the first element (i.e., the odd-position element) in the new group can be the first element in the last group, and the second element (i.e., the even-position element) in the new group can be the second element in the first group. In an example, if a new group is inserted between the last group and the first group, the first element (i.e., the odd-position element) in the new group can be the first element in the first group, and the second element (i.e., the even-position element) in the new group can be the second element in the last group.

[0043] In an embodiment, the second data sequence contains twice as many elements as the first data sequence.

[0044] In an embodiment, the modulation on 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 performing QPSK modulation on the new second data sequence to obtain the third data sequence.

[0045] In an embodiment, the data modulation method applied to the sending end further comprises: transmitting the third data sequence.

[0046] In an embodiment, the transmission of 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 first performs 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 transmits the third data sequence after phase rotation to the communication device as the receiving end.

[0047] In an embodiment, the transmission of 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 filtering can be performed on the third data sequence first, and then the digital-to-analog conversion is performed on the third data sequence after filtering to obtain a new third data sequence. In an example, the digital-to-analog conversion can be performed on the third data sequence first, and then the filtering is performed on the third data sequence after digital-to-analog conversion to obtain a new third data sequence. After the filtering and digital-to-analog conversion on the third data sequence, the new third data sequence obtained is a signal after digital-to-analog conversion.

[0048] In an embodiment, 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; and performing filtering and digital-to-analog conversion on the real and imaginary data sequences respectively to obtain a new third data sequence. In an example, the real and imaginary parts in the third data sequence can be filtered and converted into digital-to-analog respectively, i.e., the real part elements in the third data sequence are obtained first to form a corresponding real data sequence, and the imaginary part elements in the third data sequence are obtained to form a corresponding imaginary data sequence; then the real data sequence is filtered and converted into digital-to-analog to obtain a new real data sequence, and the imaginary data sequence is filtered and converted into digital-to-analog to obtain a new imaginary data sequence; and then the new real data sequence and the new imaginary data sequence are combined to obtain a new third data sequence.

[0049] In an embodiment, 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; and transmitting the new third data sequence. In an example, the process of subcarrier mapping comprises zero padding, i.e. placing data 0 on the subcarriers at both sides of the data subcarriers of the transformed third data sequence, so that oversampling can be achieved.

[0050] In an example, the Fourier transform comprises one of: fast Fourier transform; discrete Fourier transform; and correspondingly, the inverse Fourier transform comprises one of: fast inverse Fourier transform; and discrete inverse Fourier transform. In an example, if the Fourier transform is fast Fourier transform, the inverse Fourier transform is fast inverse Fourier transform; and in an example, if the Fourier transform is discrete Fourier transform, the inverse Fourier transform is discrete inverse Fourier transform.

[0051] In an embodiment, FIG. 2 is a flowchart of a data demodulation method provided by the embodiment. The embodiment is applied to the case of reducing the envelope jitter between adjacent two elements. The embodiment can be performed by a receiving end. The receiving end can be a communication device, which is configured to perform the process of demodulating and decoding data sequence, etc. As shown in FIG. 2, the embodiment comprises S210-S220.

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

[0053] S220, demodulating the third data sequence.

[0054] The modulation process of the third data sequence comprises: performing first encoding on the first data sequence to obtain a second data sequence; and modulating the second data sequence to obtain the third data sequence. The process of the first encoding comprises: in the first data sequence, every adjacent two elements are taken as a group, and a new group is inserted between every adjacent two groups, wherein the odd-numbered elements in the new group are from the odd-numbered elements of the adjacent two groups, and the even-numbered elements in the new group are from the even-numbered elements of the adjacent two groups.

[0055] In an example, before the transmitting end transmits the third data sequence to 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 fourth data sequence subjected to waveform modulation and added with noise and other interference signals is received by the receiving end. Then, the receiving end can perform waveform demodulation on the fourth data sequence to recover the third data sequence, and demodulate the third data to recover the corresponding bit data sequence.

[0056] In an embodiment, the modulating the second data sequence to obtain the third data sequence comprises: quadrature phase shift keying (QPSK) modulating the second data sequence to obtain the third data sequence.

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

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

[0059] In an embodiment, before the first encoding the first data sequence to obtain the second data sequence, the method further comprises: second encoding the bit data sequence to obtain the first data sequence.

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

[0061] In an embodiment, the odd bit elements in the new group are from the odd bit elements of the two adjacent groups, and the even bit elements in the new group are from the even bit elements of the two adjacent groups, comprising: the odd bit elements in each new group are from the odd bit elements of the left group of the two adjacent groups, and the even bit elements in each new group are from the even bit elements of the right group of the two adjacent groups.

[0062] In an embodiment, the odd bit elements in the new group are from the odd bit elements of the two adjacent groups, and the even bit elements in the new group are from the even bit elements of the two adjacent groups, comprising: the odd bit elements in each new group are from the odd bit elements of the right group of the two adjacent groups, and the even bit elements in each new group are from the even bit elements of the left group of the two adjacent groups.

[0063] In an embodiment, a new group is inserted between the last group and the first group in the first data sequence.

[0064] In an embodiment, the second data sequence contains twice as many elements as the first data sequence.

[0065] In an embodiment, the modulating the second data sequence to obtain the third data sequence comprises: 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.

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

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

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

[0069] In an embodiment, the real part and the imaginary part in the third data sequence are obtained to obtain a real part data sequence and an imaginary part data sequence, and the real part data sequence and the imaginary part data sequence are filtered and digital-to-analog converted respectively.

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

[0071] It should be noted that the explanations of the first data sequence, the second data sequence, the third data sequence 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.

[0072] In the following Embodiment One to Embodiment Ten, the first data sequence, the first encoding process of the first data sequence, the QPSK modulation process of the second data sequence, and the waveform modulation process of the third data sequence are described.

[0073] Embodiment One

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

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

[0076] Embodiment Two

[0077] This embodiment is an example of adjacent elements and adjacent groups in the first data sequence.

[0078] In this embodiment, it is assumed that the first data sequence is [a1, a2, a3, a4, …, ai, ai+1, …, a2L-1, a2L], where i = 1, 2, …, L, and 2L is the number of elements in the first data sequence. 2i-1 2i 2L-1 2L

[0079] In the first data sequence, every two adjacent elements form a group, i.e., [a1, a2] is the first group, [a3, a4] is the second group, and so on, [ai-1, ai] is the i-th group, and [a2L-1, a2L] is the last group. 2i-1 2i 2L-1 2L ​​​​​​​is the Lth group.

[0080] In the first data sequence, a new group is inserted between every two adjacent groups, i.e., a new group is inserted between the 1st group [a1, a2] and the 2nd group [a3, a4], a new group is inserted between the 2nd group [a3, a4] and the 3rd group [a5, a6], and so on. In addition, a new group is also inserted between the (L-1)th group [a 2L- 1, a 2L 2,..., a 2i-1 L-1] and the 1st group [a1, a2], which can be placed at the end of the first data sequence or at the beginning of the first data sequence.

[0081] Embodiment Three

[0082] This embodiment is an example of first encoding of the first data sequence. In the first data sequence, every two adjacent elements form a group, and a new group is inserted between every two adjacent groups, wherein the odd-position element of the new group can come from the odd-position element of the left-side group of the two adjacent groups, and the even-position element of the new group can come from the even-position element of the right-side group of the two adjacent groups.

[0083] FIG. 3 is a schematic diagram of an implementation of the first encoding provided by the embodiments of the present application. As shown in FIG. 3, in this embodiment, it is assumed that the two adjacent groups in the first data sequence are the group [a 2i-1 1, a 2i 2], the group [a 2i+1 3, a 2i+2 4], and a new group [b 2i-1 1, b 2i 2] is inserted between the group [a 2i+1 1, a 2i+2 2] and the group [a 2i-1 3, a 2i 4] in the first data sequence. Wherein, the odd-position element b 2i-1 1 of the new group [b 2i 1, b 2i-1 2] comes from the odd-position element a 2i-1 1 of the left-side adjacent group [a 2i 1, a 2i-1 2], i.e., b 2i-1 1 = a 2i-1 1; and the even-position element b 2i-1 2 of the new group [b 2i 1, b 2i 2] comes from the even-position element a 2i+1 2 of the right-side adjacent group [a 2i+2 3, a 2i+2 4], i.e., b 2i 2 = a 2i+2 2.

[0084] It is assumed that the first data sequence is: [a1, a2, a3, a4,..., a 2i-1 , a2i ...,a 2L-1 ,a 2L ], the second data sequence formed after the first data sequence is first encoded is:

[0085] [(a1,a2),(a1,a4),(a3,a4),(a3,a6),(a5,a6),...,(a 2i-1 ,a 2i ),(a 2i-1 ,a 2i+2 ),(a 2i+1 ,a 2i+2 ),...,(a 2L-3 ,a 2L-2 ),(a 2L- 3,a 2L ),(a 2L-1 ,a 2L ), (a 2L-1 ,a 2) ];

[0086] Among them, (a1,a4),(a3,a6)...(a 2i-1 ,a 2i+2 )...(a 2L-3 ,a 2L )(a 2L-1 ,a2) is the new group, the last group in the new group (a 2L- a1, a2) elements come from the tail group odd elements and the head group even elements of the first data sequence respectively. 2L-1 ,a2) can also be placed in front of the first data sequence.

[0087] Example 4

[0088] This embodiment is an example of performing a first encoding on a first data sequence. Two adjacent elements in the first data sequence form a group, and a new group is inserted between each two adjacent groups. The odd-numbered elements of the new group can come from the odd-numbered elements in the rightmost group of the two adjacent groups, and the even-numbered elements of the new group can come from the even-numbered elements in the leftmost group of the two adjacent groups.

[0089] FIG4 is a schematic diagram of another implementation of the first encoding provided by an embodiment of the present application. As shown in FIG4, in this embodiment, it is assumed that two adjacent groups in the first data sequence are group [a 2i-1 ,a 2i ], group[a 2i+1 ,a 2i+2 ], in the first data sequence group [a 2i- 1,a 2i ] and group [a 2i+1 ,a 2i+2a new group [b 2i-1 ,b 2i ] is inserted between the two groups [a 2i-1 ,a 2i ] and [b 2i-1 ,b 2i+1 ]. In the new group [b 2i+2 ,b 2i+1 ], the odd elements b 2i-1 come from the odd elements a 2i+1 of the right adjacent group [a 2i-1 ,a 2i ], i.e. b 2i =a 2i-1 , and the even elements b 2i come from the even elements a 2i of the left adjacent group [a 2i ,a 2i ], i.e. b 2i-1 =a 2i .

[0090] Suppose the first data sequence is [a1,a2,a3,a4,...,a 2L-1 ,a 2L ...,a 2i-1 ,a 2i ], then the second data sequence formed after the first data sequence is encoded is:

[0091] [(a1,a2),(a3,a2),(a3,a4),(a5,a4),(a5,a6),...,(a 2i+1 ,a 2i ),(a 2i+1 ,a 2i+2 ),(a 2L-3 ,a 2L-2 ),(a 2L-1 ,a 2L- 2),(a 2L-1 ,a 2L ),(a1,a 2L )].

[0092] In the new group, (a3,a2),(a5,a4)...(a 2i+1 ,a 2i )...(a 2L-1 ,a 2L-2 )(a1,a 2L ), the last group (a1,a 2L ) comes from the first odd element and the last even element of the first data sequence, and in other embodiments, (a1,a 2L ) can also be placed at the front of the first data sequence.

[0093] Embodiment Five

[0094] This embodiment is an example of the first encoding of the first data sequence. In the first data sequence, every two adjacent elements form a group, and a new group is inserted between every two adjacent groups, the odd bit elements and the even bit elements of the new group are from the odd bit elements and the even bit elements of the two adjacent groups respectively.

[0095] FIG. 5 is a schematic diagram of another implementation of the first encoding provided by the embodiments of the present application. As shown in FIG. 5, in this embodiment, the odd bit elements of the new group are all from the odd bit elements of the left group of the two adjacent groups, and the even bit elements of the new group are all from the even bit elements of the right group of the two adjacent groups.

[0096] Suppose that the previous group of elements in the first data sequence is [0 0], and there are four possibilities for the next group of elements:

[0097] (1) Possibility 1: the next group of elements is [0 0], then the odd bit elements and the even bit elements of the new group are [0 0] respectively;

[0098] (2) Possibility 2: the next group of elements is [0 1], then the odd bit elements and the even bit elements of the new group are [0 1] respectively;

[0099] (3) Possibility 3: the next group of elements is [1 1], then the odd bit elements and the even bit elements of the new group are [0 1] respectively;

[0100] (4) Possibility 4: the next group of elements is [1 0], then the odd bit elements and the even bit elements of the new group are [0 0] respectively;

[0101] Suppose that the previous group of elements in the first data sequence is [0 1], and there are four possibilities for the next group of elements:

[0102] (5) Possibility 1: the next group of elements is [0 0], then the odd bit elements and the even bit elements of the new group are [0 0] respectively;

[0103] (6) Possibility 2: the next group of elements is [0 1], then the odd bit elements and the even bit elements of the new group are [0 1] respectively;

[0104] (7) Possibility 3: the next group of elements is [1 1], then the odd bit elements and the even bit elements of the new group are [0 1] respectively;

[0105] (8) Possibility 4: the next group of elements is [1 0], then the odd bit elements and the even bit elements of the new group are [0 0] respectively;

[0106] Suppose the previous group of elements in the first data sequence is [1 1], there are four possibilities for the next group of elements:

[0107] (9) Possibility 1: the next group of elements is [0 0], then the elements of the odd bit and even bit of the new group are [1 0] respectively;

[0108] (10) Possibility 2: the next group of elements is [0 1], then the elements of the odd bit and even bit of the new group are [1 1] respectively;

[0109] (11) Possibility 3: the next group of elements is [1 1], then the elements of the odd bit and even bit of the new group are [1 1] respectively;

[0110] (12) Possibility 4: the next group of elements is [1 0], then the elements of the odd bit and even bit of the new group are [1 0] respectively;

[0111] Suppose the previous group of elements in the first data sequence is [1 0], there are four possibilities for the next group of elements:

[0112] (13) Possibility 1: the next group of elements is [0 0], then the elements of the odd bit and even bit of the new group are [1 0] respectively;

[0113] (14) Possibility 2: the next group of elements is [0 1], then the elements of the odd bit and even bit of the new group are [1 1] respectively;

[0114] (15) Possibility 3: the next group of elements is [1 1], then the elements of the odd bit and even bit of the new group are [1 1] respectively;

[0115] (16) Possibility 4: the next group of elements is [1 0], then the elements of the odd bit and even bit of the new group are [1 0] respectively;

[0116] According to the method shown in Fig. 5, suppose the first data sequence is: [0001111000...], then the second data sequence formed after the first data sequence is encoded is: [000101011110101000..].

[0117] Embodiment six

[0118] This embodiment is an example of encoding the first data sequence. In the first data sequence, every two adjacent elements form a group, and a new group is inserted between every two adjacent groups, the elements of the odd bit and even bit of the new group are from the elements of the odd bit and even bit of the two adjacent groups respectively.

[0119] Figure 6 is a schematic diagram of another implementation of the first encoding provided by embodiments of the application. As shown in Figure 6, in this embodiment, the odd-position elements of the new group are all from the odd-position elements of the right-hand group of the two adjacent groups, and the even-position elements of the new group are all from the even-position elements of the left-hand group of the two adjacent groups.

[0120] Suppose the previous group of the first data sequence is [0 0], there are four possibilities for the next group:

[0121] (1) Possibility 1: the next group is [0 0], then the odd-position and even-position elements of the new group are [0 0] respectively;

[0122] (2) Possibility 2: the next group is [0 1], then the odd-position and even-position elements of the new group are [0 0] respectively;

[0123] (3) Possibility 3: the next group is [1 1], then the odd-position and even-position elements of the new group are [1 0] respectively;

[0124] (4) Possibility 4: the next group is [1 0], then the odd-position and even-position elements of the new group are [1 0] respectively;

[0125] Suppose the previous group of the first data sequence is [0 1], there are four possibilities for the next group:

[0126] (5) Possibility 1: the next group is [0 0], then the odd-position and even-position elements of the new group are [0 1] respectively;

[0127] (6) Possibility 2: the next group is [0 1], then the odd-position and even-position elements of the new group are [0 1] respectively;

[0128] (7) Possibility 3: the next group is [1 1], then the odd-position and even-position elements of the new group are [1 1] respectively;

[0129] (8) Possibility 4: the next group is [1 0], then the odd-position and even-position elements of the new group are [1 1] respectively;

[0130] Suppose the previous group of the first data sequence is [1 1], there are four possibilities for the next group:

[0131] (9) Possibility 1: the next group is [0 0], then the odd-position and even-position elements of the new group are [0 1] respectively;

[0132] (10) Possibility 2: the next group is [0 1], then the odd-position and even-position elements of the new group are [0 1] respectively;

[0133] (11) possibility 3: the next group of elements is [1 1], then the elements of the new group in odd positions and even positions are [1 1] respectively;

[0134] (12) possibility 4: the next group of elements is [1 0], then the elements of the new group in odd positions and even positions are [1 1] respectively;

[0135] Suppose the previous group of elements in the first data sequence is [1 0], there are 4 possibilities for the next group of elements:

[0136] (13) possibility 1: the next group of elements is [0 0], then the elements of the new group in odd positions and even positions are [0 0] respectively;

[0137] (14) possibility 2: the next group of elements is [0 1], then the elements of the new group in odd positions and even positions are [0 0] respectively;

[0138] (15) possibility 3: the next group of elements is [1 1], then the elements of the new group in odd positions and even positions are [1 0] respectively;

[0139] (16) possibility 4: the next group of elements is [1 0], then the elements of the new group in odd positions and even positions are [1 0] respectively;

[0140] According to the method shown in Fig. 6, suppose the first data sequence is: [0001111000...], then the second data sequence formed after the first data sequence is encoded is: [000001111111100000..].

[0141] Embodiment seven

[0142] This embodiment is an example of QPSK modulation of the second data sequence. In this embodiment, the first data sequence is encoded to form a second data sequence, and every two adjacent elements in the second data sequence are a group to be QPSK modulated to form a third data sequence. The second data sequence contains twice as many elements as the first data sequence, and the third data sequence contains the same number of elements as the first data sequence.

[0143] Fig. 7 is a configuration diagram of a QPSK constellation provided by an embodiment of the application. Suppose the second data sequence is [c1, c2, c3, c4,..., c 2i-1 , c 2i ..., c 2L-1 , c 2L ], then every two adjacent elements are a group, which are: [c1, c2] [c3, c4]... [c 2i- 1, c 2i ]... [c 2L-1c 2L The QPSK modulation constellation mapping rules are: 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, as shown in (1) of FIG. 7.

[0144] In other embodiments, the constellation points S1, S2, S3, and S4 can also be: {exp(-j·θ), exp(-j·(θ+pi / 2)), exp(-j·(θ+pi)), exp(-j·(θ+3pi / 2)), θ=0~2pi, as shown in (2) of FIG. 7; or {exp(-j·θ), exp(-j·(θ+3pi / 2)), exp(-j·(θ+pi)), exp(-j·(θ+pi / 2)), θ=0~2pi, as shown in (3) of FIG. 7.

[0145] Embodiment Eight

[0146] This embodiment is an example of first encoding a first data sequence to form a second data sequence, and QPSK modulating the second data sequence to form a third data sequence.

[0147] In this embodiment, first, the first data sequence is first encoded to form a second data sequence, wherein the first encoding rule is: in the first data sequence, every two adjacent elements form a group, and a new group is inserted between every two adjacent groups, wherein the odd elements of the new group are all from the odd elements of the left group of the two adjacent groups, and the even elements of the new group are all from the even elements of the right group of the two adjacent groups.

[0148] Then, the second data sequence is QPSK modulated to form a third data sequence, wherein the QPSK modulation rule is: 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 as the third data sequence. The QPSK modulation constellation mapping rules are: 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.

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

[0150] FIG. 8 is a schematic diagram of generating a third data sequence according to an embodiment of the present application. As shown in FIG. 8, in this embodiment, it is assumed that the first data sequence is: [00 10 11 10 10 10 00 11 10 11 00 11 11 00 11];

[0151] Then, the first data sequence is encoded in the first way to form a second data sequence. The second data sequence is: [00 00 10 11 11 10 10 10 10 10 10 10 00 01 11 10 10 11 11 10 00 01 11 11 11 10 00 01 11 10],

[0152] The new data sequence is: [00 11 10 10 10 10 01 10 11 10 01 11 10 01 10];

[0153] Then, QPSK modulation is performed on the second data sequence to form a third data sequence, and the third data sequence is: [S1S1S4S3S3S4S4S4S4S4S4S4S1S2S3S4S4S3S3S4S1S2S3S3S3S4S1S1S3S4];

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

[0155] Example 9

[0156] This embodiment is an example in which a first data sequence is encoded in the first way to form a second data sequence, and the second data sequence is modulated in the QPSK way to form a third data sequence.

[0157] In this embodiment, first, a first encoding is performed on the first data sequence to form a second data sequence, wherein the first encoding rule is: in the first data sequence, every two adjacent elements form a group, and a new group is inserted between every two adjacent groups, and the odd-numbered elements of the new group all come from the odd-numbered elements in the group to the right of the adjacent group, and the even-numbered elements of the new group all come from the even-numbered elements in the group to the left of the adjacent group.

[0158] 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 as the third 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.

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

[0160] FIG9 is a schematic diagram of generating another third data sequence provided in an embodiment of the present application. As shown in FIG9 , in this embodiment, it is assumed that the first data sequence is: [00 10 11 10 10 10 00 11 10 11 00 11 11 00 11];

[0161] Then, the first data sequence is first encoded to form a second data sequence, and the second data sequence is: [00 10 10 10 11 11 10 10 10 10 10 00 00 10 11 11 10 10 11 01 00 10 11 11 01 00 10 11 01],

[0162] wherein the new group data sequence is: [10 10 11 10 10 00 10 11 10 01 10 11 01 10 01];

[0163] Then, the second data sequence is QPSK modulated to form a third data sequence, and the third data sequence is: [S1S4S4S4S3S3S4S4S4S4S4S1S1S4S3S3S4S4S3S2S1S4S3S3S3S2S1S4S3S2];

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

[0165] Embodiment Ten

[0166] This embodiment is an example of waveform modulation of the third data sequence. FIG. 10 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. 10, the third data sequence is subjected to DFT, resource mapping and frequency domain shaping, and data 0 is placed in the two edge subcarrier positions of the data subcarriers to achieve oversampling, IDFT and digital-to-analog conversion, and then the new third data sequence is transmitted on a radio frequency link.

[0167] In an embodiment, FIG. 11 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. 11, the data modulation apparatus in the present embodiment includes an encoder 1110 and a modulator 1120.

[0168] The encoder 1110 is configured to first encode a first data sequence to obtain a second data sequence; wherein the process of the first encoding includes: in the first data sequence, every two adjacent elements are taken as a group, and a new group is inserted between every two adjacent groups, the odd-numbered elements in the new group come from the odd-numbered elements of the two adjacent groups, and the even-numbered elements in the new group come from the even-numbered elements of the two adjacent groups.

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

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

[0171] The second data sequence is quadrature phase shift keying (QPSK) modulated to obtain a third data sequence.

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

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

[0174] In an embodiment, before the first data sequence is first encoded to obtain the second data sequence, the method further comprises: second encoding the bit data sequence to obtain the first data sequence.

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

[0176] In an embodiment, the odd-position elements in the new group are from the odd-position elements of the two adjacent groups, and the even-position elements in the new group are from the even-position elements of the two adjacent groups, comprising:

[0177] The odd-position elements in each new group are from the odd-position elements of the left group of the two adjacent groups, and the even-position elements in each new group are from the even-position elements of the right group of the two adjacent groups.

[0178] In an embodiment, the odd-position elements in the new group are from the odd-position elements of the two adjacent groups, and the even-position elements in the new group are from the even-position elements of the two adjacent groups, comprising:

[0179] The odd-position elements in each new group are from the odd-position elements of the right group of the two adjacent groups, and the even-position elements in each new group are from the even-position elements of the left group of the two adjacent groups.

[0180] In an embodiment, a new group is inserted between the last group and the first group in the first data sequence.

[0181] In an embodiment, the second data sequence contains twice as many elements as the first data sequence.

[0182] In an embodiment, the second data sequence is modulated to obtain the third data sequence, comprising: grouping adjacent two elements in the second data sequence as a group to form a new second data sequence; and QPSK modulating the new second data sequence to obtain the third data sequence.

[0183] In an embodiment, the data modulation method applied to the sending end further comprises: transmitting the third data sequence.

[0184] In an embodiment, 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.

[0185] In an embodiment, 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.

[0186] In an embodiment, performing 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; and performing filtering and digital-to-analog conversion on the real and imaginary data sequences respectively to obtain a new third data sequence.

[0187] In an embodiment, transmitting the third data sequence comprises: performing Fourier transform processing 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 processing on the mapped third data sequence to obtain a new third data sequence; and transmitting the new third data sequence.

[0188] The data modulation apparatus provided in the embodiment is configured to implement the data modulation method applied to the sending end in the embodiment shown in FIG. 1, and the data modulation apparatus provided in the embodiment has similar implementation principles and technical effects, which will not be described herein again.

[0189] In an embodiment, FIG. 12 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. 12, the data demodulation apparatus in the embodiment comprises a first demodulator 1210 and a second demodulator 1220.

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

[0191] The second demodulator 1220 is configured to demodulate the third data sequence.

[0192] The modulation process of the third data sequence comprises: performing first encoding on the first data sequence to obtain a second data sequence; and performing modulation on the second data sequence to obtain the third data sequence; wherein the process of the first encoding comprises: in the first data sequence, every two adjacent elements are taken as a group, and a new group is inserted between every two adjacent groups, wherein the odd-numbered elements in the new group come from the odd-numbered elements of the two adjacent groups, and the even-numbered elements in the new group come from the even-numbered elements of the two adjacent groups.

[0193] In an embodiment, performing modulation on the second data sequence to obtain the third data sequence comprises:

[0194] The second data sequence is quadrature phase shift keying (QPSK) modulated to obtain a third data sequence.

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

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

[0197] In an embodiment, before the first data sequence is first encoded to obtain the second data sequence, the method further comprises: second encoding the bit data sequence to obtain the first data sequence.

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

[0199] In an embodiment, the odd-position elements in the new group are from odd-position elements of two adjacent groups, and the even-position elements in the new group are from even-position elements of the two adjacent groups, comprising:

[0200] The odd-position elements in each new group are from odd-position elements of a left group of the two adjacent groups, and the even-position elements in each new group are from even-position elements of a right group of the two adjacent groups.

[0201] In an embodiment, the odd-position elements in the new group are from odd-position elements of two adjacent groups, and the even-position elements in the new group are from even-position elements of the two adjacent groups, comprising:

[0202] The odd-position elements in each new group are from odd-position elements of a right group of the two adjacent groups, and the even-position elements in each new group are from even-position elements of a left group of the two adjacent groups.

[0203] In an embodiment, a new group is inserted between a last group and a first group in the first data sequence.

[0204] In an embodiment, the second data sequence comprises twice as many elements as the first data sequence.

[0205] In an embodiment, the second data sequence is modulated to obtain the third data sequence, comprising: grouping adjacent two elements in the second data sequence as a group to form a new second data sequence; and QPSK modulating the new second data sequence to obtain the third data sequence.

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

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

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

[0209] In an embodiment, the real part and the imaginary part in the third data sequence are obtained to obtain a corresponding real part data sequence and an imaginary part data sequence; and the real part data sequence and the imaginary part data sequence are filtered and digital-to-analog converted respectively.

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

[0211] The data demodulation apparatus provided in the embodiment is configured to implement the data demodulation method applied to the receiving end in 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.

[0212] In an embodiment, FIG. 13 is a structural schematic diagram of a communication device provided in the embodiment. As shown in FIG. 13, the device provided in the embodiment includes a processor 1310, a memory 1320 and a communication module 1330. The number of the processors 1310 in the device can be one or more, and one processor 1310 is taken as an example in FIG. 13. The number of the memories 1320 in the device can be one or more, and one memory 1320 is taken as an example in FIG. 13. The processor 1310, the memory 1320 and the communication module 1330 of the device can be connected through a bus or other manners, and the connection through the bus is taken as an example in FIG. 13. In the embodiment, the device can be used as a sending end or a receiving end. In an example, the communication device used as the sending end and the communication device used as the receiving end can be the same communication device or two different communication devices.

[0213] The memory 1320, as a computer readable storage medium, can be configured to store software programs, computer executable programs and modules, such as program instructions / modules corresponding to the device of any embodiment of the present application (for example, the encoder 1110 and the modulator 1120 in the data modulation apparatus). The memory 1320 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; the data storage area can store data created according to the use of the device, etc. In addition, the memory 1320 can include a high-speed random access memory, and can also 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 1320 can further include a memory remotely arranged with respect to the processor 1310, which 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.

[0214] In the case of the communication device as a sending end, the above-provided device can be configured to perform the data modulation method for the sending end provided by any embodiment described above, and has the corresponding functions and effects.

[0215] In the case of the communication device as a receiving end, the above-provided device can be configured to perform the data demodulation method for the receiving end provided by any embodiment described above, and has the corresponding functions and effects.

[0216] The embodiment of the present application also provides a storage medium containing computer executable instructions, which, when executed by a computer processor, are used to perform a data modulation method for a sending end, the method comprising: performing first encoding on a first data sequence to obtain a second data sequence; wherein the process of first encoding comprises: in the first data sequence, every two adjacent elements are taken as a group, and a new group is inserted between every two adjacent groups, the odd-numbered elements in the new group come from the odd-numbered elements of the two adjacent groups, and the even-numbered elements in the new group come from the even-numbered elements of the two adjacent groups; and performing modulation on the second data sequence to obtain a third data sequence.

[0217] The embodiment of the 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; and 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; and performing modulation on the second data sequence to obtain the third data sequence; wherein the process of the first encoding comprises: in the first data sequence, every two adjacent elements are taken as a group, and a new group is inserted between every two adjacent groups, the odd-numbered elements in the new group are from the odd-numbered elements of the two adjacent groups, and the even-numbered elements in the new group are from the even-numbered elements of the two adjacent groups.

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

[0219] Generally, the various embodiments of the 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

[0220] Embodiments of the 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. Computer program instructions can be in assemblies, Instruction Set Architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state setting data, or in any combination of one or more programming languages, written in any combination of one or more of low-level programming languages, high-level programming languages, and / or declarative programming languages.

[0221] 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 any combination thereof. The computer readable media can include non-transitory storage media. The data processor can be any type suitable for the local technical environment, and can include, but is not limited to, a general purpose computer, a special purpose computer, a microprocessor, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field-programmable gate array (FPGA), and a processor based on multi-core processor architecture.

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

[0223] 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 using an Internet service provider).

Claims

1. A method for data modulation, comprising: first encoding a first data sequence to obtain a second data sequence, wherein the first encoding comprises: in the first data sequence, every two adjacent elements are taken as a group, and a new group is inserted between every two adjacent groups, wherein odd-position elements in the new group are from odd-position elements of the two adjacent groups, and even-position elements in the new group are from even-position elements of the two adjacent groups; modulating the second data sequence to obtain a third data sequence.

2. The method of claim 1, wherein, The modulating the second data sequence to obtain a third data sequence comprises: quadrature phase shift keying (QPSK) modulating the second data sequence to obtain a third data sequence.

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

4. The method of claim 3, wherein, The bit data sequence comprises one of: 0 and 1; and 1 and -1. 5.The method of claim 1, before the first encoding a first data sequence to obtain a second data sequence, further comprising: second encoding a bit data sequence to obtain the first data sequence.

6. The method of claim 5, wherein, The second encoding comprises at least one of: low density parity check (LDPC) encoding, polar encoding, Turbo encoding, and convolutional encoding.

7. The method according to any one of claims 1-6, wherein, The odd-position elements in the new group are from odd-position elements of the two adjacent groups, and the even-position elements in the new group are from even-position elements of the two adjacent groups, comprising: The odd-position elements in each new group are from odd-position elements of a left group of the two adjacent groups, and the even-position elements in each new group are from even-position elements of a right group of the two adjacent groups.

8. The method according to any one of claims 1-6, wherein, The odd-position elements in the new group are from odd-position elements of the two adjacent groups, and the even-position elements in the new group are from even-position elements of the two adjacent groups, comprising: The odd-position elements in each new group are from odd-position elements of a right group of the two adjacent groups, and the even-position elements in each new group are from even-position elements of a left group of the two adjacent groups.

9. The method according to any one of claims 1-6, wherein, A new group is inserted between a last group and a first group in the first data sequence.

10. The method according to any one of claims 1-6, wherein, The second data sequence comprises twice as many elements as the first data sequence.

11. The method according to any one of claims 1-6, wherein, The modulating the second data sequence to obtain a third data sequence comprises: taking every 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 a third data sequence. 12.The method of any one of claims 1-6, further comprising: transmitting the third data sequence.

13. The method of claim 12, wherein, The transmitting the third data sequence comprises: performing phase rotation processing on the third data sequence to obtain a new third data sequence; transmitting the new third data sequence.

14. The method of claim 12, 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.

15. The method of claim 14, wherein, The filtering and digital-to-analog converting the third data sequence to obtain a new 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 conversion are performed on the real part data sequence and the imaginary part data sequence to obtain a new third data sequence.

16. The method of claim 12, wherein, The transmitting the third data sequence comprises: performing Fourier transform processing 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 processing on the mapped third data sequence to obtain a new third data sequence; transmitting the new third data sequence.

17. A data demodulation method, comprising: performing waveform demodulation on a received fourth data sequence to obtain a third data sequence; demodulating 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; and modulating the second data sequence to obtain the third data sequence; wherein the process of the first encoding comprises: in the first data sequence, every two adjacent elements are taken as a group, and a new group is inserted between every two adjacent groups, the odd-numbered elements in the new group are from the odd-numbered elements of the two adjacent groups, and the even-numbered elements in the new group are from the even-numbered elements of the two adjacent groups.

18. 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-16 or 17.

19. 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-16 or 17.

Images