Data transmission method, and device and storage medium

Abstract

Provided in the present application are a data transmission method, and a device and a storage medium. The method comprises: dividing data to be transmitted into N groups of first sequences, wherein an nth group of first sequences includes k(n) pieces of data, k(n) being a positive integer; respectively multiplying the nth group of first sequences among the N groups of first sequences by a coefficient group X(n), so as to obtain N groups of second sequences, wherein n is equal to 1, 2, ......, N, and N is an integer greater than or equal to 2; respectively performing inverse Fourier transform on each group of second sequences, so as to obtain N groups of third sequences; performing inverse Fourier transform on the N groups of third sequences, so as to form one group of target time-domain data sequences; and transmitting the target time-domain data sequences on a pre-configured time-frequency resource.

Description

Data transmission method, device and storage medium Technical Field

[0001] The present application relates to the field of communication technology, and in particular to a data transmission method, device and storage medium. Background Art

[0002] In 5G communication technology, cyclic prefix-orthogonal frequency division multiplexing (CP-OFDM) is used as the basic waveform, and two adjacent sub-bands can use different parameter sets (Numerology). This will destroy the orthogonality between subcarriers and introduce new interference problems. As for how to solve this interference problem, one of the more direct methods is to insert a guard band between two transmission bands with different Numerologies, but this wastes frequency resources. How to design a unified waveform architecture, flexibly integrate multiple waveforms, and how to flexibly support applications with different channel bandwidths is an urgent problem to be solved.

[0003] Summary of the Invention

[0004] In view of this, the embodiments of the present application provide a data transmission method, device, and storage medium, which reduce the guard interval, reduce the interference between systems or between sub-bands, and improve the spectrum efficiency.

[0005] The present invention provides a data transmission method, including:

[0006] Divide the data to be transmitted into N groups of first sequences; wherein the nth group of the first sequence contains k(n) data, where k(n) is a positive integer;

[0007] Multiplying the nth first sequence of the N groups of first sequences by the coefficient group X(n) to obtain N groups of second sequences, wherein n=1, 2, ..., N, and N is an integer greater than or equal to 2;

[0008] Performing inverse Fourier transform on each group of the second sequences to obtain N groups of third sequences;

[0009] Performing inverse Fourier transform on the N groups of third sequences to form a group of target time domain data sequences;

[0010] The target time domain data sequence is transmitted on pre-configured time-frequency resources.

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

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

[0013] When the one or more programs are executed by the one or more processors, the one or more processors implement the method described in any one of the above embodiments.

[0014] An embodiment of the present application provides a storage medium storing a computer program. When the computer program is executed by a processor, the method described in any one of the above embodiments is implemented. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] FIG1 is a flow chart of a data transmission method provided in an embodiment of the present application;

[0016] FIG2 is a schematic diagram of generating a target time domain data sequence provided by an embodiment of the present application;

[0017] FIG3 is a schematic diagram of generating another target time domain data sequence provided by an embodiment of the present application;

[0018] FIG4 is a schematic diagram of generating another target time domain data sequence provided by an embodiment of the present application;

[0019] FIG5 is a schematic diagram of generating another target time domain data sequence provided by an embodiment of the present application;

[0020] FIG6 is a schematic diagram of generating another target time domain data sequence provided by an embodiment of the present application;

[0021] FIG7 is a schematic diagram of generating another target time domain data sequence provided in an embodiment of the present application;

[0022] FIG8 is a schematic diagram of generating another target time domain data sequence provided by an embodiment of the present application;

[0023] FIG9 is a schematic diagram of generating another target time domain data sequence provided in an embodiment of the present application;

[0024] FIG10 is a schematic diagram of generating another target time domain data sequence provided in an embodiment of the present application;

[0025] FIG11 is a schematic diagram of generating another target time domain data sequence provided in an embodiment of the present application;

[0026] FIG12 is a schematic diagram of a transmission method of data to be transmitted provided in an embodiment of the present application;

[0027] FIG13 is a structural block diagram of a data transmission device provided in an embodiment of the present application;

[0028] FIG14 is a schematic structural diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0029] The following describes the embodiments of the present application in conjunction with the accompanying drawings. The following describes the present application in conjunction with the accompanying drawings. The examples are only used to explain the present application and are not used to limit the scope of the present application.

[0030] Long Term Evolution (LTE) is a 4G (Fourth Generation) wireless cellular communication technology. LTE uses Orthogonal Frequency Division Multiplexing (OFDM) technology. The time-frequency resources comprised of subcarriers and OFDM symbols constitute the LTE system's physical radio time-frequency resources. OFDM technology is currently widely used in wireless communications. By using a cyclic prefix (CP), CP-OFDM systems effectively address multipath delay and divide frequency-selective channels into a set of parallel, flat channels. This simplifies channel estimation and provides high channel estimation accuracy. However, CP-OFDM system performance is sensitive to frequency and time offsets between adjacent subbands. This is primarily due to the system's high spectral leakage, which can easily lead to inter-subband interference. Currently, LTE systems use guard intervals in the frequency domain, but this reduces spectral efficiency, necessitating the adoption of new technologies to mitigate out-of-band leakage.

[0031] 5G NR (Fifth Generation New Radio) communication technology still uses CP-OFDM as its basic waveform, and two adjacent subbands can use different numerologies. This destroys the orthogonality between subcarriers and introduces new interference issues. One straightforward approach to addressing this interference issue is to insert a guard band between two transmission bands with different numerologies, but this wastes frequency resources.

[0032] Future 6G services will span a wide range of frequency bands and require diverse deployment methods. This requires not only multi-bandwidth channels but also waveform solutions tailored to different scenarios. Implementing each waveform solution independently would increase base station and terminal costs. Designing a unified waveform architecture that can flexibly integrate multiple waveforms and flexibly support applications with varying channel bandwidths remains a pressing challenge.

[0033] In one embodiment, FIG1 is a flow chart of a data transmission method provided by an embodiment of the present application. This embodiment is applied to situations where multiple bandwidth channels and multiple waveforms can be flexibly supported. As shown in FIG1 , this embodiment includes: S110-S150.

[0034] S110 , dividing the data to be transmitted into N groups of first sequences.

[0035] Among them, the nth group of first sequences contains k(n) data, and k(n) is a positive integer. In one example, the data to be transmitted is a data sequence that needs to be sent from the transmitting end to the receiving end. The data to be transmitted can be frequency domain data or time domain data. In one example, when the data to be transmitted is frequency domain data, the data to be transmitted is directly divided to obtain multiple first sequences that are also frequency domain data; in one example, when the data to be transmitted is time domain data, the data to be transmitted can be divided first to obtain N groups of data that are also time domain data, and then the N groups of time domain data after division are Fourier transformed to obtain the corresponding N groups of first sequences; or the data to be transmitted can be Fourier transformed first, and then the frequency domain data obtained by Fourier transform are divided to obtain the corresponding N groups of first sequences.

[0036] S120 , multiply the nth group of first sequences among the N groups of first sequences by the coefficient group X(n) to obtain N groups of second sequences.

[0037] Where n = 1, 2, ..., N; N is an integer greater than or equal to 2. In an embodiment, the nth first sequence of the N groups of first sequences is multiplied by the coefficient set X(n) to perform power compensation on the first sequence. The coefficient set corresponding to the nth first sequence is X(n), and n is 1, 2, ..., N.

[0038] S130 , performing inverse Fourier transform on each group of second sequences to obtain N groups of third sequences.

