CN118740578A

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

Info

Publication number: CN118740578A
Application number: CN202310369777.4A
Authority: CN
Inventors: 辛雨; 华健; 暴桐; 郁光辉; 许进; 胡留军
Original assignee: ZTE Corp
Current assignee: ZTE Corp
Priority date: 2023-03-31
Filing date: 2023-03-31
Publication date: 2024-10-01
Also published as: WO2024198608A1

Abstract

The present disclosure provides a data transmission method, including: 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. 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

The long term evolution (LTE, long Term Evolution) technology is a fourth generation (4G,Fourth Generation) wireless cellular communication technology. The LTE adopts an orthogonal frequency division multiplexing (OFDM, orthogonal Frequency Division Multiplexing) technology, and the time-frequency resources formed by the subcarriers and the OFDM symbols form wireless physical time-frequency resources of the LTE system. At present, OFDM technology has been widely used in wireless communication. The CP-OFDM system can well solve the multipath time delay problem due to the adoption of a Cyclic Prefix (CP), and divides the frequency selective channel into a set of parallel flat channels, thereby well simplifying the channel estimation method and having higher channel estimation precision.

The fifth generation new air interface (5G NR,Fifth Generation New Radio) communication technology still uses CP-OFDM as a basic waveform, and different numerologies (Numerology) can be used between two adjacent subbands, so that in order to avoid destroying orthogonality between subcarriers and reducing interference, a protection bandwidth needs to be inserted between two transmission bands with different Numerology.

The frequency band span of the future 6G service is very large, and the deployment modes are also various. Not only are multi-bandwidth channels required, but also waveform schemes that meet different scenarios are required. Each waveform scheme performed independently would increase the cost of the base station/terminal. How to design a unified waveform architecture, flexibly fuse multiple waveforms together, flexibly support applications of different channel bandwidths, and eliminate interference among multiple sub-bands to improve spectrum efficiency is a problem to be solved.

Disclosure of Invention

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, there is provided a data transmission method including: 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.

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

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.

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

One or more processors;

And 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.

As a fourth aspect of the present disclosure, there is provided a computer-readable medium having stored thereon a computer program which, when executed by a processor, implements the data transmission method.

In the data transmission method provided by the present disclosure, first, data to be transmitted is subjected to packet processing to obtain N data groups. In view of the fact that the spectrum bandwidth of the edge group is smaller than that of the other groups, in order to reduce out-of-band leakage, soft cyclic prefixes may be added to the first data sequences of the edge group when the N first data sequences are processed after the N first data sequences are obtained by performing inverse fourier transform on the N data groups. After soft CP is added to the first data sequence of the edge group and a corresponding second data sequence is obtained, the second data sequence corresponding to the edge group and the second data sequences of other non-edge groups can be subjected to inverse fourier transform together, so that the uniformity of parameters of the polyphase filter can be ensured in the subsequent filtering operation. Because the parameters of the polyphase filter are unified, various waveforms can be fused together, and each waveform does not need to be deployed independently, so that the cost of a base station and a terminal is reduced.

Drawings

Fig. 1 is a flow chart illustrating an embodiment of a data transmission method provided in the present disclosure;

FIG. 2 is a flow diagram of one embodiment of step S110;

FIG. 3 is a flow chart of one embodiment of step S140;

FIG. 4 is a flow diagram of one embodiment of step S142;

FIG. 5 is a flow diagram of one embodiment of step S142 b;

FIG. 6 is a flow chart of another embodiment of step S142 b;

Fig. 7 is a flow chart of a data transmission method provided in a second aspect of the present disclosure;

FIG. 8 is a block diagram of one embodiment of an electronic device provided by the present disclosure;

FIG. 9 is a schematic illustration of a computer readable medium provided by the present disclosure;

fig. 10 is a schematic diagram of a data transmission method provided in embodiment 1;

Fig. 11 is a schematic diagram of a data transmission method provided in embodiment 2;

fig. 12 is a schematic diagram of a data transmission method provided in embodiment 3;

Fig. 13 is a schematic diagram of a data transmission method provided in embodiment 4;

