Data transmission method and device and storage medium

Abstract

The invention provides a data transmission method and device and a storage medium. The method comprises the following steps: dividing data to be transmitted into N groups of first sequences; wherein the nth group of the first sequence comprises 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 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 inverse Fourier transform on each group of second sequences to obtain N groups of third sequences; inverse Fourier transform is carried out on the N groups of third sequences to form a group of target time domain data sequences; and transmitting the target time domain data sequence on a pre-configured time frequency resource.

Description

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 different parameter sets (Numerology) can be used between two adjacent sub-bands, which will destroy the orthogonality between sub-carriers and bring new interference problems. As for how to solve this interference problem, one of the more direct methods is to insert a protection bandwidth between two transmission bands with different Numerologies, but this will waste 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. Summary of the invention

[0003] 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.

[0004] The present application provides a data transmission method, including:

[0005] 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;

[0006] 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;

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

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

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

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

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

[0012] 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 of the above embodiments.

[0013] An embodiment of the present application provides a storage medium, wherein the storage medium stores a computer program, and when the computer program is executed by a processor, the method described in any of the above embodiments is implemented. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] Figure 1 is a flow chart of a data transmission method provided in an embodiment of the present application;

[0015] Figure 2 It is a schematic diagram of generating a target time domain data sequence provided by an embodiment of the present application;

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

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

[0018] Figure 5 This is a schematic diagram of generating another target time domain data sequence provided in an embodiment of the present application;

[0019] Figure 6 This is a schematic diagram of generating another target time domain data sequence provided in an embodiment of the present application;

[0020] Figure 7 This is a schematic diagram of generating another target time domain data sequence provided in an embodiment of the present application;

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

[0022] Fig. 9 This is a schematic diagram of generating another target time domain data sequence provided in an embodiment of the present application;

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

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

[0025] Fig.12 is a transmission schematic diagram of data to be transmitted provided in an embodiment of the present application;

[0026] Fig.13is a structural block diagram of a data transmission device provided in an embodiment of the present application;

[0027] Fig.14 It is a structural diagram of a communication device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0028] The following will describe the embodiments of the present application in conjunction with the accompanying drawings. The following will describe the present application in conjunction with the accompanying drawings of the embodiments, and the examples cited are only used to explain the present application and are not used to limit the scope of the present application.

[0029] 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 composed of subcarriers and OFDM symbols constitute the wireless physical time-frequency resources of the LTE system. At present, OFDM technology has been widely used in wireless communications. Due to the use of cyclic prefix CP (Cyclic Prefix), the CP-OFDM system can well solve the multipath delay problem and divide the frequency selective channel into a set of parallel flat channels, which greatly simplifies the channel estimation method and has a higher channel estimation accuracy. However, the performance of the CP-OFDM system is sensitive to the frequency offset and time offset between adjacent subbands. This is mainly because the spectrum leakage of the system is relatively large, which easily leads to inter-subband interference. At present, the LTE system uses a guard interval in the frequency domain, but this reduces the spectrum efficiency, so some new technologies are needed to suppress out-of-band leakage.

[0030] 5G NR (Fifth Generation New Radio) communication technology still uses CP-OFDM as the basic waveform, and two adjacent sub-bands can use different Numerologies, which will destroy the orthogonality between sub-carriers and bring new interference problems. As for how to solve this interference problem, one of the more direct methods is to insert a guard bandwidth between two transmission bands with different Numerologies, but this will waste frequency resources.

[0031] The frequency bands used by future 6G services will span a wide range, and the deployment methods will also be diverse. Not only will multi-bandwidth channels be required, but also waveform solutions that meet different scenarios will be required. The independent implementation of each waveform solution will increase the cost of base stations / terminals. How to design a unified waveform architecture to flexibly integrate multiple waveforms and how to flexibly support applications with different channel bandwidths is an urgent problem to be solved.

[0032] In one embodiment, Figure 11 is a flow chart of a data transmission method provided by an embodiment of the present application. This embodiment is applied to the case of flexibly supporting multiple bandwidth channels and supporting multiple waveforms. Figure 1 As shown, this embodiment includes: S110-S150.

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

[0034] 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 transmitter to the receiver. 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 can be divided to obtain the corresponding N groups of first sequences.

[0035] 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.

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

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

[0038] 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.

[0039] S140, performing inverse Fourier transform on the N groups of third sequences to form a group of target time domain data sequences.

