Data modulation method and apparatus

Abstract

Embodiments of the present disclosure provide a data modulation method and apparatus. The method comprises: for M groups each having L(m) consecutive data blocks, performing N(m)-point discrete Fourier transform on one data block in each group among the M groups to generate M groups each having N(m) pieces of data, then performing G-point inverse discrete Fourier transform on formula (I) pieces of generated data to generate G pieces of time domain data, and transmitting the G pieces of time domain data on a time-frequency resource, wherein in each group of L(m) consecutive data blocks, the head of each data block comprises the same first data sequence, and the tail of each data block comprises the same second data sequence; M>=2, L(m)>=2, and m is 1, 2, … M; N(m) is the amount of data contained in each data block, N(m)>0, and G>=formula (I). The present disclosure solves the problem of being unable to support various service data and satisfy a low peak-to-average power ratio signal.

Description

Data modulation method and apparatus

[0001] Cross-reference to Related Applications

[0002] The present disclosure is based on Chinese Patent Application No. CN202411236802.2 entitled “Data modulation method and apparatus” filed on September 4, 2024, and claiming priority to the same, the disclosure of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0003] Embodiments of the present disclosure relate to the field of communications, and in particular, to a data modulation method and apparatus. BACKGROUND

[0004] In a high frequency scenario, the channel bandwidth is relatively large. If the existing Cyclic Prefix Orthogonal Frequency Division Multiplexing (CP-OFDM) waveform in the Fifth Generation New Ratio (5G NR) standard is used, the time-frequency resources of the entire channel bandwidth can be flexibly scheduled, and data can be transmitted to multiple terminals at the same time. However, if multiple different services need to be supported at the same time, the data of different services needs to be transmitted using frequency domain resources with different subcarrier spacings, and the frequency domain resources with different subcarrier spacings need to be separately processed by Inverse Fast Fourier Transform (IFFT), which has a relatively high processing complexity. Moreover, the efficiency of a high frequency Power Amplifier (PA) is relatively low, and therefore a waveform signal with a low peak-to-average ratio needs to be designed. However, the peak-to-average ratio of the CP-OFDM waveform signal is relatively high, and therefore it is difficult to meet the requirements.

[0005] Although the peak-to-average ratio of the signal of the existing Discrete Fourier Transform Spread Orthogonal Frequency Division Multiplexing (DFT-s-OFDM) waveform in the 5G NR standard is relatively low, the flexibility of time-frequency resource scheduling is relatively low. Moreover, if multiple different services need to be supported at the same time, the data of different services needs to be transmitted using frequency domain resources with different subcarrier spacings, and the frequency domain resources with different subcarrier spacings need to be separately processed by IFFT, which has a relatively high processing complexity.

[0006] Under a large channel bandwidth, it is difficult to support data of multiple different services flexibly, reduce processing complexity, and meet a low peak-to-average ratio signal at the same time, which is a problem to be solved. SUMMARY

[0007] Embodiments of the present disclosure provide a data modulation method and device to at least solve the problem that in the related art, it is difficult to support data of multiple different services flexibly, reduce processing complexity, and meet a low peak-to-average ratio signal at the same time.

[0008] According to one embodiment of the present disclosure, a data modulation method is provided, comprising: in M groups of L(m) consecutive data blocks each, performing N(m)-point discrete Fourier transform on one data block of each group respectively to generate N(m) data of each group, and performing G-point inverse discrete Fourier transform on a total of G generated data to generate G time-domain data, and transmitting the G time-domain data on time-frequency resources; wherein, in each group of L(m) consecutive data blocks, a same first data sequence is contained in a head of each data block, and a same second data sequence is contained in a tail of each data block; M>=2, L(m)>=2, m=1, 2,...M; N(m) is a data number contained in each data block,

[0009] According to another embodiment of the present disclosure, a data modulation device is provided, comprising: a first execution module configured to, in M groups of L(m) consecutive data blocks each, perform N(m)-point discrete Fourier transform on one data block of each group respectively to generate N(m) data of each group, and a second execution module configured to perform G-point inverse discrete Fourier transform on a total of G generated data to generate G time-domain data, and a transmission module configured to transmit the G time-domain data on time-frequency resources; wherein, in each group of L(m) consecutive data blocks, a same first data sequence is contained in a head of each data block, and a same second data sequence is contained in a tail of each data block; M>=2, L(m)>=2, m=1, 2,...M; N(m) is a data number contained in each data block,

[0010] According to still another embodiment of the present disclosure, a computer readable storage medium is also provided, and the computer readable storage medium stores a computer program, wherein the computer program is configured to execute the steps in any of the method embodiments described above when running.

[0011] According to still another embodiment of the present disclosure, an electronic device is also provided, comprising a memory and a processor, the memory stores a computer program, and the processor is configured to execute the computer program to execute the steps in any of the method embodiments described above.

