Modulation method, and storage medium, electronic apparatus and computer program product

Abstract

Provided in the embodiments of the present disclosure are a modulation method, and a storage medium, an electronic apparatus and a computer program product. The method comprises: on the basis of a preset modulation rule, modulating a first data sequence into a second data sequence; and transmitting the second data sequence, wherein the preset modulation rule determines, according to the bit values of the first data sequence and the parity of each element position, a real part item and an imaginary part item of an element at a corresponding position in the second data sequence.

Description

Modulation methods, storage media, electronic devices and computer program products

[0001] Cross-references to related applications

[0002] This disclosure is based on and claims priority to Chinese patent application CN2025100847800, filed on January 17, 2025, entitled “Modulation Method, Storage Medium, Electronic Device and Computer Program Product”, and incorporates the entire contents of that patent application by reference. Technical Field

[0003] This disclosure relates to the field of communications, and more specifically, to a modulation method, a storage medium, an electronic device, and a computer program product. Background Technology

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

[0005] In existing communication systems, the PAPR of multi-carrier Orthogonal Frequency Division Multiplexing (OFDM) signals is very high. A high PAPR means that the peak power of the signal is much greater than the average power. This not only leads to nonlinear distortion in the power amplifier but also forces the power amplifier to operate at high power, increasing energy consumption and heat loss, and reducing its efficiency. Although the PAPR of single-carrier Discrete Fourier Transform-Spread OFDM (DFT-S-OFDM) signals is low, it is still not low enough to meet the low PAPR requirements of future communications. Therefore, it is necessary to further reduce the PAPR of data. Summary of the Invention

[0006] This disclosure provides a modulation method, storage medium, electronic device, and computer program product to at least address the problem in the related art that it is difficult to meet the low PAPR requirements of future communications.

[0007] According to one embodiment of this disclosure, a modulation method is provided, comprising: modulating a first data sequence into a second data sequence according to a preset modulation rule; and transmitting the second data sequence; wherein the modulation rule includes at least one of the following:

[0008] First rule,

[0009] Rule Two

[0010] The third rule,

[0011] Fourth rule,

[0012] Where i = 0, 1, ..., M-1, M is the number of elements in the first data sequence, M is a positive integer, and i is an integer and 0 ≤ i < M.

[0013] According to yet another embodiment of this disclosure, a computer-readable storage medium is also provided, which stores a computer program configured to perform the steps in any of the above method embodiments when executed.

[0014] According to yet another embodiment of this disclosure, an electronic device is also provided, including a memory and a processor, the memory storing a computer program and the processor being configured to run the computer program to perform the steps in any of the above method embodiments.

[0015] According to yet another embodiment of this disclosure, a computer program product is also provided, including a computer program that, when executed by a processor, implements the steps in any of the above method embodiments. Attached Figure Description

[0016] Figure 1 is a hardware structure block diagram of the computer terminal operating in the embodiments of this disclosure;

[0017] Figure 2 is a schematic flowchart of a modulation method according to an embodiment of the present disclosure;

[0018] Figure 3 is a schematic diagram of the first rule in one embodiment of this disclosure;

[0019] Figure 4 is a schematic diagram of the third rule in one embodiment of this disclosure;

[0020] Figure 5 is a schematic diagram (I) of a process for modulating a first data sequence to form a second data sequence and transmitting the second data sequence in one embodiment of the present disclosure;

[0021] Figure 6 is a schematic diagram (II) of the process of modulating a first data sequence to form a second data sequence and transmitting the second data sequence in one embodiment of the present disclosure;

[0022] Figure 7 is a schematic diagram (III) of the process of modulating a first data sequence to form a second data sequence and transmitting the second data sequence in one embodiment of this disclosure. Detailed Implementation

[0023] The embodiments of this disclosure will be described in detail below with reference to the accompanying drawings and examples.

[0024] It should be noted that the terms "first," "second," etc., in the specification, claims, and drawings of this disclosure are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence.

