Data transmission method, device, and storage medium

Abstract

Provided in the present application are a data transmission method, a device, and a storage medium. The method comprises: dividing, into N first sequences, data to be transmitted, wherein an nth first sequence includes k(n) pieces of data, k(n) being a positive integer, n = 1, 2, …, N, and N being an integer greater than or equal to 2; performing inverse Fourier transform on each first sequence, so as to obtain N second sequences; performing multiple instances of inverse Fourier transform on the N second sequences, so as to obtain a target time-domain data sequence, wherein each of the multiple instances of inverse Fourier transform comprises the following operations: sequentially extracting one piece of data from each second sequence, so as to form N pieces of data, and sequentially performing a zero-padding operation and an inverse Fourier transform operation on the N pieces of data; and transmitting the target time-domain data sequence on pre-configured time-frequency resources.

Description

Data transmission method, device and storage medium Technical Field

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

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

[0003] Summary of the Invention

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

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

[0006] Divide the data to be transmitted into N groups of first sequences; wherein the nth group of the first sequence contains k(n) data, k(n) is a positive integer; n=1, 2, ..., N; N is an integer greater than or equal to 2;

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

[0008] 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 to form N data, and sequentially performing zero insertion operations and inverse Fourier transform operations on the N data;

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

[0010] An embodiment of the present application provides a communication device, comprising: a memory, and at least one processor;

[0011] The memory is configured to store at least one program;

[0012] When the at least one program is executed by the at least one processor, the at least one processor implements the method described in any one of the above embodiments.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0030] 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 transmitting end to the receiving end. The data to be transmitted can be frequency domain data or time domain data. In one example, when the data to be transmitted is frequency domain data, the data to be transmitted is directly divided to obtain multiple first sequences that are also frequency domain data; in one example, when the data to be transmitted is time domain data, the data to be transmitted can be divided first to obtain N groups of data that are also time domain data, and then the divided N groups of time domain data can be 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 the Fourier transform can be divided to obtain the corresponding N groups of first sequences.

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

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

[0033] 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 sequence to form N data, and performing zero insertion and inverse Fourier transform operations on the N data in sequence.

[0034] 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 sequence. 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 the sub-band data mapping and the number of points of the inverse Fourier transform can be adjusted so that the sub-band can be mapped on the channel bandwidth according to the actual frequency domain position.

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

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

[0037] In one embodiment, when a subcarrier in a subband is at 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.

[0038] 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 within a subband is at 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 in multiple Fourier transforms. Furthermore, the zero-frequency position of the baseband is also the zero-frequency position of the channel bandwidth. This allows the subband to be aligned with the actual frequency domain position in a second-order inverse Fourier transform. The second-order inverse Fourier transform is an inverse Fourier transform operation performed on the second sequence.

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

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

[0041] In one embodiment, after performing the zero-insertion operation on N data, the interval between adjacent non-zero data in the frequency domain is the width of one sub-band.

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

[0043] In one embodiment, the interval between the frequency domain positions of two adjacent data in the N data during inverse Fourier transform is the width of one sub-band.

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

[0045] In one embodiment, the number of zeros inserted between each adjacent pair of N data is unequal; the widths of the N subbands are unequal. In one example, the number of zeros inserted between each adjacent pair of N data can be equal or unequal, thereby achieving the effect of the subband spacing being exactly equal to the subband width by configuring the data interval of the second-order inverse Fourier transform. The second-order inverse Fourier transform is an inverse Fourier transform operation performed on the second sequence.

[0046] 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 of each group of first sequences respectively; 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 of 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.

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

[0048] In one embodiment, the number of times of performing multiple inverse Fourier transform operations 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 of 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 multiple inverse Fourier transform operations 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 transform operations 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 multiple inverse Fourier transform operations on N groups of second sequences is M*s(n).

[0049] 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 of the data after the zero-insertion operation.

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

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

[0052] 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 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 inverse Fourier transform in multiple inverse Fourier 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 in the first sequence of the nth group; a and b are both positive integers, with a being an odd number. This approach has the advantage of finding the minimum number of second-order inverse Fourier transform points that matches the subband width, reducing complexity while still achieving the effect of the subband width in the second-order inverse Fourier transform.

[0053] 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 staggered superposition serial connection mode.

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

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

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

