CN118740578A - Data transmission method, electronic device and computer readable medium - Google Patents

Abstract

The present disclosure provides a data transmission method, including: performing group processing on data to be transmitted to obtain N data groups, wherein N is a positive integer greater than 2; performing inverse Fourier transform on the data of each data group to obtain N groups of first data sequences; performing processing on the N groups of the first data sequences to obtain N groups of second data sequences, wherein the processing of the first data sequence of the edge group in the N groups of the first data sequences includes adding a soft cyclic prefix to the first data sequence; performing inverse Fourier transform on the N groups of the second data sequences to obtain a time domain data sequence; and transmitting the time domain data sequence. The present disclosure also provides an electronic device and a computer-readable medium.

Description

Data transmission method, electronic device and computer readable medium

Technical Field

The present disclosure relates to the field of communication technology, and in particular, to a data transmission method, an electronic device and a computer-readable medium.

Background Art

Long Term Evolution (LTE) technology is the fourth generation (4G) of wireless cellular communication technology. LTE uses Orthogonal Frequency Division Multiplexing (OFDM) technology. The time-frequency resources composed of subcarriers and OFDM symbols constitute the wireless physical time-frequency resources of the LTE system. At present, OFDM technology has been widely used in wireless communications. Due to the use of cyclic prefix (CP), the CP-OFDM system can solve the multipath delay problem well and divide the frequency selective channel into a set of parallel flat channels, which greatly simplifies the channel estimation method and has a higher channel estimation accuracy.

The fifth generation new radio (5G NR) communication technology still uses CP-OFDM as the basic waveform, and different numerologies can be used between two adjacent sub-bands. In order to avoid destroying the orthogonality between subcarriers and reduce interference, it is necessary to insert a protection bandwidth between two transmission bands with different numerologies.

The frequency bands used by future 6G services will span a wide range, and the deployment methods will also be diverse. Not only will multi-bandwidth channels be required, but also waveform solutions that meet different scenarios will be required. The independent implementation of each waveform solution will increase the cost of base stations/terminals. How to design a unified waveform architecture, flexibly integrate multiple waveforms, how to flexibly support applications with different channel bandwidths, and how to eliminate interference between multiple sub-bands to improve spectrum efficiency are all issues that need to be addressed.

Summary of the invention

The embodiments of the present disclosure provide a data transmission method, an electronic device, and a computer-readable medium.

As a first aspect of the present disclosure, a data transmission method is provided, comprising: performing group processing on data to be transmitted to obtain N data groups, wherein N is a positive integer greater than 2; performing inverse Fourier transform on the data of each of the data groups, respectively, to obtain N groups of first data sequences; performing processing on the N groups of the first data sequences, respectively, to obtain N groups of second data sequences, wherein processing of the first data sequence of an edge group in the N groups of the first data sequences comprises adding a soft cyclic prefix to the first data sequence; performing inverse Fourier transform on the N groups of the second data sequences, to obtain a time domain data sequence; and transmitting the time domain data sequence.

As a second aspect of the present disclosure, a data transmission method is provided, including:

Divide the data to be transmitted into N data groups according to N frequency domain resource blocks, wherein the number of subcarriers respectively included in the N frequency domain resource blocks is k(n), wherein N is a positive integer greater than 2, n=1, 2, ..., N, the N frequency domain resource blocks are continuous in the frequency domain, the spectrum bandwidths of the non-edge frequency domain resource blocks are equal, and the spectrum bandwidth of the initial resource block corresponding to the edge frequency domain resource block is smaller than the spectrum bandwidth of the non-edge frequency domain resource block;

Performing inverse Fourier transform on the data corresponding to each subcarrier of each frequency domain resource block respectively to obtain N groups of first data sequences;

Performing inverse Fourier transform on the N groups of the first data sequences to obtain a time domain data sequence;

The time domain data sequence is transmitted.

As a third aspect of the present disclosure, an electronic device is provided, including:

one or more processors;

A memory having one or more programs stored therein, when the one or more programs are executed by the one or more processors, the one or more processors implement the data transmission method.

As a fourth aspect of the present disclosure, a computer-readable medium is provided, on which a computer program is stored, and when the program is executed by a processor, the data transmission method is implemented.

In the data transmission method provided by the present disclosure, the data to be transmitted is firstly grouped and processed to obtain N data groups. In view of the fact that the spectrum bandwidth of the edge group is smaller than the spectrum bandwidth of other groups, in order to reduce out-of-band leakage, after the N data groups are subjected to inverse Fourier transform to obtain N groups of first data sequences, when the N groups of first data sequences are processed, a soft cyclic prefix is added to the first data sequence of the edge group. After adding a soft CP to the first data sequence of the edge group and obtaining the corresponding second data sequence, the second data sequence corresponding to the edge group can be inverse Fourier transformed together with the second data sequences of other non-edge groups, so as to ensure the uniformity of the parameters of the multi-phase filter when performing subsequent filtering operations. Since the parameters of the multi-phase filter are unified, multiple waveforms can be fused together, and there is no need to deploy each waveform separately, thereby reducing the cost of base stations and terminals.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG1 is a flow chart of an implementation of a data transmission method provided by the present disclosure;

FIG2 is a flow chart of an implementation of step S110;

FIG3 is a flow chart of an implementation of step S140;

FIG4 is a flow chart of an implementation of step S142;

FIG5 is a flow chart of an implementation of step S142b;

FIG6 is a flow chart of another implementation of step S142b;

FIG7 is a schematic flow chart of a data transmission method provided in the second aspect of the present disclosure;

FIG8 is a module diagram of an embodiment of an electronic device provided by the present disclosure;

FIG9 is a schematic diagram of a computer-readable medium provided by the present disclosure;

FIG10 is a schematic diagram of a data transmission method provided in Example 1;

FIG11 is a schematic diagram of a data transmission method provided in Example 2;

FIG12 is a schematic diagram of a data transmission method provided in Example 3;

FIG13 is a schematic diagram of a data transmission method provided in Example 4;

FIG14 is a schematic diagram of a data transmission method provided in Example 5;

FIG15 is a schematic diagram of a data transmission method provided in Example 6;

FIG16 is a schematic diagram of a data transmission method provided in Example 7;

FIG17 is a schematic diagram of a data transmission method provided in Example 8;

FIG. 18 is a schematic diagram of the data transmission method provided in Example 9.

DETAILED DESCRIPTION

In order to enable those skilled in the art to better understand the technical solution of the present disclosure, the data transmission method, electronic device and computer-readable storage medium provided by the present disclosure are described in detail below in conjunction with the accompanying drawings.

Example embodiments will be described more fully below with reference to the accompanying drawings, but the example embodiments may be embodied in different forms and should not be construed as limited to the embodiments set forth herein. On the contrary, the purpose of providing these embodiments is to make the present disclosure thorough and complete and to enable those skilled in the art to fully understand the scope of the present disclosure.

In the absence of conflict, the various embodiments of the present disclosure and the various features therein may be combined with each other.

As used herein, the term "and/or" includes any and all combinations of one or more of the associated listed items.