[0025] The method embodiments provided in this disclosure can be executed in a communication node with signal modulation capability. Communication nodes include, but are not limited to, core network elements, base stations, user terminals, etc. User terminals include, but are not limited to, mobile terminals, computer terminals, or similar computing devices. Taking a computer terminal as an example, Figure 1 is a hardware structure block diagram of the computer terminal used in the method embodiments of this disclosure. As shown in Figure 1, the computer terminal 100 may include one or more (only one is shown in Figure 1) processors 102 (processors 102 may include, but are not limited to, microprocessors (MCUs) or programmable logic devices (FPGAs), etc.) and a memory 104 for storing data. The computer terminal may also include transmission devices for communication functions and input / output devices. Those skilled in the art will understand that the structure shown in Figure 1 is merely illustrative and does not limit the structure of the computer terminal. For example, the computer terminal may include more or fewer components than shown in Figure 1, or have a different configuration than shown in Figure 1.

[0026] The memory 104 can be used to store computer programs, such as application software programs and modules, like the computer program corresponding to the modulation method in this embodiment. The processor 102 executes various functional applications and data processing by running the computer program stored in the memory 104, thus implementing the above-described method. The memory 104 may include high-speed random access memory and non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some instances, the memory 104 may further include memory remotely located relative to the processor 102, and these remote memories can be connected to a computer terminal via a network. Examples of such networks include, but are not limited to, the Internet, corporate intranets, local area networks, mobile communication networks, and combinations thereof.

[0027] The transmission device is used to receive or send data via a network. Specific examples of the network described above may include a wireless network provided by the mobile terminal's communication provider. In one example, the transmission device includes a Network Interface Controller (NIC), which can connect to other network devices via a base station to communicate with the Internet. In another example, the transmission device may be a Radio Frequency (RF) module, used for wireless communication with the Internet.

[0028] This embodiment provides a modulation method. Figure 2 is a schematic flowchart of the modulation method according to an embodiment of this disclosure. As shown in Figure 2, the process includes the following steps:

[0029] Step S202: Modulate the first data sequence into a second data sequence according to a preset modulation rule;

[0030] Step S204: Transmit the second data sequence.

[0031] In some embodiments, the modulation rule includes at least one of the following:

[0032] First rule,

[0033] Rule Two

[0034] The third rule,

[0035] Fourth rule,

[0036] Where i = 0, 1, ..., M-1, M is the number of elements in the first data sequence, M is a positive integer, and i is an integer and 0 ≤ i < M.

[0037] The entity executing each step in the embodiments of the method disclosed herein may be a communication node with signal modulation capability, including but not limited to base stations, terminals, etc.

[0038] In this embodiment of the disclosure, mod is the modulo operator. For example, if i is even, then i mod 2 is 0, and if i is odd, then i mod 2 is 1.

[0039] Through the above steps S202 to S204, the first data sequence is modulated into a second data sequence according to a preset modulation rule, and after performing a Fourier transform on the second data sequence, it is mapped onto the frequency domain resources according to the arrangement of subcarriers. This solves the problem in related technologies that it is difficult to meet the low PAPR requirements of future communication, and achieves the technical effect of better reducing the peak-to-average power ratio of the data signal, thereby improving the efficiency of the power amplifier.

[0040] In some embodiments, prior to step S202, the method further includes: channel coding the third data bit sequence to obtain the first data sequence.

[0041] In some embodiments, prior to step S202, the method further includes: transforming the "1"s into "0"s and the "-1"s into "1"s in the fourth data sequence composed of "1"s and "-1", and then obtaining the first data sequence. That is, the first data sequence is composed of two elements, "0"s and "1".

[0042] In some embodiments, the first data sequence is a bit data sequence, and the second data sequence is a complex modulation symbol sequence.

[0043] In some embodiments, d(i) in the second data sequence is determined by b(i) and b(i+1) in the first data sequence, wherein b(i) and b(i+1) in the first data sequence may include at least one of the following: 00, 10, 11, 01.

[0044] In some embodiments, the second data sequence is a complex modulation symbol sequence, including a real part and an imaginary part. The real part is determined by 1-2b(i), and the imaginary part is determined by j(1-2b(i+1)) or j(1-2b((i+1)modM)). The real part and the imaginary part are added together and then multiplied by their corresponding factors. or Multiply them to form the corresponding modulation rules.