fig. 14 is a schematic diagram of a data transmission method provided in embodiment 5;

Fig. 15 is a schematic diagram of a data transmission method provided in embodiment 6;

fig. 16 is a schematic diagram of a data transmission method provided in embodiment 7;

Fig. 17 is a schematic diagram of a data transmission method provided in embodiment 8;

fig. 18 is a schematic diagram of a data transmission method provided in embodiment 9.

Detailed Description

For a better understanding of the technical solutions of the present disclosure, the following provides a data transmission method, an electronic device, and a computer readable storage medium for the present disclosure in conjunction with the accompanying drawings. Detailed description is made.

Example embodiments will be described more fully hereinafter with reference to the accompanying drawings, but may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.

Embodiments of the disclosure and features of embodiments may be combined with each other without conflict.

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

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the disclosure. As used herein, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.

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

As a first aspect of the present disclosure, there is provided a data transmission method, as shown in fig. 1, including:

in step S110, data to be transmitted is subjected to packet processing to obtain N data sets, where N is a positive integer greater than 2;

in step S120, inverse fourier transforming the data of each data set to obtain N sets of first data sequences;

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

in step S140, performing inverse fourier transform on the N groups of second data sequences to obtain a time domain data sequence;

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

In this disclosure, a "soft cyclic prefix" is a cyclic prefix in a general sense. The cyclic prefix in general terms includes two kinds, one is a normal cyclic prefix and the other is an extended cyclic prefix. In the present application, the "soft cyclic prefix" has lower power than the normal cyclic prefix, as well as the extended cyclic prefix.

In the present disclosure, there is no particular limitation on how the first data sequence of the non-edge group is processed. As an alternative embodiment, the processing of the first data sequence for the non-edge group in the N groups 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. Of course, the present disclosure is not limited thereto, and detailed description thereof will be omitted here.

As an alternative embodiment, for the first data sequence of an edge group, the power of the soft CP added to the first data sequence is slowly reduced at the edge of the soft CP.

In order to achieve the above "the power of the added soft CP slowly drops 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 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.

In the present disclosure, there is no particular limitation on how to form the soft cyclic prefix using a cyclic prefix including the first falling portion. For example, a cyclic prefix subjected to the header portion dropping operation may be directly utilized as the soft cyclic prefix. Of course, the present disclosure is not limited thereto. As another alternative embodiment, the forming the soft cyclic prefix using the cyclic prefix including the first dropping portion, 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.

As an alternative embodiment, performing a dropping operation on a header portion of a cyclic prefix of the first data sequence added to an edge group includes:

a dot product is performed on a header portion of a cyclic prefix of the first data sequence added to the edge group using a root raised cosine filter function.

As an alternative embodiment, 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, the specific numerical value of n is not particularly limited. For example, when the cyclic prefix is 72 points (i.e., short CP), n may be 36. Where the cyclic prefix is 80 points (i.e., long CP), n may be 40.

As an alternative embodiment, the performing the point multiplication operation on the header portion of the cyclic prefix of the first data sequence added to the edge group by using the root raised cosine filter function may include: and multiplying the head part of the cyclic prefix by a coefficient, wherein the coefficient is a left falling side lobe of the root raised cosine function.

The performing a down operation using a portion of the cyclic suffix of the first data sequence corresponding to the edge set in the previous symbol includes: 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.

As an alternative embodiment, the part of the cyclic suffix of the first data sequence corresponding to the edge set in the previous symbol may be the last n data of the previous symbol. The performing a point multiplication operation on the part of the cyclic suffix of the first data sequence corresponding to the edge group in the previous symbol by using the root raised cosine function may include: and multiplying the cyclic suffix by a coefficient, wherein the coefficient is a right falling side lobe 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 alternative implementation manner, the data set to be transmitted may be divided according to the frequency domain resource blocks corresponding to the data set to be transmitted, where the N data sets respectively correspond to N different frequency domain resource blocks. Hereinafter, this embodiment will be described in detail, and will not be described in detail.