[0039] Perform inverse Fourier transform on each group of second sequences to obtain N groups of corresponding third sequences, wherein each group of third sequences is time domain data.

[0040] S140: Perform inverse Fourier transform on the N groups of third sequences to form a group of target time domain data sequences.

[0041] In one example, N groups of third sequences are first subjected to Fourier transform to obtain corresponding N groups of new third sequences, which are all frequency domain data. Then, the new N groups of third sequences are subjected to inverse Fourier transform to form a group of target time domain data sequences.

[0042] S150: Transmit a target time-domain data sequence on pre-configured time-frequency resources.

[0043] The data to be transmitted is divided into N groups of first sequences, and the nth group of first sequences in the N groups of first sequences is multiplied by the coefficient group X(n) to obtain N groups of second sequences; each group of second sequences is subjected to inverse Fourier transform to obtain N groups of third sequences; then the N groups of third sequences are subjected to inverse Fourier transform to form a group of target time domain data sequences, and this group of target time domain data sequences is transmitted on pre-configured time-frequency resources. By pre-compensating the coefficients of the first sequence, the performance loss caused by the power imbalance caused by the subsequent filter is eliminated.

[0044] In one embodiment, before performing inverse Fourier transform on each group of second sequences, the method further includes:

[0045] Each group of second sequences is padded with zeros at both ends; wherein each group of second sequences after zero padding contains M*s(n) data; M is a positive integer, s(n) ≥ k(n). After padding with zeros at both ends of each group of second sequences, an inverse Fourier transform is performed on each group of second sequences after zero padding. Inter-subband interference can be eliminated by oversampling. In one example, M can satisfy the i-th power of 2 (i.e., 2 i ), where i is an integer greater than or equal to 0. In one example, s(n) satisfies the value of 2 to the power of i (i.e., 2 i ), where i is an integer greater than or equal to 0. In one example, s(n) satisfies s(n) = 2^ceil(log2(k(n)); where ceil(log2(k(n)) refers to the smallest integer greater than or equal to log2(k(n)). In one example, when k(n) satisfies 2 raised to the power of 1, s(n) = k(n).

[0046] In one embodiment, the number of points for performing an inverse Fourier transform on each set of second sequences is M*s(n). In this embodiment, each set of second sequences is first padded with zeros at both ends to obtain a second sequence containing M*s(n) data, and then an inverse Fourier transform is performed on the second sequence containing M*s(n) data.

[0047] In one embodiment, the channel bandwidth includes N sub-bands, and each sub-band corresponds to a set of first sequences.

[0048] In one embodiment, multiplying the n-th group of first sequences in the N groups of first sequences by the coefficient group X(n) is to perform a frequency domain shaping operation on the frequency domain data in the n-th group of first sequences.

[0049] In one embodiment, the coefficient group X(n) by which the n-th group of first sequences of different time-domain symbols are multiplied is the same; n=1, 2, . . . , N; N is an integer greater than or equal to 2.

[0050] In one embodiment, the length of the nth coefficient group X(n) is the same as k(n); n = 1, 2, ..., N, where N is an integer greater than or equal to 2. The length of the nth coefficient group X(n) refers to the number of coefficients contained in the nth coefficient group X(n). In one example, the number of coefficients contained in the nth coefficient group X(n) is the same as the number of data k(n) contained in the corresponding first sequence.

[0051] In one embodiment, first sequences with the same k(n) are multiplied by the same coefficient set X(n). First sequences containing the same number of data are also multiplied by the same coefficient set X(n).

[0052] In one embodiment, the coefficient group X(n) by which the first sequence corresponding to subbands with the same subcarrier spacing is multiplied is the same; the coefficient group X(n) by which the first sequence corresponding to different subcarrier spacing is multiplied is different. The first sequences corresponding to subbands with the same subcarrier spacing use the same coefficient group X(n), while the first sequences corresponding to different subcarrier spacings use different coefficient groups X(n). This ensures that the coefficients for the same subcarrier spacing are uniform, while the coefficient groups X(n) for different subcarrier spacings contain different numbers of coefficients due to the different amount of data.

[0053] In one embodiment, the nth coefficient group X(n) = F(n) / f(n); F(n) represents the frequency domain coefficients of an ideal root raised cosine filter at the frequency domain subcarrier positions corresponding to the nth first sequence, and f(n) represents the frequency domain coefficients of an actual root raised cosine filter at the frequency domain subcarrier positions corresponding to the nth first sequence, where n = 1, 2, ..., N, and N is an integer greater than or equal to 2. The nth coefficient group is configured as the ratio between the frequency domain coefficients of the ideal root raised cosine filter and the frequency domain coefficients of the actual root raised cosine filter at the frequency domain subcarrier positions corresponding to the nth first sequence, so that the transmitter can be compensated to the ideal filter.

[0054] In one embodiment, the nth coefficient group X(n) = 1 / f(n); f(n) is the actual root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth first sequence, n = 1, 2, ..., N; N is an integer greater than or equal to 2. The nth coefficient group is configured as a ratio between 1 and the actual root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth first sequence, and the transmitter can be compensated to 1. In one example, the nth coefficient group can be configured differently, so that the transmitter can be compensated to an ideal filter or to 1.

[0055] In one embodiment, the nth coefficient group X(n) is power normalized to satisfy mean(|X(n)| 2)=1;n=1,2,...,N;N is an integer greater than or equal to 2. The power normalization is performed on the n-th coefficient group X(n) to facilitate subsequent other data processing.

[0056] In one embodiment, both ends of the n-th coefficient group X(n) contain p 1s; n=1, 2, ..., N; N is an integer greater than or equal to 2; and p is an integer greater than or equal to 0.

[0057] In one embodiment, the coefficient group X'(n) after removing the p ones at both ends of the nth coefficient group X(n) is equal to F'(n) / f'(n); F'(n) is the ideal root raised cosine filter frequency domain coefficient at the corresponding frequency domain subcarrier position after removing the p subcarriers at both ends of the nth first sequence; f'(n) is the actual root raised cosine filter frequency domain coefficient at the corresponding frequency domain subcarrier position after removing the p subcarriers at both ends of the nth first sequence; n=1, 2, ..., N; N is an integer greater than or equal to 2. When the nth coefficient group X(n) contains p ones at both ends, the coefficient group X'(n) can be determined based on the ratio between the ideal root raised cosine filter frequency domain coefficient at the corresponding frequency domain subcarrier position after removing the p subcarriers at both ends of the nth first sequence to the actual root raised cosine filter frequency domain coefficient. This can prevent the image of the edge subcarriers from causing excessive power due to FDSS, and thus, coefficient compensation can be performed only on the middle portion without performing coefficient compensation on the edge portion.

[0058] In one embodiment, the coefficient group X'(n) after removing the p ones at both ends of the nth coefficient group X(n) is equal to 1 / f'(n); f'(n) is the actual root raised cosine filter frequency domain coefficient at the corresponding frequency domain subcarrier position after removing the p subcarriers at both ends of the nth first sequence; n=1, 2, ..., N; N is an integer greater than or equal to 2. When the nth coefficient group X(n) contains p ones at both ends, the coefficient group X'(n) can be determined based on the ratio between 1 and the actual root raised cosine filter frequency domain coefficient at the corresponding frequency domain subcarrier position after removing the p subcarriers at both ends of the nth first sequence. This can prevent the mirror image of the edge subcarriers from causing excessive power due to FDSS, and thus, coefficient compensation can be performed only on the middle portion without performing coefficient compensation on the edge portion.

[0059] In one embodiment, the nth coefficient group X'(n) is power normalized to satisfy mean(|X'(n)| 2 )=1;n=1,2,……,N;N is an integer greater than or equal to 2.

[0060] In one embodiment, the number of data k(n) included in each group of first sequences satisfies one of the following conditions: any positive integer; an integer multiple of a resource block (RB); 2 to the power of i; the ratio of two adjacent k(n)s satisfies 2 to the power of i; k(n)s are all the same. In one example, the number of data k(n) included in each group of first sequences is any positive integer; in one example, the number of data k(n) included in each group of first sequences satisfies 12 to the power of i, i.e., an integer multiple of a RB. In one example, the number of data k(n) included in each group satisfies 2 to the power of i (i.e., 2 i ), where i is an integer greater than or equal to 0. In one example, the ratio between the number of data k(n) contained in each group of the first sequence satisfies the i-th power of 2 (i.e., 2 i ), wherein i is an integer greater than or equal to 0. In one example, the number k(n) of data included in each group of first sequences is the same.

[0061] In one embodiment, a zero padding operation is performed on both ends of each group of second sequences, and [M*s(n)-k(n)] / 2 zero data are added to both ends of each group of second sequences.

[0062] In one embodiment, the number of points for inverse Fourier transform of each group of second sequences satisfies one of the following conditions: the ratio of the number of points for inverse Fourier transform of two adjacent groups of second sequences satisfies 2 to the power of i; the number of points for inverse Fourier transform of each group of second sequences is the same; where i is an integer. In one example, inverse Fourier transform of M*s(n) points is performed on each group of second sequences, and the ratio of the number of points for inverse Fourier transform of each group of second sequences satisfies 2 to the power of i (i.e., 2 i ), wherein i is an integer greater than or equal to 0. In one example, an inverse Fourier transform of M*s(n) points is performed on each group of second sequences, and the number of points of the inverse Fourier transform of each group of second sequences is the same.

[0063] In one embodiment, the data to be transmitted includes at least constellation point modulated data; the data to be transmitted also includes at least one reference signal data. In one embodiment, the data to be transmitted includes constellation point modulated data. In one embodiment, the data to be transmitted includes constellation point modulated data and at least one reference signal data.

[0064] In one embodiment, performing inverse Fourier transform on N groups of third sequences to form a group of target time-domain data sequences includes:

[0065] Perform frequency domain zero padding and cyclic shift operations on the other P groups of initial frequency domain data sequences in sequence to obtain the other P groups of target frequency domain data sequences;

[0066] Perform inverse Fourier transform on the N groups of third sequences and the other P groups of target frequency domain data sequences to form a group of target time domain data sequences; wherein the other P groups of target frequency domain data sequences include: data after M times frequency domain oversampling, and are not included in the data sequence generated by the data to be transmitted. In one example, perform inverse Fourier transform on the N groups of third sequences and the other P groups of initial frequency domain data sequences together to form a group of target time domain data sequences. wherein the other P groups of initial frequency domain data sequences can be data after M times frequency domain oversampling, or can be data sequences that are not generated by the data to be transmitted. In one example, the other P groups of initial frequency domain data sequences are first padded with zeros in the frequency domain, and then cyclically shifted to obtain the other P groups of target frequency domain data sequences; then perform inverse Fourier transform on the N groups of third sequences and the other P groups of target frequency domain data sequences together to form a group of target time domain data sequences.

[0067] In one embodiment, performing an inverse Fourier transform on N sets of third sequences to form a set of target time-domain data sequences includes performing an oversampled inverse Fourier transform on every N data, where each N data is from the N sets of third sequences. In one example, performing an inverse Fourier transform on the N sets of third sequences includes performing an oversampled inverse Fourier transform on every N data, where each N data is from the N sets of third sequences.

[0068] In one embodiment, a set of target time domain data sequences is formed by serially concatenating multiple initial time domain data sequences generated by performing multiple inverse Fourier transforms on a third sequence; the number of initial time domain data sequences is equal to the number of inverse Fourier transform operations. The initial time domain data sequences refer to sub-symbols obtained by performing an oversampled inverse Fourier transform on the third sequence. In this embodiment, an oversampled inverse Fourier transform is performed on N data in the third sequence to obtain corresponding sub-symbols, which are then repeatedly extended and finally serially concatenated in the time domain to obtain a corresponding set of target time domain data sequences.

[0069] In one embodiment, a process of generating an initial time-domain data sequence by performing one inverse Fourier transform among multiple inverse Fourier transforms includes: extracting N data, the same number as the total number of groups of the first sequence, from N groups of third sequences; performing an oversampled inverse Fourier transform on the N data to obtain a corresponding initial time-domain data sequence; wherein the N data are respectively from the N groups of third sequences. For example, assuming that the N groups of third sequences are distributed in N rows (i.e., one group of third sequences is distributed in one row), then N data are selected according to the column number (i.e., data in one column are selected), and then an oversampled inverse Fourier transform is performed on each of the N selected data (i.e., data in each column). For another example, assuming that the N groups of third sequences are distributed in N columns (i.e., one group of third sequences is distributed in one column), then N data are selected according to the row number (i.e., data in one row are selected), and then an oversampled inverse Fourier transform is performed on each of the N selected data (i.e., data in each row).

[0070] In one embodiment, the serial connection interval of the target time domain data sequence is 1 / M of the length after inverse Fourier transform of the N oversampled target data. In this embodiment, the target time domain data sequences generated by inverse Fourier transform are serially connected, and the serial connection interval between each two adjacent groups of initial time domain data sequences is half of the length after inverse Fourier transform of each N oversampled target data, that is, half of the sub-symbol length.

[0071] In one embodiment, the process of generating multiple initial time domain data sequences through multiple inverse Fourier transforms includes: for subbands with different subcarrier spacings, using the length of the third sequence corresponding to the subband with the minimum subcarrier spacing as a reference length; for third sequences corresponding to subbands with non-minimum subcarrier spacings, selecting at least two groups of third sequences, concatenating them to form sequences with the same length as the reference length, forming N new groups of third sequences, and performing multiple inverse Fourier transforms on the N new groups of third sequences to obtain the corresponding multiple initial time domain data sequences. The subbands with different subcarrier spacings represent first sequences with different amounts of data.

[0072] In one embodiment, each group of first sequences is transmitted in a corresponding frequency-domain resource block; each frequency-domain resource block includes Z subcarriers, where Z is a positive integer; the number of data included in each group of second sequences satisfies one of the following conditions: M*s(n); or greater than or equal to M times the number of subcarriers included in each frequency-domain resource block. In one example, among N groups of second sequences, the number of data included in each group of second sequences is M*s(n), i.e., greater than or equal to M times the number of subcarriers included in each frequency-domain resource block.

[0073] In one embodiment, the zero-frequency position of the second sequence during the inverse Fourier transform operation is within the range of the corresponding frequency domain resource block; different groups of second sequences have different zero-frequency positions when the inverse Fourier transform operation is performed. In this embodiment, the zero-frequency position refers to the zero subcarrier (i.e., the 0th subcarrier, which can also be understood as a subcarrier index of 0) in the frequency domain resource block.

[0074] In one embodiment, the zero-frequency position during the inverse Fourier transform operation is one of the subcarriers included in each frequency domain resource block. In one embodiment, the zero-frequency position (i.e., zero subcarrier) during the inverse Fourier transform operation on each set of original data sequences is one of the subcarriers included in each frequency domain resource block.

[0075] In one embodiment, the frequency domain resource blocks include: all frequency domain resource blocks in the channel bandwidth; some frequency domain resource blocks in the channel bandwidth;

[0076] The data to be transmitted includes: all the data to be transmitted in the channel bandwidth; and part of the data to be transmitted in the channel bandwidth.

[0077] In one embodiment, the data transmission method further includes: filtering a set of target time domain data sequences; wherein the filtering operation includes one of the following: single-phase filtering and multi-phase filtering.

[0078] In one embodiment, the filter function used in the polyphase filtering includes one of the following: a root raised cosine function; a raised cosine function; a rectangular function; or an isotropic orthogonal transform algorithm.

[0079] In one embodiment, the data transmission method further includes: performing a windowing operation on a set of target time domain data sequences.

[0080] In the following embodiments, the generation process of the target time-domain data sequence is described with different examples.

[0081] In one example, Figure 2 is a schematic diagram of generating a target time-domain data sequence according to an embodiment of the present application. In this embodiment, the process of generating the target time-domain data sequence is described by taking as an example a case where the number of first sequence groups N is 4, each first sequence group contains the same number of data items (64), and each second sequence group has 32 zero-padded bits at both ends.

[0082] As shown in Figure 2, the data to be transmitted is divided into 4 groups of first sequences, each of which contains 64 data. First, the data of each of the 4 groups of first sequences are multiplied by the coefficient group X(n) for power compensation to obtain 4 groups of second sequences; wherein, the coefficient group X(n) = F(n) / f(n), F(n) is the ideal root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of first sequences, f(n) is the actual root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of first sequences, n = 1, 2, 3, 4, since the subcarrier spacing of the 4 subbands is the same, Therefore, X(1)=X(2)=X(3)=X(4), and each X(n) contains 64 coefficients. Then, 32 zero subcarriers are added to both ends of each second sequence to form four new second sequences, each containing 128 data items. Then, a 128-point inverse Fourier transform is performed on the new second sequences to form four third sequences. Then, a subband-level inverse Fourier transform and polyphase filtering are performed on the four third sequences to form a target time-domain data sequence. A target time-domain data sequence is transmitted on the time-frequency resources.

[0083] In one example, FIG3 is a schematic diagram of another target time-domain data sequence generation method provided in an embodiment of the present application. In this embodiment, the target time-domain data sequence generation method is described by taking the case where the number of first sequence groups N is 4, each first sequence group contains the same number of data items (48), and each second sequence group has 40 zero-padded bits at both ends as an example.

[0084] As shown in Figure 3, the data to be transmitted is divided into four groups of first sequences, each containing 48 data, or four RBs. First, the data in each of the four groups of first sequences is multiplied by the coefficient group X(n) for power compensation, resulting in four groups of second sequences. Among them, the coefficient group X(n) = F(n) / f(n), F(n) is the ideal root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of the first sequence, f(n) is the actual root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of the first sequence, n = 1, 2, 3, 4, since the subcarrier spacing of the four subbands is the same, so X(1) = X(2) = X(3) = X(4), and each X(n) contains 48 coefficients; then, 40 0 ​​subcarriers are added to both ends of each group of the second sequence to form 4 new second sequences, each of which contains 128 data; then, the new second sequence is subjected to a 128-point inverse Fourier transform to form 4 groups of third sequences; then, the 4 groups of third sequences are subjected to a subband-level inverse Fourier transform and polyphase filtering operation to form a group of target time domain data sequences. A group of target time domain data sequences is transmitted on the time-frequency resources.

[0085] In one example, FIG4 is a schematic diagram of another target time-domain data sequence generation method provided in an embodiment of the present application. In this embodiment, the target time-domain data sequence generation process is described using the example where the number of first sequence groups N is 4, each first sequence group contains the same number of data items, 40 items, and each second sequence group has 44 zero-padded items at both ends.

[0086] As shown in Figure 4, the data to be transmitted is divided into four groups of first sequences, each of which contains 40 data. First, the data of each of the four groups of first sequences is multiplied by the coefficient group X(n) for power compensation to obtain four groups of second sequences. Among them, the coefficient group X(n) = F(n) / f(n), F(n) is the ideal root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of the first sequence, f(n) is the actual root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of the first sequence, n = 1, 2, 3, 4, since the subcarrier spacing of the four subbands is the same, so X(1) = X(2) = X(3) = X(4), and each X(n) contains 40 coefficients; then, 44 zero subcarriers are added to both ends of each group of the second sequence to form four new groups of second sequences, each of which contains 128 data; then, a 128-point inverse Fourier transform is performed on the new second sequence to form four groups of third sequences; then, a subband-level inverse Fourier transform and polyphase filtering operation are performed on the four groups of third sequences to form a group of target time domain data sequences. A group of target time domain data sequences is transmitted on the time-frequency resources.

[0087] In one example, FIG5 is a schematic diagram of generating another target time-domain data sequence provided in an embodiment of the present application. In this embodiment, the target time-domain data sequence generation process is described using the example where the number of first sequence groups N is 4, each first sequence group contains the same number of data items, 48, and each second sequence group has 40 zero-padded bits at both ends.

[0088] As shown in Figure 5, the data to be transmitted is divided into four groups of first sequences, each containing 48 data, or four RBs. First, the data in each of the four groups of first sequences is multiplied by the coefficient group X(n) for power compensation, resulting in four groups of second sequences. Among them, the coefficient group X(n) = 1 / f(n), f(n) is the actual root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of the first sequence, n = 1, 2, 3, 4. Since the subcarrier spacing of the four subbands is the same, X(1) = X(2) = X(3) = X(4), and each X(n) contains 48 coefficients; then, 40 zero subcarriers are added to both ends of each group of the second sequence to form four new groups of second sequences, each of which contains 128 data; then, a 128-point inverse Fourier transform is performed on the new second sequences to form four groups of third sequences; then, a subband-level inverse Fourier transform and polyphase filtering operation are performed on the four groups of third sequences to form a group of target time domain data sequences. A group of target time domain data sequences is transmitted on the time-frequency resources.

[0089] In one example, FIG6 is a schematic diagram of generating another target time-domain data sequence provided in an embodiment of the present application. In this embodiment, the process of generating the target time-domain data sequence is described by taking as an example a case where the number of first sequence groups N is 4, each first sequence group contains the same number of data items, 48, and each second sequence group has 40 zeros padded at both ends.

[0090] As shown in Figure 6, the data to be transmitted is divided into 4 groups of first sequences, and each group of first sequences contains 48 data, that is, 4 RBs. First, the data of each group of the first sequences in the 4 groups of first sequences are multiplied by the coefficient group X(n) for power compensation to obtain 4 groups of second sequences. Among them, the two ends of the n-th coefficient group X(n) contain 8 1s respectively, n=1, 2, 3, 4, and the coefficient group X'(n) after removing the 8 1s at both ends of the n-th coefficient group X(n) is F'(n) / f'(n), F'(n) is the ideal root raised cosine filter frequency domain coefficient at the corresponding subcarrier position after removing the 8 subcarriers at both ends of the n-th first sequence, f'(n) is the actual root raised cosine filter frequency domain coefficient at the corresponding subcarrier position after removing the 8 subcarriers at both ends of the n-th first sequence, n=1, 2, 3, 4; Since the subcarrier spacing of the four subbands is the same, X(1)=X(2)=X(3)=X(4), and each X(n) contains 48 coefficients. Then, 40 zero subcarriers are added to both ends of each group of second sequences to form four new groups of second sequences, each of which contains 128 data items. Then, a 128-point inverse Fourier transform is performed on the new second sequences to form four groups of third sequences. Then, a subband-level inverse Fourier transform and polyphase filtering operation are performed on the four groups of third sequences to form a group of target time-domain data sequences. A group of target time-domain data sequences is transmitted on the time-frequency resources.

[0091] In one example, FIG7 is a schematic diagram of generating another target time-domain data sequence provided in an embodiment of the present application. In this embodiment, the process of generating the target time-domain data sequence is described by taking as an example a case where the number of first sequence groups N is 4, each first sequence group contains the same number of data items, 48, and each second sequence group has 40 zeros padded at both ends.

[0092] As shown in Figure 7, the data to be transmitted is divided into four groups of first sequences, each containing 48 data, or four RBs. First, the data in each of the four groups of first sequences is multiplied by the coefficient group X(n) for power compensation, resulting in four groups of second sequences. Among them, the nth group of coefficients X(n) contains 8 1s at both ends, n=1, 2, 3, 4, and the coefficient group X'(n) after removing the 8 1s at both ends of the nth group of coefficients X(n) is 1 / f'(n), f'(n) is the actual root raised cosine filter frequency domain coefficient at the corresponding subcarrier position after removing the 8 subcarriers at both ends of the nth group of first sequence, n=1, 2, 3, 4; since the subcarrier intervals of the four subbands are the same, X(1)=X(2)=X(3)=X(4), and each X(n) contains 48 coefficients; then, 40 0 ​​subcarriers are added to both ends of each group of second sequences to form 4 new second sequences, and the number of data contained in each new second sequence is 128; then, the new second sequences are subjected to 128-point inverse Fourier transform to form 4 third sequences; then, the 4 third sequences are subjected to subband-level inverse Fourier transform and polyphase filtering operations to form a group of target time domain data sequences. A set of target time domain data sequences is transmitted on time-frequency resources.

[0093] In one example, FIG8 is a schematic diagram of generating another target time-domain data sequence provided in an embodiment of the present application. In this embodiment, the process of generating the target time-domain data sequence is described by taking as an example a case where the number of first sequence groups N is 4, each first sequence group contains the same number of data items, 48, and each second sequence group has 40 zeros padded at both ends.

[0094] As shown in Figure 8, the data to be transmitted is divided into four groups of first sequences, each containing 48 data, or four RBs. First, the data in each of the four groups of first sequences is multiplied by the coefficient group X(n) for power compensation, resulting in four groups of second sequences. Among them, the coefficient group X(n) = F(n) / f(n), F(n) is the ideal root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of the first sequence, f(n) is the actual root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of the first sequence, n = 1, 2, 3, 4, since the subcarrier intervals of the four subbands are the same, so X(1) = X(2) = X(3) = X(4), and each X(n) contains 48 coefficients; then, 40 0 ​​subcarriers are added to both ends of each group of the second sequence to form 4 groups of new second sequences, and the number of data contained in each new second sequence is 128; then, the new second sequence is subjected to a 128-point inverse Fourier transform to form 4 groups of third sequences; then, the 4 groups of third sequences and other groups of data are subjected to subband-level inverse Fourier transform and polyphase filtering operations to form a group of target time domain data sequences. The other data sets contain 48 data points, which are also processed at the sub-band level after zero padding, power compensation, and IDFT. A target time domain data sequence is transmitted on the time-frequency resources.

[0095] In one example, Figure 9 is a schematic diagram of generating another target time-domain data sequence provided in an embodiment of the present application. In this embodiment, the target time-domain data sequence generation process is described by taking as an example a case where the number of first sequence groups N is 4, each first sequence group contains the same number of data items, 48 ​​items, the first first sequence group contains 24 reference signal data items, and each second sequence group has 40 zero-padded bits at both ends.

[0096] As shown in Figure 9, the data to be transmitted is divided into four groups of first sequences. Each group of first sequences contains 48 data, or four RBs. The first group of first sequences contains 24 reference signals. First, the data in each of the four groups of first sequences is power-compensated by the coefficient group X(n), resulting in four groups of second sequences. Among them, the coefficient group X(n) = F(n) / f(n), F(n) is the ideal root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of the first sequence, f(n) is the actual root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of the first sequence, n = 1, 2, 3, 4, since the subcarrier spacing of the four subbands is the same, so X(1) = X(2) = X(3) = X(4), and each X(n) contains 48 coefficients; then, 40 zero subcarriers are added to both ends of each group of the second sequence to form four new groups of second sequences, each of which contains 128 data; then, a 128-point inverse Fourier transform is performed on the new second sequences to form four groups of third sequences; then, a subband-level inverse Fourier transform and polyphase filtering operation are performed on the four groups of third sequences to form a group of target time domain data sequences. A group of target time domain data sequences is transmitted on the time-frequency resources.

[0097] In one example, Figure 10 is a schematic diagram of generating another target time-domain data sequence provided by an embodiment of the present application. In this embodiment, the process of generating the target time-domain data sequence is described by taking as an example the case where the number of first sequence groups N is 4, the first two first sequence groups contain the same number of data items, 24 each; the second two first sequence groups contain the same number of data items, 48 ​​each; and the first two second sequence groups have 20 zeros padded at both ends, while the second two second sequence groups have 40 zeros padded at both ends.

[0098] As shown in Figure 10, the data to be transmitted is divided into four groups of first sequences. The first two groups of first sequences each contain 24 data, or two RBs, while the last two groups of first sequences each contain 48 data, or four RBs. First, the data in each of the four groups of first sequences is multiplied by the coefficient group X(n) for power compensation, resulting in four groups of second sequences. Among them, the coefficient group X(n) = F(n) / f(n), F(n) is the ideal root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the first sequence of the nth group, f(n) is the actual root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the first sequence of the nth group, n = 1, 2, 3, 4, since the subcarrier spacing of the four subbands is different, so X(1) = X(2), X(3) = X(4), and X(1) and X(2) each contain 24 coefficients, X(3) and X(4) each contain 48 coefficients; then, 20 0 subcarriers are added to both ends of each second sequence in the first two groups respectively to obtain the corresponding new second sequence, and the number of data contained in each new second sequence The first two groups of second sequences are then subjected to a 64-point inverse Fourier transform, while the second two groups are subjected to a 128-point inverse Fourier transform. The data in the first two groups of second sequences are then concatenated with the symbol data at the next moment to form two groups of 128-point data. These data are then combined with the data in the second two groups of second sequences to form four groups of 128-point third sequences. The four groups of third sequences are then subjected to a subband-level inverse Fourier transform and polyphase filtering to form a target time-domain data sequence. A target time-domain data sequence is transmitted on the time-frequency resources.

[0099] In one example, Figure 11 is a schematic diagram of generating another target time-domain data sequence provided in an embodiment of the present application. In this embodiment, the process of generating the target time-domain data sequence is described by taking as an example a case where the number of first sequence groups N is 4, each first sequence group contains the same number of data items, 64, and each second sequence group has 32 zeros padded at both ends.

[0100] As shown in Figure 11, the data to be transmitted is divided into 4 groups of first sequences, and each group of first sequences contains 64 data. First, the data of each group of the 4 groups of first sequences are multiplied by the coefficient group X(n) for power compensation to obtain 4 groups of second sequences. Among them, the coefficient group X(n) = F(n) / f(n), F(n) is the ideal root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of first sequences, f(n) is the actual root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of first sequences, n = 1, 2, 3, 4, since the subcarrier spacing of the 4 subbands is the same, so X(1) = X(2) = X(3) = X(4), and each X(n) contains 64 coefficients; then, 32 0 subcarriers are added to both ends of each group of second sequences to form 4 new groups. A second sequence is generated, with each new second sequence containing 128 data items. A 128-point inverse Fourier transform is then performed on the new second sequence to form four third sequences. One data item is then extracted from each new second sequence column by column, resulting in four data items. An oversampled 16-point inverse Fourier transform is performed on each of the four extracted data items to obtain a subsymbol. Each subsymbol is then repeatedly expanded by a factor of four. Finally, the 128 subsymbols are concatenated in the time domain to form a target time domain data sequence. The concatenation interval is 8 points, or half a subsymbol length. The target time domain data sequence is then transmitted on the time-frequency resources.

[0101] In one example, Figure 12 is a schematic diagram of transmitting data to be transmitted according to an embodiment of the present application. As shown in Figure 12, the data to be transmitted is windowed or filtered in sequence, and then DAC and RF processes are performed.

[0102] As shown in FIG12 , transmitting a set of data to be transmitted further includes windowing or filtering the target time domain data sequence corresponding to the data to be transmitted, and then performing DAC and RF processes.

[0103] The windowing process includes: grouping the target time domain data sequence corresponding to the data to be transmitted, then performing period extension, then performing point multiplication by a preset function, and then performing staggered superposition between the groups.

[0104] The filtering is single-phase filtering or multi-phase filtering, and the multi-phase filtering is to filter each group of the new N groups of data sequences.

[0105] In one embodiment, Figure 13 is a block diagram of a data transmission device provided in an embodiment of the present application. As shown in Figure 13, the data transmission device in this embodiment includes: a partitioning module 1310, a first conversion module 1320, a second conversion module 1330, a third conversion module 1340, and a transmission module 1350.

[0106] The division module 1310 is configured to divide the data to be transmitted into N groups of first sequences; wherein the nth group of first sequences contains k(n) data, where k(n) is a positive integer;

[0107] The first conversion module 1320 is configured to multiply the nth first sequence of the N first sequences by the coefficient group X(n) to obtain N second sequences, where n=1, 2, ..., N, and N is an integer greater than or equal to 2.

[0108] The second conversion module 1330 is configured to perform an inverse Fourier transform on each group of second sequences to obtain N groups of third sequences;

[0109] The third conversion module 1340 is configured to perform an inverse Fourier transform on the N groups of third sequences to form a group of target time domain data sequences;

[0110] The transmission module 1350 is configured to transmit the target time-domain data sequence on pre-configured time-frequency resources.

[0111] In one embodiment, before performing inverse Fourier transform on each group of second sequences, the method further includes:

[0112] Perform zero padding operation on both ends of each group of second sequences respectively; wherein, each group of second sequences after zero padding contains M*s(n) data; M is a positive integer, s(n)≥k(n).

[0113] In one embodiment, the number of points for performing inverse Fourier transform on each group of second sequences is M*s(n).

[0114] In one embodiment, the channel bandwidth includes N sub-bands, and each sub-band corresponds to a set of first sequences.

[0115] In one embodiment, multiplying the n-th group of first sequences in the N groups of first sequences by the coefficient group X(n) is to perform a frequency domain shaping operation on the frequency domain data in the n-th group of first sequences.

[0116] In one embodiment, the coefficient group X(n) by which the n-th group of first sequences of different time-domain symbols are multiplied is the same; n=1, 2, . . . , N; N is an integer greater than or equal to 2.

[0117] In one embodiment, the length of the n-th coefficient group X(n) is the same as k(n); n=1, 2, . . . , N; N is an integer greater than or equal to 2.

[0118] In one embodiment, the first sequences with the same k(n) are multiplied by the same coefficient set X(n).

[0119] In one embodiment, the coefficient groups X(n) by which the first sequences corresponding to subbands with the same subcarrier spacing are multiplied are the same; and the coefficient groups X(n) by which the first sequences corresponding to different subcarrier spacings are multiplied are different.

[0120] In one embodiment, the nth group of coefficients X(n) = F(n) / f(n); F(n) is the frequency domain coefficient of the ideal root raised cosine filter at the frequency domain subcarrier position corresponding to the nth group of first sequence, f(n) is the frequency domain coefficient of the actual root raised cosine filter at the frequency domain subcarrier position corresponding to the nth group of first sequence, n = 1, 2, ..., N; N is an integer greater than or equal to 2.

[0121] In one embodiment, the nth coefficient group X(n) = 1 / f(n); f(n) is the actual root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth first sequence, n = 1, 2, ..., N; N is an integer greater than or equal to 2.

[0122] In one embodiment, the nth coefficient group X(n) is power normalized to satisfy mean(|X(n)| 2 )=1;n=1,2,……,N;N is an integer greater than or equal to 2.

[0123] In one embodiment, both ends of the n-th coefficient group X(n) contain p 1s; n=1, 2, ..., N; N is an integer greater than or equal to 2; and p is an integer greater than or equal to 0.

[0124] In one embodiment, the coefficient group X'(n) after removing the p ones at both ends of the nth coefficient group X(n) is equal to F'(n) / f'(n); F'(n) is the frequency domain coefficient of the ideal root raised cosine filter at the corresponding frequency domain subcarrier position after removing the p subcarriers at both ends of the nth first sequence; f'(n) is the frequency domain coefficient of the actual root raised cosine filter at the corresponding frequency domain subcarrier position after removing the p subcarriers at both ends of the nth first sequence; n=1, 2, ..., N; N is an integer greater than or equal to 2.

[0125] In one embodiment, the coefficient group X'(n) after removing the p ones at both ends of the nth coefficient group X(n) is equal to 1 / f'(n); f'(n) is the actual root raised cosine filter frequency domain coefficient at the corresponding frequency domain subcarrier position after removing the p subcarriers at both ends of the nth first sequence; n=1, 2, ..., N; N is an integer greater than or equal to 2.

[0126] In one embodiment, the nth coefficient group X'(n) is power normalized to satisfy mean(|X'(n)| 2 )=1;n=1,2,……,N;N is an integer greater than or equal to 2.