The terms used herein are only used to describe specific embodiments and are not intended to limit the present disclosure. As used herein, the singular forms "a", "an" and "the" are also intended to include the plural forms, unless the context clearly indicates otherwise. It will also be understood that when the terms "comprising" and/or "made of" are used in this specification, the presence of the features, wholes, steps, operations, elements and/or components is specified, but the presence or addition of one or more other features, wholes, steps, operations, elements, components and/or groups thereof is not excluded.

Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by those of ordinary skill in the art. It will also be understood that terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with their meaning in the context of the relevant art and the present disclosure, and will not be interpreted as having an idealized or overly formal meaning unless explicitly defined as such herein.

As a first aspect of the present disclosure, a data transmission method is provided. As shown in FIG1 , the data transmission method includes:

In step S110, the data to be transmitted is grouped to obtain N data groups, where N is a positive integer greater than 2;

In step S120, inverse Fourier transform is performed on the data of each data group to obtain N groups of first data sequences;

In step S130, N groups of the first data sequences are processed respectively to obtain N groups of second data sequences, wherein the processing of the first data sequences of the edge group in the N groups of the first data sequences includes adding a soft cyclic prefix to the first data sequences;

In step S140, inverse Fourier transform is performed on the N groups of the second data sequences to obtain a time domain data sequence;

In step S150, the time domain data sequence is transmitted.

In the data transmission method provided by the present disclosure, the data to be transmitted is first grouped and processed to obtain N data groups. In view of the fact that the spectrum bandwidth of the edge group is smaller than the spectrum bandwidth of other groups, in order to reduce out-of-band leakage, after the N data groups are subjected to inverse Fourier transform to obtain N groups of first data sequences, when the N groups of first data sequences are processed, a soft cyclic prefix is added to the first data sequence of the edge group. After adding a soft CP to the first data sequence of the edge group and obtaining the corresponding second data sequence, the second data sequence corresponding to the edge group can be inverse Fourier transformed together with the second data sequences of other non-edge groups, so as to ensure the uniformity of the multi-phase filter parameters when performing subsequent filtering operations. Since the parameters of the multi-phase filter are unified, multiple waveforms can be fused together, and there is no need to deploy each waveform separately, thereby reducing the cost of base stations and terminals.

In the present disclosure, "soft cyclic prefix" refers to the cyclic prefix in the usual sense. There are two types of cyclic prefixes in the usual sense, one is a normal cyclic prefix and the other is an extended cyclic prefix. In the present application, the power of the "soft cyclic prefix" is lower than that of the normal cyclic prefix and the extended cyclic prefix.

In the present disclosure, there is no special limitation on how to process the first data sequence of the non-edge group. As an optional implementation, the processing of the first data sequence of the non-edge group in the N groups of the first data sequences includes: adding cyclic prefixes to the first data sequences of the non-edge group in the N groups of the first data sequences, respectively, to obtain the second data sequence of the non-edge group. Of course, the present disclosure is not limited to this, and will be described in detail below, which will not be repeated here.

As an optional implementation manner, for the first data sequence of the edge group, the power of the soft CP added to the first data sequence slowly decreases at the edge of the soft CP.

In order to achieve the above “the power of the added soft CP slowly decreases at the edge of the soft CP”, optionally, for the first data sequence of the edge group, adding a soft cyclic prefix to the first data sequence includes:

adding a cyclic prefix to the first data sequence of the edge group;

performing a drop operation on a header portion of a cyclic prefix of the first data sequence added to an edge group so that the header portion is formed into a first drop portion;

The soft cyclic prefix is formed by using the cyclic prefix including the first descending part, and a corresponding second data sequence is obtained.

In the present disclosure, there is no special limitation on how to use the cyclic prefix including the first descending part to form the soft cyclic prefix. For example, the cyclic prefix that has undergone the header portion descending operation can be directly used as the soft cyclic prefix. Of course, the present disclosure is not limited to this. As another optional implementation, the use of the cyclic prefix including the first descending part to form the soft cyclic prefix and obtain the corresponding second data sequence includes:

Performing a descending operation using a portion of a cyclic suffix of a first data sequence of an edge group in a previous symbol to obtain a second descending portion, wherein a length of the portion of the cyclic suffix of the first data sequence of the edge group in the previous symbol is the same as a length of a header portion of a cyclic prefix of the first data sequence added to the edge group;

The first descending portion and the second descending portion are superimposed so that the cyclic prefix of the first data sequence added to the edge group is formed into the soft cyclic prefix, and a corresponding second data sequence is obtained.

As an optional implementation manner, performing a drop operation on a header portion of a cyclic prefix of the first data sequence added to an edge group includes:

A root raised cosine filter function is used to perform a point multiplication operation on a head portion of a cyclic prefix of the first data sequence added to an edge group.

As an optional implementation, the header portion of the cyclic prefix of the first data sequence may refer to the first n data of the cyclic prefix. In the present disclosure, there is no special limitation on the specific value of n. For example, when the cyclic prefix is 72 points (i.e., short CP), n may be 36. When the cyclic prefix is 80 points (i.e., long CP), n may be 40.

As an optional implementation, the use of a root raised cosine filter function to perform a point multiplication operation on the header part of the cyclic prefix of the first data sequence added to the edge group may include: multiplying the header part of the cyclic prefix with a coefficient, where the coefficient is the left descending sidelobe of the root raised cosine function.

The step of performing a descending operation on the part of the cyclic suffix of the first data sequence of the edge group in the previous symbol includes: performing a point multiplication operation on the part of the cyclic suffix of the first data sequence of the edge group in the previous symbol using a root raised cosine function.

As an optional implementation, the portion of the cyclic suffix of the first data sequence corresponding to the edge group in the previous symbol may be the last n data of the previous symbol. The point multiplication operation of the portion of the cyclic suffix of the first data sequence corresponding to the edge group in the previous symbol using the root raised cosine function may include: multiplying the cyclic suffix with a coefficient, where the coefficient is a right descending sidelobe of the root raised cosine function.

In the present disclosure, the basis for grouping the data to be transmitted in step S110 is not particularly limited. As an optional implementation, the data groups to be transmitted can be divided according to the frequency domain resource blocks corresponding to the data groups to be transmitted, and the N data groups correspond to N different frequency domain resource blocks. This implementation will be described in detail below and will not be repeated here.

In the present disclosure, there is no special limitation on which groups of the N groups of first data sequences are edge groups. As long as the first data sequence is located at the end of the N groups of first data sequences, it can be called the first data sequence of the edge group.

As an optional implementation, the first data sequence of the edge group includes the first data sequences of the first a groups among the N groups of the first data sequences, where a is a positive integer, 1≤a＜N/2. That is, the first data sequences of the first a groups are the first data sequences of the edge group.

As another optional implementation, the first data sequence of the edge group includes the first data sequence of the last b groups of N groups of the first data sequences, where b is a positive integer and 1≤b＜N/2. That is, the first data sequence of the last b groups is the first data sequence of the edge group.

As another optional implementation, the first data sequence of the first group a and the first data sequence of the second group b are both first data sequences of edge groups.

In the present disclosure, there is no special limitation on the values of a and b. The values of a and b can be determined according to the amount of data to be transmitted. As an optional implementation, a=1, b=1. That is, the first data sequence of the edge group is the first data sequence of the first group, and/or the first data sequence of the Nth group.

As described above, the spectrum bandwidth of the edge group is smaller than the spectrum bandwidth of other groups. Accordingly, as shown in FIG2 , the data to be transmitted is grouped to obtain N data groups, including:

In step S111, the data to be transmitted is divided to obtain N initial groups, wherein the amount of data in the initial groups of non-edge groups is an integer power of 2 (for example, it can be expressed as 2 ⁱ , wherein i is a positive integer, and for different initial groups, the value of i can be the same or different), and the amount of data in the initial groups of edge groups is not equal to an integer power of 2;

In step S112, the initial groups whose data amounts are not equal to an integer power of 2 are padded with zeros to obtain N data groups, wherein the data amounts of the N data groups are all integer powers of 2.

In the present disclosure, for N initial groups, the data volume of the edge group may be smaller than that of the non-edge group. In order to perform subsequent filtering operations, it is necessary to fill zeros for the initial groups whose data volume is not equal to an integer power of 2, so that the initial groups of the edge groups are formed as "data groups". In the present disclosure, the "initial groups" of the non-edge groups do not need to be filled with zeros to form the "data groups" of the non-edge groups. Therefore, after step S112, N data groups can be obtained, and the number of "data" in each data group is an integer power of 2. Of course, for the edge groups, the "data" here includes the padded zeros.

In the data transmission method provided by the present disclosure, any number of data to be transmitted can be divided into N groups, and after zero padding, the number of data in each group can be the same, and the data to be transmitted can be kept continuous, and the number of IFFT points in each group can be equal. This ensures that the number of IFFT points in each subsequent serial is the same.

As described above, for different data groups, the amount of data may be the same or different. As an optional embodiment, the amount of data in the initial group of the non-edge group is the same (correspondingly, the amount of data in the data group of the non-edge group is also the same). Of course, the disclosure is not limited to this, and the amount of data in the initial group of the non-edge group may also be different (correspondingly, the amount of data in the data group of the non-edge group is also different). That is to say, in the case of the amount of data in the initial group of the non-edge group, the ratio of the amount of data in the initial group of the non-edge group is an integer power of 2.

For the case where the amount of data in the non-edge groups is different, in the step of separately processing the N groups of the first data sequences, for the first data sequence of the non-edge group, when the amount of data in the first data sequences of two adjacent non-edge groups is different, a soft cycle prefix is added to the first data sequence of the non-edge group with less data.

It should be noted that if the data in the initial group of the edge group already satisfies an integer power of 2, there is no need to pad the data of the initial group of the edge group with zeros.

As an optional implementation, in the step of performing inverse Fourier transform on each of the data groups respectively, the number of points for performing inverse Fourier transform on each of the data groups is less than the total number of data to be transmitted.

Furthermore, in the step of performing inverse Fourier transform on the data of each of the data groups, the number of points of the inverse Fourier transform is an integer power of 2.

Optionally, in the step of performing inverse Fourier transform on each of the data groups, the inverse Fourier transform is 2 times oversampled, and the data starting point of the inverse Fourier transform on each of the data groups is in the corresponding data group.

In the present disclosure, there is no particular limitation on how to specifically perform step S140. As an optional implementation, as shown in FIG3 , step S140 may include:

In step S141, inverse Fourier transform is performed on N groups of the second data sequences to obtain multiple groups of third data sequences;

In step S142, a filtering operation is performed on the multiple groups of third data sequences to obtain the time domain data sequence.

As described above, the CP of the second data sequence of the edge group is a soft CP. In step S141, the second data sequence corresponding to the edge group is inverse Fourier transformed together with the second data sequences of other non-edge groups, so as to ensure the uniformity of the multi-phase filter parameters during the subsequent filtering operation (i.e., step S142).

As an optional implementation, in the step of performing inverse Fourier transform on N groups of the second data sequences, the inverse Fourier transform is an oversampled inverse Fourier transform with a point number greater than N.

Specifically, performing inverse Fourier transform on N groups of the second data sequences includes:

Extracting data from the N groups of the second data sequences respectively to obtain a plurality of third data sequences, each of the third data sequences comprising N data respectively from the N groups of the second data sequences;

Perform inverse Fourier transform on each of the plurality of third data sequences.

As an optional implementation, extracting data from N groups of the second data sequences respectively to obtain multiple third data sequences can specifically include: N groups of second data sequences form N rows, and then taking out data in columns, with every N data forming a group of third data sequences; performing an inverse Fourier transform on each N data taken out (i.e., each group of third data sequences).

As described above, as an optional implementation, N groups of first data sequences are added with cyclic prefixes to obtain N groups of second data sequences.

In order to allow the data to be sent to be sent together with other data, further optionally, in the step of performing inverse Fourier transform on the N groups of second data sequences, the data participating in the inverse Fourier transform also includes other groups of data sequences, and the other groups of data sequences do not belong to the above-mentioned N groups of second data sequences.

In the present disclosure, there is no special limitation on how to obtain the "other data sequence". As an optional implementation, the "other data sequence" can be directly formed by using other data expected to be transmitted together with the data to be transmitted.

The other set of data sequences can also be obtained in the following manner:

Performing inverse Fourier transform on the other data groups to obtain a first other data sequence;

A cyclic prefix is added to the first other data sequence to obtain the other group of data sequences.

In the present disclosure, there is no special limitation on how to perform filtering operations on multiple sets of third data sequences. Optionally, as shown in FIG4 , the filtering operations are performed on multiple sets of third data sequences to obtain time domain data sequences, including:

In step S142a, multiple groups of the third data sequences are serially linked;

In step S142b, a filtering operation is performed on the serially linked data sequence to obtain the time domain data sequence.

In the present disclosure, there is no special limitation on how to perform the filtering operation in step S142b. Optionally, in the step of performing the filtering operation on the serially linked data sequence, the filtering operation includes a multi-phase filtering operation.

Specifically, as shown in FIG5 , the filtering operation is performed on the serially linked data sequence to obtain the time domain data sequence, including:

In step S142b1, repeating and windowing operations are performed on multiple groups of third data sequences respectively;

In step S142b2, staggered overlap addition is performed on the multiple groups of third data sequences that have undergone the repetition and windowing operations to obtain the time domain sequence.

As another optional implementation, as shown in FIG6 , the filtering operation is performed on the serially linked data sequence to obtain the time domain data sequence, including:

In step S142b3, down-sampling is performed on the N groups of third data sequences to obtain N parallel data groups;

In step S142b4, a filter is used to perform filtering operations on the N parallel data groups respectively;

In step S142b5, upsampling and addition operations are performed on the N data groups obtained after the filtering operation to obtain the time domain data sequence.

As described above, the data to be transmitted can be grouped according to the frequency domain resource blocks. That is, N data groups are transmitted in N frequency domain resource blocks respectively. Accordingly, the number of subcarriers contained in each of the N resource blocks is k(n), and the N frequency domain resource blocks are continuous in the frequency domain. The k(n) of the non-edge resource blocks is 2 to the power of i, where i is a positive integer and n=1, 2, ..., N.

In the disclosed embodiment, step S120 may be specifically performed as follows: performing inverse Fourier transform on the data to be transmitted on the k(n) subcarriers of each frequency domain resource block respectively to form N groups of time domain data sequences (ie, N groups of first data sequences).

In the disclosed embodiment, step S130 may be specifically performed as follows: first data sequences after inverse Fourier transformation of the data to be transmitted on k(n) subcarriers of N frequency domain resource blocks are processed separately to obtain N groups of second data sequences.