In the present disclosure, which of the N sets of first data sequences is an edge set is not particularly limited, and any first data sequence located at the end of the N sets of first data sequences may be referred to as an edge set of first data sequences.

As an alternative embodiment, the first data sequences of the edge group include first data sequences of a first a group of N groups of the first data sequences. Wherein a is a positive integer, and a is more than or equal to 1 and less than N/2. I.e. the first a-group first data sequence is the first data sequence of the edge group.

As another alternative implementation manner, the first data sequence of the edge group comprises the first data sequence of the rear b group in the N groups of the first data sequences, wherein b is a positive integer, and b is more than or equal to 1 and less than N/2. I.e. the latter b sets of first data sequences are the first data sequences of the edge sets.

As a further alternative embodiment, the first a-group first data sequence and the second b-group first data sequence are both edge-group first data sequences.

In the present disclosure, the values of a and b are not particularly limited. The values of a and b may be determined according to the data amount of the data to be transmitted. As an alternative embodiment, a=1, b=1. That is, the first data sequence of the edge group is the 1 st group first data sequence, and/or the N-th group first data sequence.

As described above, the spectral bandwidth of the edge group is smaller than the spectral bandwidth of the other groups. Accordingly, as shown in fig. 2, the packet processing is performed on the data to be transmitted to obtain N data groups, including:

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

In step S112, zero padding is performed on the initial set of the integer powers of which the data amounts are not equal to 2, so as to obtain N data sets, where the data amounts of the N data sets are all the integer powers of 2.

In the present disclosure, for N initial groups, the amount of data for an edge group may be less than the amount of data for a non-edge group. In order to perform the subsequent filtering operation, it is necessary to zero-fill the initial group of integer powers of which the data amount is not equal to 2, so that the initial group of edge groups is formed as a "data group". In this disclosure, an "initial set" of non-edge sets is formed into a "data set" of non-edge sets without the need for zero padding operations. Thus, after step S112, N data sets can be obtained, where the number of "data" in each data set is an integer power of 2, and of course, for an edge set, the "data" herein includes zero complements.

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

As described above, the amount of data may be the same or different for different data sets. As an alternative embodiment, the amount of data in the initial group of non-edge groups is the same (and accordingly the amount of data in the data group of non-edge groups is the same). Of course, the present disclosure is not limited thereto, and the amount of data in the initial group of the non-edge group may also be different (accordingly, the amount of data in the data group of the non-edge group is also different). That is, in the case of the number of data in the initial group of the non-edge group, the ratio of the number of data in the initial group of the non-edge group is the integer power of 2.

In the step of processing the N sets of first data sequences, when the data amounts in the first data sequences of the adjacent two non-edge sets are different, a soft-round prefix is added to the first data sequence of the non-edge set having the smaller data amount.

It is noted that if the data in the initial group of edge groups has already satisfied an integer power of 2, then the data zeroing of the initial group of edge groups is not required.

As an alternative embodiment, in the step of performing inverse fourier transform on each of the data groups, 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.

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

Optionally, the inverse fourier transform in the step of performing inverse fourier transform on each of the data sets is 2 times oversampling, and a data start point of performing inverse fourier transform on each of the data sets is in the corresponding data set.

In the present disclosure, there is no particular limitation on how to specifically perform step S140. As an alternative embodiment, as shown in fig. 3, step S140 may include:

In step S141, performing inverse fourier transform on the N sets of second data sequences to obtain multiple sets of third data sequences;

In step S142, a filtering operation is performed on the multiple sets of third data sequences, so as 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, and in step S141, the second data sequence corresponding to the edge group performs inverse fourier transform together with the second data sequences of other non-edge groups, so that the uniformity of the polyphase filter parameters can be ensured when the filtering operation (i.e., step S142) is performed subsequently.

As an alternative embodiment, the inverse fourier transform in the step of performing inverse fourier transform on the N sets of the second data sequences is an oversampled inverse fourier transform having a number of points greater than N.

Specifically, the performing inverse fourier transform on the N sets of the second data sequences includes:

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

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