[0012] According to yet another embodiment of the present disclosure, there is also provided a computer program product comprising a computer program which, when executed by a processor, implements the steps of any of the above method embodiments. BRIEF DESCRIPTION OF DRAWINGS

[0013] Fig. 1 is a hardware structure block diagram of a computer terminal of a data modulation method according to an embodiment of the present disclosure;

[0014] Fig. 2 is a flow chart of data modulation according to an embodiment of the present disclosure;

[0015] Fig. 3 is a structure block diagram of a data modulation apparatus according to an embodiment of the present disclosure;

[0016] Fig. 4 is a schematic diagram of a first data block in each group of multiple data blocks according to an embodiment of the present disclosure (I);

[0017] Fig. 5 is a schematic diagram of a first data block in each group of multiple data blocks according to an embodiment of the present disclosure (II);

[0018] Fig. 6 is a schematic diagram of a first data block in each group of multiple data blocks according to an embodiment of the present disclosure (III);

[0019] Fig. 7 is a schematic diagram of a first data block in each group of multiple data blocks according to an embodiment of the present disclosure (IV);

[0020] Fig. 8 is a schematic diagram of a first data block in each group of multiple data blocks according to an embodiment of the present disclosure (V);

[0021] Fig. 9 is a schematic diagram of a first data block in each group of multiple data blocks according to an embodiment of the present disclosure (VI);

[0022] Fig. 10 is a schematic diagram of a first data block in each group of multiple data blocks according to an embodiment of the present disclosure (VII);

[0023] Fig. 11 is a schematic diagram of a first data block in each group of multiple data blocks according to an embodiment of the present disclosure (VIII);

[0024] Fig. 12 is a schematic diagram of digital-to-analog conversion according to an embodiment of the present disclosure. DETAILED DESCRIPTION

[0025] Hereinafter, embodiments of the present disclosure will be described in detail with reference to the accompanying drawings and in conjunction with embodiments.

[0026] It should be noted that the terms "first", "second", and the like in the specification and claims of the present disclosure and the above-described drawings are used to distinguish similar objects, and do not necessarily have to describe a specific order or sequence.

[0027] The method embodiments provided in the embodiments of the present disclosure can be executed in a mobile terminal, a computer terminal or similar computing device. Taking the case of running on a computer terminal, FIG. 1 is a hardware structure block diagram of a computer terminal of a data modulation method according to an embodiment of the present disclosure. As shown in FIG. 1, the computer terminal can include one or more (only one is shown in FIG. 1) processors 102 (the processor 102 can include, but is not limited to, a processing device such as a microprocessor MCU or a programmable logic device FPGA) and a memory 104 configured to store data, wherein the computer terminal can further include a transmission device 106 configured to have a communication function and an input and output device 108. Those skilled in the art can understand that the structure shown in FIG. 1 is only schematic, which does not limit the structure of the computer terminal. For example, the computer terminal can include more or less components than those shown in FIG. 1, or have a different configuration from that shown in FIG. 1.

[0028] The memory 104 can be configured to store computer programs, for example, software programs of application software and modules, such as a computer program corresponding to the data modulation method in the embodiments of the present disclosure. The processor 102 executes various functional applications and data processing by running the computer programs stored in the memory 104, that is, implements the above-mentioned method. The memory 104 can include a high-speed random access memory, and can further include a non-volatile memory, such as one or more magnetic storage devices, flash memories, or other non-volatile solid-state memories. In some examples, the memory 104 can further include a memory remotely arranged with respect to the processor 102, which can be connected to the computer terminal through a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and a combination thereof.

[0029] The transmission device 106 is configured to receive or send data via a network. Specific examples of the above-mentioned network can include a wireless network provided by a communication provider of the computer terminal. In one example, the transmission device 106 includes a network adapter (Network Interface Controller, NIC for short), which can be connected to other network devices through a base station so as to communicate with the Internet. In one example, the transmission device 106 can be a radio frequency (Radio Frequency, RF for short) module, which is configured to communicate with the Internet in a wireless manner.

[0030] In the present embodiment, a data modulation method running on the above-mentioned computer terminal is provided, and FIG. 2 is a flow chart of data modulation according to an embodiment of the present disclosure. As shown in FIG. 2, the flow includes the following steps:

[0031] Step S202, performing N(m) point discrete Fourier transform on one data block in each of the M groups of L(m) consecutive data blocks respectively to generate N(m) data in each of the M groups, and performing G point inverse discrete Fourier transform on the total generated G data to generate G time domain data, and transmitting the G time domain data on time-frequency resources, wherein the first data sequence is contained in the head of each data block and the second data sequence is contained in the tail of each data block in each of the L(m) consecutive data blocks; M>=2, L(m)>=2, m=1, 2, …M; N(m) is the number of data contained in each data block,