In the implementation of the present disclosure, step S140 may be specifically performed as follows: performing an inverse Fourier transform on the second data sequences corresponding to the N frequency domain resource blocks to obtain multiple groups of third data sequences.

In the present disclosure, there is no special limitation on the spectrum of each frequency domain resource block. Optionally, the spectrum intervals of non-edge adjacent frequency domain resource blocks are equal. Further, optionally, the spectrum bandwidths of non-edge frequency domain resource blocks are equal.

As an optional implementation manner, the number of subcarriers in non-edge frequency domain resource blocks is equal.

As another optional implementation, the numbers of subcarriers in non-edge frequency domain resource blocks may be unequal. Specifically, the ratio of the numbers of subcarriers in non-edge frequency domain resource blocks satisfies a power of 2.

As an optional implementation manner, in the N frequency domain resource blocks, subcarrier spacing is equal.

As another optional implementation, in the N frequency domain resource blocks, the subcarrier spacings are not equal, and the ratio of the subcarrier spacings of different frequency domain resource blocks satisfies a power of 2.

As an optional implementation, the subcarriers of the edge frequency domain resource block include initial subcarriers and zeroed subcarriers, the number of the initial subcarriers is less than the number of subcarriers of other frequency domain resource blocks having the same subcarrier spacing as the edge frequency domain resource block, and the sum of the number of initial subcarriers and the number of zeroed subcarriers of the edge frequency domain resources is the same as the number of subcarriers of other frequency domain resource blocks having the same subcarrier spacing as the edge frequency domain resource block.

The number of subcarriers in the edge resource block is less than the number of subcarriers in other resource blocks with the same subcarrier spacing as the edge resource block. The advantage is that spectrum resources with any number of subcarriers can be divided into N frequency domain resource blocks. After adding zero subcarriers, the spectrum bandwidth of the N frequency domain resource blocks can be equal, and the N frequency domain resource blocks are kept continuous, which can ensure the normal operation of each subsequent serial inverse Fourier transform.

Optionally, the zeroed subcarriers in the edge frequency domain resource blocks are outside the N frequency domain resource blocks.

Optionally, the spectrum bandwidth of the edge frequency domain resource blocks not supplemented with zeroed subcarriers is smaller than the spectrum bandwidth of the non-edge frequency domain resource blocks.

Optionally, in the step of performing inverse Fourier transform on the data of each of the data groups, inverse Fourier transform is performed on the data to be transmitted on the k(n) subcarriers of each resource block, and any one of the following conditions is met:

The zero-frequency positions of the inverse Fourier transform corresponding to each frequency domain resource block are different in the frequency domain;

The zero frequency position of the inverse Fourier transform corresponding to each frequency domain resource block is respectively within the k(n) subcarrier frequency range of each frequency domain resource block;

The zero-frequency position of the inverse Fourier transform corresponding to each frequency domain resource block is respectively on one of the k(n) subcarriers of each frequency domain resource block.

It should be pointed out that, for different frequency domain resource blocks, the value of n may be the same or different.

Optionally, for the first data sequences of the non-edge groups in the N groups of the first data sequences, the processing may include:

Adding a guard interval GI to each of the first data sequences of the edge group, where the guard interval GI is empty data;

The filter time domain data is used to perform a linear convolution operation on the first data sequence to which the guard interval GI is added and the data sequence of the adjacent symbols in the time domain to obtain a corresponding second data sequence.

As a second aspect of the present disclosure, a data transmission method is provided. As shown in FIG7 , the data transmission method includes:

In step S210, the data to be transmitted is divided into N data groups according to N frequency domain resource blocks, wherein the number of subcarriers respectively included in the N frequency domain resource blocks is k(n), wherein N is a positive integer greater than 2, n=1, 2, ..., N, the N frequency domain resource blocks are continuous in the frequency domain, the spectrum bandwidths of the non-edge frequency domain resource blocks are equal, and the spectrum bandwidth of the initial resource block corresponding to the edge frequency domain resource block is smaller than the spectrum bandwidth of the non-edge frequency domain resource block;

In step S220, inverse Fourier transform is performed on the data corresponding to each subcarrier of each frequency domain resource block to obtain N groups of first data sequences;

In step S230, inverse Fourier transform is performed on the N groups of the first data sequences to obtain a time domain data sequence;

In step S240, the time domain data sequence is transmitted.

In the data transmission method, the data to be transmitted are transmitted using N frequency domain resource blocks. The spectrum bandwidth of the initial resource block corresponding to the edge frequency domain resource block is smaller than the spectrum bandwidth of the non-edge frequency domain resource block, so that the spectrum resources of any number of subcarriers can be divided into N continuous resource blocks, so that each subsequent serial inverse Fourier transform can be performed normally.

In the present disclosure, the values of n for different frequency domain resource blocks may be the same or different.

As an optional implementation, the spectrum resources may be divided into N consecutive initial resource blocks, wherein the spectrum bandwidth of the edge initial resource blocks is smaller than that of the non-edge initial resource blocks. The edge initial resource blocks are processed in the same manner to obtain edge frequency domain resource blocks. The non-edge initial resource blocks may be directly used as non-edge frequency domain resource blocks.

In the present disclosure, there is no special limitation on how to process the initial resource blocks at the edge. As an optional implementation, the frequency domain resource blocks at the edge can be obtained by supplementing the zeroed subcarriers to the initial resource blocks at the non-edge. In other words, the subcarriers of the frequency domain resource blocks at the edge include zeroed subcarriers and initial subcarriers corresponding to the initial frequency domain resource blocks. By supplementing the zeroed subcarriers, the spectrum bandwidth of the frequency domain resource blocks at the edge can be equal to the spectrum bandwidth of the frequency domain resource blocks at the non-edge.

In the present disclosure, there is no special limitation on the edge frequency domain resource blocks, and the first a frequency domain resource blocks and/or the last b frequency domain resource blocks among the N frequency domain resource blocks are edge frequency domain resource blocks. The remaining resource blocks are all non-edge frequency domain resource blocks.

Optionally, a and b can both be 1,

To ensure that the resource blocks are continuous, optionally, the zeroed subcarriers are outside the continuous frequency domains corresponding to the edge initial resource blocks and non-edge frequency domain resource blocks. As an optional implementation, zeroed subcarriers may be added outside the initial resource blocks.

As an optional implementation, the number of subcarriers k(n) of the non-edge initial frequency domain resource block is an integer power of 2, and the number of subcarriers of the edge initial resource block is less than the number of subcarriers of other frequency domain resource blocks having the same subcarrier spacing as the edge initial resource block.

Optionally, all frequency domain resource blocks with the same subcarrier spacing include an equal number of subcarriers.

Optionally, in the step of performing inverse Fourier transform on the data corresponding to the k(n) subcarriers of each frequency domain resource block, the inverse Fourier transform is a 2-fold oversampled inverse Fourier transform, and the number of inverse Fourier transform points of all frequency domain resource blocks with the same subcarrier spacing is the same.