[0045] In some embodiments, the sign of the above factor is affected by the parity of i, b(i), and b(i+1). Specifically, when b(i)+b(i+1)-1, b(i)+b(i+1), b(i)+b((i+1)modM-1), or b(i)+b((i+1)modM) is 0, the above factor is always positive. When b(i)+b(i+1)-1, b(i)+b(i+1), b(i)+b((i+1)modM-1), or b(i)+b((i+1)modM) is not 0, the sign of the above factor needs to be further determined. In this case, when i is even, i mod 2 is 0, and the above factor is positive. When i is odd, i mod 2 is 1, and when b(i)+b(i+1) or b(i+1)modM is 2, the above factors are positive.

[0046] In some embodiments, a first data sequence is modulated using a specific formula to form a second data sequence. The modulation rule determines the real and imaginary parts of each element in the second data sequence based on the bit value of the first data sequence and the parity of each element's position. This helps to standardize the modulation process and thus better reduce the peak-to-average power ratio of the data signal.

[0047] In some embodiments, in response to the modulation rule being the first rule or the third rule, i = 0, 1, ..., M-2, the last element in the second data sequence is preset data or the last element in the second data sequence is empty, and the other elements in the second data sequence except for the last element are determined according to the modulation rule.

[0048] In some embodiments, when the imaginary part of the preset modulation rule does not include the mod symbol, the last element in the second data sequence is preset data or the last element in the second data sequence is empty.

[0049] In other embodiments, in response to the modulation rule being the second rule or the fourth rule, i = 0, 1, ..., M-1, the first data sequence and the second data sequence contain the same number of elements, both M, and each element in the second data sequence is determined according to the modulation rule.

[0050] In some embodiments, when the imaginary part of the preset modulation rule includes a mod symbol, the last element in the second data sequence is also determined by the modulation rule. For example, when determining the last element d(M-1) in the second data sequence, it is determined by d(M-1) in the first data sequence and the next element of d(M-1). At this time, the next element of d(M-1) is d(0), that is, d(M-1) in the second data sequence is jointly determined by d(M-1) and d(0) in the first data sequence.

[0051] In some embodiments, step S204 may include the following steps:

[0052] Step S2042: Perform a Fourier transform on the second data sequence and map the transformed data sequence onto time-frequency resources for transmission.

[0053] In some embodiments, step S2042 may include the following steps:

[0054] Step S2042-2: Divide the second data sequence into at least one group of data sequences, perform Fourier transform on each group of data sequences, and map the transformed data sequences of different groups onto different Orthogonal Frequency Division Multiplexing (OFDM) symbols.

[0055] In one exemplary embodiment, the second data sequence is a set of data sequences, the second data sequence is subjected to a Fourier transform, and the transformed data sequence is mapped onto one OFDM symbol.

[0056] In another exemplary embodiment, the second data sequence is divided into L groups (L>1) of data sequences, each group of data sequences is subjected to Fourier transform, and the L groups of Fourier transformed data sequences are mapped onto L OFDM symbols, wherein 1 group of Fourier transformed data sequences is mapped onto 1 OFDM symbol.

[0057] In some embodiments, in response to the Fourier transform being a Discrete Fourier Transform (DFT), performing a Fourier transform on the second data sequence and mapping the transformed data sequence onto time-frequency resources for transmission further includes at least one of the following steps:

[0058] Step S2042-4: Map the transformed data sequence onto frequency domain resources according to the subcarrier arrangement order;

[0059] Step S2042-6: Perform a half-cycle cyclic shift on the transformed data sequence, and map the half-cycle cyclic shifted data sequence onto the frequency domain resources according to the arrangement order of the subcarriers.

[0060] In this embodiment, each data sequence can be mapped onto the frequency domain according to the order of the subcarriers, thereby better reducing the peak-to-average power ratio of the data signal.

[0061] In some embodiments, performing a Fourier transform on the second data sequence and mapping the transformed data sequence onto time-frequency resources for transmission further includes at least one of the following steps:

[0062] Step S2042-8: After performing frequency domain spectroscopic shaping (FDSS) on the transformed data sequence, it is then mapped onto the time-frequency resources for transmission;