[0127] In one embodiment, the number of data k(n) included in each group of the first sequence satisfies one of the following conditions: an arbitrary positive integer; an integer multiple of a resource block (RB); 2 to the power of i; the ratio of two adjacent k(n)s satisfies 2 to the power of i; and all k(n)s are the same.

[0128] In one embodiment, a zero padding operation is performed on both ends of each group of second sequences, and [M*s(n)-k(n)] / 2 zero data are added to both ends of each group of second sequences.

[0129] In one embodiment, the number of points for inverse Fourier transform of each group of second sequences satisfies one of the following conditions: the ratio of the number of points for inverse Fourier transform of two adjacent groups of second sequences satisfies 2 to the power of i; the number of points for inverse Fourier transform of each group of second sequences is the same; wherein i is an integer.

[0130] In one embodiment, performing inverse Fourier transform on N groups of third sequences to form a group of target time-domain data sequences includes:

[0131] Perform frequency domain zero padding and cyclic shift operations on the other P groups of initial frequency domain data sequences in sequence to obtain the other P groups of target frequency domain data sequences;

[0132] Perform inverse Fourier transform on the N groups of third sequences and the other P groups of target frequency domain data sequences to form a group of target time domain data sequences; wherein the other P groups of target frequency domain data sequences include: data after M times frequency domain oversampling, and are not included in the data sequence generated by the data to be transmitted.