As an optional implementation manner, the data extraction of the N groups of second data sequences to obtain the plurality of third data sequences may specifically include: the N groups of second data sequences form N rows, then data are taken out by taking columns as units, and each N groups of data form a group of third data sequences; one of the inverse fourier transforms is performed for every N data (i.e., every set of third data sequences) fetched.

As described above, as an alternative embodiment, the N sets of second data sequences are obtained after adding a cyclic prefix to the N sets of first data sequences.

In order to enable the data to be transmitted together with other data, further optionally, in the step of performing inverse fourier transform on the N sets of the second data sequences, the data participating in the inverse fourier transform further includes other sets of data sequences, which do not belong to the N sets of the second data sequences.

In the present disclosure, there is no particular limitation on how to obtain the "other group data sequence". As an alternative embodiment, other data that is desired to be transmitted together with the data to be transmitted may be used directly to form the "other group data sequence".

The other sets of data sequences may also be obtained by:

performing inverse Fourier transform on the other data sets to obtain a first other data sequence;

and adding a cyclic prefix to the first other data sequences to obtain the other groups of data sequences.

In the present disclosure, how to perform the filtering operation on the plurality of sets of third data sequences is not particularly limited. Optionally, as shown in fig. 4, the filtering operation on the multiple sets of third data sequences to obtain a time domain data sequence includes:

in step S142a, a plurality of sets of the third data sequences are serially linked;

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

In the present disclosure, there is no particular limitation on how to perform the filtering operation in step S142b, and optionally, in the step of performing the filtering operation on the serially linked data sequence, the filtering operation includes a polyphase filtering operation.

Specifically, as shown in fig. 5, the filtering operation on the serially linked data sequence to obtain the time domain data sequence includes:

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

In step S142b2, the plurality of sets of third data sequences subjected to the repetition and windowing operations are subjected to staggered overlap addition, so as to obtain the time domain sequence.

As another alternative embodiment, as shown in fig. 6, the filtering operation on the serially linked data sequence to obtain the time domain data sequence includes:

In step S142b3, downsampling the N sets of third data sequences to obtain N parallel data sets;

In step S142b4, filtering operations are performed on the N parallel data sets, respectively, using filters;

in step S142b5, up-sampling and adding operations are performed on the N data sets obtained after the filtering operation, to obtain the time domain data sequence.

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

In the embodiment of the present disclosure, step S120 may be specifically performed as: the inverse fourier transform is performed on the data to be transmitted on k (N) subcarriers of each frequency domain resource block, respectively, to form N sets of time domain data sequences (i.e., N sets of first data sequences).

In the embodiment of the present disclosure, step S130 may be specifically performed as: and respectively processing the first data sequences after inverse Fourier transform of the data to be transmitted on k (N) subcarriers of the N frequency domain resource blocks to obtain N groups of second data sequences.

In the implementation of the present disclosure, step S140 may be specifically performed as: and carrying out inverse Fourier transform on the second data sequences corresponding to the N frequency domain resource blocks to obtain a plurality of groups of third data sequences.

In the present disclosure, the spectrum of each frequency domain resource block is not particularly limited, and optionally, the spectrum intervals of adjacent frequency domain resource blocks that are not edges are equal. Further optionally, the spectrum bandwidths of the non-edge frequency domain resource blocks are equal.

As an alternative embodiment, the number of subcarriers of the non-edge frequency domain resource block is equal.

As another alternative embodiment, the number of subcarriers of the non-edge frequency domain resource block may not be equal, and in particular, the ratio of the number of subcarriers of the non-edge frequency domain resource block satisfies a power of 2.

As an alternative implementation manner, the subcarrier intervals are equal in the N frequency domain resource blocks.

As another alternative embodiment, the subcarrier spacing is not equal in the N frequency domain resource blocks, and the ratio of the subcarrier spacing of different frequency domain resource blocks satisfies a power of 2.

As an alternative embodiment, the subcarriers of the frequency domain resource block of the edge include initial subcarriers and nulling subcarriers, the number of the 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 the initial subcarriers and the 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.