[0032] In this embodiment, the transmission of the G time domain data on the time-frequency resources can be performed in the following manner: digital-to-analog conversion is performed on the G time domain data, and then the G time domain data are transmitted on a radio frequency link.

[0033] In this embodiment, the G point inverse discrete Fourier transform performed on the total generated G data can be performed in the following manner: P(m) data are added to each group of data respectively, then 0 is added, and then G point inverse discrete Fourier transform is performed, wherein P(m)>=0.

[0034] In an embodiment, the addition of P(m) data to each group of data respectively and the addition of 0 can be performed in the following manner: P(m) data are added to each group of data respectively, and then z(m) 0s are added to each group of data respectively.

[0035] In an embodiment, the addition of P(m) data to each group of data respectively can be performed in the following manner: a cyclic prefix and a cyclic postfix are added to each group of N(m) data respectively, and then point multiplication of a filter coefficient is performed.

[0036] In this embodiment, the filter coefficient can be a discrete value of a root raised cosine function.

[0037] In an embodiment, in each data block in each of the M groups, the data block of at least one group contains a number of data different from that of other groups.

[0038] In an embodiment, in each data block in each of the M groups, the time domain length occupied by the data block is the same among different groups.

[0039] In an embodiment, in the M groups, the L(m) consecutive data blocks of at least one group each contain 2 i sub-blocks of data, i is an integer greater than or equal to 1, and the number of data contained in each of the 2 i sub-blocks of data is the same.

[0040] In this embodiment, the 2i In each data sub-block, a same third data sequence is contained in the head of each data sub-block, and a same fourth data sequence is contained in the tail of each data sub-block.

[0041] In the embodiment, the number of the same first data sequences contained in the head of each data sub-block is equal to the number of the same second data sequences contained in the tail of each data sub-block; or, the number of the same third data sequences contained in the head of each data sub-block is less than the number of the same fourth data sequences contained in the tail of each data sub-block.

[0042] Through the above steps, the single-carrier sub-band data of different sub-carrier intervals can be transmitted through one IDFT, a plurality of continuous OFDM symbols can be processed through DFT by adding the same head and tail sequences in the time domain, and the cyclic data and 0 can be added in the frequency domain, thereby solving the problem that in the related art, a low PAPR signal cannot be flexibly supported while reducing the processing complexity, and achieving the effects of flexibly supporting a plurality of different services, reducing the processing complexity, reducing the inter-symbol interference, and reducing the inter-sub-band interference.

[0043] Through the description of the above embodiments, those skilled in the art can clearly understand that the method according to the above embodiments can be realized by means of software and a necessary general hardware platform, and of course, it can also be realized by hardware, but in many cases, the former is a better embodiment. Based on such understanding, the technical solutions of the disclosure can be embodied in the form of a software product, which is stored in a storage medium (such as a ROM / RAM, a magnetic disk, or an optical disk), and includes a plurality of instructions for causing a terminal device (which can be a mobile phone, a computer, a server, or a network device) to execute the methods of the various embodiments of the disclosure.

[0044] In the embodiment, a data modulation apparatus is also provided, which is configured to implement the above embodiments and preferred embodiments, and will not be described again. As used below, the term "module" can be a combination of software and / or hardware that implements a predetermined function. Although the apparatus described in the following embodiments is preferably implemented in software, hardware or a combination of software and hardware is also possible and is contemplated.

[0045] FIG. 3 is a structural block diagram of a data modulation apparatus according to an embodiment of the disclosure, as shown in FIG. 3, the apparatus 300 includes:

[0046] The first execution module 302 is configured to perform N(m) point discrete Fourier transform on one data block in each of the M groups of L(m) continuous data blocks, respectively, to generate N(m) data in each of the M groups,

[0047] The second execution module 304 is configured to perform G-point inverse discrete Fourier transform on the generated total of G pieces of time domain data,

[0048] The transmission module 306 is configured to transmit the G pieces of time domain data on time-frequency resources,

[0049] Wherein, in each group of L(m) consecutive data blocks, the same first data sequence is contained in the head of each data block, and the same second data sequence is contained in the tail of each data block; M>=2, L(m)>=2, m=1, 2, …M; N(m) is the number of data contained in each data block,

[0050] In an embodiment, the second execution module 304 can include:

[0051] The execution submodule is configured to add P(m) data to each group of data respectively, then add 0, and then perform G-point inverse discrete Fourier transform, where P(m)>=0.

[0052] In an embodiment, the execution submodule can include:

[0053] The first execution sub-submodule is configured to add P(m) data to each group of data respectively, and then add z(m) 0 to each group of data respectively.

[0054] In an embodiment, the execution submodule can include:

[0055] The second execution sub-submodule is configured to add a cyclic prefix and a cyclic postfix to each group of N(m) data respectively, and then multiply by a filter coefficient.

[0056] In this embodiment, the filter coefficient can be a discrete value of a root-raised cosine function.

[0057] In an embodiment, the transmission module 306 can include:

[0058] The transmission submodule is configured to perform digital-to-analog conversion on the G pieces of time domain data, and then transmit the G pieces of time domain data on a radio frequency link.

[0059] In an embodiment, in the M groups, at least one group of data blocks contains a different number of data than the other groups.

[0060] In an embodiment, in the M groups, the time domain length occupied by the data blocks is the same between different groups.

[0061] In an embodiment, in the M groups, at least one group of L(m) consecutive data blocks contains 2 ia number of data sub-blocks, i is an integer greater than or equal to 1, wherein, 2 i The number of data contained in each data sub-block is the same.

[0062] In an embodiment, 2 i The same third data sequence is contained in the head of each data sub-block, and the same fourth data sequence is contained in the tail of each data sub-block.

[0063] In an embodiment, the number of the same first data sequence contained in the head of each data sub-block is equal to the number of the same second data sequence contained in the tail of each data sub-block; or, the number of the same third data sequence contained in the head of each data sub-block is less than the number of the same fourth data sequence contained in the tail of each data sub-block.

[0064] It should be noted that each of the above modules can be implemented by software or hardware, and for the latter, the following implementation manners can be used, but are not limited thereto: all the above modules are located in the same processor; or, the above modules are located in different processors in any combination.

[0065] Embodiment one

[0066] In this embodiment, data modulation is described by taking 2 groups of data blocks, i.e., M=2 as an example.

[0067] There are 2 groups of data blocks, each group of which contains a plurality of continuous data blocks, each data block of the first group contains 96 data (composed of 2 data sub-blocks, each data sub-block contains 48 data), and each data block of the second group contains 128 data. Each group of data blocks corresponds to a sub-band, the sub-carrier spacing of the sub-band corresponding to the first group is 30 kHz, and the sub-carrier spacing of the sub-band corresponding to the second group is 15 kHz. In the first group of data, the same data sequence with a length of 2 is contained in the head of each data sub-block, and the same data sequence with a length of 2 is contained in the tail of each data sub-block, and in the second group of data, the same data sequence with a length of 6 is contained in the head of each data block, and the same data sequence with a length of 6 is contained in the tail of each data block.

[0068] Figure 4 is a schematic diagram of the first data block in each group of multiple data blocks according to an embodiment of the present disclosure (I), as shown in Figure 4, a 96-point and a 128-point Discrete Fourier transform (DFT) is respectively performed on the first data block of the two groups, generating two groups of 96 and 128 data respectively. Then a cyclic prefix and suffix with a length of 6 points are added to the first group of data, and multiplied by a filter coefficient, which can be a discrete value of a root-raised cosine function. A cyclic prefix and suffix with a length of 8 points are added to the second group of data, and multiplied by a filter coefficient, which can be a discrete value of a root-raised cosine function. After the above processing, two groups of data can be obtained, each group having 108 and 144 data respectively.

[0069] The two groups of data are mapped to the positions shown in Figure 4 in the frequency domain, and a 1024-point Inverse Discrete Fourier transform (IDFT) is performed together to generate 1024 time-domain data, which is transmitted on the time-frequency resource.

[0070] Embodiment Two

[0071] In this embodiment, data modulation is described taking 3 groups of data blocks, i.e. M = 3, as an example.

[0072] There are 3 groups of multiple consecutive data blocks, the first group of each data block contains 96 data (composed of 2 data sub-blocks, each data sub-block contains 48 data), the second group of each data block contains 128 data (composed of 2 data sub-blocks, each data sub-block contains 64 data), and the third group of each data block contains 128 data. Each group of data blocks corresponds to a sub-band, the sub-carrier spacing of the sub-bands corresponding to the first and second groups is 30 kHz, and the sub-carrier spacing of the sub-band corresponding to the third group is 15 kHz. Among them, the first part of each data sub-block in the first group of data contains a same data sequence with a length of 2, and the tail part contains a same data sequence with a length of 2, the first part of each data sub-block in the second group of data contains a same data sequence with a length of 3, and the tail part contains a same data sequence with a length of 3, and the first part of each data block in the third group of data contains a same data sequence with a length of 6, and the tail part contains a same data sequence with a length of 6.