Optionally, among the N frequency domain resource blocks, the number of subcarriers of the non-edge frequency domain resource blocks is equal. Of course, the present disclosure is not limited to this. As another optional implementation, among the N final frequency domain resource blocks, the number of subcarriers of different non-edge frequency domain resource blocks may also be different. Specifically, among the N final frequency domain resource blocks, the ratio of the number of subcarriers of different non-edge frequency domain resource blocks satisfies an integer power of 2.

Optionally, the subcarrier spacings of the N frequency domain resource blocks are equal. Of course, the present disclosure is not limited to this. As another optional implementation, the subcarrier spacings of the N frequency domain resource blocks are not equal, and the ratio of the subcarrier spacings of different frequency domain resource blocks satisfies an integer power of 2.

Optionally, performing inverse Fourier transform on data corresponding to each subcarrier of each frequency domain resource block to obtain N groups of first data sequences includes:

Performing inverse Fourier transform on the data corresponding to each subcarrier of each frequency domain resource block to obtain N groups of first initial sequences;

The N groups of first initial sequences are processed to obtain N groups of first data sequences, wherein the processing of the first initial data sequences of the edge groups includes adding a soft CP to the first initial sequences to obtain corresponding first data sequences.

By adding soft CP to the first initial sequence of the edge group, the edge leakage can be reduced.

In the present disclosure, there is no special limitation on how to process the first initial sequence of the non-edge group. Optionally, a CP may be added to the first initial sequence of the non-edge group to obtain a first data sequence of the non-edge group.

As another optional implementation, a soft CP or a GI may be added to the first data sequence of the non-edge group to obtain the first data sequence of the non-edge group.

The soft CP may be obtained in the manner received above.

As a third aspect of the present disclosure, an electronic device is provided, as shown in FIG8 , the electronic device comprising:

One or more processors 101;

The memory 102 stores one or more programs, and when the one or more programs are executed by the one or more processors 101, the one or more processors implement the data transmission method provided by the first aspect and/or the second aspect of the present disclosure.

Optionally, the electronic device may further include one or more I/O interfaces 103 connected between the processor and the memory and configured to implement information interaction between the processor and the memory.

Among them, the processor 101 is a device with data processing capabilities, including but not limited to a central processing unit (CPU) and the like; the memory 102 is a device with data storage capabilities, including but not limited to random access memory (RAM, more specifically SDRAM, DDR, etc.), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory (FLASH); the I/O interface (read-write interface) 103 is connected between the processor 101 and the memory 102, and can realize information interaction between the processor 101 and the memory 102, including but not limited to a data bus (Bus) and the like.

In some embodiments, the processor 101 , the memory 102 , and the I/O interface 103 are connected to each other via a bus 104 , and further connected to other components of the computing device.

As a fourth aspect of the present disclosure, as shown in FIG. 9 , a computer-readable medium is provided, on which a computer program is stored, and when the program is executed by a processor, the data transmission method provided by the first aspect and/or the second aspect of the present disclosure is implemented.

Example 1

As shown in FIG. 10 , in this embodiment, the data transmission method includes:

The data sequence to be transmitted is divided into 4 groups to obtain 4 initial groups, the first 3 initial groups each include 1024 data, the fourth initial group includes 204 data, and a total of 273 RBs. The subcarrier spacing of each initial group is 30 kHz.

820 zero subcarriers are added outside the fourth initial group to obtain the fourth data group. The first three initial groups are also three data groups, thus obtaining four data groups.

Perform 2048-point oversampling IFFT on the four data groups respectively to obtain four groups of first data sequences.

In order to reduce out-of-band leakage, a soft CP operation is performed on the first data sequence of the fourth group to obtain the second data sequence of the fourth group. In addition, CP is added to the first three groups of first data sequences respectively to obtain the first three groups of second data sequences.

Sub-band level IFFT and polyphase filtering operations are performed on the four groups of second data sequences to obtain a group of time domain data.

Example 2

As shown in FIG. 11 , in this embodiment, the data transmission method includes:

The data sequence to be transmitted is divided into 4 groups to obtain 4 initial groups, the first 3 initial groups each include 1024 data, the fourth initial group includes 204 data, and a total of 273 RBs. The subcarrier spacing of each initial group is 30 kHz.

820 zero subcarriers are added outside the fourth initial group to obtain the fourth data group. The first three initial groups are also three data groups, thus obtaining four data groups.

Perform 2048-point oversampling IFFT on the four data groups respectively to obtain four groups of first data sequences.

In order to reduce out-of-band leakage, soft CP operations are performed on the first data sequence of the first group and the first data sequence of the fourth group, respectively, to obtain the first data sequence of the second group and the fourth group of second data sequences, respectively, and CP is added to the first data sequence of the second group and the first data sequence of the third group, respectively, to obtain the second data sequence of the second group and the third group of second data sequences;

Sub-band level IFFT and polyphase filtering operations are performed on the four groups of second data sequences to obtain a group of time domain data.

Example 3

As shown in FIG. 12 , in this embodiment, the data transmission method includes:

The data sequence to be transmitted is divided into 4 groups to obtain 4 initial groups, the second initial group and the third initial group each include 1024 data, the first initial group and the fourth initial group each include 614 data, a total of 273 RBs. The subcarrier spacing of each initial group is 30 kHz.

410 zero subcarriers are added to the outer side of the first initial group to obtain the first data group, and 410 zero subcarriers are added to the outer side of the fourth initial group to obtain the fourth data group. Among them, the second initial group is also the second data group, and the third initial group is also the third data group. Therefore, a total of 4 data groups are obtained.

Perform 2048-point oversampling IFFT on the four data groups respectively to obtain four groups of first data sequences.

In order to reduce out-of-band leakage, a soft CP operation is performed on the first data sequence of the first group and the first data sequence of the fourth group, respectively, to obtain the first second data sequence of the first group and the fourth group of second data sequence, and a CP operation is performed on the first data sequence of the second group and the first data sequence of the third group, respectively, to obtain the second second data sequence of the second group and the third group of second data sequence, respectively.

Sub-band level IFFT and polyphase filtering operations are performed on the four groups of second data sequences to obtain a group of time domain data.

Example 4

As shown in FIG. 13 , in this embodiment, the data transmission method includes:

The data sequence to be transmitted is divided into 4 groups to obtain 4 initial groups, the first 3 initial groups each include 1024 data, the fourth initial group includes 204 data, and a total of 273 RBs. The subcarrier spacing of each initial group is 30 kHz.

820 zero subcarriers are added outside the fourth initial group to obtain the fourth data group. The first three initial groups are also three data groups, thus obtaining four data groups.

Perform 2048-point oversampling IFFT on the four data groups respectively to obtain four groups of first data sequences.

The CP is added to the first three groups of first data sequences to obtain the first three groups of second data sequences, wherein the CP length is: 80 points for the long CP and 72 points for the short CP. Either the long CP or the short CP can be added.

Add a soft CP to the 4th group of the first data sequence to obtain the 4th group of the second data sequence. The specific process is: for the soft CP of a symbol (A SYMBOL): the short CP length is 72 points, first take the data of the 72 sampling points after this symbol (the original CP, that is, the CP in the usual sense), and multiply the first 36 sampling points with the coefficient, the coefficient is the left descending sidelobe of the root raised cosine function, recorded as CP1; then multiply the first 36 sampling point data of the previous symbol (the original cyclic suffix CS) with the coefficient, the coefficient is the right descending sidelobe of the root raised cosine function, recorded as CP2, and add it to the first 36 points of CP1, and finally obtain a soft CP with a length of 72, and the average power of the soft CP is the same as the original CP. It should be pointed out that the same treatment is applied to the long CP. Add CP to the first three groups of the first data sequences to obtain the first three groups of the second data sequences.

