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; n = 1, 2,..., N; n is an integer greater than or equal to 2; performing inverse Fourier transform on each group of first sequences to obtain N groups of second sequences; performing inverse Fourier transform on the N groups of second sequences for multiple times to obtain a group of target time domain data sequences; wherein each inverse Fourier transform in the multiple inverse Fourier transforms comprises the following operations: sequentially extracting one piece of data from each group of second sequences according to a sequence to form N pieces of data, and sequentially performing zero insertion and inverse Fourier transform operation on the N pieces of data; 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, k(n) is a positive integer; n=1, 2, ..., N; N is an integer greater than or equal to 2;

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

[0007] Performing multiple inverse Fourier transforms on the N groups of second sequences to obtain a group of target time domain data sequences; wherein each inverse Fourier transform in the multiple inverse Fourier transforms includes the following operations: extracting one data from each group of second sequences in sequence to form N data, and performing zero insertion and inverse Fourier transform operations on the N data in sequence;

[0008] The target time domain data sequence is transmitted on preconfigured time-frequency resources.

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

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

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

[0012] 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

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

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

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

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

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

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

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

[0020] Figure 8 is a transmission schematic diagram of data to be transmitted provided in an embodiment of the present application;

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

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

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

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

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

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

[0027] In one embodiment, Figure 1 1 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-S140.

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

[0029] Among them, the nth group of first sequences contains k(n) data, k(n) is a positive integer; n=1,2,...,N; N is an integer greater than or equal to 2. 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 divided N groups of time domain data are Fourier transformed to obtain the corresponding N groups of first sequences; it is also possible to first perform Fourier transform on the data to be transmitted, and then divide the frequency domain data obtained by Fourier transform to obtain the corresponding N groups of first sequences.

[0030] S120, performing inverse Fourier transform on each group of first sequences to obtain N groups of second sequences.

[0031] S130, performing multiple inverse Fourier transforms on the N groups of second sequences to obtain a group of target time domain data sequences.

[0032] Each inverse Fourier transform in the multiple inverse Fourier transforms includes the following operations: extracting one data from each group of the second sequence in order to form N data, and performing zero insertion and inverse Fourier transform operations on the N data in order.

[0033] After performing an inverse Fourier transform on each group of first sequences to obtain the corresponding second sequence, the first data is extracted from each group of second sequences in the order of the N groups of second sequences to form N data, and the N data are inverse Fourier transformed after zero insertion, and then the second data is extracted from each group of second sequences in the order of the N groups of second sequences to form N data, and the N data are inverse Fourier transformed after zero insertion, until all the data in the second sequence are inverse Fourier transformed to obtain a group of target time domain data sequences. Among them, the total number of multiple inverse Fourier transforms performed on the N groups of second sequences is the same as the number of data contained in the second sequence. In the multiple inverse Fourier transforms performed on the second sequence, the interval of sub-band data mapping and the number of inverse Fourier transform points can be adjusted so that the sub-band can be mapped on the channel bandwidth according to the actual frequency domain position.

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

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

[0036] In one embodiment, when a subcarrier in a subband is the zero frequency position of the baseband, the data sequentially extracted from the second sequence corresponding to the subband is mapped to the zero frequency position after multiple inverse Fourier transforms are performed.

[0037] In one embodiment, the zero frequency position of the baseband is also the zero frequency position of the channel bandwidth. In one example, when a subcarrier in a subband is the zero frequency position of the baseband, the data extracted in sequence from the second sequence corresponding to the subband is mapped to the zero frequency position in multiple Fourier transforms, and the zero frequency position of the baseband is also the zero frequency position of the channel bandwidth, and the subband and the actual frequency domain position can be aligned in a secondary inverse Fourier transform. The secondary inverse Fourier transform is an inverse Fourier transform operation performed on the second sequence.

[0038] In one embodiment, the zero insertion operation includes: inserting Q(n) zeros between every two adjacent data among the N data.

[0039] In one embodiment, the number of zeros inserted between each two adjacent data in the N data is equal. In one example, for the case where the number of zeros inserted between each two adjacent data in the N data is equal, it can also be understood that Q(n) is a constant.

[0040] In one embodiment, after the zero insertion operation is performed on N data, the interval between the frequency domains where adjacent non-zero data are located is the width of one sub-band.

[0041] In one embodiment, the widths of the N sub-bands are the same.