[0073] Figure 5 is a schematic diagram of the first data block in each of the three groups of data blocks according to an embodiment of the present disclosure. As shown in Figure 5, a 96-point, 128-point and 128-point DFT is performed on the first data block in each of the three groups, respectively, to generate 96, 128 and 128 data, respectively. Then, a cyclic prefix and a cyclic suffix of 5 points in length are added to the first group of data, respectively, and multiplied by filter coefficients, which can be discrete values of a root-raised cosine function, and one 0 data is added to each end. A cyclic prefix and a cyclic suffix of 6 points in length are added to the second group of data, respectively, and multiplied by filter coefficients, which can be discrete values of a root-raised cosine function, and two 0 data are added to each end. A cyclic prefix and a cyclic suffix of 6 points in length are added to the third group of data, respectively, and multiplied by filter coefficients, which can be discrete values of a root-raised cosine function, and two 0 data are added to each end. After the above processing, 108, 144 and 144 data are obtained in the three groups, respectively.

[0074] The three groups of data are mapped to the positions shown in Figure 5 in the frequency domain, and a 1024-point IDFT is performed to generate 1024 time-domain data, which are transmitted on the time-frequency resources.

[0075] Embodiment Three

[0076] In this embodiment, data modulation is described by taking three groups of data blocks, i.e., M = 3, as an example.

[0077] There are three groups of data blocks, each of which contains a plurality of consecutive data blocks. The first group contains 96 data in each data block (consisting of two data sub-blocks, each of which contains 48 data), the second group contains 128 data in each data block (consisting of two data sub-blocks, each of which contains 64 data), and the third group contains 32 data in each data block. Each group of data blocks corresponds to one sub-band. The sub-carrier spacing of the sub-band corresponding to the first and second groups is 30 kHz, and the sub-carrier spacing of the sub-band corresponding to the third group is 15 kHz. In the first group of data, the beginning of each data sub-block contains a same data sequence of length 2, and the end of each data sub-block contains a same data sequence of length 2. In the second group of data, the beginning of each data sub-block contains a same data sequence of length 3, and the end of each data sub-block contains a same data sequence of length 3. In the third group of data, the beginning of each data block contains a same data sequence of length 2, and the end of each data block contains a same data sequence of length 2.

[0078] Figure 6 is a schematic diagram of the first data block in each of the plurality of data blocks according to an embodiment of the present disclosure (three), as shown in Figure 6, 96, 128 and 32-point DFTs are respectively performed on the first data block of the three groups to generate 96, 128 and 32 data respectively in the three groups. Then a cyclic prefix and a cyclic suffix with a length of 5 points are respectively added to the first group of data, and multiplied by a filter coefficient, which can be a discrete value of a root-raised cosine function, and one 0 data is respectively added at both ends. A cyclic prefix and a cyclic suffix with a length of 6 points are respectively added to the second group of data, and multiplied by a filter coefficient, which can be a discrete value of a root-raised cosine function, and two 0 data are respectively added at both ends. A cyclic prefix and a cyclic suffix with a length of 1 point are respectively added to the third group of data, and multiplied by a filter coefficient, which can be a discrete value of a root-raised cosine function, and one 0 data is respectively added at both ends. After the above processing, three groups of data can be obtained, each group having 108, 144 and 36 data respectively.

[0079] The three groups of data are mapped to the positions in the frequency domain as shown in Figure 6, and 1024-point IDFT is performed to generate 1024 time-domain data, and the generated 1024 time-domain data are transmitted on the time-frequency resource.

[0080] Embodiment Four

[0081] In this embodiment, data modulation is described taking 2 groups of data blocks, i.e., M = 2 as an example.

[0082] There are 2 groups of multiple consecutive data blocks, each data block in the first group contains 96 data (composed of 2 data sub-blocks, each data sub-block contains 48 data), and each data block in the second group contains 128 data. Each group of data blocks corresponds to a sub-band, the sub-carrier spacing of the sub-band corresponding to the first group is 30 kHz, and the sub-carrier spacing of the sub-band corresponding to the second group is 15 kHz. In the first group of data, the head of each data sub-block contains a same data sequence with a length of 1, and the tail contains a same data sequence with a length of 3, and in the second group of data, the head of each data block contains a same data sequence with a length of 3, and the tail contains a same data sequence with a length of 9.

[0083] Figure 7 is a schematic diagram of the first data block in each of the plurality of data blocks according to an embodiment of the present disclosure (four), as shown in Figure 7, 96 and 128-point DFTs are respectively performed on the first data block of the two groups to generate 96 and 128 data respectively in the two groups. Then a cyclic prefix and a cyclic suffix with a length of 6 points are added to the first group of data, and multiplied by a filter coefficient, which can be a discrete value of a root-raised cosine function. A cyclic prefix and a cyclic suffix with a length of 8 points are added to the second group of data, and multiplied by a filter coefficient, which can be a discrete value of a root-raised cosine function. After the above processing, two groups of data can be obtained, each group having 108 and 144 data respectively.