[0063] Step S2042-10: Multiply the transformed data sequence by a power factor and then map it onto the time-frequency resources for transmission.

[0064] In this embodiment, FDSS can be used to extract a portion of the data with relatively high power and map it onto frequency domain resources.

[0065] In this embodiment, the second data sequence after Fourier transform may only undergo FDSS processing or only be multiplied by a power factor. Alternatively, the fourth data sequence after Fourier transform may undergo both FDSS processing and power factor multiplication, and this disclosure does not restrict the execution order of steps S2042-8 and S2042-10.

[0066] In some embodiments, FDSS processing and power factor adjustment can further reduce the PAPR of the data sequence and optimize the transmission performance of the data sequence.

[0067] Through the above embodiments of this disclosure, the first data sequence is modulated into a second data sequence according to a preset modulation rule, and after performing a Fourier transform on the second data sequence, it is mapped onto frequency domain resources according to the arrangement of subcarriers. This solves the problem in related technologies that it is difficult to meet the low PAPR requirements of future communication, and achieves the technical effect of better reducing the peak-to-average power ratio of the data signal, thereby improving the efficiency of the power amplifier.

[0068] Figure 3 is a schematic diagram of the first rule in an embodiment of the present disclosure. The first data sequence b(i) is modulated into a second data sequence d(i) according to the first rule (represented by formula (1)), where i = 0, 1, ..., M-1, and M is the number of elements in the first data sequence and the second data sequence.

[0069] In the first rule, b(i) and b(i+1) of the first data sequence jointly determine d(i) of the second data sequence, where d(M-1) represents other data. The real part 1-2b(i) is added to the imaginary part j(1-2b(i+1)), and then factored. Multiply to form d(i) of the second data sequence. Specifically,

[0070] When b(i) = 0 and b(i+1) = 0, the real part is 1, the imaginary part is j, and the factor is... Therefore, if i is even, the... If i is odd, the

[0071] When b(i) = 0 and b(i+1) = 1, the real part is 1, the imaginary part is -j, and the factor is... Therefore, the

[0072] When b(i) = 1 and b(i+1) = 0, the real part is -1, the imaginary part is j, and the factor is... Therefore, the

[0073] When b(i) = 1 and b(i+1) = 1, the real part is -1, the imaginary part is -j, and the factor is... Therefore, if i is even, the... If i is odd, the

[0074] In an exemplary embodiment, it is assumed that the first data sequence contains 10 elements, and the first data sequence is: [b(0),b(1),b(2),b(3),b(4),b(5),b(6),b(7),b(8),b(9)] = [1,0,1,1,0,0,1,1,0,0].

[0075] The first data sequence b(i) is modulated into a second data sequence d(i) according to the first rule, that is, the second data sequence is: d(9) represents other data.

[0076] Therefore, the second data sequence is: d(9) represents other data.

[0077] In one exemplary embodiment, the odd-numbered data elements of the second data sequence remain unchanged, while the even-numbered data elements are changed to their opposites. Then, the modulus of the second data sequence is 1, and the phase difference between adjacent data is 0 or ±π / 2.

[0078] In one embodiment of this disclosure, the first data sequence b(i) is modulated into a second data sequence d(i) according to a second rule (represented by formula (2)), where i = 0, 1, ..., M-1, and M is the number of elements in the first data sequence and the second data sequence.

[0079] The difference between the second rule and the first rule is that the imaginary part of the second rule contains a mod symbol, where mod stands for modulo. In this case, d(M-1) in the second data sequence is also modulated using the second rule, and b(M-1) and b(0) in the first data sequence jointly determine d(M-1) in the second data sequence. Specifically, the real part 1-2b(M-1) is added to the imaginary part j(1-2b(0)), and then factored... Multiply them to form d(M-1) in the second data sequence. The specific analysis process is similar to the first rule mentioned above, and will not be repeated here.

[0080] In an exemplary embodiment, it is assumed that the first data sequence contains 10 elements, and the first data sequence is: [b(0),b(1),b(2),b(3),b(4),b(5),b(6),b(7),b(8),b(9)] = [1,0,1,1,0,0,1,1,0,0].