[0133] In one embodiment, performing inverse Fourier transform on N groups of third sequences to form a group of target time-domain data sequences includes:

[0134] An oversampled inverse Fourier transform is performed on every N data, and every N data comes from N groups of third sequences.

[0135] In one embodiment, a set of target time domain data sequences is formed by serially linking multiple initial time domain data sequences generated by performing multiple inverse Fourier transforms on the third sequence; wherein the number of initial time domain data sequences is equal to the number of inverse Fourier transform operations.

[0136] In one embodiment, the process of generating an initial time-domain data sequence by performing one inverse Fourier transform among multiple inverse Fourier transforms includes:

[0137] Extract N data from the N groups of the third sequence, the same number as the total number of groups in the first sequence;

[0138] An oversampled inverse Fourier transform is performed on the N data to obtain a corresponding initial time domain data sequence; wherein the N data come from N groups of third sequences respectively.

[0139] In one embodiment, the serial connection interval of the target time-domain data sequence is 1 / M of the length after inverse Fourier transform is performed on the N oversampled target data.

[0140] In one embodiment, the process of generating multiple initial time-domain data sequences by performing multiple inverse Fourier transforms includes:

[0141] For subbands with different subcarrier spacings, the length of the third sequence corresponding to the subband with the smallest subcarrier spacing is used as the reference length;