The number of subcarriers of the edge resource block is smaller than the number of subcarriers of other resource blocks having the same subcarrier spacing as the edge resource block. The advantages are that: the frequency spectrum resource of any subcarrier number can be divided into N frequency domain resource blocks, after zero-setting subcarriers are supplemented, the frequency spectrum bandwidths of the N frequency domain resource blocks can be equal, and the N frequency domain resource blocks are kept continuously, so that the normal operation of each subsequent serial inverse Fourier transform can be ensured.

Optionally, the nulling subcarriers in the frequency domain resource blocks of the edge are out of N of the frequency domain resource blocks.

Optionally, the spectral bandwidth of the frequency domain resource blocks that do not complement the edges of the nulled subcarriers is less than the spectral 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 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.

It should be noted that the values of n may be the same or different for different frequency domain resource blocks.

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

respectively adding a guard interval GI to each group of the first data sequences of the edge group, wherein the guard interval GI is null data;

And performing linear convolution operation on the first data sequence added with the guard interval GI and the data sequence of the adjacent symbol in the time domain by utilizing the filter time domain data to obtain a corresponding second data sequence.

As a second aspect of the present disclosure, there is provided a data transmission method, as shown in fig. 7, including:

in step S210, the data to be transmitted is divided into N data sets according to N frequency domain resource blocks, where the number of subcarriers included in each of the N frequency domain resource blocks is k (N), where N is a positive integer greater than 2, n=1, 2, … …, N, where 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 transforming the data corresponding to each subcarrier of each frequency domain resource block to obtain N groups of first data sequences;

in step S230, performing inverse fourier transform on the N groups of 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 by using N frequency domain resource blocks. The spectrum bandwidth of the initial resource block corresponding to the frequency domain resource block at the edge is smaller than that of the frequency domain resource block at the non-edge, so that the spectrum resources with any subcarrier number can be divided into N continuous resource blocks, and each subsequent serial inverse Fourier transform can be ensured to be carried out normally.

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

As an alternative embodiment, the spectrum resource may be divided into N consecutive initial resource blocks, wherein the spectrum bandwidth of the initial resource blocks of the edge is smaller than the initial resource blocks of the non-edge. And processing the initial resource blocks of the edge to obtain the frequency domain resource blocks of the edge. The non-edge initial resource block can be directly used as the non-edge frequency domain resource block.

In the present disclosure, how to process the initial resource blocks of the edge is not particularly limited, and as an alternative implementation manner, the frequency domain resource blocks of the edge may be obtained by supplementing zero-setting subcarriers to the initial resource blocks of the non-edge. In other words, the subcarriers of the frequency domain resource block of the edge include zero-set subcarriers and initial subcarriers corresponding to the initial frequency domain resource block. The frequency spectrum bandwidth of the frequency domain resource blocks at the edge and the frequency spectrum bandwidth of the frequency domain resource blocks at the non-edge can be made equal by supplementing the zero-setting subcarriers.

In the present disclosure, the frequency domain resource blocks at the edge are not particularly limited, and the first a frequency domain resource blocks and/or the last b frequency domain resource blocks in the N frequency domain resource blocks are frequency domain resource blocks at the edge. The rest resource blocks are non-edge frequency domain resource blocks.

Alternatively, a and b may each be 1,

In order to ensure the continuity of the resource blocks, optionally, the nulling sub-carriers are outside the continuous frequency domain corresponding to the initial resource blocks at the edge and the frequency domain resource blocks at the non-edge. As an alternative embodiment, the zeroed subcarriers may be supplemented outside of the initial resource block.

As an alternative embodiment, 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.

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

Optionally, the inverse fourier transform in the step of performing inverse fourier transform on 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 the frequency domain resource blocks of the same subcarrier spacing is the same.

Optionally, the number of subcarriers of the non-edge frequency domain resource blocks in the N frequency domain resource blocks is equal. Of course, the disclosure is not limited thereto, and as another alternative embodiment, the number of subcarriers of different non-edge frequency domain resource blocks in the N final frequency domain resource blocks may also be different, specifically, the ratio of the number of subcarriers of different non-edge frequency domain resource blocks in the N final frequency domain resource blocks satisfies an integer power of 2.