[0081] The first data sequence b(i) is modulated into a second data sequence d(i) according to the second rule, that is, the second data sequence is:

[0082] Therefore, the second data sequence is:

[0083] Figure 4 is a schematic diagram of the third rule in one embodiment of this disclosure. The first data sequence b(i) is modulated into a second data sequence d(i) according to the third rule (represented by formula (3)), where i = 0, 1, ..., M-1, and M is the number of elements in the first data sequence and the second data sequence.

[0084] In the third rule, b(i) and b(i+1) of the first data sequence jointly determine d(i) of the second data sequence, where d(M-1) represents other data. The real part 1-2b(i) is added to the imaginary part j(1-2b(i+1)), and then factored. Multiply to form d(i) of the second data sequence. Specifically,

[0085] When b(i) = 0 and b(i+1) = 0, the real part is 1, the imaginary part is j, and the factor is... Therefore, the

[0086] When b(i) = 0 and b(i+1) = 1, the real part is 1, the imaginary part is -j, and the factor is... Therefore, if i is even, the... If i is odd, the

[0087] When b(i) = 1 and b(i+1) = 0, the real part is -1, the imaginary part is j, and the factor is... Therefore, if i is even, the... If i is odd, the

[0088] When b(i) = 1 and b(i+1) = 1, the real part is -1, the imaginary part is -j, and the factor is... Therefore, the

[0089] In an exemplary embodiment, it is assumed that the first data sequence contains 10 elements, and the first data sequence is: [b(0),b(1),b(2),b(3),b(4),b(5),b(6),b(7),b(8),b(9)] = [1,0,1,1,0,0,1,1,0,0].

[0090] The first data sequence b(i) is modulated into a second data sequence d(i) according to the third rule, that is, the second data sequence is: d(9) represents other data.

[0091] Therefore, the second data sequence is: d(9) represents other data. The modulus of the second data sequence is 1, and the phase difference between adjacent data is 0 or ±π / 2.

[0092] In one embodiment of this disclosure, the first data sequence b(i) is modulated into a second data sequence d(i) according to the fourth rule (represented by formula (4)), where i = 0, 1, ..., M-1, and M is the number of elements in the first data sequence and the second data sequence.

[0093] The difference between the fourth rule and the third rule is that the imaginary part of the fourth rule contains a mod symbol, where mod stands for modulo. In this case, d(M-1) in the second data sequence is also modulated using the fourth rule, and b(M-1) and b(0) in the first data sequence jointly determine d(M-1) in the second data sequence. Specifically, the real part 1-2b(M-1) is added to the imaginary part j(1-2b(0)), and then factored. Multiply them to form d(M-1) in the second data sequence. The specific analysis process is similar to the third rule mentioned above, and will not be repeated here.

[0094] In an exemplary embodiment, it is assumed that the first data sequence contains 10 elements, and the first data sequence is: [b(0),b(1),b(2),b(3),b(4),b(5),b(6),b(7),b(8),b(9)] = [1,0,1,1,0,0,1,1,0,0].

[0095] The first data sequence b(i) is modulated into a second data sequence d(i) according to the fourth rule, that is, the second data sequence is:

[0096] Therefore, the second data sequence is:

[0097] Figure 5 is a schematic flowchart (I) of a method for modulating a first data sequence to form a second data sequence and transmitting the second data sequence according to an embodiment of the present disclosure. As shown in Figure 5, the process includes the following steps:

[0098] Step S502: Modulate the first data sequence into a second data sequence according to the first rule or the second rule;

[0099] Step S504: Perform an M-point Discrete Fourier Transform (DFT) on the second data sequence to obtain frequency domain data of M subcarriers;

[0100] Step S506: Map the frequency domain data to the corresponding subcarrier positions;

[0101] Step S508: Perform an N-point Inverse Discrete Fourier Transform (IFFT) (N>=M) on the data carried by the subcarrier to obtain the first communication signal.

[0102] In some embodiments, after performing step S1208, the method further includes: adding a cyclic prefix or guard interval to the first communication signal, and then performing frequency mixing and transmission.