[0142] For the third sequences corresponding to the subbands with non-minimum subcarrier spacing, at least two groups of third sequences are selected and concatenated to form sequences with the same length as the reference length, forming N new groups of third sequences. Multiple inverse Fourier transforms are performed on the new N groups of third sequences to obtain corresponding multiple initial time domain data sequences.

[0143] In one embodiment, each group of first sequences is transmitted in a corresponding frequency domain resource block; each frequency domain resource block includes Z subcarriers;

[0144] The number of data included in each group of the second sequence meets one of the following conditions: M*s(n); greater than or equal to M times the number of subcarriers included in each frequency domain resource block.

[0145] In one embodiment, the zero-frequency position of the second sequence when performing an inverse Fourier transform operation is within the range of the corresponding frequency domain resource block;

[0146] The zero-frequency positions of different groups of second sequences when performing inverse Fourier transform operations are different.

[0147] In one embodiment, the zero-frequency position during the inverse Fourier transform operation is located at one of the subcarriers included in each frequency domain resource block.

[0148] In one embodiment, the frequency domain resource blocks include: all frequency domain resource blocks in the channel bandwidth; some frequency domain resource blocks in the channel bandwidth;

[0149] The data to be transmitted includes: all the data to be transmitted in the channel bandwidth; and part of the data to be transmitted in the channel bandwidth.