Optionally, the N frequency domain resource block subcarriers are equally spaced. Of course, the present disclosure is not limited thereto, and as another alternative embodiment, the subcarrier intervals of the N frequency domain resource blocks are not equal, and the ratio of the subcarrier intervals of different frequency domain resource blocks satisfies an integer power of 2.

Optionally, the performing inverse fourier transform on the data corresponding to each subcarrier of each frequency domain resource block to obtain N groups 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.

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

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

As another alternative embodiment, a soft CP, or 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, there is provided an electronic apparatus, as shown in fig. 8, including:

One or more processors 101;

A memory 102 having one or more programs stored thereon, which when executed by the one or more processors 101, cause the one or more processors to implement the data transmission method provided by the first and/or second aspects 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 enable information interaction of the processor with the memory.

Wherein the processor 101 is a device having data processing capabilities, including but not limited to a Central Processing Unit (CPU) or the like; memory 102 is a device with data storage capability including, but not limited to, random access memory (RAM, more specifically SDRAM, DDR, etc.), read-only memory (ROM), electrically charged erasable programmable read-only memory (EEPROM), FLASH memory (FLASH); an I/O interface (read/write interface) 103 is connected between the processor 101 and the memory 102 to enable information interaction between the processor 101 and the memory 102, including but not limited to a data Bus (Bus) or the like.

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

As a fourth aspect of the present disclosure, as shown in fig. 9, there is provided a computer-readable medium having stored thereon a computer program which, when executed by a processor, implements the data transmission method provided in the first and/or second aspects of the present disclosure.

Example 1

As shown in fig. 10, in the present embodiment, the data transmission method includes:

the data sequence to be transmitted is divided into 4 groups, 4 initial groups are obtained, the first 3 initial groups comprise 1024 data, and the 4 th initial group comprises 204 data and totally comprises 273 RBs. Wherein the subcarrier spacing of each initial set is 30kHz.

And supplementing 820 zero subcarriers outside the 4 th initial group to obtain the 4 th data group. Wherein the first 3 initial groups are also 3 data groups, resulting in 4 data groups.

And respectively performing 2048-point oversampling IFFT on the 4 data groups to obtain 4 groups of first data sequences.

In order to reduce out-of-band leakage, the first data sequence of the 4 th group is subjected to a softening CP operation, so that a second data sequence of the 4 th group is obtained. And, CP is added to the first data sequences of the first 3 groups, respectively, to obtain second data sequences of the first 3 groups.

And carrying out sub-band level IFFT and polyphase filtering operation on the 4 groups of second data sequences to obtain a group of time domain data.

Example 2

As shown in fig. 11, in the present embodiment, the data transmission method includes:

In order to reduce out-of-band leakage, respectively performing softening CP operation on the 1 st group of first data sequences and the 4 th group of first data sequences to respectively obtain a1 st group of second data sequences and a 4 th group of second data sequences, and respectively adding CPs to the 2 nd group of first data sequences and the 3 rd group of first data sequences to obtain a2 nd group of second data sequences and a 3 rd group of second data sequences;

Example 3

As shown in fig. 12, in the present embodiment, the data transmission method includes:

The data sequence to be transmitted is divided into 4 groups to obtain 4 initial groups, wherein the 2 nd initial group and the 3 rd initial group comprise 1024 data, and the 1 st initial group and the 4 th initial group comprise 614 data and total 273 RBs. Wherein the subcarrier spacing of each initial set is 30kHz.

And supplementing 410 zero subcarriers outside the 1 st initial group to obtain the 1 st data group, and supplementing 410 zero subcarriers outside the 4 th initial group to obtain the 4 th data group. Wherein, the 2 nd initial group is also the 2 nd data group, and the 3 rd initial group is also the 3 rd data group. Thus, a total of 4 data sets were obtained.