[0103] In some embodiments, frequency domain shaping and multiplication by a power factor may also be included between the DFT and IFFT.

[0104] In this embodiment, the first rule is,

[0105] The second rule is,

[0106] Where i = 0, 1, ..., M-1, M is the number of elements in the first data sequence, M is a positive integer, and i is an integer and 0 ≤ i < M.

[0107] Figure 6 is a schematic flowchart (II) of a process for modulating a first data sequence to form a second data sequence and transmitting the second data sequence according to an embodiment of the present disclosure. As shown in Figure 6, the process includes the following steps:

[0108] Step S602: Modulate the first data sequence into a second data sequence according to the third or fourth rule;

[0109] Step S604: Perform an M-point Discrete Fourier Transform (DFT) on the second data sequence to obtain frequency domain data of M subcarriers;

[0110] Step S606: Perform a half-cycle cyclic shift on the frequency domain data, and then map the half-cycle cyclic shifted data to the corresponding subcarrier position.

[0111] Step S608: Perform an N-point Inverse Discrete Fourier Transform (IFFT) (N>=M) on the data carried by the subcarrier to obtain the first communication signal.

[0112] In this embodiment, after adding a cyclic prefix or guard interval to the first communication signal, it is mixed and transmitted.

[0113] In this embodiment, the third rule is,

[0114] The fourth rule is,

[0115] Where i = 0, 1, ..., M-1, M is the number of elements in the first data sequence, M is a positive integer, and i is an integer and 0 ≤ i < M.

[0116] Figure 7 is a schematic flowchart (III) of a process for modulating a first data sequence to form a second data sequence and transmitting the second data sequence in one embodiment of this disclosure. As shown in Figure 7, the process includes the following steps:

[0117] Step S702: Modulate the first data sequence into a second data sequence according to a preset modulation rule;

[0118] Step S704: Divide the second data sequence into L groups of data sequences, and then perform Discrete Fourier Transform (DFT) on each group of data sequences to obtain the frequency domain data of the subcarriers of each group.

[0119] Step S706: Map the frequency domain data of each group of subcarriers to the corresponding subcarrier positions;

[0120] Step S708: Perform Inverse Discrete Fourier Transform (IFFT) on the frequency domain data carried by each group of subcarriers to obtain the first communication signal.

[0121] In this embodiment, before step S706, the method may further include the following steps:

[0122] Step S705: Perform a half-cycle cyclic shift on the frequency domain data of each group of subcarriers.

[0123] In this embodiment, the modulation rule includes at least one of the following:

[0124] First rule,

[0125] Rule Two

[0126] The third rule,

[0127] Fourth rule,

[0128] Where i = 0, 1, ..., M-1, M is the number of elements in the first data sequence, M is a positive integer, and i is an integer and 0 ≤ i < M.

[0129] Through the above embodiments of this disclosure, the first data sequence is modulated into a second data sequence according to a preset modulation rule, and after performing a Fourier transform on the second data sequence, it is mapped onto frequency domain resources according to the arrangement of subcarriers. This solves the problem in related technologies that it is difficult to meet the low PAPR requirements of future communication, and achieves the technical effect of better reducing the peak-to-average power ratio of the data signal, thereby improving the efficiency of the power amplifier.

[0130] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods according to the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this disclosure, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), and includes several instructions to cause a terminal device (which may be a mobile phone, computer, server, or network device, etc.) to execute the methods described in the various embodiments of this disclosure.

[0131] Embodiments of this disclosure also provide a computer-readable storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the steps in any of the above method embodiments.

[0132] In one exemplary embodiment, the aforementioned computer-readable storage medium may include, but is not limited to, various media capable of storing computer programs, such as USB flash drives, read-only memory (ROM), random access memory (RAM), portable hard drives, magnetic disks, or optical disks.

[0133] Embodiments of this disclosure also provide an electronic device including a memory and a processor, the memory storing a computer program and the processor being configured to run the computer program to perform the steps in any of the above method embodiments.

[0134] In one exemplary embodiment, the electronic device may further include a transmission device and an input / output device, wherein the transmission device is connected to the processor and the input / output device is connected to the processor.