[0057] 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., 2 i ), wherein i is an integer greater than or equal to 0. In one example, an inverse Fourier transform of M*s(n) points is performed on each group of third sequences, and the number of points of the inverse Fourier transform of each group of third sequences is the same.

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

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

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

[0061] 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 are not included in the data sequences generated by the data sequences 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.

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

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

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

[0065] For the second sequences corresponding to subbands with non-minimum subcarrier spacing, select at least two groups of second sequences, concatenate them to form sequences with the same length as the reference length, and form N new groups of second sequences. Multiple inverse Fourier transforms are performed on the N new groups of second sequences. Subbands with different subcarrier spacings represent first sequences with different amounts of data.

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

[0067] The number of data included in each group of second sequences meets one of the following conditions: M*s(n); or greater than or equal to M times the number of subcarriers included in each frequency-domain resource block. In one example, among N groups of second sequences, the number of data included in each group of second sequences is M*s(n), that is, greater than or equal to M times the number of subcarriers included in each frequency-domain resource block.

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

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

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

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

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

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

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

[0075] 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 (IOTA) function.

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

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

[0078] Example 1

[0079] In one example, Figure 2 is a schematic diagram of generating a target time-domain data sequence according to an embodiment of the present application. In this embodiment, the process of generating the target time-domain data sequence is described by taking as an example a case where the number of first sequence groups N is 4, each first sequence group contains the same number of data items, 48, and each first sequence group is padded with zeros for 40 items.

[0080] As shown in Figure 2, in this embodiment, the data to be transmitted is divided into four groups of first sequences, each containing 48 data points. Forty zero subcarriers are added to both ends of each first sequence, forming four groups of zero-padded first sequences, each containing 128 points. Assuming that the zero frequency of the channel bandwidth is located at the zero subcarrier position when the second data group is inverse Fourier transformed, frequency shifting is performed on the first, third, and fourth data groups; a 128-point inverse Fourier transform is then performed to form four groups of second sequences.

[0081] Then, one data point is sequentially extracted from each second sequence, for a total of four data points. Each of the four data points is subjected to an oversampled 64-point inverse Fourier transform. The zero-frequency position is aligned with the second data set, and the four data points are arranged sequentially. Two zeros are inserted between every two data points, and 54 zeros are added to the remaining subcarrier positions. An inverse fast Fourier transform (IFFT) is then 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 a factor of four and filtered, performing a point-wise multiplication with the filter. Finally, the 128 subsymbols are concatenated in the time domain to form a target time domain data sequence. The concatenation process is staggered and superimposed, with an interval of 8 points (i.e., 1 / 8 of the subsymbol length). This target time domain data sequence is transmitted over the time-frequency resources.

[0082] Example 2

[0083] In one example, FIG3 is a schematic diagram of another target time-domain data sequence generation method provided in an embodiment of the present application. In this embodiment, the target time-domain data sequence generation method is described by taking the example of a first sequence group number N being 4, each first sequence group containing the same number of data items (40), and each first sequence group padded with 12 zeros at both ends.

[0084] As shown in Figure 3, in this embodiment, the data to be transmitted is divided into four first sequences, each containing 40 data points. Twelve zero subcarriers are added to both ends of each first sequence, forming four zero-padded first sequences. Each zero-padded first sequence contains 64 points. Assuming that the zero frequency of the channel bandwidth is located at the zero subcarrier position when the second data set is inverse Fourier transformed, frequency shifting is performed on the first, third, and fourth data sets. A 64-point inverse Fourier transform is then performed to form four second sequences.

[0085] Then, one data point is extracted from each second sequence, column by column, for a total of four data points. Each of the four extracted data points undergoes an oversampled 128-point inverse Fourier transform. The zero-frequency position is aligned with the second set of data, and the four data points are arranged sequentially. Four zeros are inserted between every two data points, and 112 zeros are added to the remaining subcarrier positions. An IFFT is then performed to obtain a subsymbol. A total of 64 128-point IFFTs are performed, yielding 64 subsymbols. Each subsymbol is then repeatedly expanded by a factor of four. Finally, the 64 subsymbols are concatenated in the time domain to form a target time domain data sequence. The concatenation interval is 16 points, or 1 / 8 of the subsymbol length. This target time domain data sequence is then transmitted over the time-frequency resources.

[0086] Example 3

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