[0150] In one embodiment, the data transmission device further includes:

[0151] The filtering module is configured to filter a set of target time domain data sequences; wherein the filtering operation includes one of the following: single-phase filtering and multi-phase filtering.

[0152] In one embodiment, the filter function used in the polyphase filtering includes one of the following: a root raised cosine function; a raised cosine function; a rectangular function; or an isotropic orthogonal transform algorithm.

[0153] In one embodiment, the data transmission device further includes:

[0154] The windowing module is configured to perform a windowing operation on a set of target time domain data sequences.

[0155] The data transmission device provided in this embodiment is configured to implement the data transmission method of the embodiment shown in FIG1 . The implementation principle and technical effects of the data transmission device provided in this embodiment are similar and will not be described in detail here.

[0156] In one embodiment, FIG14 is a schematic diagram of the structure of a communication device provided by an embodiment of the present application. As shown in FIG14, the device provided by the present application includes: a processor 1410, a memory 1420, and a communication interface 1430. The number of processors 1410 in the device can be one or more, and FIG14 takes one processor 1410 as an example. The number of memories 1420 in the device can be one or more, and FIG14 takes one memory 1420 as an example. The processor 1410, memory 1420, and communication interface 1430 of the device can be connected via a bus or other means, and FIG14 takes the bus connection as an example. Exemplarily, the communication device can be on the base station side or on the terminal side. The memory 1420, as a computer-readable storage medium, can be configured to store software programs, computer executable programs, and modules, such as program instructions / modules corresponding to the device of any embodiment of the present application (for example, the partitioning module 1310, the first conversion module 1320, the second conversion module 1330, the third conversion module 1340, and the transmission module 1350 in the data transmission device). The memory 1420 may include a program storage area and a data storage area, wherein the program storage area may store an operating system and applications required for at least one function; the data storage area may store data created based on the use of the device, etc. In addition, the memory 1420 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other non-volatile solid-state storage device. In some instances, the memory 1420 may further include a memory remotely located relative to the processor 1410, and these remote memories may be connected to the device via a network. Examples of the above-mentioned networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof. Among them, the communication interface 1430 is used for data interaction between multiple communication devices.