[0084] The 2 groups of data are mapped at the positions shown in FIG. 7 in the frequency domain, and 1024-point IDFT is performed on the 2 groups of data together to generate 1024 time-domain data, and the generated 1024 time-domain data are transmitted on time-frequency resources.

[0085] Embodiment Five

[0086] In this embodiment, data modulation is described by taking 3 groups of data blocks, i.e., M = 3 as an example.

[0087] There are 3 groups of multiple consecutive data blocks, each data block in the 1st group contains 96 data (composed of 2 data sub-blocks, each data sub-block contains 48 data), each data block in the 2nd group contains 256 data (composed of 4 data sub-blocks, each data sub-block contains 64 data), and each data block in the 3rd group contains 128 data. Each group of data blocks corresponds to one sub-band, the sub-carrier spacing of the sub-band corresponding to the 1st group is 30 kHz, the sub-carrier spacing of the sub-band corresponding to the 2nd group is 60 kHz, and the sub-carrier spacing of the sub-band corresponding to the 3rd group is 15 kHz. In the 1st group of data, the head of each data sub-block contains a same data sequence with a length of 2, and the tail contains a same data sequence with a length of 2. In the 2nd group of data, the head of each data sub-block contains a same data sequence with a length of 3, and the tail contains a same data sequence with a length of 3. In the 3rd group of data, the head of each data block contains a same data sequence with a length of 6, and the tail contains a same data sequence with a length of 6.

[0088] FIG. 8 is a schematic diagram of the first data block in each group of multiple data blocks according to an embodiment of the present disclosure (five). As shown in FIG. 8, 96-point, 256-point, and 128-point DFT are respectively performed on the first data blocks of the 3 groups to generate 96, 256, and 128 data respectively. Then, a cyclic prefix and a cyclic suffix with a length of 5 points are respectively added to the 1st group of data, and the data is multiplied by a filter coefficient, which can be a discrete value of a root-raised cosine function, and 1 0 data is respectively added at both ends. A cyclic prefix and a cyclic suffix with a length of 14 points are respectively added to the 2nd group of data, and the data is multiplied by a filter coefficient, which can be a discrete value of a root-raised cosine function, and 2 0 data is respectively added at both ends. A cyclic prefix and a cyclic suffix with a length of 6 points are respectively added to the 3rd group of data, and the data is multiplied by a filter coefficient, which can be a discrete value of a root-raised cosine function, and 2 0 data is respectively added at both ends. After the above processing, 3 groups of data can be obtained, each group containing 108, 288, and 144 data respectively.

[0089] The 3 groups of data are mapped at the positions shown in FIG. 8 in the frequency domain, and 1024-point IDFT is performed on the 3 groups of data together to generate 1024 time-domain data, and the generated 1024 time-domain data are transmitted on time-frequency resources.

[0090] Embodiment Six

[0091] In this embodiment, the data modulation is described by taking 3 groups of data blocks, i.e., M = 3 as an example.

[0092] There are 3 groups of multiple consecutive data blocks, each data block in the first group contains 96 data (composed of 2 data sub-blocks, each data sub-block contains 48 data), each data block in the second group contains 128 data (composed of 2 data sub-blocks, each data sub-block contains 64 data), and each data block in the third group contains 128 data. Each group of data blocks corresponds to a sub-band, and the sub-carrier spacing of the sub-bands corresponding to the first and second groups is 30 kHz, and the sub-carrier spacing of the sub-band corresponding to the third group is 15 kHz. Among them, the head of each data sub-block in the first group of data contains a same data sequence with a length of 2, and the tail contains a same data sequence with a length of 2, the head of each data sub-block in the second group of data contains a same data sequence with a length of 3, and the tail contains a same data sequence with a length of 3, and the head of each data block in the third group of data contains a same data sequence with a length of 6, and the tail contains a same data sequence with a length of 6.

[0093] FIG. 9 is a schematic diagram of the first data block in each group of multiple data blocks according to an embodiment of the present disclosure (six), as shown in FIG. 9, 96, 128 and 128-point DFTs are respectively performed on the first data blocks of the 3 groups to generate 96, 128 and 128 data respectively. Then, a cyclic prefix and a cyclic suffix with a length of 5 points are respectively added to the first group of data, and multiplied by a filter coefficient, which can be a discrete value of a root raised cosine function, and then 1 zero data is respectively added at both ends. A cyclic prefix and a cyclic suffix with a length of 6 points are respectively added to the second group of data, and multiplied by a filter coefficient, which can be a discrete value of a root raised cosine function, and then 2 zero data are respectively added at both ends. A cyclic prefix and a cyclic suffix with a length of 14 points are respectively added to the third group of data, and multiplied by a filter coefficient, which can be a discrete value of a root raised cosine function, and then 2 zero data are respectively added at both ends. After the above processing, three groups of data can be obtained, each group containing 108, 144 and 160 data respectively.