[0042] In one embodiment, the interval between the frequency domain positions of two adjacent data among the N data when performing inverse Fourier transform is the width of a sub-band.

[0043] In one embodiment, the interval between the frequency domain positions of any two data among the N data when performing inverse Fourier transform is the subband interval of the subbands corresponding to the two data; wherein the subband interval is the interval between the same positions in the two subbands.

[0044] In one embodiment, the number of zeros inserted between each adjacent two data in the N data is not equal; the widths of the N sub-bands are not the same. In one example, the number of zeros inserted between each adjacent two data in the N data may be equal or unequal, so that the effect of the sub-band spacing being exactly the sub-band width can be achieved by configuring the data interval of the secondary inverse Fourier transform. The secondary inverse Fourier transform is an inverse Fourier transform operation performed on the second sequence.

[0045] In one embodiment, before performing the inverse Fourier transform operation on each group of first sequences respectively, it further includes: performing zero-padding operations at both ends on each group of first sequences; wherein, each group of first sequences after zero-padding contains M*s(n) data, M is a positive integer, and s(n) >= k(n); the number of points for performing the inverse Fourier transform on each group of first sequences is M*s(n). In one example, first perform zero-padding operations at both ends on each group of first sequences respectively to obtain the first sequences after zero-padding; then perform the inverse Fourier transform on the first sequences after zero-padding. In one example, each group of first sequences after zero-padding contains M*s(n) data, correspondingly, the number of points for performing the inverse Fourier transform is M*s(n), that is, the inverse Fourier transform performed on the first sequences is an oversampled inverse Fourier transform.

[0046] In one embodiment, before performing the inverse Fourier transform multiple times on N groups of second sequences, it further includes: performing a frequency shift operation on the N groups of second sequences.

[0047] In one embodiment, the number of times of performing the inverse Fourier transform multiple times on N groups of second sequences is M*s(n). In one example, before performing the inverse Fourier transform on N groups of first sequences, first perform zero-padding operations at both ends on each group of first sequences to obtain the first sequences after zero-padding; then perform the inverse Fourier transform on the first sequences after zero-padding to obtain the second sequences; then perform the inverse Fourier transform multiple times on the N groups of second sequences, that is, each group of second sequences contains M*s(n) data, and each inverse Fourier transform in the multiple inverse Fourier transforms includes the following operations: sequentially extract one data from each group of second sequences in order to form N data, and sequentially perform zero-insertion and inverse Fourier transform operations on the N data, that is, the number of times of performing the inverse Fourier transform multiple times on the N groups of second sequences is M*s(n).

[0048] In one embodiment, after performing the zero-insertion operation on N data and before performing the inverse Fourier transform operation, it further includes: performing zero-padding operations at both ends on the data after the zero-insertion operation.

[0049] In one embodiment, in the nth group of first sequences, when (s(n) - k(n)) / s(n) >= p*α, M = 1;

[0050] When (s(n) - k(n)) / s(n) < p*α, M = 2; wherein, α is the roll-off factor of the root-raised cosine filter in polyphase filtering; p is the error coefficient. In one example, p can be 1, and by judging whether the roll-off part of the filter will cause inter-subband interference, the oversampling ratio can be selected to prevent inter-subband interference.

[0051] In one embodiment, the number of data k(n) contained in the nth group of first sequences = a*2 bIn the case of performing multiple inverse Fourier transforms on the N groups of second sequences, the subcarrier spacing of each inverse Fourier transform is 2 times the subcarrier spacing of the nth subband. b times, the number of points of each Fourier inverse transform in multiple Fourier inverse transforms of N groups of second sequences is nifft=Nifft(n) / 2 b ; Where Nifft(n) is the total number of inverse Fourier transform points of the first sequence of the nth group; a and b are both positive integers, and a is an odd number. The advantage of this is that the minimum number of points of the second-order inverse Fourier transform that meets the subband width can be found, which reduces the complexity while achieving the effect of the subband width in the second-order inverse Fourier transform.

[0052] In one embodiment, a set of target time domain data sequences is formed by serially connecting multiple time domain data sequences generated by inverse Fourier transform; the serial connection is a serial connection method of staggered superposition.

[0053] In one embodiment, the time domain data sequences generated by inverse Fourier transform are connected in series, and the series interval of each set of data is Nifft(n) / M / s(n).

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

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