[0157] The communication device provided above can be configured to execute the data transmission method provided in any of the above embodiments, and have corresponding functions and effects.

[0158] An embodiment of the present application also provides a storage medium containing computer-executable instructions, which, when executed by a computer processor, are used to perform a data transmission method, the method comprising: dividing the data to be transmitted into N groups of first sequences; wherein the nth group of the first sequence contains k(n) data, and k(n) is a positive integer; multiplying the nth group of the first sequence in the N groups of first sequences by a coefficient group X(n) to obtain N groups of second sequences; wherein n=1, 2, ..., N; N is an integer greater than or equal to 2; performing an inverse Fourier transform on each group of the second sequences to obtain N groups of third sequences; performing an inverse Fourier transform on the N groups of third sequences to form a group of target time domain data sequences; and transmitting the target time domain data sequences on pre-configured time-frequency resources.

[0159] It will be appreciated by those skilled in the art that the term user equipment encompasses any suitable type of wireless user equipment, such as a mobile phone, a portable data processing device, a portable web browser or a car-mounted mobile station.

[0160] In general, various embodiments of the present application may be implemented in hardware or dedicated circuits, software, logic, or any combination thereof. For example, some aspects may be implemented in hardware, while other aspects may be implemented in firmware or software that can be executed by a controller, microprocessor, or other computing device, although the present application is not limited thereto.

[0161] Embodiments of the present application may be implemented by executing computer program instructions by a data processor of a mobile device, for example, in a processor entity, or by hardware, or by a combination of software and hardware. The computer program instructions may be assembly instructions, instruction set architecture (ISA) instructions, machine instructions, machine-dependent instructions, microcode, firmware instructions, state setting data, or source code or object code written in any combination of one or more programming languages.

[0162] The block diagram of any logic flow in the drawings of the present application may represent program steps, or may represent interconnected logic circuits, modules and functions, or may represent a combination of program steps and logic circuits, modules and functions. A computer program may be stored on a memory. The memory may be of any type suitable for the local technical environment and may be implemented using any suitable data storage technology, such as, but not limited to, read-only memory (ROM), random access memory (RAM), optical memory devices and systems (digital versatile discs (DVD) or compact disks (CD)), etc. Computer-readable media may include non-transient storage media. A data processor may be of any type suitable for the local technical environment, such as, but not limited to, a general-purpose computer, a special-purpose computer, a microprocessor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), and a processor based on a multi-core processor architecture.