[0094] The three groups of data are mapped to the positions in the frequency domain as shown in FIG. 9, and 1024-point IDFT is performed together to generate 1024 time-domain data, and the generated 1024 time-domain data are transmitted on the time-frequency resource.

[0095] Embodiment Seven

[0096] In this embodiment, the data modulation is described by taking 3 groups of data blocks, i.e., M = 3 as an example.

[0097] There are three groups of multiple continuous data blocks, each data block in the first group contains 128 data (consisting of two data sub-blocks, each data sub-block contains 64 data), each data block in the second group contains 128 data (consisting of two data sub-blocks, each data sub-block contains 64 data), and each data block in the third group contains 128 data. Each group of data blocks corresponds to one sub-band, the sub-carrier spacing of the sub-band corresponding to the first and second groups is 30 kHz, and the sub-carrier spacing of the sub-band corresponding to the third group is 15 kHz. Among them, the head of each data sub-block in the first group of data contains a same data sequence with a length of 2, and the tail contains a same data sequence with a length of 2, the head of each data sub-block in the second group of data contains a same data sequence with a length of 3, and the tail contains a same data sequence with a length of 3, and the head of each data block in the third group of data contains a same data sequence with a length of 6, and the tail contains a same data sequence with a length of 6.

[0098] Figure 10 is a schematic diagram of the first data block in each group of multiple data blocks according to an embodiment of the present disclosure (seven), as shown in Figure 10, 128, 128 and 128 point DFTs are respectively performed on the first data blocks of the three groups to generate three groups of 128, 128 and 128 data respectively. Then, a cyclic prefix and suffix with a length of 6 points are respectively added to the three groups of data, and the data are multiplied by filter coefficients which can be discrete values of a root raised cosine function, and then 2 0 data are respectively added at both ends. After the above processing, three groups of data can be obtained, each group containing 144, 144 and 144 data respectively.

[0099] The three groups of data are mapped to the positions shown in Figure 10 in the frequency domain, and 1024 point IDFT is performed together to generate 1024 time domain data, and the generated 1024 time domain data are transmitted on the time-frequency resource.

[0100] Embodiment eight

[0101] In this embodiment, data modulation is described taking three groups of data blocks, i.e., M = 3 as an example.

[0102] There are three groups of multiple continuous data blocks, each data block in each of the three groups contains 128 data. Each group of data blocks corresponds to one sub-band, and the sub-carrier spacing of the corresponding sub-band is 15 kHz. Among them, the head of each data block in each group of data contains a same data sequence with a length of 6, and the tail contains a same data sequence with a length of 6.

[0103] Figure 11 is a schematic diagram of the first data block in each group of multiple data blocks according to an embodiment of the present disclosure (eight), as shown in Figure 11, 128, 128 and 128-point DFTs are respectively performed on the first data block of the three groups to generate three groups of 128, 128 and 128 data respectively. Then a cyclic prefix and a cyclic suffix with a length of 6 points are respectively added to the three groups of data, and the data are multiplied by filter coefficients which can be discrete values of a root raised cosine function, and then 2 0 data are respectively added at both ends. After the above processing, three groups of data can be obtained, each group having 144, 144 and 144 data respectively.

[0104] The three groups of data are mapped to the positions shown in Figure 11 in the frequency domain, and 1024-point IDFT is performed together to generate 1024 time-domain data, and the generated 1024 time-domain data are transmitted on the time-frequency resource.

[0105] Embodiment Nine

[0106] In this embodiment, any one of the above embodiments one to eight can be used as a basis.

[0107] Figure 12 is a schematic diagram of digital-to-analog conversion according to an embodiment of the present disclosure, as shown in Figure 12, digital-to-analog conversion (Digital-to-Analog Converter, referred to as DAC for short) and radio frequency digital-to-analog conversion (Radio Frequency Digital-to-Analog Converter, referred to as RF for short) are performed on the 1024 time-domain data generated in any one of the above embodiments, and then the 1024 time-domain data are transmitted on a radio frequency link.

[0108] The embodiment of the present disclosure also provides a computer readable storage medium, and the computer readable storage medium stores a computer program, wherein the computer program is configured to execute the steps in any one of the above method embodiments when running.

[0109] In one exemplary embodiment, the above computer readable storage medium can include but is not limited to: a U disk, a read-only memory (Read-Only Memory, referred to as ROM for short), a random access memory (Random Access Memory, referred to as RAM for short), a mobile hard disk, a magnetic disk or an optical disk and various media that can store computer programs.

[0110] The embodiment of the present disclosure also provides an electronic device, which comprises a memory and a processor, the memory stores a computer program, and the processor is configured to execute the computer program to perform the steps in any one of the above method embodiments.

[0111] In one example embodiment, the electronic device described above can further include a transmission device connected to the processor, and an input / output device connected to the processor.