[0056] In one embodiment, the number of points for inverse Fourier transform of each group of first sequences satisfies one of the following conditions: the ratio of the number of points for inverse Fourier transform of two adjacent groups of first sequences satisfies 2 to the power of i; the number of points for inverse Fourier transform of each group of first 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 third sequences, and the ratio of the number of points for inverse Fourier transform of each group of third sequences satisfies 2 to the power of i (i.e., 2i ), wherein i is an integer greater than or equal to 0. In one example, each group of third sequences is subjected to inverse Fourier transform with M*s(n) points, and each group of third sequences is subjected to inverse Fourier transform with the same number of points.

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

[0058] In one embodiment, multiple inverse Fourier transforms are performed on N groups of second sequences to form a group of target time domain data sequences, including:

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

[0060] Perform inverse Fourier transform on the N groups of second 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 data sequences not included in the data sequence generated by the data sequence 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.

[0061] In one embodiment, the number of points of the multiple inverse Fourier transforms performed on the N groups of second sequences is greater than N; and the number of points of each inverse Fourier transform in the multiple inverse Fourier transforms is greater than or equal to M.

[0062] In one embodiment, the process of multiple inverse Fourier transforms includes:

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

[0064] For the second sequence corresponding to the subband with non-minimum subcarrier spacing, at least two groups of second sequences are selected, and the sequences are serially connected to form a sequence with the same length as the reference length to form new N groups of second sequences, and multiple inverse Fourier transforms are performed on the new N groups of second sequences. Among them, subbands with different subcarrier spacings represent first sequences with different numbers of data.

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

[0066] The number of data included in each group of second sequences satisfies 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 an example, among the 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.

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

[0068] The zero frequency positions of different groups of first sequences when performing inverse Fourier transform operations are different. In the embodiment, the zero frequency position refers to the zero subcarrier (ie, the 0th subcarrier, which can also be understood as a subcarrier index of 0) in the frequency domain resource block.

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

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

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

[0072] In one embodiment, the data transmission method further includes:

[0073] A set of target time domain data sequences is filtered; wherein the filtering operation includes one of the following: single-phase filtering and multi-phase filtering.

[0074] 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; an isotropic orthogonal transform algorithm IOTA function.

[0075] In one embodiment, the data transmission method further includes:

[0076] Perform windowing operation on a set of target time domain data series.

[0077] Example 1

[0078] 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 48, and the number of zeros padded at both ends of each group of the first sequence as 40 as an example.

[0079] like Figure 2 As shown, in this embodiment, the data to be transmitted is divided into 4 groups of first sequences, each of which contains 48 data. 40 0 ​​subcarriers are added to both ends of each group of first sequences to form 4 groups of zero-padded first sequences, and the number of points contained in each group of zero-padded first sequences is 128. Assuming that the zero frequency position of the channel bandwidth is at the 0 subcarrier position when the second group of data is subjected to inverse Fourier transform, the 1st, 3rd, and 4th groups of data are subjected to frequency shift operation; then a 128-point inverse Fourier transform is performed to form 4 groups of second sequences.

[0080] Then, one data is taken out from each group of the second sequence in order by column, and a total of four data are taken out. An oversampled 64-point inverse Fourier transform is performed on each of the four taken out data: wherein, the zero frequency position is aligned with the second group of data, the four data are arranged in order, two zeros are inserted between every two data, and then 54 zeros are added to the positions of the remaining subcarriers, and then IFFT is performed to obtain a subsymbol. A total of 128 64-point IFFTs are performed to obtain 128 subsymbols; each subsymbol is then repeatedly expanded 4 times, and a filtering operation is performed, that is, a point multiplication operation is performed with the filter; finally, 128 subsymbols are connected in series in the time domain to form a group of target time domain data sequences, and the series connection process is a staggered superposition, wherein the staggered superposition interval during the series connection is 8 points, that is, 1 / 8 of the subsymbol length. The group of target time domain data sequences is transmitted on the time-frequency resources.

[0081] Example 2