In order to reduce out-of-band leakage, the 1 st group of first data sequences and the 4 th group of first data sequences are respectively subjected to soft adding CP operation to obtain the 1 st group of second data sequences and the 4 th group of second data sequences, and the 2 nd group of first data sequences and the 3 rd group of first data sequences are respectively subjected to CP operation to obtain the 2 nd group of second data sequences and the 3 rd group of second data sequences.

Example 4

As shown in fig. 13, in the present embodiment, the data transmission method includes:

Adding a CP to the first data sequences of the first 3 groups to obtain second data sequences of the first 3 groups, wherein the length of the CP is as follows: the long CP is 80 points and the short CP is 72 points. A long CP may be added, or an end CP may be added.

Soft CPs are added to the 4 th group of first data sequences to obtain a 4 th group of second data sequences. The specific process is as follows: in soft CP for one SYMBOL (a symbin): the short CP length is 72 points, firstly taking the data (original CP, namely CP in normal meaning) of 72 sampling points after the symbol, multiplying the first 36 sampling points by coefficients, wherein the coefficients are left descending side lobes of a root raised cosine function and recorded as CP1; and multiplying the first 36 sampling point data (original cyclic suffix CS) of the previous symbol by a coefficient, wherein the coefficient is a right falling side lobe of a root raised cosine function, recorded as CP2, and added with the first 36 points of CP1 to finally obtain a soft CP with the length of 72, and the average power of the soft CP is the same as that of the original CP. It should be noted that this is also true for long CPs. And adding CPs to the first data sequences of the first 3 groups to obtain second data sequences of the first 3 groups.

Example 5

As shown in fig. 14, in the present embodiment, the data transmission method includes:

the data sequence to be transmitted is divided into 4 groups to obtain 4 initial groups, wherein the 1 st initial group and the 3 rd initial group comprise 1024 data, and the 1 st initial group and the 4 th initial group comprise 614 data and total 273 RBs. Wherein the subcarrier spacing of each initial group is 30kHz.

And supplementing 410 zero subcarriers outside the 1 st initial group to obtain the 1 st data group, and supplementing 410 zero subcarriers outside the 4 th initial group to obtain the 4 th data group. Wherein the 2 nd initial group, and the 3 rd data group are also data groups, resulting in 4 data groups.

And respectively performing 2048-point oversampling IFFT on the 3 data groups to obtain 4 groups of first data sequences.

Adding GI to the first data sequence of the 2 nd group to obtain a second data sequence of the 2 nd group, adding GI to the first data sequence of the 3 rd group to obtain a second data sequence of the 3 rd group, wherein the GI is zero data, and the length of the GI is as follows: the long GI is 80 points and the short GI is 72 points. A long GI may be added, or an end GI may be added. Adding a soft CP to the 1 st group of first data sequences to obtain a1 st group of second data sequences, and adding a soft CP to the 4 th group of first data sequences to obtain a4 th group of second data sequences, wherein the length of the soft CP is as follows: the long soft CP is 80 points and the short soft CP is 72 points. A long soft CP may be added, or a short soft CP may be added.

Example 6

As shown in fig. 15, in the present embodiment, the data transmission method includes:

The data sequence to be transmitted is divided into 4 groups, resulting in 4 initial groups. The 1 st initial group includes 388 data, the 2 nd initial group includes 512 data, the 3 rd initial group includes 1024 data, and the 4 th initial group includes 776 data. Wherein the subcarrier spacing of each of the 1 st initial group and the 2 nd initial group is 30kHz, and the subcarrier spacing of each of the 3 rd initial group and the 4 th initial group is 15kHz.

And supplementing 124 zero subcarriers at the outer side of the 1 st initial group to obtain a1 st data group, and supplementing 248 zero subcarriers at the outer side of the 4 th initial group to obtain a2 nd data group. Where the 2 nd initial group is also the 2 nd data group and the 3rd initial group is also the 3rd data group. Thus, a total of 4 data sets were obtained.

And respectively carrying out 1024-point over-sampling IFFT on the 1 st data group and the 2 nd data group to obtain a1 st group first data sequence and a2 nd group first data sequence, and respectively carrying out 2048-point over-sampling IFFT on the 3 rd data group and the 4 th data group to obtain a 3 rd group first data sequence and a 4 th group first data sequence.