[0040] In one example, N groups of third sequences are first Fourier transformed to obtain corresponding N groups of new third sequences, which are all frequency domain data, and then the new N groups of third sequences are inverse Fourier transformed to form a group of target time domain data sequences.

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

[0042] The data to be transmitted are divided into N groups of first sequences, and the nth group of first sequences in the N groups of first sequences are 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.

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

[0044] Each group of second sequences is padded with zeros at both ends; 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, inverse Fourier transform is performed on each group of second sequences after zero padding. Interference between subbands can be eliminated through 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 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(log 2 (k(n)); where ceil(log 2 (k(n)) refers to the function that returns a value greater than or equal to log 2 (The smallest integer of k(n). In one example, when k(n) satisfies the i-th power of 2, s(n)=k(n).

[0045] In one embodiment, the number of points for inverse Fourier transform of each group of second sequences is M*s(n). In the embodiment, each group of second sequences is firstly padded with zeros at both ends to obtain a second sequence containing M*s(n) data, and then the second sequence containing M*s(n) data is inverse Fourier transformed.

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

[0047] In one embodiment, 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.

[0048] 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.

[0049] 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. The length of the n-th coefficient group X(n) refers to the number of coefficients included in the n-th coefficient group X(n). In one example, the number of coefficients included in the n-th coefficient group X(n) is the same as the number of data k(n) included in the corresponding first sequence.

[0050] In one embodiment, the coefficient groups X(n) by which the first sequences with the same k(n) are multiplied are the same. The coefficient groups X(n) by which the first sequences with the same number of data are multiplied are also the same.

[0051] In one embodiment, the coefficient groups X(n) by which the first sequences corresponding to the 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. The first sequences corresponding to the subbands with the same subcarrier spacing use the same coefficient group X(n), and the first sequences corresponding to different subcarrier spacings use different coefficient groups X(n), which can ensure that the coefficients of the same subcarrier spacing are unified, while the coefficient groups X(n) of different subcarrier spacings contain different numbers of coefficients due to different numbers of data.

[0052] In one embodiment, the nth 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 first sequence, 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 the ratio between the ideal root raised cosine filter frequency domain coefficient 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 the ideal filter.

[0053] 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 selected to be compensated to an ideal filter or to 1.

[0054] 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. By performing power normalization on the nth coefficient group X(n), it is convenient for subsequent other data processing.

[0055] In one embodiment, both ends of the n-th coefficient group X(n) contain p 1s 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.

[0056] In one embodiment, the coefficient group X(n) after removing the p 1s at both ends is ’ (n) = 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 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 the nth group of first sequences removes p subcarriers at both ends; n = 1, 2, ..., N; N is an integer greater than or equal to 2. In the case where the nth group of coefficients X(n) contains p 1s 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 the nth group of first sequences removes p subcarriers at both ends and the actual root raised cosine filter frequency domain coefficient. ’ (n), it is possible to prevent the mirror image of the edge subcarrier from causing the power to be too high due to FDSS, and thus the coefficient compensation may not be performed on the edge part, but only on the middle part.

[0057] In one embodiment, the coefficient group X(n) after removing the p 1s at both ends is ’ (n) = 1 / f ’ (n); f ’ (n) is the actual root raised cosine filter frequency domain coefficient at the corresponding frequency domain subcarrier position after the nth group of first sequences removes p subcarriers at both ends; n = 1, 2, ..., N; N is an integer greater than or equal to 2. In the case where the nth group of coefficients X(n) contains p 1s at both ends, the coefficient group X(n) can be determined according to the ratio between 1 and the actual root raised cosine filter frequency domain coefficient at the corresponding frequency domain subcarrier position after the nth group of first sequences removes p subcarriers at both ends. ’ (n), it is possible to prevent the mirror image of the edge subcarrier from causing the power to be too high due to FDSS, and thus the coefficient compensation may not be performed on the edge part, but only on the middle part.

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

[0059] 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 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, that is, an integer multiple of one RB. In one example, the number of data k(n) included in each group satisfies 2 to the power of i (that is, 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 2 to the power of i (i.e., 2 i ), wherein i is an integer greater than or equal to 0. In one example, the number of data k(n) included in each group of first sequences is the same.

[0060] 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.

[0061] 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, each group of second sequences is subjected to an inverse Fourier transform of M*s(n) points, and each group of second sequences is subjected to an inverse Fourier transform of the same number of points.

[0062] In one embodiment, the data to be transmitted at least includes: 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 may include constellation point modulated data. In one embodiment, the data to be transmitted may include: constellation point modulated data, and at least one reference signal data.

[0063] In one embodiment, inverse Fourier transform is performed on N groups of third sequences to form a group of target time domain data sequences, including:

[0064] 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;

[0065] Perform inverse Fourier transform on N groups of third sequences and 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 data sequences not included in the data sequence generated by the data to be transmitted. In one example, perform inverse Fourier transform on N groups of third sequences and other P groups of initial frequency domain data sequences together to form a group of target time domain data sequences. Among them, 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 N groups of third sequences and other P groups of target frequency domain data sequences together to form a group of target time domain data sequences.

[0066] In one embodiment, performing inverse Fourier transform on N groups of third sequences to form a group of target time-domain data sequences includes: performing an oversampled inverse Fourier transform on every N data, and every N data comes from the N groups of third sequences. In one example, the process of performing inverse Fourier transform on N groups of third sequences includes: performing an oversampled inverse Fourier transform on every N data, and every N data comes from the N groups of third sequences.

[0067] 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 operations of the inverse Fourier transform. The initial time domain data sequence refers to a sub-symbol obtained by performing an oversampled inverse Fourier transform on the third sequence. In an embodiment, an oversampled inverse Fourier transform is performed on N data in the third sequence to obtain corresponding sub-symbols, and then the sub-symbols are repeatedly extended and finally serially connected in the time domain to obtain a corresponding set of target time domain data sequences.

[0068] In one embodiment, the process of generating an initial time domain data sequence by an inverse Fourier transform in multiple inverse Fourier transforms includes: extracting N data of 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. Exemplarily, it is assumed that the N groups of third sequences are distributed in N rows (i.e., one group of third sequences is distributed in one row), and then N data are selected according to the column number (i.e., data of one column are selected), and then an oversampled inverse Fourier transform is performed on each of the selected N data (i.e., data of each column). For another example, it is assumed that the N groups of third sequences are distributed in N columns (i.e., one group of third sequences is distributed in one column), and then N data are selected according to the row number (i.e., data of one row are selected), and then an oversampled inverse Fourier transform is performed on each of the selected N data (i.e., data of each row).

[0069] In one embodiment, 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. In the embodiment, the target time domain data sequence generated by the inverse Fourier transform is serially connected, and the serial connection interval between each two adjacent groups of initial time domain data sequences is: half of the length after the inverse Fourier transform of each N target data is oversampled, that is, half of the sub-symbol length.

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

[0071] 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; the number of data included in each group of second sequences 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. In one example, among N groups of second sequences, the number of data included in each group of second sequences is M*s(n), that is, greater than or equal to M times the number of subcarriers included in each frequency domain resource block.

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

[0073] 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 an embodiment, the zero frequency position (i.e., zero subcarrier) during the inverse Fourier transform operation in each group of original data sequences is one of the subcarriers included in each frequency domain resource block.

[0074] 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;

[0075] 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.

[0076] 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.

[0077] 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.

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

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

[0080] In one example, Figure 2 This is a schematic diagram of generating a target time domain data sequence provided by an embodiment of the present application. In the embodiment, the generation process of the target time domain data sequence is described by taking the number of groups N of the first sequence as 4, the number of data contained in each group of the first sequence as the same, which is 64, and the number of zeros padded at both ends of each group of the second sequence as 32 as an example.

[0081] like Figure 2As shown, the data to be transmitted is divided into 4 groups of first sequences, each group of first sequences contains 64 data. First, the data of each group of 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; 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 0 subcarriers are added to both ends of each group of second sequences to form 4 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 4 groups of third sequences; then, a subband-level inverse Fourier transform and polyphase filtering operation are performed on the 4 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.

[0082] In one example, Figure 3 This is another schematic diagram of generating a target time domain data sequence provided by an embodiment of the present application. In the embodiment, the generation process of the target time domain data sequence is described by taking the number of groups N of the first sequence as 4, the number of data contained in each group of the first sequence as the same, which is 48, and the number of zeros padded at both ends of each group of the second sequence as 40 as an example.

[0083] like Figure 3 As shown, the data to be transmitted is divided into 4 groups of first sequences, each of which contains 48 data, namely 4 RBs. First, the data of each group of 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 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 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, 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 second sequence to form 4 new second sequences, and the number of data contained in each new second sequence is 128; then, the new second sequence is 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 group of target time domain data sequences is transmitted on time-frequency resources.

[0084] In one example, Figure 4 This is another schematic diagram of generating a target time domain data sequence provided by an embodiment of the present application. In the embodiment, the generation process of the target time domain data sequence is described by taking the number of groups N of the first sequence as 4, the number of data contained in each group of the first sequence as the same, both as 40, and the number of zeros padded at both ends of each group of the second sequence as 44 as an example.

[0085] like Figure 4 As shown, the data to be transmitted is divided into 4 groups of first sequences, each of which contains 40 data. First, the data of each group of 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 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 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, 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 40 coefficients; then, 44 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 sequence is 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 group of target time domain data sequences is transmitted on the time-frequency resources.

[0086] In one example, Figure 5 This is another schematic diagram of generating a target time domain data sequence provided in an embodiment of the present application. In the embodiment, the generation process of the target time domain data sequence is described by taking the number of groups N of the first sequence as 4, the number of data contained in each group of the first sequence as the same, which is 48, and the number of zeros padded at both ends of each group of the second sequence as 40 as an example.

[0087] like Figure 5As shown, the data to be transmitted is divided into 4 groups of first sequences, each of which contains 48 data, namely 4 RBs. First, the data of each group of 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 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 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 new second sequences, and the number of data contained in each new second sequence is 128; then, the new second sequence is 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 group of target time domain data sequences is transmitted on the time-frequency resources.

[0088] In one example, Figure 6 This is another schematic diagram of generating a target time domain data sequence provided in an embodiment of the present application. In the embodiment, the generation process of the target time domain data sequence is described by taking the number of groups N of the first sequence as 4, the number of data contained in each group of the first sequence as the same, which is 48, and the number of zeros padded at both ends of each group of the second sequence as 40 as an example.

[0089] like Figure 6As shown, the data to be transmitted is divided into 4 groups of first sequences, 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 nth group of coefficient group X(n) contain 8 1s respectively, n=1,2,3,4, the coefficient group X'(n) after removing the 8 1s at both ends of the nth group of coefficient group X(n) = 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 nth group of 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 nth group of first sequence, n=1,2,3,4; by 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 second sequences 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.

[0090] In one example, Figure 7 This is another schematic diagram of generating a target time domain data sequence provided in an embodiment of the present application. In the embodiment, the generation process of the target time domain data sequence is described by taking the number of groups N of the first sequence as 4, the number of data contained in each group of the first sequence as the same, which is 48, and the number of zeros padded at both ends of each group of the second sequence as 40 as an example.

[0091] like Figure 7As shown, the data to be transmitted is divided into 4 groups of first sequences, each of which contains 48 data, namely 4 RBs. First, the data of each group of 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. The two ends of the nth coefficient group X(n) contain 8 1s respectively, n=1, 2, 3, 4, the coefficient group X'(n) after removing the 8 1s at the two ends of the nth coefficient group 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 the two ends of the nth 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 the two ends of each group of second sequences respectively to form 4 groups of new second sequences, and the number of data contained in each group of new second sequences is 128; then, the new second sequences are subjected to 128-point inverse Fourier transform to form 4 groups of third sequences; then, the 4 groups of 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 the time-frequency resources.

[0092] In one example, Figure 8 This is another schematic diagram of generating a target time domain data sequence provided in an embodiment of the present application. In the embodiment, the generation process of the target time domain data sequence is described by taking the number of groups N of the first sequence as 4, the number of data contained in each group of the first sequence as the same, which is 48, and the number of zeros padded at both ends of each group of the second sequence as 40 as an example.

[0093] like Figure 8As shown, the data to be transmitted is divided into 4 groups of first sequences, each of which contains 48 data, namely 4 RBs. First, the data of each group of 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 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 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,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 respectively to form 4 groups of new second sequences, and the number of data contained in each group of new second sequences is 128; then, a 128-point inverse Fourier transform is performed on the new second sequences 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 multi-phase filtering operations to form a group of target time domain data sequences. Among them, the other data groups contain 48 data, which are also processed at the sub-band level after zero padding, power compensation and IDFT operations. A set of target time domain data sequences are transmitted on the time-frequency resources.

[0094] In one example, Fig. 9 This is another schematic diagram of generating a target time domain data sequence provided by an embodiment of the present application. In the embodiment, the generation process of the target time domain data sequence is described by taking the case where the number of groups N of the first sequence is 4, the number of data contained in each group of the first sequence is the same, which is 48, and the first group of the first sequence contains 24 reference signal data, and the number of zeros padded at both ends of each group of the second sequence is 40 as an example.

[0095] like Fig. 9As shown, the data to be transmitted is divided into 4 groups of first sequences, each group of first sequences contains 48 data, that is, 4 RBs, wherein the first group of first sequences contains 24 reference signals. Firstly, the data of each group of 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 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 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, 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 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 sequence is 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 group of target time domain data sequences is transmitted on the time-frequency resources.

[0096] In one example, Fig.10 This is another schematic diagram of generating a target time domain data sequence provided by an embodiment of the present application. In the embodiment, the generation process of the target time domain data sequence is described by taking the number of groups N of the first sequence as 4, the number of data contained in the first two groups of the first sequence as the same, both as 24; the number of data contained in the second two groups of the first sequence as the same, both as 48; and the number of zeros padded at both ends of the first two groups of the second sequence as 20, and the number of zeros padded at both ends of the second two groups as 40 as an example.

[0097] like Fig.10As shown, the data to be transmitted is divided into 4 groups of first sequences, the first two groups of first sequences each contain 24 data, that is, 2 RBs, and the last two groups of first sequences each contain 48 data, that is, 4 RBs. First, the data of each group of 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 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, due to the different subcarrier intervals of the four subbands, 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 to obtain the corresponding new second sequence, and the number of data contained in each new second sequence =64; add 40 0 ​​subcarriers at both ends of each second sequence in the last two groups to obtain the corresponding new second sequence. The number of data contained in each new second sequence is 128, that is, a total of 4 new second sequences are formed; then the first two new second sequences are subjected to 64-point inverse Fourier transform, and the last two new second sequences are subjected to 128-point inverse Fourier transform. The data in the first two new second sequences are respectively connected in series with the symbol data of the next moment to form two groups of data with a length of 128 points, and then together with the data in the last two new second sequences to form 4 groups of 128-point third sequences; then perform subband-level inverse Fourier transform and multi-phase filtering operations on the 4 groups of third sequences to form a group of target time domain data sequences. A group of target time domain data sequences are transmitted on the time-frequency resources.

[0098] In one example, Fig.11 This is another schematic diagram of generating a target time domain data sequence provided in an embodiment of the present application. In the embodiment, the generation process of the target time domain data sequence is described by taking the number of groups N of the first sequence as 4, the number of data contained in each group of the first sequence as the same, which is 64, and the number of zeros padded at both ends of each group of the second sequence as 32 as an example.

[0099] like Fig.11As shown, the data to be transmitted is divided into 4 groups of first sequences, each group of first sequences contains 64 data. First, the data of each group of the first sequences in the 4 groups 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, because the subcarrier intervals of the 4 subbands are 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. The second sequence is a sequence of 128 data in each new second sequence; then the new second sequence is subjected to a 128-point inverse Fourier transform to form four third sequences; then one data is taken out from each new second sequence in turn according to the columns to obtain four data, and an oversampled 16-point inverse Fourier transform is performed on each of the four taken out data to obtain a sub-symbol, and then each sub-symbol is repeatedly extended by 4 times, and finally 128 sub-symbols are connected in series in the time domain to form a set of target time domain data sequences, wherein the interval during the series connection is 8 points, i.e., half a sub-symbol length. A set of target time domain data sequences is transmitted on the time-frequency resources.

[0100] In one example, Fig.12 Schematic diagram of data transmission to be transmitted provided by an embodiment of the present application. Fig.12 As shown, the data to be transmitted is windowed or filtered in sequence; then the DAC and RF processes are performed.

[0101] like Fig.12 As shown, transmitting a group of data to be transmitted also includes windowing or filtering the target time domain data sequence corresponding to the data to be transmitted, and then performing DAC and RF processes.

[0102] 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.

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

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

[0105] 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, and k(n) is a positive integer;

[0106] The first conversion module 1320 is configured to multiply 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;

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

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

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

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

[0111] 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).

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

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

[0114] In one embodiment, 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.

[0115] 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.

[0116] In one embodiment, 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.

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

[0118] 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.

[0119] In one embodiment, 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.

[0120] In one embodiment, the nth group of coefficients 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, ..., N; N is an integer greater than or equal to 2.

[0121] 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.

[0122] In one embodiment, both ends of the n-th coefficient group X(n) contain p 1s 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.

[0123] In one embodiment, the coefficient group X(n) after removing the p 1s at both ends is ’ (n) = 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 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 p subcarriers at both ends of the nth group of first sequences; n=1, 2, ..., N; N is an integer greater than or equal to 2.

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

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

[0126] In one embodiment, the number of data k(n) included in each group of first sequences 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; k(n)s are all the same.

[0127] 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.

[0128] 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.

[0129] In one embodiment, inverse Fourier transform is performed on N groups of third sequences to form a group of target time domain data sequences, including:

[0130] 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;

[0131] 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.

[0132] In one embodiment, inverse Fourier transform is performed on N groups of third sequences to form a group of target time domain data sequences, including:

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

[0134] 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 a third sequence; wherein the number of initial time domain data sequences is equal to the number of inverse Fourier transform operations.

[0135] 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:

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

[0137] 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.

[0138] In one embodiment, the serial connection interval of the target time domain data sequence is 1 / M of the length after inverse Fourier transformation of the oversampled N target data.

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

[0140] 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;

[0141] 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.

[0142] 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;

[0143] 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.

[0144] 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;

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

[0146] 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.

[0147] 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;

[0148] 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.

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

[0150] 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.

[0151] 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.

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

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

[0154] The data transmission device provided in this embodiment is configured to implement Figure 1 The data transmission method of the illustrated embodiment and the data transmission device provided in this embodiment have similar implementation principles and technical effects, which will not be described in detail here.

[0155] In one embodiment, Fig.14 Schematic diagram of a communication device provided in an embodiment of the present application. Fig.14 As shown, 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. Fig.14 In the example, a processor 1410 is used. The number of memories 1420 in the device may be one or more. Fig.14 A memory 1420 is taken as an example. The processor 1410, the memory 1420 and the communication interface 1430 of the device can be connected via a bus or other means. Fig.14In the example, the connection through the bus is taken as an example. Exemplarily, the communication device can be a base station side or a 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 division 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 storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function; the storage data area may store data created according to 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 arranged relative to the processor 1410, and these remote memories may be connected to the device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network and a combination thereof. The communication interface 1430 is used for data interaction between multiple communication devices.

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

[0157] An embodiment of the present application also provides a storage medium containing computer executable instructions, which are used to execute a data transmission method when executed by a computer processor. The method includes: 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 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 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; and transmitting the target time domain data sequences on pre-configured time-frequency resources.

[0158] 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.

[0159] In general, various embodiments of the present application can be implemented in hardware or dedicated circuits, software, logic or any combination thereof. For example, some aspects can be implemented in hardware, while other aspects can 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.

[0160] 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.

[0161] 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 have 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 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 (FGPAs) and a processor based on a multi-core processor architecture.

[0162] The above are only preferred embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. A data transmission method, characterized in that: include: 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, characterized in that Before performing inverse Fourier transform on each group of the second sequences respectively, the method further comprises: 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, characterized in that 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, characterized in that 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, characterized in that: 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, characterized in that 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, characterized in that 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, characterized in that: 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, characterized in that: 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, characterized in that 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, characterized in that: 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, characterized in that 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, characterized in that 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, characterized in that The coefficient group X after removing the p 1s at both ends of the nth coefficient group X(n) ’ (n) = 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 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 p subcarriers at both ends of the nth group of first sequences; n=1, 2, ..., N; N is an integer greater than or equal to 2.

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

16. The method according to claim 14 or 15, characterized in that For the nth coefficient group X ’ (n) Perform power normalization 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, characterized in that: 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, characterized in that: 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 third sequence; wherein 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, characterized in that 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; wherein the N data are respectively from N groups of third sequences.

20. The method according to claim 18, characterized in that 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, characterized in that 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, characterized in that: Each group of first sequences is transmitted in a corresponding frequency domain resource block; each frequency domain resource block includes Z subcarriers; 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.

23. A communication device, characterized in that: include: memory, and one or more processors; The memory is configured to store one or more programs; When the one or more programs are executed by the one or more processors, the one or more processors implement the method as described in any one of claims 1 to 22.

24. A storage medium, characterized in that The storage medium stores a computer program, and when the computer program is executed by a processor, the method according to any one of claims 1 to 22 is implemented.

Images