Sub-band level IFFT and polyphase filtering operations are performed on the four groups of second data sequences to obtain a group of time domain data.

Example 5

As shown in FIG. 14 , in this embodiment, the data transmission method includes:

The data sequence to be transmitted is divided into 4 groups, and 4 initial groups are obtained. The first initial group and the third initial group each include 1024 data, and the first initial group and the fourth initial group each include 614 data, for a total of 273 RBs. The subcarrier spacing of each initial group is 30 kHz.

410 zero subcarriers are added to the outer side of the first initial group to obtain the first data group, and 410 zero subcarriers are added to the outer side of the fourth initial group to obtain the fourth data group. The second initial group and the third data group are also data groups, so that four data groups are obtained.

Perform 2048-point oversampling IFFT on the three data groups respectively to obtain four groups of first data sequences.

Then add GI to the second group of first data sequences to obtain the second group of second data sequences, add GI to the third group of first data sequences to obtain the third group of second data sequences, GI is zero data, GI length: long GI is 80 points, short GI is 72 points. Long GI or short GI can be added. Add soft CP to the first group of first data sequences to obtain the first group of second data sequences, add soft CP to the fourth group of first data sequences to obtain the fourth group of second data sequences, where soft CP length: long soft CP is 80 points, short soft CP is 72 points. Long soft CP or short soft CP can be added.

Sub-band level IFFT and polyphase filtering operations are performed on the four groups of second data sequences to obtain a group of time domain data.

Example 6

As shown in FIG. 15 , in this embodiment, the data transmission method includes:

The data sequence to be transmitted is divided into 4 groups to obtain 4 initial groups. The first initial group includes 388 data, the second initial group includes 512 data, the third initial group includes 1024 data, and the fourth initial group includes 776 data. The subcarrier spacing of each of the first initial group and the second initial group is 30kHz, and the subcarrier spacing of each of the third initial group and the fourth initial group is 15kHz.

124 zero subcarriers are added to the outer side of the first initial group to obtain the first data group, and 248 zero subcarriers are added to the outer side of the fourth group to obtain the second data group. The second initial group is also the second data group, and the third initial group is also the third data group. Therefore, a total of 4 data groups are obtained.

A 1024-point oversampling IFFT is performed on the first data group and the second data group respectively to obtain the first data sequence of the first group and the first data sequence of the second group. A 2048-point oversampling IFFT is performed on the third data group and the fourth data group respectively to obtain the first data sequence of the third group and the first data sequence of the fourth group.

In order to reduce out-of-band leakage and inter-sub-band interference, soft CP operation is added to the four groups of first data sequences to obtain four groups of second data sequences.

For the first group of second data sequences, two adjacent symbol data (represented by symbol 1 and symbol 2 in FIG. 13 ) are concatenated to form data having the same length as the third group of second data sequences and the fourth group of second data sequences; for the second second data sequence, two adjacent symbol data (represented by symbol 1 and symbol 2 in FIG. 13 ) are concatenated to form data having the same length as the third group of second data sequences and the fourth group of second data sequences.

The first group of second data sequences that have undergone symbol addition operations, the second group of second data sequences that have undergone symbol addition operations, the third group of second data sequences, and the fourth group of second data sequences are subjected to subband level IFFT and multi-phase filtering operations to obtain a group of time domain data.

Example 7

As shown in FIG. 16 , in this embodiment, the data transmission method includes:

The data sequence to be transmitted is divided into 4 groups to obtain 4 initial groups, the first 3 initial groups each include 1024 data, the fourth initial group includes 204 data, and a total of 273 RBs. The subcarrier spacing of each group is 30 kHz.

820 zero subcarriers are added outside the fourth initial group to obtain the fourth data group. The first three initial groups are also three data groups, thus obtaining four data groups.

Perform 2048-point oversampling IFFT on the four data groups respectively to obtain four groups of first data sequences.

In order to reduce out-of-band leakage, soft CP operations are performed on the first data sequence of the first group and the first data sequence of the fourth group, respectively, to obtain the second data sequence of the first group and the second data sequence of the fourth group. CP is added to the first data sequence of the second group to obtain the second data sequence of the second group, and CP is added to the first data sequence of the third group to obtain the second data sequence of the third group.

Then, the four groups of second data sequences are subjected to sub-band level IFFT and multi-phase filtering operations together with the data sequences of other groups (with soft CP added) to obtain a group of time domain data.

Among them, the other groups of data can be data after IFFT or data without IFFT, and soft CP can be added to the data sequences of other groups, or soft CP can not be added to the data sequences of other groups. In this embodiment, the data sequences of other groups are data sequences obtained after IFFT and soft CP.

Example 8

As shown in FIG. 17 , in this embodiment, the data transmission method includes:

The data sequence to be transmitted is divided into 4 groups, the first 3 initial groups each include 1024 data, the fourth initial group includes 204 data, a total of 273 RBs, and each initial group contains some reference signals. The subcarrier spacing of each initial group is 30kHz.

820 zero subcarriers are added outside the fourth initial group to obtain the fourth data group. The first three initial groups are also three data groups, thus obtaining four data groups.

Perform 2048-point oversampling IFFT on the four data groups respectively to obtain four groups of first data sequences.

In order to reduce out-of-band leakage, a soft CP is added to the first data sequence of the first group to obtain the first second data sequence, and a soft CP is added to the first data sequence of the fourth group to obtain the fourth group of second data sequence; CP is added to the first data sequence of the second group to obtain the second group of second data sequence, and CP is added to the first data sequence of the third group to obtain the third group of second data sequence.

Sub-band level IFFT and polyphase filtering operations are performed on the four groups of second data sequences to obtain a group of time domain data.

Example 9

As shown in FIG. 18 , in this embodiment, the data transmission method includes:

The data sequence to be transmitted is divided into 4 groups to obtain 4 initial groups, the first 3 initial groups each include 1024 data, the fourth initial group includes 204 data, and a total of 273 RBs. The subcarrier spacing of each group is 30 kHz.

820 zero subcarriers are added outside the fourth initial group to obtain the fourth data group. The first three initial groups are also three data groups, thus obtaining four data groups.

Then, 2048-point oversampling IFFT is performed on the four data groups respectively to obtain four groups of first data sequences.

In order to reduce out-of-band leakage, a soft CP is added to the first data sequence of the first group to obtain the first second data sequence, a soft CP is added to the fourth group of first data to obtain the fourth group of second data sequence, a CP is added to the second group of first data sequence to obtain the second group of second data sequence, and a CP is added to the third group of first data sequence to obtain the third group of second data sequence.

Then, the 4 groups of second data sequences are subjected to inverse Fourier transform, and the process of inverse Fourier transform is as follows: the 4 groups of second data sequences are placed in 4 rows respectively, and then 4 data are taken out according to the columns, and an oversampled 8-point inverse Fourier transform is performed on each of the 4 taken out data to obtain a sub-symbol, and then the sub-symbol is repeatedly expanded by 4 times (sub-symbol 1, sub-symbol 2, ..., sub-symbol n shown in the figure), and a window function is added, and finally 2048 sub-symbols are connected in series in the time domain to form a group of data sequences, wherein the interval of the series connection is 4 points, that is, half the sub-symbol length. This group of data sequences is the time domain data sequence.