[0163] The above are merely preferred embodiments of the present application and are not intended to limit the present application. Those skilled in the art will readily appreciate that various modifications and variations are possible. Any modifications, equivalent substitutions, or improvements made within the spirit and principles of the present application shall be included within the scope of protection of the present application.

Claims

1. A data transmission method, comprising: Divide the data to be transmitted into N groups of first sequences; wherein the nth group of the first sequence contains k(n) data, and k(n) is a positive integer; Multiplying the nth group of first sequences in the N groups of first sequences by the coefficient group X(n) to obtain N groups of second sequences; wherein n=1, 2, ..., N; N is an integer greater than or equal to 2; Performing inverse Fourier transform on each group of the second sequences respectively to obtain N groups of third sequences; Performing inverse Fourier transform on the N groups of third sequences to form a group of target time domain data sequences; The target time domain data sequence is transmitted on preconfigured time-frequency resources.

2. The method according to claim 1, before performing inverse Fourier transform on each group of the second sequences respectively, further comprising: Perform zero padding operation on both ends of each group of the second sequences respectively; wherein each group of the second sequences after zero padding contains M*s(n) data; M is a positive integer, s(n)≥k(n).

3. The method according to claim 2, wherein: The number of points for performing inverse Fourier transform on each group of second sequences is M*s(n).

4. The method according to claim 1, wherein: The channel bandwidth includes N sub-bands, and each sub-band corresponds to a group of first sequences.

5. The method according to claim 1, wherein: The multiplying the nth group of first sequences in the N groups of first sequences by the coefficient group X(n) is to perform a frequency domain shaping operation on the frequency domain data in the nth group of first sequences.

6. The method according to claim 1, wherein: The coefficient group X(n) by which the nth group of the first sequences of different time domain symbols are multiplied is the same; n=1, 2, ..., N; N is an integer greater than or equal to 2.

7. The method according to claim 1, wherein: The length of the nth coefficient group X(n) is the same as k(n); n=1, 2, ..., N; N is an integer greater than or equal to 2.

8. The method according to claim 1, wherein: The coefficient group X(n) by which the first sequence with the same k(n) is multiplied is the same.

9. The method according to claim 1, wherein: The coefficient groups X(n) by which the first sequences corresponding to subbands with the same subcarrier spacing are multiplied are the same; the coefficient groups X(n) by which the first sequences corresponding to different subcarrier spacings are multiplied are different.

10. The method according to claim 1, wherein: The nth group of coefficients X(n)=F(n) / f(n); F(n) is the ideal root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of first sequence, / f(n) is the actual root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth group of first sequence, n=1,2,...,N; N is an integer greater than or equal to 2.

11. The method according to claim 1, wherein: The nth coefficient group X(n)=1 / f(n); f(n) is the actual root raised cosine filter frequency domain coefficient at the frequency domain subcarrier position corresponding to the nth first sequence, n=1, 2, ..., N; N is an integer greater than or equal to 2.

12. The method according to claim 1, wherein: The power of the nth coefficient group X(n) is normalized to satisfy mean(|X(n)| 2 )=1;n=1,2,……,N;N is an integer greater than or equal to 2.

13. The method according to claim 1, wherein: The nth coefficient group X(n) contains p 1s at both ends respectively; n=1, 2, ..., N; N is an integer greater than or equal to 2; p is an integer greater than or equal to 0.

14. The method according to claim 13, wherein: The coefficient group X'(n) after removing the p 1s at both ends of the nth coefficient group X(n) is equal to F'(n) / f'(n); F'(n) is the ideal root raised cosine filter frequency domain coefficient at the corresponding frequency domain subcarrier position after removing the p subcarriers at both ends of the first sequence of the nth group; f'(n) is the actual root raised cosine filter frequency domain coefficient at the corresponding frequency domain subcarrier position after removing the p subcarriers at both ends of the first sequence of the nth group; n=1,2,...,N; N is an integer greater than or equal to 2.

15. The method according to claim 13, wherein: The coefficient group X'(n) = 1 / f'(n) after removing the p 1s at both ends of the nth coefficient group X(n); / f'(n) is the actual root raised cosine filter frequency domain coefficient at the corresponding frequency domain subcarrier position after removing the p subcarriers at both ends of the first sequence of the nth group; n = 1, 2, ..., N; N is an integer greater than or equal to 2.

16. The method according to claim 14 or 15, wherein: The power of the nth coefficient group X'(n) is normalized to satisfy mean(|X'(n)| 2 )=1;n=1,2,……,N;N is an integer greater than or equal to 2.

17. The method according to any one of claims 1 to 15, wherein: The performing inverse Fourier transform on the N groups of third sequences to form a group of target time domain data sequences includes: Performing frequency domain zero padding and cyclic shift operations on other P groups of initial frequency domain data sequences in sequence to obtain other P groups of target frequency domain data sequences; Perform inverse Fourier transform on the N groups of third sequences and the other P groups of target frequency domain data sequences to form a group of target time domain data sequences; wherein the other P groups of target frequency domain data sequences include: data after M times frequency domain oversampling, and are not included in the data sequence generated by the data to be transmitted.

18. The method according to any one of claims 1 to 15, wherein: The set of target time domain data sequences is formed by serially linking a plurality of initial time domain data sequences generated by performing multiple inverse Fourier transforms on the N sets of third sequences; the number of the initial time domain data sequences is equal to the number of inverse Fourier transform operations.

19. The method according to claim 18, wherein: The process of generating an initial time domain data sequence by performing one inverse Fourier transform among the multiple inverse Fourier transforms includes: Extracting N data from N groups of third sequences, the same number as the total number of groups of the first sequence; An oversampled inverse Fourier transform is performed on the N data to obtain a corresponding initial time domain data sequence; the N data come from N groups of third sequences respectively.

20. The method according to claim 18, wherein: The serial connection interval of the target time domain data sequence is 1 / M of the length after the inverse Fourier transform of the oversampled N target data.

21. The method according to claim 18, wherein: The process of generating multiple initial time domain data sequences by multiple inverse Fourier transforms includes: For subbands with different subcarrier spacings, the length of the third sequence corresponding to the subband with the smallest subcarrier spacing is used as the reference length; For the third sequence corresponding to the subband with non-minimum subcarrier spacing, select at least two groups of third sequences, concatenate them into sequences with the same length as the reference length, form new N groups of third sequences, perform multiple inverse Fourier transforms on the new N groups of third sequences, and obtain corresponding multiple initial time domain data sequences.

22. The method according to any one of claims 1 to 15, wherein: Each group of first sequences is transmitted in a corresponding frequency domain resource block; each frequency domain resource block includes Z subcarriers, where Z is a positive integer; The number of data contained in each group of the second sequence satisfies one of the following conditions: M*s(n); greater than It is equal to M times the number of subcarriers contained in each frequency domain resource block.

23. A communication device comprising: memory, and at least one processor; The memory is configured to store at least one program; When the at least one program is executed by the at least one processor, the at least one processor implements the method according to any one of claims 1 to 22.

24. A storage medium storing a computer program, wherein the computer program, when executed by a processor, implements the method according to any one of claims 1 to 22.

Images