In order to reduce out-of-band leakage and inter-subband interference, soft CP operations are added to all 4 sets of first data sequences, resulting in 4 sets of second data sequences.

For the second data sequence of group 1, two adjacent symbol data (represented by symbol 1 and symbol 2 in fig. 13) are concatenated to form data of the same length as the second data sequence of group 3 and the second data sequence of group 4; for the 2 nd second data sequence, two adjacent symbol data (represented by symbol 1 and symbol 2 in fig. 13) are concatenated to form data of the same length as the 3 rd group second data sequence and the 4 th group second data sequence.

And carrying out subband level IFFT and polyphase filtering operation on the 1 st group of second data sequences subjected to the symbol addition operation, the 2 nd group of second data sequences subjected to the symbol addition operation, the 3 rd group of second data sequences and the 4 th group of second data sequences to obtain one group of time domain data.

Example 7

As shown in fig. 16, in the present embodiment, the data transmission method includes:

The data sequence to be transmitted is divided into 4 groups, 4 initial groups are obtained, the first 3 initial groups comprise 1024 data, and the 4 th initial group comprises 204 data and totally comprises 273 RBs. Wherein the subcarrier spacing of each group is 30kHz.

In order to reduce out-of-band leakage, the softening CP operation is respectively carried out on the 1 st group of first data sequences and the 4 th group of first data sequences, so as to obtain the 1 st group of second data sequences and the 4 th group of second data sequences. And adding a CP to the first data sequence of the 2 nd group to obtain the second data sequence of the 2 nd group, and adding a CP to the first data sequence of the 3 rd group to obtain the second data sequence of the 3 rd group.

And then carrying out sub-band level IFFT and polyphase filtering operation on the 4 groups of second data sequences and other groups of data sequences (soft CP) together to obtain a group of time domain data.

The other group of data may be data after IFFT or data without IFFT, and the other group of data sequences may be soft-CP-added or soft-CP-added, and in this embodiment, the other group of data sequences are soft-CP-added after IFFT.

Example 8

As shown in fig. 17, in the present 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 4 th initial group includes 204 data, and each initial group contains a part of reference signals, which are 273 RBs in total. Wherein the subcarrier spacing of each initial set is 30kHz.

In order to reduce out-of-band leakage, soft CPs are added to the 1 st group of first data sequences to obtain a1 st group of second data sequences, and soft CPs are added to the 4 th group of first data sequences to obtain the 4 th group of second data sequences; and adding CPs to the 2 nd group of first data sequences to obtain the 2 nd group of second data sequences, adding CPs to the 3 rd group of first data sequences, and obtaining the 3 rd group of second data sequences.

Example 9

As shown in fig. 18, in the present embodiment, the data transmission method includes:

In order to reduce out-of-band leakage, soft CPs are added to the 1 st group of first data sequences to obtain a1 st group of second data sequences, soft CPs are added to the 4 th group of first data to obtain a 4 th group of second data sequences, CPs are added to the 2 nd group of first data sequences to obtain a2 nd group of second data sequences, CPs are added to the 3 rd group of first data sequences to obtain a 3 rd group of second data sequences.

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

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

Those of ordinary skill in the art will appreciate that all or some of the steps, systems, functional modules/units in the apparatus, and methods disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between the functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed cooperatively by several physical components. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as known to those skilled in the art. Computer storage media includes, but is 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 tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by a computer. Furthermore, as is well known to those of ordinary skill in the art, communication media typically embodies 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 includes any information delivery media.

Example embodiments have been disclosed herein, and although specific terms are employed, they are used and should be interpreted in a generic and descriptive sense only and not for purpose of limitation. In some instances, it will be apparent to one skilled in the art that features, characteristics, and/or elements described in connection with a particular embodiment may be used alone or in combination with other embodiments unless explicitly stated otherwise. It will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the scope of the disclosure as set forth in the appended claims.

Claims

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;

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:

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;

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:

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:

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:

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.