[0088] As shown in Figure 4, in this embodiment, the data to be transmitted is divided into four first sequences, each containing 40 data points. Twelve zero subcarriers are added to both ends of each first sequence, forming four zero-padded first sequences, each containing 64 points. Assuming that the zero frequency of the channel bandwidth is located 0.5 subcarriers before the zero subcarrier when performing an inverse Fourier transform on the second data set, frequency shifting is performed on the first, second, third, and fourth data sets. A 64-point inverse Fourier transform is then performed to form four second sequences.

[0089] Then, one data point is extracted from each second sequence, column by column, for a total of four data points. Each of the four extracted data points undergoes an oversampled 128-point inverse Fourier transform. The zero-frequency position is aligned with the second set of data, and the four data points are arranged sequentially. Four zeros are inserted between every two data points, and 112 zeros are added to the remaining subcarrier positions. An IFFT is then performed to obtain a subsymbol. A total of 64 128-point IFFTs are performed, yielding 64 subsymbols. Each subsymbol is then repeatedly expanded by a factor of four. Finally, the 64 subsymbols are concatenated in the time domain to form a target time domain data sequence. The concatenation interval is 16 points, or 1 / 8 of the subsymbol length. This target time domain data sequence is then transmitted over the time-frequency resources.

[0090] Example 4

[0091] In one example, FIG5 is a schematic diagram of generating another target time-domain data sequence provided in an embodiment of the present application. In this embodiment, the process of generating the target time-domain data sequence is described by taking the example of a first sequence group number N being 4, each first sequence group containing the same number of data items (48), and each first sequence group padded with 40 zeros at both ends.

[0092] As shown in Figure 5, in this embodiment, the data to be transmitted is divided into four groups of first sequences, each containing 48 data points. Forty zero subcarriers are added to both ends of each first sequence, forming four groups of zero-padded first sequences, each containing 128 points. Assuming that the zero frequency of the channel bandwidth is located at the zero subcarrier position when the second data group is inverse Fourier transformed, frequency shifting is performed on the first, third, and fourth data groups. A 128-point inverse Fourier transform is then performed to form four groups of second sequences.

[0093] The four second sequences, along with the other data sets, are then subjected to subband-level inverse Fourier transform and polyphase filtering to form a target time-domain data sequence. The other data sets, comprising 48 data points, also undergo zero-padding, inverse discrete Fourier transform (IDFT), and frequency shifting before being processed at the subband level.

[0094] The process of forming the target time domain data sequence includes: extracting one data point from each group of the second sequence in column order, for a total of five data points, and performing an oversampled 64-point inverse Fourier transform on each of the five data points: the zero-frequency position is aligned with the second group of data, the five data points are arranged in sequence, two zeros are inserted between every two data points, and 41 zeros are added to the positions of the remaining subcarriers, and then an 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 a factor of 4, and finally, the 128 subsymbols are concatenated in the time domain to form a group of target time domain data sequences, where the interval between the concatenations 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.

[0095] Example 5

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

[0097] As shown in Figure 6, in this embodiment, the data to be transmitted is divided into four groups of first sequences, each containing 48 data points, with the first group containing 24 reference signals. Forty zero subcarriers are added to both ends of each first sequence, forming four groups of zero-padded first sequences, each containing 128 points. Assuming that the zero frequency of the channel bandwidth is located at the zero subcarrier position when the second data group is inverse Fourier transformed, frequency shifting is performed on the first, third, and fourth data groups. A 128-point inverse Fourier transform is then performed to form four data sequences.

[0098] Then, one data point is extracted from each second sequence group, column by column, for a total of four data points. Each of the four extracted data points undergoes an oversampled 64-point inverse Fourier transform: the zero-frequency position is aligned with the second set of data, the four data points are arranged sequentially, two zeros are inserted between every two data points, and 54 zeros are added to the remaining subcarrier positions. An IFFT is then 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 a factor of 4. Finally, the 128 subsymbols are concatenated in the time domain to form a target time domain data sequence. The concatenation interval is 8 points, or 1 / 8 of the subsymbol length. This target time domain data sequence is then transmitted over the time-frequency resources.

[0099] Example 6

[0100] In one example, Figure 7 is a schematic diagram of generating another target time-domain data sequence provided by an embodiment of the present application. In this embodiment, the process of generating the target time-domain data sequence is described by taking the example of the number of first sequence groups N being 4, the first two first sequence groups containing the same number of data, 24, or 2 RBs; the second two first sequence groups containing the same number of data, 48, or 4 RBs; and the first two first sequence groups having 20 zeros padded at both ends, and the second two first sequence groups having 40 zeros padded at both ends.