The set of data sequences is transmitted on the time-frequency resources.

It will be appreciated by those skilled in the art that all or some of the steps, systems, and functional modules/units in the methods disclosed above may be implemented as software, firmware, hardware, and appropriate combinations thereof. In hardware implementations, the division between the functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed by several physical components in cooperation. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor, or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit. Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or temporary medium). As known to those skilled in the art, the term computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, magnetic disk storage or other magnetic storage devices, or any other medium that can be used to store the desired information and can be accessed by a computer. In addition, it is well known to those skilled in the art that communication media typically contain computer-readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.

Example embodiments have been disclosed herein, and although specific terms are employed, they are used and should be interpreted only in a general illustrative sense and not for limiting purposes. In some instances, it will be apparent to those skilled in the art that, unless otherwise expressly noted, features, characteristics, and/or elements described in conjunction with a particular embodiment may be used alone or in combination with features, characteristics, and/or elements described in conjunction with other embodiments. Therefore, those skilled in the art will appreciate that various changes in form and detail may be made without departing from the scope of the present disclosure as set forth in the appended claims.

Claims (42)

1. A data transmission method, comprising:

Grouping data to be transmitted to obtain N data groups, wherein N is a positive integer greater than 2;

Respectively carrying out inverse Fourier transform on the data of each data group to obtain N groups of first data sequences;

Respectively processing the N groups of first data sequences to obtain N groups of second data sequences, wherein the processing of the first data sequences of the edge groups in the N groups of first data sequences comprises the addition of a soft cyclic prefix to the first data sequences;

Performing inverse Fourier transform on the N groups of second data sequences to obtain time domain data sequences;

Transmitting the time domain data sequence.

2. The data transmission method according to claim 1, wherein the first data sequences of the edge groups comprise first data sequences of a first group a of the first data sequences of N groups and/or first data sequences of a last group b of the first data sequences of N groups, wherein a and b are positive integers, and 1 is less than or equal to a < N/2, and 1 is less than or equal to b < N/2.

3. The data transmission method according to claim 2, wherein the first data sequences of the edge groups comprise a1 st group of first data sequences and/or an N-th group of first data sequences.

4. The data transmission method according to claim 1, wherein in the step of processing the N sets of the first data sequences, respectively, processing the first data sequences of the non-edge group among the N sets of the first data sequences includes: and respectively adding cyclic prefixes to the first data sequences of the non-edge groups in the N groups of the first data sequences to obtain second data sequences of the non-edge groups.

5. The data transmission method of claim 4, wherein adding a soft cyclic prefix to the first data sequence for the first data sequence of an edge group comprises:

adding a cyclic prefix to the first data sequence of an edge group;

Performing a dropping operation on a header portion of a cyclic prefix of the first data sequence added to an edge group such that the header portion is formed as a first dropped portion;

And forming the soft cyclic prefix by using the cyclic prefix comprising the first descending part, and obtaining a corresponding second data sequence.

6. The data transmission method of claim 5, wherein the dropping of the header portion of the cyclic prefix of the first data sequence added to the edge group comprises:

And performing point multiplication operation on the head part of the cyclic prefix of the first data sequence added to the edge group by utilizing a root raised cosine filter function to obtain the first descending part.

7. The data transmission method according to claim 5, wherein the forming the soft cyclic prefix using the cyclic prefix including the first dropping section and obtaining the corresponding second data sequence includes:

Performing a descent operation by using a part of the cyclic suffix of the first data sequence corresponding to the edge group in the previous symbol to obtain a second descent part, wherein the length of the part of the cyclic suffix of the first data sequence corresponding to the edge group in the previous symbol is the same as the length of the head part of the cyclic prefix of the first data sequence added to the edge group;

The first and second dropping parts are superimposed such that the cyclic prefix of the first data sequence added to the edge group is formed as the soft cyclic prefix and a corresponding second data sequence is obtained.

8. The data transmission method as claimed in claim 7, wherein the dropping operation using the part of the cyclic suffix of the first data sequence corresponding to the edge group in the previous symbol comprises:

The part of the previous symbol corresponding to the cyclic suffix of the first data sequence of the edge set is subjected to a dot product operation by using a root raised cosine function.

9. The data transmission method according to claim 1, wherein the grouping processing of the data to be transmitted to obtain N data groups includes:

Dividing the data to be transmitted to obtain N initial groups, wherein the data amount in the initial groups of the non-edge groups is an integer power of 2, and the data amount in the initial groups of the edge groups is not equal to the integer power of 2;

And carrying out zero padding on an initial group of which the data volume is not equal to the integer power of 2 to obtain N data groups, wherein the data volume of the N data groups is the integer power of 2.

10. The data transmission method according to claim 9, wherein in the step of performing inverse fourier transform on each of the data groups, respectively, the number of points of performing inverse fourier transform on each of the data groups is smaller than the total number of data of the data to be transmitted.

11. The data transmission method according to claim 10, wherein in the step of performing inverse fourier transform on the data of each of the data groups, respectively, the number of inverse fourier transform points is an integer power of 2.

12. The data transmission method according to claim 9, wherein the inverse fourier transform in the step of performing inverse fourier transform on each of the data groups is 2-fold oversampling, and a data start point of performing inverse fourier transform on each of the data groups is in the corresponding data group.

13. The data transmission method of claim 9, wherein the data amount in the initial group of the non-edge group is the same; or alternatively

The ratio of the number of data in the initial group of non-edge groups is the integer power of 2.

14. The data transmission method according to claim 9, wherein in the step of processing the N sets of the first data sequences, in a case where the data amounts in the first data sequences of the adjacent two non-edge sets are different, soft-round prefix is added to the first data sequences of the non-edge sets in which the data amount is small, for the first data sequences of the non-edge sets.

15. The data transmission method according to any one of claims 1 to 14, wherein said performing inverse fourier transform on N sets of said second data sequences results in a time domain data sequence, comprising:

performing inverse Fourier transform on the N groups of second data sequences to obtain a plurality of groups of third data sequences;

And performing filtering operation on a plurality of groups of third data sequences to obtain the time domain data sequences.

16. The data transmission method according to claim 15, wherein the inverse fourier transform in the step of inverse fourier transforming N sets of the second data sequences is an oversampled inverse fourier transform having a number of points greater than N;

Said inverse fourier transforming N sets of said second data sequences, comprising:

Respectively extracting data from N groups of second data sequences to obtain a plurality of groups of third data sequences, wherein each group of third data sequences comprises N data respectively from N groups of second data sequences;

and performing inverse fourier transform on the plurality of third data sequences respectively.

17. The data transmission method according to claim 16, wherein in the step of performing inverse fourier transform on the N sets of the second data sequences, the data participating in inverse fourier transform further includes other sets of data sequences, the other sets not belonging to the N sets of the second data sequences.

18. The data transmission method according to claim 16, wherein the filtering the plurality of sets of third data sequences to obtain a time domain data sequence includes:

Serial linking is carried out on a plurality of groups of third data sequences;