[0135] Embodiments of this disclosure also provide a computer program product, including a computer program that, when executed by a processor, implements the steps in any of the method embodiments described above.

[0136] Specific examples in this embodiment can be found in the examples described in the above embodiments and exemplary implementations, and will not be repeated here.

[0137] It is obvious to those skilled in the art that the modules or steps of this disclosure described above can be implemented using general-purpose computing devices. They can be centralized on a single computing device or distributed across a network of multiple computing devices. They can be implemented using computer-executable program code, and thus can be stored in a storage device for execution by a computing device. In some cases, the steps shown or described can be performed in a different order than those presented herein, or they can be fabricated as separate integrated circuit modules, or multiple modules or steps can be fabricated as a single integrated circuit module. Thus, this disclosure is not limited to any particular combination of hardware and software.

[0138] The above description is merely an exemplary embodiment of this disclosure and is not intended to limit this disclosure. Various modifications and variations can be made to this disclosure by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the principles of this disclosure should be included within the scope of protection of this disclosure.

Claims

1. A modulation method, comprising: The first data sequence is modulated into the second data sequence according to the preset modulation rules; Transmit the second data sequence; The modulation rule includes at least one of the following: First rule, Rule Two The third rule, Fourth rule, Where i = 0, 1, ..., M-1, M is the number of elements contained in the first data sequence, M is a positive integer, and i is an integer and 0 ≤ i < M.

2. The method according to claim 1, wherein, In response to the modulation rule being either the first rule or the third rule, i = 0, 1, ..., M-2, the last element in the second data sequence is preset data or the last element in the second data sequence is empty, and the other elements in the second data sequence except for the last element are determined according to the modulation rule.

3. The method according to claim 1, wherein, In response to the modulation rule being the second rule or the fourth rule, i = 0, 1, ..., M-1, the first data sequence and the second data sequence contain the same number of elements, both M, and each element in the second data sequence is determined according to the modulation rule.

4. The method according to claim 1, wherein, Before modulating the first data sequence into a second data sequence according to a preset modulation rule, the method further includes: The third data bit sequence is channel-coded to obtain the first data sequence.

5. The method according to claim 1, wherein, The first data sequence is a bit data sequence, and the second data sequence is a complex modulation symbol sequence.

6. The method according to claim 1, wherein, The transmission of the second data sequence includes: The second data sequence is subjected to a Fourier transform, and the transformed data sequence is mapped onto time-frequency resources for transmission.

7. The method according to claim 6, wherein, The step of performing a Fourier transform on the second data sequence and mapping the transformed data sequence onto time-frequency resources for transmission includes: The second data sequence is divided into at least one group of data sequences, and a Fourier transform is performed on each group of data sequences. The transformed data sequences of different groups are then mapped onto different orthogonal frequency division multiplexing (OFDM) symbols.

8. The method according to claim 7, wherein, In response to the Fourier transform being a Discrete Fourier Transform (DFT), the step of performing a Fourier transform on the second data sequence and mapping the transformed data sequence onto time-frequency resources for transmission further includes at least one of the following: The transformed data sequence is mapped onto frequency domain resources according to the order of the subcarriers; The transformed data sequence is subjected to a half-cycle cyclic shift, and the half-cycle cyclic shifted data sequence is mapped onto the frequency domain resources according to the arrangement order of the subcarriers.

9. The method according to claim 7, wherein, The step of performing a Fourier transform on the second data sequence and mapping the transformed data sequence onto time-frequency resources for transmission further includes at least one of the following: The transformed data sequence is then frequency-domain shaped and mapped onto the time-frequency resources for transmission. The transformed data sequence is multiplied by a power factor and then mapped onto the time-frequency resources for transmission.

10. A computer-readable storage medium, wherein, The storage medium stores a computer program, wherein the computer program, when executed by a processor, implements the steps of the method described in any one of claims 1 to 9.

11. An electronic device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein, When the processor executes the computer program, it implements the steps of the method described in any one of claims 1 to 9.

12. A computer program product comprising a computer program, wherein, When the computer program is executed by a processor, it implements the steps of the method described in any one of claims 1 to 9.

Images