[0101] As shown in Figure 7, in this embodiment, the data to be transmitted is divided into four groups of first sequences. The first two groups each contain 24 data points, or two RBs, and the second two groups each contain 48 data points, or four RBs. 20 zero subcarriers are added to both ends of each first sequence in the first two groups, resulting in a total of 64 points in each zero-padded first sequence. For the second two groups, 40 zero subcarriers are added to both ends of each data sequence, resulting in a total of 128 points in each zero-padded first sequence, forming a total of four groups of zero-padded first sequences. The first two groups then undergo a 64-point inverse Fourier transform, while the second two groups undergo a 128-point inverse Fourier transform. Assuming the zero frequency of the channel bandwidth is located at the zero subcarrier position during the inverse Fourier transform of the second group, the first, third, and fourth groups of data are frequency shifted. The first two groups of data are concatenated with the symbol data at the next moment to form two 128-point data groups, which are then combined with the second two groups of data to form four 128-point second sequences.

[0102] Then, one data point is extracted from each second sequence group, column by column, for a total of four data points. Each of the four extracted data points undergoes an oversampled 64-point inverse Fourier transform: the zero-frequency position is aligned with the second set of data, the four data points are arranged sequentially, two zeros are inserted between every two data points, and 54 zeros are added to the remaining subcarrier positions. An IFFT is then 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 a factor of 4. Finally, the 128 subsymbols are concatenated in the time domain to form a target time domain data sequence. The concatenation interval is 8 points, or 1 / 8 of the subsymbol length. This target time domain data sequence is then transmitted over the time-frequency resources.

[0103] Example 7

[0104] In one example, Figure 8 is a schematic diagram of a data transmission method provided by an embodiment of the present application. As shown in Figure 8, the target time-domain data sequence corresponding to the data to be transmitted is windowed or filtered, followed by digital-to-analog conversion (DAC) and radio frequency (RF) processing.

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

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

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

[0108] In one embodiment, FIG9 is a block diagram of a data transmission device provided by an embodiment of the present application. As shown in FIG9 , the data transmission device in this embodiment includes: a partitioning module 910 , a first transformation module 920 , a second transformation module 930 , and a transmission module 940 .

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

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

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

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

[0113] 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 sequence to form N data, and performing zero insertion and inverse Fourier transform operations on the N data in sequence;

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

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

[0116] In one embodiment, when a subcarrier in a subband is at 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.

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

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

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

[0120] In one embodiment, after performing the zero-insertion operation on N data, the interval between adjacent non-zero data in the frequency domain is the width of one sub-band.

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

[0122] In one embodiment, the interval between the frequency domain positions of two adjacent data in the N data during inverse Fourier transform is the width of one sub-band.

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

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

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

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

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

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

[0129] Perform frequency shift operation on the N groups of second sequences.

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

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

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

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

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

[0135] 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 inverse Fourier transform points of the nth group of the first sequence; both a and b are positive integers, and a is an odd number.

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

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

[0138] 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 to the i; the ratio of adjacent two k(n) satisfies a power of 2 to the i; k(n) are all the same.

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

[0140] 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 adjacent two groups of the first sequence satisfies a power of 2 to the i; the number of points of the inverse Fourier transform of each group of the first sequence is the same; where i is an integer.

[0141] In one embodiment, performing multiple inverse Fourier transforms on N groups of second sequences to form a group of target time-domain data sequences includes:

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

[0143] 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 are not included in the data sequence generated by the data sequence to be transmitted.

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

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

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

[0147] For the second sequences corresponding to the subbands with non-minimum subcarrier spacing, at least two groups of second sequences are selected, concatenated 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.

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

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

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

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

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

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

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

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

[0156] The 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 polyphase filtering.

[0157] 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 (IOTA) function.

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

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

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

[0161] In one embodiment, Figure 10 is a schematic diagram of the structure of a communication device provided by an embodiment of the present application. As shown in Figure 10, 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, and Figure 10 takes one processor 1010 as an example. The number of memories 1020 in the device can be one or more, and Figure 10 takes one memory 1020 as an example. The processor 1010, memory 1020, and communication module 1030 of the device can be connected via a bus or other means, and Figure 10 takes connection via a bus as an example. In this embodiment, the communication device can be on the base station side or on the terminal side.