And performing filtering operation on the data sequence after serial linking to obtain the time domain data sequence.

19. The data transmission method of claim 18, wherein in the step of performing a filtering operation on the serially linked data sequence, the filtering operation comprises a polyphase filtering operation.

20. The data transmission method as claimed in claim 19, wherein the filtering the serially linked data sequence to obtain the time domain data sequence includes:

repeating and windowing a plurality of groups of third data sequences respectively;

And carrying out staggered overlap addition on a plurality of groups of third data sequences subjected to repetition and windowing processing to obtain the time domain sequence.

21. The data transmission method as claimed in claim 19, wherein the filtering the serially linked data sequence to obtain the time domain data sequence includes:

downsampling a plurality of groups of third data sequences to obtain N parallel data groups;

respectively performing filtering operation on the N parallel data sets by using a filter;

and carrying out up-sampling and adding operation on the N data sets obtained after the filtering operation to obtain the time domain data sequence.

22. The data transmission method according to any one of claims 1 to 14, wherein N data groups are transmitted in N frequency domain resource blocks, respectively, the N frequency domain resource blocks each include a number of subcarriers k (N), the N frequency domain resource blocks being consecutive in the frequency domain, and k (N) of a non-edge frequency domain resource block being an integer power of 2, where N = 1, 2.

23. The data transmission method of claim 22, wherein the spectral spacing of adjacent frequency domain resource blocks that are not edges is equal.

24. The data transmission method of claim 22, wherein the spectral bandwidths of the non-marginal frequency domain resource blocks are equal.

25. The data transmission method of claim 22, wherein the number of subcarriers of the non-marginal frequency domain resource blocks is equal; or alternatively

The ratio of the number of subcarriers of the non-edge frequency domain resource block satisfies an integer power of 2.

26. The data transmission method of claim 22, wherein the subcarrier spacing is equal in the N frequency domain resource blocks; or alternatively

In the N frequency domain resource blocks, the subcarrier intervals are not equal, and the ratio of the subcarrier intervals of different frequency domain resource blocks satisfies the integer power of 2.

27. The data transmission method of claim 22, wherein the subcarriers of the frequency domain resource block of the edge comprise initial subcarriers and nulling subcarriers, the number of initial subcarriers is smaller than the number of subcarriers of other frequency domain resource blocks having the same subcarrier spacing as the frequency domain resource block of the edge, and the sum of the number of initial subcarriers and nulling subcarriers of the frequency domain resource of the edge is the same as the number of subcarriers of other frequency domain resource blocks having the same subcarrier spacing as the frequency domain resource block of the edge.

28. The data transmission method of claim 27, wherein the nulling subcarriers in the frequency domain resource blocks of an edge are outside of N of the frequency domain resource blocks.

29. The data transmission method of claim 27, wherein a spectral bandwidth of the frequency domain resource blocks at the edges of the non-nulled subcarriers is less than a spectral bandwidth of the non-edge frequency domain resource blocks.

30. The data transmission method according to claim 22, wherein in the step of performing inverse fourier transform on the data of each of the data groups, inverse fourier transform is performed on the data to be transmitted on k (n) subcarriers of each resource block, respectively, and any one of the following conditions is satisfied:

The zero frequency position of the inverse Fourier transform corresponding to each frequency domain resource block is different in the frequency domain;

The zero frequency position of the inverse Fourier transform corresponding to each frequency domain resource block is respectively in the k (n) subcarrier frequency range of each frequency domain resource block;

The zero frequency position of the inverse fourier transform corresponding to each frequency domain resource block is on one of k (n) subcarriers of each frequency domain resource block.

31. The data transmission method of claim 22, wherein for a non-edge group of the N groups of first data sequences, the processing comprises: a guard interval GI is added to the first data sequence of the non-edge group, the guard interval GI being null data.

32. A data transmission method, comprising:

Dividing data to be transmitted into N data groups according to N frequency domain resource blocks, wherein the number of subcarriers respectively included by the N frequency domain resource blocks is k (N), N is a positive integer greater than 2, n=1, 2, … …, N, N frequency domain resource blocks are continuous in a frequency domain, the spectrum bandwidths of all non-edge frequency domain resource blocks are equal, and the spectrum bandwidth of an initial resource block corresponding to an edge frequency domain resource block is smaller than the spectrum bandwidth of a non-edge frequency domain resource block;

respectively carrying out inverse Fourier transform on the data corresponding to each subcarrier of each frequency domain resource block to obtain N groups of first data sequences;

Performing inverse Fourier transform on the N groups of first data sequences to obtain time domain data sequences;

Transmitting the time domain data sequence.

33. The data transmission method of claim 32, wherein the subcarriers of the frequency domain resource blocks of the edge comprise nulling subcarriers and initial subcarriers corresponding to initial frequency domain resource blocks such that a spectral bandwidth of the frequency domain resource blocks of the edge is equal to a spectral bandwidth of the non-edge frequency domain resource blocks.

34. The data transmission method of claim 33, wherein the nulling subcarriers are outside of a continuous frequency domain corresponding to an initial resource block at an edge and a frequency domain resource block at a non-edge.

35. The data transmission method of claim 33, wherein the number of subcarriers k (n) of the non-edge initial frequency domain resource block is an integer power of 2, and the number of subcarriers of the edge initial resource block is smaller than the number of subcarriers of other frequency domain resource blocks having the same subcarrier spacing as the edge initial resource block.

36. The data transmission method of claim 35, wherein the frequency domain resource blocks of all the same subcarrier spacing include an equal number of subcarriers.

37. The data transmission method of claim 33, wherein the inverse fourier transform in the step of inverse fourier transforming the corresponding data on k (n) subcarriers of each frequency domain resource block is an inverse fourier transform of 2 times oversampling, and the number of points of inverse fourier transforms of frequency domain resource blocks of all same subcarrier intervals is the same.

38. The data transmission method according to any one of claims 32 to 37, wherein the number of subcarriers of the non-marginal frequency domain resource blocks is equal among the N frequency domain resource blocks; or alternatively

The ratio of the number of subcarriers of different non-edge frequency domain resource blocks in the N frequency domain resource blocks satisfies the integer power of 2.

39. The data transmission method according to any one of claims 32 to 37, wherein N frequency domain resource block sub-carriers are equally spaced; or alternatively

The subcarrier intervals of the N frequency domain resource blocks are unequal, and the ratio of the subcarrier intervals of different frequency domain resource blocks meets the integer power of 2.

40. The data transmission method according to any one of claims 32 to 37, wherein the performing inverse fourier transform on the data corresponding to each subcarrier of each frequency domain resource block to obtain N sets of first data sequences includes:

Respectively carrying out inverse Fourier transform on the data corresponding to each subcarrier of each frequency domain resource block to obtain N groups of first initial sequences;

And processing the N groups of first initial sequences to obtain N groups of first data sequences, wherein the processing of the first initial data sequences of the edge groups comprises the step of adding soft CPs to the first initial sequences to obtain corresponding first data sequences.

41. An electronic device, comprising:

One or more processors;

A memory having one or more programs stored thereon, which when executed by the one or more processors, cause the one or more processors to implement the data transmission method of any of claims 1 to 40.

42. A computer readable medium having stored thereon a computer program which when executed by a processor implements the data transmission method of any of claims 1 to 40.