[0112] Embodiments of the present disclosure also provide a computer program product comprising a computer program which, when executed by a processor, implements the steps of any of the method embodiments described above.

[0113] The specific examples in the present embodiment can refer to the examples described in the above embodiments and exemplary implementation manners, which will not be described herein again.

[0114] Obviously, those skilled in the art should understand that the modules or steps of the present disclosure described above can be realized by general computing devices, which can be concentrated on a single computing device or distributed on a network composed of multiple computing devices, which can be realized by program codes executable by the computing devices, so that they can be stored in storage devices and executed by the computing devices, and in some cases, the steps shown or described can be executed in different order, or they can be manufactured into individual integrated circuit modules, or multiple modules or steps among them can be manufactured into a single integrated circuit module. Thus, the present disclosure is not limited to any specific combination of hardware and software.

[0115] The above merely describes the preferred embodiments of the present disclosure and is not intended to limit the present disclosure. Those skilled in the art can make various modifications and changes to the present disclosure. Any modification, equivalent replacement, improvement, etc. within the principles of the present disclosure shall be included in the protection scope of the present disclosure.

Claims

1. A data modulation method, comprising: In each of the M groups, L(m) consecutive data blocks, one data block in each of the M groups is subjected to N(m) point discrete Fourier transform to generate N(m) data in each of the M groups, and then the total N(m) data generated in the M groups are subjected to N(m) point inverse discrete Fourier transform to generate L(m) data blocks. performing G-point inverse discrete Fourier transform on the data to generate G time-domain data, and transmitting the G time-domain data on a time-frequency resource; In each group of L(m) continuous data blocks, a same first data sequence is contained in the head of each data block, and a same second data sequence is contained in the tail of each data block; M>=2, L(m)>=2, m=1, 2,..., M; N(m) is the number of data contained in each data block, 2. The method of claim 1, wherein, at least one data block of one data in each of the M groups contains a different number of data from other groups.

3. The method of claim 1, wherein, at least one data block of one data in each of the M groups contains a different number of data from other groups.

4. The method of claim 1, wherein, In the M groups, at least one group has L(m) continuous data blocks, each of which contains 2 i data sub-blocks, i is an integer greater than or equal to 1, and the 2 i data sub-blocks contain the same number of data.

5. The method of claim 4, wherein, The 2 i In the two data sub-blocks, the same third data sequence is contained in the head of each data sub-block, and the same fourth data sequence is contained in the tail of each data sub-block.

6. The method of claim 5, wherein, the number of data blocks in each of the M groups is the same.

7. The method of claim 1, wherein, The total number of generated The G-point inverse discrete Fourier transform of the total number of generated the number of data blocks in each of the M groups is the same.

8. The method of claim 7, wherein, the number of data blocks in each of the M groups is the same. the number of data blocks in each of the M groups is the same.

9. The method of claim 7, wherein, adding P(m) data to each group of data respectively, and then adding 0, wherein P(m) > = 0. adding P(m) data to each group of data respectively, and then adding 0, wherein P(m) > = 0.

10. The method of claim 9, wherein, adding P(m) data to each group of data respectively, and then adding 0, wherein P(m) > = 0.

11. The method of claim 1, wherein, adding P(m) data to each group of data respectively, and then adding 0, wherein P(m) > = 0. adding P(m) data to each group of data respectively, and then adding 0, wherein P(m) > = 0. adding P(m) data to each group of data respectively, and then adding 0, wherein P(m) > = 0. the filter coefficient is a discrete value of a root raised cosine function. a second execution module configured to execute the generated total the filter coefficient is a discrete value of a root raised cosine function. the filter coefficient is a discrete value of a root raised cosine function. In each group of L(m) continuous data blocks, a same first data sequence is contained in the head of each data block, and a same second data sequence is contained in the tail of each data block; M>=2, L(m)>=2, m=1, 2,..., M; N(m) is the number of data contained in each data block, 13. A computer-readable storage medium having stored therein a computer program, wherein, the filter coefficient is a discrete value of a root raised cosine function. the filter coefficient is a discrete value of a root raised cosine function. 12.A data modulation apparatus, comprising: a first execution module configured to perform N(m)-point discrete Fourier transform on one data block of each of the M groups respectively to generate N(m) data of each of the M groups in L(m) continuous data blocks of each of the M groups; performing G-point inverse discrete Fourier transform on the data to generate G time-domain data; a transmission module configured to transmit the G time-domain data on a time-frequency resource; the computer program is executed by the processor to realize the steps of the method in any one of claims 1 to 11. 14.An electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to realize the steps of the method in any one of claims 1 to 11. 15.A computer program product, comprising a computer program, wherein the computer program is executed by a processor to realize the steps of the method in any one of claims 1 to 11.

Images