[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, both as 40, and the number of zeros padded at both ends of each group of the first sequence as 12 as an example.

[0083] like Figure 3As shown, in this embodiment, the data to be transmitted is divided into 4 groups of first sequences, each of which contains 40 data. 12 0 subcarriers are added to both ends of each group of first sequences to form 4 groups of first sequences after zero padding, and the number of points contained in each group of first sequences after zero padding is 64. Assuming that the zero frequency position of the channel bandwidth is at the 0 subcarrier position when the second group of data is subjected to inverse Fourier transform, the frequency shift operation is performed on the 1st, 3rd, and 4th groups of data. Then, a 64-point inverse Fourier transform is performed to form 4 groups of second sequences.

[0084] Then, one data is taken out from each group of the second sequence in order by column, and a total of four data are taken out. An oversampled 128-point inverse Fourier transform is performed on each of the four data taken out: the zero-frequency position is aligned with the second group of data, the four data are arranged in order, four zeros are inserted between every two data, and 112 zeros are added to the positions of the remaining subcarriers, and then IFFT is performed to obtain a subsymbol. A total of 64 128-point IFFTs are performed to obtain 64 subsymbols; each subsymbol is then repeatedly expanded by 4 times, and finally 64 subsymbols are concatenated in the time domain to form a group of target time domain data sequences, where the interval during concatenation is 16 points, that is, 1 / 8 of the subsymbol length. The group of target time domain data sequences is transmitted on the time-frequency resources.

[0085] Example 3

[0086] 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 first sequence as 12 as an example.

[0087] like Figure 4 As shown, in this embodiment, the data to be transmitted is divided into 4 groups of first sequences, each of which contains 40 data. 12 0 subcarriers are added to both ends of each group of first sequences to form 4 groups of first sequences after zero padding, and the number of points contained in each group of first sequences after zero padding is 64. Assuming that the zero frequency position of the channel bandwidth is at the first 0.5 subcarrier position of the 0 subcarrier when the second group of data is subjected to inverse Fourier transform, the frequency shift operation is performed on the 1st, 2nd, 3rd, and 4th groups of data. Then, a 64-point inverse Fourier transform is performed to form 4 groups of second sequences.

[0088] Then, one data is taken out from each group of the second sequence in order by column, and a total of four data are taken out. An oversampled 128-point inverse Fourier transform is performed on each of the four data taken out: the zero-frequency position is aligned with the second group of data, the four data are arranged in order, four zeros are inserted between every two data, and 112 zeros are added to the positions of the remaining subcarriers, and then IFFT is performed to obtain a subsymbol. A total of 64 128-point IFFTs are performed to obtain 64 subsymbols; each subsymbol is then repeatedly expanded by 4 times, and finally 64 subsymbols are concatenated in the time domain to form a group of target time domain data sequences, where the interval during concatenation is 16 points, that is, 1 / 8 of the subsymbol length. The group of target time domain data sequences is transmitted on the time-frequency resources.

[0089] Example 4

[0090] 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 first sequence as 40 as an example.

[0091] like Figure 5 As shown, in this embodiment, the data to be transmitted is divided into 4 groups of first sequences, each of which contains 48 data. 40 0 ​​subcarriers are added to both ends of each group of first sequences to form 4 groups of zero-padded first sequences, and the number of points contained in each group of zero-padded first sequences is 128. Assuming that the zero frequency position of the channel bandwidth is at the 0 subcarrier position when the second group of data is subjected to inverse Fourier transform, the frequency shift operation is performed on the 1st, 3rd, and 4th groups of data. Then, a 128-point inverse Fourier transform is performed to form 4 groups of second sequences.

[0092] Then, the four groups of second sequences and other groups of data are subjected to sub-band inverse Fourier transform and polyphase filtering operations to form a group of target time domain data sequences. Among them, the other groups of data contain 48 data, which are also processed at the sub-band level after zero padding, IDFT and frequency shift operations.

[0093] The process of forming the target time domain data sequence includes: taking out 1 data from each group of the second sequence in order by column, taking out 5 data in total, performing an oversampled 64-point inverse Fourier transform on each of the 5 taken data: the zero frequency position is aligned with the second group of data, the 5 data are arranged in order, 2 zeros are inserted between every two data, and then 41 zeros are added to the positions of the remaining subcarriers, and then performing I FFT to obtain a subsymbol. A total of 128 64-point I FFTs are performed to obtain 128 subsymbols; each subsymbol is repeatedly extended by 4 times, and finally 128 subsymbols are connected in series in the time domain to form a group of target time domain data sequences, wherein the interval during the series connection is 8 points, that is, 1 / 8 of the subsymbol length. The group of target time domain data sequences is transmitted on the time-frequency resources.

[0094] Example 5

[0095] In one example, Figure 6 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 48, and the first group of the first sequence as 24 reference signals, and the number of zeros padded at both ends of each group of the first sequence as 40 as an example.

[0096] like Figure 6 As shown, in this embodiment, the data to be transmitted is divided into 4 groups of first sequences, each group of first sequences contains 48 data, of which the first group contains 24 reference signals. 40 0 ​​subcarriers are added to both ends of each group of first sequences respectively, forming 4 groups of first sequences after zero padding, and the number of points contained in each group of first sequences after zero padding is 128. Assuming that the zero frequency position of the channel bandwidth is at the 0 subcarrier position when the second group of data is subjected to inverse Fourier transform, the frequency shift operation is performed on the 1st, 3rd and 4th groups of data. Then, a 128-point inverse Fourier transform is performed to form 4 groups of data sequences.

[0097] Then, one data is taken out from each group of the second sequence in order by column, and a total of four data are taken out. An oversampled 64-point inverse Fourier transform is performed on each of the four data taken out: the zero-frequency position is aligned with the second group of data, the four data are arranged in order, two zeros are inserted between every two data, and 54 zeros are added to the positions of the remaining subcarriers, and then IFFT is performed to obtain a subsymbol. A total of 128 64-point IFFTs are performed to obtain 128 subsymbols; each subsymbol is then repeatedly expanded by 4 times, and finally 128 subsymbols are concatenated in the time domain to form a group of target time domain data sequences, where the interval during concatenation is 8 points, that is, 1 / 8 of the subsymbol length. The group of target time domain data sequences is transmitted on the time-frequency resources.

[0098] Example 6

[0099] In one example, Figure 7 This is another schematic diagram of generating a target time domain data sequence provided by an embodiment of the present application. In the embodiment, 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 is the same, both are 24, that is, 2 RBs; the number of data contained in the second two groups of the first sequence is the same, both are 48, that is, 4 RBs; and the number of zeros padded at both ends of the first two groups of the first sequence is 20, and the number of zeros padded at both ends of the second two groups of the first sequence is 40 as an example, the generation process of the target time domain data sequence is described.

[0100] like Figure 7 As shown, in this embodiment, the data to be transmitted is divided into 4 groups of first sequences. Each of the first two groups contains 24 data, i.e., 2 RBs, and each of the first sequences of the last two groups contains 48 data, i.e., 4 RBs. 20 0 subcarriers are added to both ends of each of the first sequences of the first two groups, and the number of points contained in each group of zero-filled first sequences is 64. 40 0 ​​subcarriers are added to both ends of each of the data sequences of the last two groups, and the number of points contained in each group of zero-filled first sequences is 128, forming a total of 4 groups of first sequences after zero-filling. Then, the first two groups are subjected to 64-point inverse Fourier transform, and the last two groups are subjected to 128-point inverse Fourier transform. Assuming that the zero frequency position of the channel bandwidth is at the position of the 0 subcarrier when the second group of data is subjected to inverse Fourier transform, the frequency shift operation is performed on the first, third, and fourth groups of data. The first two groups of data are 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 last two groups of data, form 4 groups of 128-point second sequences.

[0101] Then, one data is taken out from each group of the second sequence in order by column, and a total of four data are taken out. An oversampled 64-point inverse Fourier transform is performed on each of the four data taken out: the zero-frequency position is aligned with the second group of data, the four data are arranged in order, two zeros are inserted between every two data, and 54 zeros are added to the positions of the remaining subcarriers, and then IFFT is performed to obtain a subsymbol. A total of 128 64-point IFFTs are performed to obtain 128 subsymbols; each subsymbol is then repeatedly expanded by 4 times, and finally 128 subsymbols are concatenated in the time domain to form a group of target time domain data sequences, where the interval during concatenation is 8 points, that is, 1 / 8 of the subsymbol length. The group of target time domain data sequences is transmitted on the time-frequency resources.

[0102] Example 7

[0103] In one example, Figure 8 Schematic diagram of data transmission to be transmitted provided by an embodiment of the present application. Figure 8 As shown, the target time domain data sequence corresponding to the data to be transmitted is windowed or filtered in turn; then the DAC and RF processes are performed.

[0104] like Figure 8 As shown, transmitting the target time domain data sequence corresponding to the set 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.

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

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

[0107] In one embodiment, Fig. 9 is a structural block diagram of a data transmission device provided in an embodiment of the present application. Fig. 9 As shown, the data transmission device in this embodiment includes: a division module 910, a first transformation module 920, a second transformation module 930 and a transmission module 940.

[0108] The division module 910 is configured to divide the data to be transmitted into N groups of first sequences.

[0109] The nth group of first sequences contains k(n) data, k(n) is a positive integer; n = 1, 2, ..., N; N is an integer greater than or equal to 2.

[0110] The first transformation module 920 is configured to perform inverse Fourier transformation on each group of first sequences to obtain N groups of second sequences.

[0111] The second transformation module 930 is configured to perform multiple inverse Fourier transforms on the N groups of second sequences to obtain a group of target time domain data sequences.

[0112] Each inverse Fourier transform in the multiple inverse Fourier transforms includes the following operations: extracting one data from each group of the second sequence in order to form N data, and performing zero insertion and inverse Fourier transform operations on the N data in order;

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

[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, when a subcarrier in a subband is the zero frequency position of the baseband, the data sequentially extracted from the second sequence corresponding to the subband is mapped to the zero frequency position after multiple inverse Fourier transforms are performed.

[0116] In one embodiment, the zero frequency position of the baseband is also the zero frequency position of the channel bandwidth.

[0117] In one embodiment, the zero insertion operation includes: inserting Q(n) zeros between every two adjacent data among the N data.

[0118] In one embodiment, the number of zeros inserted between every two adjacent data among the N data is equal.

[0119] In one embodiment, after the zero insertion operation is performed on N data, the interval between the frequency domains where adjacent non-zero data are located is the width of one sub-band.

[0120] In one embodiment, the widths of the N sub-bands are the same.

[0121] In one embodiment, the interval between the frequency domain positions of two adjacent data among the N data when performing inverse Fourier transform is the width of a sub-band.

[0122] In one embodiment, the interval between the frequency domain positions of any two data among the N data when performing inverse Fourier transform is the subband interval of the subbands corresponding to the two data; wherein the subband interval is the interval between the same positions in the two subbands.

[0123] In one embodiment, the number of zeros inserted between every two adjacent data among the N data is not equal; and the widths of the N sub-bands are not the same.

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

[0125] Perform zero padding operation on both ends of each group of first sequences respectively;

[0126] Among them, each group of the first sequence after zero padding contains M*s(n) data, M is a positive integer, s(n)>=k(n); the number of points for performing inverse Fourier transform on each group of the first sequence is M*s(n).

[0127] In one embodiment, before performing multiple inverse Fourier transforms on the N groups of second sequences, the method further includes:

[0128] A frequency shift operation is performed on the N groups of second sequences.

[0129] In one embodiment, the number of times the inverse Fourier transform is performed on the N groups of second sequences is M*s(n).

[0130] In one embodiment, after performing the zero insertion operation on the N data and before performing the inverse Fourier transform operation, the method further includes:

[0131] Perform zero padding operation on both ends of the data after the zero insertion operation.

[0132] In one embodiment, in the nth group of the first sequence, when (s(n) - k(n)) / s(n) >= p*α, M = 1;

[0133] when (s(n) - k(n)) / s(n) < p*α, M = 2; where α is the roll-off factor of the root-raised cosine filter in polyphase filtering; p is the error coefficient.

[0134] In one embodiment, when the number of data k(n) included in the nth group of the first sequence is k(n) = a*2 b in the case of performing multiple inverse Fourier transforms on N groups of second sequences, the subcarrier spacing of each inverse Fourier transform is 2 b times the subcarrier spacing of the nth subband, and the number of points nifft of each inverse Fourier transform in performing multiple inverse Fourier transforms on N groups of second sequences is nifft = Nifft(n) / 2 b ; where Nifft(n) is the total number of points of the inverse Fourier transform of the nth group of the first sequence; both a and b are positive integers, and a is an odd number.

[0135] In one embodiment, a group of target time-domain data sequences is formed by serially connecting time-domain data sequences generated by multiple inverse Fourier transforms; the serial connection is a serial connection method of offset superposition.

[0136] In one embodiment, the time-domain data sequences generated by inverse Fourier transforms are connected in series, and the series connection interval of each group of data is Nifft(n) / M / s(n).

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

[0138] In one embodiment, zero-padding operations are respectively performed on both ends of each group of the first sequence, and [M*s(n) - k(n)] / 2 zero data are added to both ends of each group of the first sequence.

[0139] In one embodiment, the number of points of the inverse Fourier transform of each group of the first sequence satisfies one of the following conditions: the ratio of the number of points of the inverse Fourier transform of two adjacent groups of the first sequence satisfies a power of 2; the number of points of the inverse Fourier transform of each group of the first sequence is the same; where i is an integer.

[0140] In one embodiment, multiple inverse Fourier transforms are performed on N groups of second sequences to form a group of target time-domain data sequences, including:

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

[0142] Perform inverse Fourier transform on the N groups of second 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 data sequences not included in the data sequence generated by the data sequence to be transmitted.

[0143] In one embodiment, the number of points of the multiple inverse Fourier transforms performed on the N groups of second sequences is greater than N; and the number of points of each inverse Fourier transform in the multiple inverse Fourier transforms is greater than or equal to M.

[0144] In one embodiment, the process of multiple inverse Fourier transforms includes:

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

[0146] For the second sequences corresponding to the subbands with non-minimum subcarrier spacing, at least two groups of second sequences are selected, connected in series to form sequences with the same length as the reference length, forming new N groups of second sequences, and multiple inverse Fourier transforms are performed on the new N groups of second sequences.

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

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

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

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

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

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

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

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

[0155] A filter 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.

[0156] 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; an isotropic orthogonal transform algorithm IOTA function.

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

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

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

[0160] In one embodiment, Fig.10 Schematic diagram of a communication device provided in an embodiment of the present application. Fig.10 As shown, the device provided by the present application includes: a processor 1010, a memory 1020 and a communication module 1030. The number of processors 1010 in the device can be one or more. Fig.10 In the example, a processor 1010 is used. The number of memories 1020 in the device may be one or more. Fig.10 A memory 1020 is taken as an example. The processor 1010, the memory 1020 and the communication module 1030 of the device can be connected via a bus or other means. Fig.10 In the embodiment, the communication device may be a base station side or a terminal side.

[0161] The memory 1020, as a computer-readable storage medium, may 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 (e.g., the partition module 910, the first transformation module 920, the second transformation module 930, and the transmission module 940 in the data transmission device). The memory 1020 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the device, etc. In addition, the memory 1020 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 1020 may further include a memory remotely arranged relative to the processor 1010, 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 combinations thereof.

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

[0163] 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 first sequences contains k(n) data, k(n) is a positive integer; n=1, 2, ..., N; N is an integer greater than or equal to 2; performing inverse Fourier transform on each group of first sequences respectively to obtain N groups of second sequences; performing inverse Fourier transform on the N groups of second sequences multiple times to obtain a group of target time domain data sequences; wherein each inverse Fourier transform in the multiple inverse Fourier transforms includes the following operations: extracting one data from each group of second sequences in sequence to form N data, and performing zero insertion and inverse Fourier transform operations on the N data in sequence; transmitting the target time domain data sequence on a pre-configured time-frequency resource.

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

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

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

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

[0168] 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: It includes: Dividing the data to be transmitted into N groups of first sequences; wherein, the nth group of the first sequences contains k(n) data, and k(n) is a positive integer; n = 1, 2, ……, N; N is an integer greater than or equal to 2; Performing inverse Fourier transforms on each group of the first sequences respectively to obtain N groups of second sequences; Performing multiple inverse Fourier transforms on the N groups of second sequences to obtain a group of target time-domain data sequences; wherein, each inverse Fourier transform in the multiple inverse Fourier transforms includes the following operations: sequentially extracting one data from each group of second sequences in order to form N data, and sequentially performing zero-padding and inverse Fourier transform operations on the N data; Transmitting the target time-domain data sequences on pre-configured time-frequency resources.

2. The method according to claim 1, characterized in that The channel bandwidth includes N subbands, and each subband corresponds to a group of first sequences.

3. The method according to claim 1, characterized in that When a subcarrier within a subband is at the zero-frequency position of the baseband, the data extracted in order from the second sequence corresponding to the subband is mapped to the zero-frequency position when performing the multiple inverse Fourier transforms.

4. The method according to claim 3, characterized in that The zero-frequency position of the baseband is also the zero-frequency position of the channel bandwidth.

5. The method according to claim 1, characterized in that The zero-padding operation includes: inserting Q(n) zeros between every two adjacent data among the N data.

6. The method according to claim 1, characterized in that The number of zeros inserted between every two adjacent data among the N data is equal.

7. The method according to claim 1, characterized in that The interval between the frequency domains where the adjacent non-zero data are located after performing the zero-padding operation on the N data is the width of one subband.

8. The method according to claim 2, characterized in that: The widths of the N subbands are the same.

9. The method according to claim 1, characterized in that: The interval between the frequency domain positions where two adjacent data among the N data are located when performing the inverse Fourier transform is the width of one subband.

10. The method according to claim 1, characterized in that The interval between the frequency domain positions where any two data among the N data are located when performing the inverse Fourier transform is the subband interval of the two subbands corresponding to the two data; wherein, the subband interval is the interval between the same positions in two subbands.

11. The method according to claim 2, characterized in that The number of zeros inserted between every two adjacent data among the N data is not equal; the widths of the N subbands are not the same.

12. The method according to claim 1, characterized in that Before performing the inverse Fourier transform operation on each group of the first sequences respectively, it further includes: Performing zero-padding operations at both ends of each group of the first sequences respectively; Wherein, each group of the first sequences after zero-padding contains M*s(n) data, M is a positive integer, s(n) >= k(n); the number of points for performing the inverse Fourier transform on each group of the first sequences is M*s(n).

13. The method according to claim 1, characterized in that Before performing the multiple inverse Fourier transforms on the N groups of second sequences, it further includes: Performing a frequency shift operation on the N groups of second sequences.

14. The method according to claim 1, characterized in that The number of times of performing the multiple inverse Fourier transforms on the N groups of second sequences is M*s(n).

15. The method according to claim 1, characterized in that After performing the zero-padding operation on the N data and before performing the inverse Fourier transform operation, it further includes: Performing zero-padding operations at both ends of the data after performing the zero-padding operation.

16. The method according to claim 12, characterized in that In the nth group of the first sequences, when (s(n) - k(n)) / s(n) >= p*α, M = 1; When (s(n) - k(n)) / s(n) < p*α, M = 2; wherein, α is the roll-off factor of the root raised cosine filter in the polyphase filtering; p is the error coefficient.

17. The method according to claim 1, characterized in that The number of data contained in the first sequence of the nth group k(n)=a*2 b In the case of performing multiple inverse Fourier transforms on the N groups of second sequences, the subcarrier spacing of each inverse Fourier transform is 2 times the subcarrier spacing of the nth subband. b times, the number of points of each Fourier inverse transform in multiple Fourier inverse transforms of N groups of second sequences is nifft=Nifft(n) / 2 b ; Wherein, Nifft(n) is the total number of inverse Fourier transform points of the first sequence of the nth group; a and b are both positive integers, and a is an odd number.

18. The method according to claim 17, characterized in that The set of target time domain data sequences is formed by serially connecting multiple time domain data sequences generated by the inverse Fourier transform; the serial connection is a serial connection method of staggered superposition.

19. The method according to claim 18, characterized in that The time domain data sequences generated by the inverse Fourier transform are connected in series, and the series interval of each set of data is Nifft(n) / M / s(n).

20. The method according to claim 1, characterized in that The performing multiple inverse Fourier transforms on the N groups of second 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 turn to obtain other P groups of target frequency domain data sequences; Perform inverse Fourier transform on the N groups of second 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 data sequences not included in the data sequence generated by the data sequence to be transmitted.

21. The method according to claim 1, characterized in that The number of points of multiple inverse Fourier transforms performed on the N groups of second sequences is greater than N; and the number of points of each inverse Fourier transform in the multiple inverse Fourier transforms is greater than or equal to M.

22. The method according to claim 1, characterized in that The process of multiple inverse Fourier transforms includes: For subbands with different subcarrier spacings, the length of the second sequence corresponding to the subband with the smallest subcarrier spacing is used as the reference length; For the second sequences corresponding to the subbands with non-minimum subcarrier spacing, at least two groups of second sequences are selected, serially connected to form sequences with the same length as the reference length, forming new N groups of second sequences, and multiple inverse Fourier transforms are performed on the new N groups of second sequences.

23. The method according to claim 12, 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.

24. 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 23.

25. 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 23 is implemented.

Images