[0162] The memory 1020, as a computer-readable storage medium, can be configured to store software programs, computer executable programs, and modules, such as program instructions / modules corresponding to the device of any embodiment of the present application (for example, the partitioning module 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; and 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 located 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.

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

[0164] An embodiment of the present application also provides a storage medium containing computer-executable instructions, which, when executed by a computer processor, are used to perform a data transmission method, the method comprising: dividing the data to be transmitted into N groups of first sequences; wherein the nth group of 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 an inverse Fourier transform on each group of first sequences to obtain N groups of second sequences; performing an 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 comprises 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; and transmitting the target time domain data sequence on pre-configured time-frequency resources.

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

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

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

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

Claims

1. A data transmission method, comprising: Divide the data to be transmitted into N groups of first sequences; wherein the nth group of the first sequence contains k(n) data, 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 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: extracting one data from each group of second sequences in sequence to form N data, and performing zero insertion operations and inverse Fourier transform operations on the N data in sequence; The target time domain data sequence is transmitted on preconfigured time-frequency resources.

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

3. The method according to claim 1, wherein: In the case where 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 of the multiple inverse Fourier transforms.

4. The method according to claim 3, wherein: The zero frequency position of the baseband is also the zero frequency position of the channel bandwidth.

5. The method according to claim 1, wherein: The zero insertion operation includes: inserting Q(n) zeros between every two adjacent data in the N data.

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

7. The method according to claim 1, wherein: After the zero insertion operation is performed on the N data, the interval between the frequency domains where adjacent non-zero data are located is the width of a sub-band.

8. The method according to claim 2, wherein: The N sub-bands have the same width.

9. The method according to claim 1, wherein: 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.

10. The method according to claim 1, wherein: 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 two subbands.

11. The method according to claim 2, wherein: The number of zeros inserted between every two adjacent data in the N data is not equal; the widths of the N sub-bands are different.

12. The method according to claim 1, before performing the inverse Fourier transform operation on each group of the first sequences respectively, further comprising: Performing zero padding operation on both ends of each group of the first sequences; 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).

13. The method according to claim 1, before performing multiple inverse Fourier transforms on the N groups of second sequences, further comprising: A frequency shift operation is performed on the N groups of second sequences.

14. The method according to claim 1, wherein: The number of times the inverse Fourier transform is performed on the N groups of second sequences is M*s(n).

15. The method according to claim 1, after performing the zero insertion operation on the N data and before performing the inverse Fourier transform operation, further comprises: Perform zero padding operation on both ends of the data after the zero insertion operation.

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

17. The method according to claim 1, wherein: The number of data contained in the first sequence in 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 inverse Fourier transform in multiple inverse Fourier transforms of the 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, wherein: 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, wherein: The time-domain data sequences generated by the inverse Fourier transform are connected in series, and the series interval of each group of data is Nifft(n) / M / s(n).

20. The method according to claim 1, wherein: Performing multiple inverse Fourier transforms on the N groups of second sequences to form a set of target time-domain data sequences, including: Sequentially performing zero-padding in the frequency domain and cyclic shift operations on other P groups of initial frequency-domain data sequences to obtain other P groups of target frequency-domain data sequences; Performing inverse Fourier transforms on the N groups of second sequences and the other P groups of target frequency-domain data sequences to form a set of target time-domain data sequences; where the other P groups of target frequency-domain data sequences include: data after M-fold frequency-domain oversampling, and data sequences not included in the data sequences generated by the data sequence to be transmitted.

21. The method according to claim 1, wherein: 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.

22. The method according to claim 1, wherein: The process of the multiple inverse Fourier transforms includes: For subbands with different subcarrier intervals, the length of the second sequence corresponding to the subband with the minimum subcarrier interval is used as the reference length; For the second sequences corresponding to subbands with non-minimum subcarrier intervals, select at least two groups of second sequences, serially combine them into a sequence with the same length as the reference length, form a new set of N groups of second sequences, and perform multiple inverse Fourier transforms on the new set of N groups of second sequences.

23. The method according to claim 12, wherein: Each group of first sequences is transmitted in a corresponding frequency-domain resource block; each frequency-domain resource block contains Z subcarriers; The number of data contained in each group of the second sequences satisfies one of the following conditions: M * s(n); greater than or equal to M times the number of subcarriers contained in each frequency-domain resource block.

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

25. A storage medium storing a computer program, which when executed by a processor implements the method according to any one of claims 1-23 above.

Images