WO2023213228A1 - 数据传输方法、装置、存储介质及电子装置 - Google Patents

数据传输方法、装置、存储介质及电子装置 Download PDF

Info

Publication number
WO2023213228A1
WO2023213228A1 PCT/CN2023/091315 CN2023091315W WO2023213228A1 WO 2023213228 A1 WO2023213228 A1 WO 2023213228A1 CN 2023091315 W CN2023091315 W CN 2023091315W WO 2023213228 A1 WO2023213228 A1 WO 2023213228A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
fourier transform
inverse fourier
data sequences
frequency domain
Prior art date
Application number
PCT/CN2023/091315
Other languages
English (en)
French (fr)
Inventor
辛雨
华健
暴桐
郁光辉
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2023213228A1 publication Critical patent/WO2023213228A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2626—Arrangements specific to the transmitter only
    • H04L27/2627—Modulators
    • H04L27/2628—Inverse Fourier transform modulators, e.g. inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2647—Arrangements specific to the receiver only
    • H04L27/2655—Synchronisation arrangements
    • H04L27/2668—Details of algorithms
    • H04L27/2681—Details of algorithms characterised by constraints
    • H04L27/2686—Range of frequencies or delays tested
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2647—Arrangements specific to the receiver only
    • H04L27/2655—Synchronisation arrangements
    • H04L27/2668—Details of algorithms
    • H04L27/2681—Details of algorithms characterised by constraints
    • H04L27/2688—Resistance to perturbation, e.g. noise, interference or fading
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/04—Wireless resource allocation
    • H04W72/044—Wireless resource allocation based on the type of the allocated resource
    • H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA

Definitions

  • the present disclosure relates to the field of communications, and specifically, to a data transmission method, device, storage medium and electronic device.
  • LTE Long-term evolution technology
  • 4G Full-term evolution technology
  • LTE uses Orthogonal Frequency Division Multiplexing OFDM (Orthogonal Frequency Division Multiplexing) technology.
  • the time-frequency resources composed of subcarriers and OFDM symbols constitute the wireless physical time-frequency resources of the LTE system.
  • OFDM technology has been widely used in wireless communications, especially the orthogonal frequency division multiplexing system CP-OFDM with cyclic prefix. 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.
  • the performance of the CP-OFDM system is sensitive to the frequency offset and time offset between adjacent subbands. This is mainly due to the large spectrum leakage of the system, which easily leads to inter-subband interference.
  • LTE systems use guard intervals in the frequency domain, but this reduces spectrum efficiency, so some new technologies need to be used to suppress out-of-band leakage.
  • 5G NR Freth Generation New Radio
  • 5G NR Freth Generation New Radio
  • 6G services will use a wide range of frequency bands and various deployment methods. Not only multi-bandwidth channels are required, but also waveform solutions that meet different scenarios are required.
  • Embodiments of the present disclosure provide a data transmission method, device, storage medium and electronic device to at least solve the problem in related technologies that interference between subcarriers is easy to occur.
  • a data transmission method including: transmitting data to be transmitted in N frequency domain resource blocks, wherein the N frequency domain resource blocks respectively contain the same number of subcarriers K , K is the i power of 2, i is a positive integer, and N is an integer greater than 1; perform inverse Fourier transform on the data to be transmitted on the K subcarriers of each frequency domain resource block to form N sets of data sequences. , wherein the number of points of the inverse Fourier transform is 2K; perform inverse Fourier transform on the N sets of data sequences to form a set of time domain data sequences, and transmit the set of time domain data sequences.
  • a data transmission device including: a transmission module configured to transmit data to be transmitted in N frequency domain resource blocks, wherein the N frequency domain resource blocks are respectively Contains the same number of subcarriers K, K is the i power of 2, i is a positive integer, and N is an integer greater than 1; the transformation module is set to perform the Fourier inverse of the data to be transmitted on the K subcarriers of each frequency domain resource block. Transform to form N sets of data sequences, wherein the number of points of the inverse Fourier transform is 2K; the processing module is configured to perform inverse Fourier transform on the N sets of data sequences to form a set of time domain data sequences, and transmit the set of time domain data sequences.
  • the data to be transmitted on the K subcarriers of each frequency domain resource block in the N frequency domain resource blocks are respectively subjected to an inverse Fourier transform to form N groups of data sequences, and the Fourier transform of the data to be transmitted is The number of inverse transformation points is 2K, and then the inverse Fourier transform is performed on the N sets of data sequences to form a set of time domain data sequences.
  • Each group of N data sequences formed in this way can be regarded as a time domain data sequence at the frequency domain resource block level. Its adjacent data intervals are the same, and the length of each group of time domain data sequences is also the same.
  • the number of inverse Fourier transform points of the data to be transmitted is 2K
  • the filtering operation not only the orthogonality of adjacent resource blocks can be guaranteed, but also the adjacent groups of time domain data sequences generated by each group of the inverse Fourier transform
  • the interval is exactly half the length of the time domain data sequence, so the processing complexity will be relatively low, and it will solve the problem of easy interference between subcarriers in related technologies.
  • Figure 1 is a hardware structure block diagram of a computer terminal according to an optional data transmission method according to an embodiment of the present disclosure
  • Figure 2 is a flow chart of an optional data transmission method according to an embodiment of the present disclosure
  • Figure 3 is a schematic diagram of an optional data transmission method according to an embodiment of the present disclosure.
  • Figure 4 is a schematic diagram of another optional data transmission method according to an embodiment of the present disclosure.
  • Figure 5 is a schematic diagram of yet another optional data transmission method according to an embodiment of the present disclosure.
  • Figure 6 is a structural block diagram of an optional data transmission device according to an embodiment of the present disclosure.
  • FIG. 1 is a hardware structure block diagram of a computer terminal of a data transmission method according to an embodiment of the present disclosure.
  • the computer terminal 10 may include one or more (only one is shown in the figure) processors 102 (the processor 102 may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA) , a memory 104 configured to store data, and a transmission device 106 configured to have a communication function.
  • processors 102 may include but is not limited to a processing device such as a microprocessor MCU or a programmable logic device FPGA
  • a memory 104 configured to store data
  • a transmission device 106 configured to have a communication function.
  • the computer terminal 10 may also include more or fewer components than shown in FIG. 1 , or have a different configuration than shown in FIG. 1 .
  • the memory 104 may be configured to store software programs and modules of application software, such as program instructions/modules corresponding to the data transmission method in the embodiment of the present disclosure.
  • the processor 102 runs the software programs and modules stored in the memory 104, Thereby executing various functional applications and data processing, that is, realizing the above method.
  • Memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory.
  • the memory 104 may further include memory located remotely relative to the processor 102, and these remote memories may be connected to the computer terminal 10 through a network. Examples of the above-mentioned networks include but are not limited to the Internet, intranets, local area networks, mobile communication networks and combinations thereof.
  • the transmission device 106 is configured to receive or send data via a network.
  • Specific examples of the above-mentioned network may include a wireless network provided by a communication provider of the computer terminal 10 .
  • the transmission device 106 includes a network adapter (Network Interface Controller, NIC), which can be connected to other network devices through a base station to communicate with the Internet.
  • the transmission device 106 may be a radio frequency (Radio Frequency, RF) module, which is configured to communicate with the Internet wirelessly.
  • RF Radio Frequency
  • FIG. 2 is a flow chart of an optional data transmission method according to an embodiment of the present disclosure. As shown in Figure 2, the process includes the following step:
  • Step S202 transmit the data to be transmitted in N frequency domain resource blocks, wherein the N frequency domain resource blocks respectively contain the same number of subcarriers K, K is the i power of 2, i is a positive integer, N is an integer greater than 1;
  • Step S204 Perform inverse Fourier transform on the data to be transmitted on K subcarriers of each frequency domain resource block to form N groups of data sequences, where the number of points in the inverse Fourier transform is 2K;
  • Step S206 Perform inverse Fourier transform on the N sets of data sequences to form a set of time domain data sequences, and transmit the set of time domain data sequences.
  • the data to be transmitted on the K subcarriers of each frequency domain resource block in the N frequency domain resource blocks are respectively subjected to the inverse Fourier transform to form N groups of data sequences, and the Fourier transform of the data to be transmitted is The number of inverse transformation points is 2K, and then the inverse Fourier transform is performed on the N sets of data sequences to form a set of time domain data sequences.
  • Each group of N data sequences formed in this way can be regarded as a time domain data sequence at the frequency domain resource block level. Its adjacent data intervals are the same, and the length of each group of time domain data sequences is also the same.
  • the spectrum intervals of adjacent frequency domain resource blocks are equal.
  • the spectrum bandwidths of the N frequency domain resource blocks are equal.
  • the subcarrier intervals of the N frequency domain resource blocks are equal.
  • K zeros are added to the data to be transmitted on the K subcarriers, and then the oversampling inverse Fourier transform is performed on the data to be transmitted with the K zeros added to form N sets of data sequences.
  • adding K zeros specifically means adding K/2 zeros on both sides of the K pieces of data to be transmitted.
  • the zero frequency position of each inverse Fourier transform or The zero subcarriers have different positions in the frequency domain.
  • Fourier transform is performed on the data to be transmitted on K subcarriers of each resource block respectively.
  • the zero frequency position or zero subcarrier of each inverse Fourier transform is within the K subcarrier frequency range of each resource block.
  • the zero frequency position or zero sub-position of each inverse Fourier transform is one of the K sub-carriers in each resource block.
  • the inverse Fourier transform is an oversampled inverse Fourier transform, and the number of IFFT points of the inverse Fourier transform is greater than N.
  • IFFT inverse fast Fourier transform
  • the number of IFFT points is IFFT size.
  • the number of points in the inverse Fourier transform can be understood as the number of frequency domain data before transformation, or the number of points in the inverse Fourier transform can be understood as the IFFT size.
  • the inverse Fourier transform includes: performing the inverse Fourier transform on every N pieces of data, and the every N pieces of data are respectively from N groups of data sequences.
  • N groups of data sequences are in N rows, and then N pieces of data are taken out according to columns, and the inverse Fourier transform is performed on each N piece of data taken out.
  • processing the above N groups of data sequences includes: adding multiple groups of zero data sequences, and then performing inverse Fourier transform. That is, after adding some 0s to every N data taken out, the inverse Fourier transform is performed.
  • processing the above N groups of data sequences includes: performing the inverse Fourier transform after adding data of other frequency domain resource blocks to every N data.
  • the other resource blocks are not among the N resource blocks.
  • processing the above-mentioned N groups of data sequences includes: performing the inverse Fourier transform after adding data and zeros of other frequency domain resource blocks to every N data.
  • the other frequency domain resource blocks are not among the N frequency domain resource blocks.
  • the set of time domain data sequences is serially linked by a plurality of time domain data sequences generated by the inverse Fourier transform.
  • the inverse Fourier transform before performing the inverse Fourier transform on the N groups of data sequences, it also includes adding a cyclic prefix CP to the N groups of data sequences respectively.
  • a guard interval GI Guard Interval
  • the guard interval is empty data (that is, data 0).
  • the set of time domain data sequences are filtered, wherein the filtering includes at least one of the following: single phase filtering, polyphase filtering, Add window operation.
  • the filtering or windowing operation includes: respectively repeating and windowing each set of time domain data sequences generated by the inverse Fourier transform in the set of time domain data sequences. operation, and then shift, overlap and add to form a new set of time domain data sequences; wherein, after performing the filtering or windowing operation, the adjacent time domain data sequences generated by each set of the inverse Fourier transform The group interval is half the length of the time domain data sequence.
  • the data to be transmitted includes at least one of the following: constellation point modulated data, reference signal data.
  • the method according to the above embodiments can be implemented by means of software plus the necessary general hardware platform. Of course, it can also be implemented by hardware, but in many cases the former is Better implementation.
  • the technical solution of the present disclosure can be embodied in the form of a software product in essence or that contributes to the existing technology.
  • the computer software product is stored in a storage medium (such as ROM/RAM, disk, CD), including several instructions to cause a terminal device (which can be a mobile phone, computer, server, or network device, etc.) to execute the methods described in various embodiments of the present disclosure.
  • FIG 3 is a schematic diagram of an optional data transmission method according to an embodiment of the present disclosure; as shown in Figure 3, in this embodiment:
  • the data to be transmitted is transmitted in N frequency domain resource blocks, and these N resource blocks each contain K subcarriers.
  • K 4, that is, these N resource blocks each contain 4 subcarriers.
  • the data to be transmitted on the 4 subcarriers of each resource block are respectively subjected to an inverse Fourier transform with a number of points of 8 to form N groups of data sequences.
  • These N sets of data sequences can be regarded as N sets of time domain data sequences at the frequency domain resource block level, in which the zero subcarriers of the inverse Fourier transform with 8 points are respectively among the 4 subcarriers of each resource block. one of.
  • the N sets of time domain data sequences are subjected to inverse Fourier transform to form a set of time domain data sequences, and finally this set of time domain data sequences is transmitted.
  • FIG 4 is a schematic diagram of another optional data transmission method according to the embodiment of the present disclosure; as shown in Figure 4, in this embodiment:
  • the data to be transmitted is transmitted in N frequency domain resource blocks, and the N resource blocks each contain K subcarriers.
  • the number of subcarriers is 3.
  • the data to be transmitted in each resource block is subjected to an oversampling inverse Fourier transform with a number of points of 8, forming three sets of time domain data sequences: [a1, a2, a3, a4, a5, a6, a7, a8], [b1, b2, b3, b4, b5, b6, b7, b8], [c1, c2, c3, c4, c5, c6, c7, c8].
  • multiple inverse oversampling Fourier transforms are performed on the three sets of time domain data sequences.
  • the first set of data formed after performing a 16-point inverse fast Fourier transform IFFT (inverse fast Fourier transform) on [a1, b1, c1] is [D1-1 , D1-2, D1-3, D1-4, D1-5, D1-6, D1-7, D1-8, D1-9, D1-10, D1-11, D1-12, D1-13, D1 -14, D1-15, D1-16]
  • the second set of data formed after performing 16-point IFFT on [a2, b2, c2] is [D2-1, D2-2, D2-3, D2-4, D2-5, D2-6, D2-7, D2-8, D2-9, D2-10, D2-11, D2-12, D2-13, D2-14, D2-15, D2-16]
  • the 8th set of data formed after performing 16-point IFFT on [a8, b8, c8] is [D8-1, D8-2, D8-3, D8-4, D8-5
  • Transmitting this set of time domain data sequences also includes filtering operations.
  • this filtering operation includes: performing a windowing operation on the 8 sets of time domain data sequences generated by the 8 inverse Fourier transforms in the set of time domain data sequences, and then performing a staggered overlap and addition operation to form A new set of time domain data sequences.
  • the time domain length of the windowing function is greater than or equal to the length of each group of time domain data sequence.
  • the data formed after the windowing of the first group of data is [d1- 1, d1-2, d1-3, d1-4, d1-5, d1-6, d1-7, d1-8, d1-9, d1-10, d1-11, d1-12, d1-13, d1-14, d1-15, d1-16]
  • the data formed after the second group of data is windowed is [d2-1, d2-2, d2-3, d2-4, d2-5, d2 -6, d2-7, d2-8, d2-9, d2-10, d2-11, d2-12, d2-13, d2-14, d2-15, d2-16]
  • group 8 The data formed after windowing the data is [d8-1, d8-2, d8-3, d8-4, d8-5, d8-6, d8-7, d8-8, d
  • each group of time domain data sequence is 16, and the interval between adjacent groups is 8. Therefore, the new time domain data sequence after offset, overlap and addition is [[d1-1, d1-2, d1-3, d1-4, d1- 5, d1-6, d1-7, d1-8, d1-9+d2-1, d1-10+d2-2, d1-11+d2-3, d1-12+d2-4, d1-13+ d2-5, d1-14+d2-6, d1-15+d2-7, d1-16+d2-8, d2-9+d3-1, d2-10+d3-2, d2-11+d3- 3, d2-12+d3-4, d2-13+d3-5, d2-14+d3-6, d2-15+d3-7, d2-16+d3-8,..., d7-9+ d8-1, d7-10+d8-2, d7-11+d8-3, d7-12+d8-4, d7-13+d8-5,
  • FIG. 5 is a schematic diagram of another optional data transmission method according to the embodiment of the present disclosure; as shown in Figure 5, in this embodiment:
  • Transmitting a set of time domain data sequences also includes: windowing or filtering this set of time domain data sequences, and then performing the digital-to-analog converter DAC and radio frequency (radio frequency) processes.
  • the above-mentioned windowing process includes: grouping the time domain data sequence, then performing periodic extension, then dot-multiplying the preset windowing function, and then performing staggered superposition between each group.
  • the above filtering includes: single-phase filtering and polyphase filtering.
  • Single-phase filtering is ordinary filtering; polyphase filtering requires multiple filters to be processed jointly.
  • FIG. 6 is a structural block diagram of an optional data transmission device according to an embodiment of the present disclosure. As shown in Figure 6, the data transmission device includes:
  • the transmission module 62 is configured to transmit the data to be transmitted in N frequency domain resource blocks, wherein the N frequency domain resource blocks respectively contain the same number of subcarriers K, K is the i power of 2, and i is Positive integer, N is an integer greater than 1;
  • the transform module 64 is configured to perform an inverse Fourier transform on the data to be transmitted on the K subcarriers of each frequency domain resource block to form N groups of data sequences, where the number of points in the inverse Fourier transform is 2K ;
  • the processing module 66 is configured to perform inverse Fourier transform on the N sets of data sequences to form a set of time domain data sequences, and transmit the set of time domain data sequences.
  • the data to be transmitted on the K subcarriers of each frequency domain resource block in the N frequency domain resource blocks are respectively subjected to an inverse Fourier transform to form N groups of data sequences, and the Fourier transform of the data to be transmitted is The number of inverse transformation points is 2K, and then the inverse Fourier transform is performed on the N sets of data sequences to form a set of time domain data sequences.
  • Each group of N data sequences formed in this way can be regarded as a time domain data sequence at the frequency domain resource block level. Its adjacent data intervals are the same, and the length of each group of time domain data sequences is also the same.
  • the number of inverse Fourier transform points of the data to be transmitted is 2K
  • the filtering operation not only the orthogonality of adjacent resource blocks can be guaranteed, but also the adjacent groups of time domain data sequences generated by each group of the inverse Fourier transform
  • the interval is exactly half the length of the time domain data sequence, so the processing complexity will be relatively low, and it will solve the problem of easy interference between subcarriers in related technologies.
  • the spectrum intervals of adjacent frequency domain resource blocks are equal.
  • the spectrum bandwidths of the N frequency domain resource blocks are equal.
  • the subcarrier intervals of the N frequency domain resource blocks are equal.
  • the transformation module 64 is further configured to add K zeros to the data to be transmitted on the K subcarriers, and then perform an oversampling inverse Fourier transform on the data to be transmitted with the K zeros added. , forming N sets of data sequences.
  • the transformation module 64 is also configured to add K/2 zeros on both sides of the K pieces of data to be transmitted.
  • the transform module 64 is also configured to perform an inverse Fourier transform on the data to be transmitted on the K subcarriers of each frequency domain resource block.
  • the zero-frequency position or the position of the zero subcarrier in the frequency domain of the inverse leaf transform is different.
  • the transformation module 64 is further configured to perform inverse Fourier transformation on the data to be transmitted on the K subcarriers of each resource block.
  • the transformed zero frequency position or zero subcarrier is respectively within the K subcarrier frequency range of each resource block.
  • the transformation module 64 is further configured to perform inverse Fourier transformation on the data to be transmitted on the K subcarriers of each resource block.
  • the transformed zero frequency position or zero subcarrier is respectively one of the K subcarriers of each resource block.
  • the inverse Fourier transform is an oversampled inverse Fourier transform, and the number of IFFT points of the inverse Fourier transform is greater than N.
  • the inverse Fourier transform is performed on every N pieces of data, and each N piece of data comes from N groups of data sequences respectively.
  • the transform module 64 is further configured to perform the inverse Fourier transform after adding data of other frequency domain resource blocks to every N pieces of data, wherein the other frequency domain resource blocks are not in the N frequency domain resource blocks.
  • N groups of data sequences are in N rows, and then N pieces of data are taken out according to columns, and the inverse Fourier transform is performed on each N piece of data taken out.
  • the processing module 66 is also configured to add multiple sets of zero data sequences, and then perform an inverse Fourier transform. That is, after adding some 0s to every N data taken out, the inverse Fourier transform is performed.
  • the set of time domain data sequences is serially linked by a plurality of time domain data sequences generated by the inverse Fourier transform.
  • the processing module 66 is also configured to add a cyclic prefix CP to each of the N groups of data sequences.
  • the processing module 66 is also configured to add a guard interval GI (Guard Interval) to the N groups of data sequences respectively, and the guard interval is empty data (that is, data 0).
  • GI Guard Interval
  • the processing module 66 filters the set of time domain data sequences, where the filtering includes at least one of the following: single-phase filtering, polyphase filtering, and windowing operations.
  • the processing module 66 is further configured such that the filtering or windowing operation includes: performing a time domain analysis on each group of the time domain data sequences generated by the inverse Fourier transform.
  • the data sequences are repeated and windowed respectively, and then shifted, overlapped and added to form a new set of time domain data sequences; where, after performing the filtering or windowing operations,
  • the interval between adjacent groups of the time domain data sequence generated by each group of the inverse Fourier transform is half the length of the time domain data sequence.
  • the data to be transmitted includes at least one of the following: constellation point modulated data, reference signal data.
  • An embodiment of the present application also provides an electronic device, including a memory and a processor.
  • a computer program is stored in the memory, and the processor is configured to run the computer program to perform the steps in any of the above method embodiments.
  • the above-mentioned processor may be configured to perform the following steps through a computer program:
  • N frequency domain resource blocks respectively contain the same number of subcarriers K, K is the i power of 2, i is a positive integer, and N is an integer greater than 1;
  • S2 Perform inverse Fourier transform on the data to be transmitted on K subcarriers of each frequency domain resource block to form N sets of data sequences, where the number of points in the inverse Fourier transform is 2K;
  • S3 Perform inverse Fourier transform on the N sets of data sequences to form a set of time domain data sequences, and transmit the set of time domain data sequences.
  • the above-mentioned processor may be configured to perform the following steps through a computer program:
  • N frequency domain resource blocks respectively contain the same number of subcarriers K, K is the i power of 2, i is a positive integer, and N is an integer greater than 1;
  • S2 Perform inverse Fourier transform on the data to be transmitted on K subcarriers of each frequency domain resource block to form N sets of data sequences, where the number of points in the inverse Fourier transform is 2K;
  • S3 Perform inverse Fourier transform on the N sets of data sequences to form a set of time domain data sequences, and transmit the set of time domain data sequences.
  • the above-mentioned electronic device may further include a transmission device and an input-output device, wherein the transmission device is connected to the above-mentioned processor, and the input-output device is connected to the above-mentioned processor.
  • modules or steps of the present application can be implemented using general-purpose computing devices, and they can be concentrated on a single computing device, or distributed across a network composed of multiple computing devices. They may be implemented in program code executable by a computing device, such that they may be stored in a storage device for execution by the computing device, and in some cases may be executed in a sequence different from that shown herein. Or the described steps can be implemented by making them into individual integrated circuit modules respectively, or by making multiple modules or steps among them into a single integrated circuit module. As such, the application is not limited to any specific combination of hardware and software.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Discrete Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请提供了一种数据传输方法、装置、存储介质及电子装置，上述方法包括：将待传输数据在N个频域资源块中传输，其中，N个频域资源块分别包含相同的子载波数K，K为2的i次幂，i为正整数，N为大于1的整数；分别对每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换，形成N组数据序列，其中，傅里叶逆变换的点数为2K；对N组数据序列进行傅里叶逆变换，形成一组时域数据序列，并传输一组时域数据序列。通过本申请，解决了相关技术中，子载波之间容易发生干扰等问题。

Description

数据传输方法、装置、存储介质及电子装置
本公开要求于2022年05月05日提交中国专利局、申请号为202210480845.X、发明名称“数据传输方法、装置、存储介质及电子装置”的中国专利申请的优先权，其全部内容通过引用结合在本公开中。
技术领域
本公开涉及通信领域，具体而言，涉及一种数据传输方法、装置、存储介质及电子装置。
背景技术
长期演进技术LTE(Long Term Evolution)是4G(Fourth Generation)的无线蜂窝通信技术。LTE采用正交频分复用OFDM(Orthogonal Frequency Division Multiplexing)技术，子载波和OFDM符号构成的时频资源组成LTE系统的无线物理时频资源。目前，OFDM技术在无线通信中已经应用比较广了，尤其是带循环前缀的正交频分复用系统CP-OFDM。由于采用了循环前缀CP(Cyclic Prefix)，CP-OFDM系统能很好地解决多径时延问题，并且将频率选择性信道分成了一套平行的平坦信道，这很好地简化了信道估计方法，并且有较高的信道估计精度。然而，CP-OFDM系统性能对相邻子带间的频偏和时偏比较敏感，这主要是由于该系统的频谱泄漏比较大，因此容易导致子带间干扰。目前LTE系统在频域上使用了保护间隔，但这样降低了频谱效率，因此需要采用一些新技术来抑制带外泄漏。
5G NR(Fifth Generation New Radio)通信技术仍然采用CP-OFDM为基础波形，而且两个相邻子带间可以采用不同的子载波间隔类型，这将破坏子载波之间的正交性，带来新的干扰问题。针对如何解决该干扰问题，其中一个比较直接的方法就是在具有不同参数的两个传输带之间插入一个保护带宽，但这样会浪费频率资源。
未来6G业务使用的频段跨度很大，部署方式也多种多样。不仅需要多带宽信道，而且也需要满足不同场景的波形方案。
针对相关技术中，子载波之间容易发生干扰等问题，尚未提出有效的解决方案。
发明内容
本公开实施例提供了一种数据传输方法、装置、存储介质及电子装置，以至少解决相关技术中，子载波之间容易发生干扰等问题。
根据本公开的一个实施例，提供了一种数据传输方法，包括：将待传输数据在N个频域资源块中传输，其中，所述N个频域资源块分别包含相同的子载波数K，K为2的i次幂，i为正整数，N为大于1的整数；分别对每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换，形成N组数据序列，其中，所述傅里叶逆变换的点数为2K；对所述N组数据序列进行傅里叶逆变换，形成一组时域数据序列，并传输所述一组时域数据序列。
根据本公开的另一个实施例，提供了一种数据传输装置，包括：传输模块，被设置为将待传输数据在N个频域资源块中传输，其中，所述N个频域资源块分别包含相同的子载波数 K，K为2的i次幂，i为正整数，N为大于1的整数；变换模块，被设置为分别对每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换，形成N组数据序列，其中，所述傅里叶逆变换的点数为2K；处理模块，被设置为对所述N组数据序列进行傅里叶逆变换，形成一组时域数据序列，并传输所述一组时域数据序列。
通过本公开，分别对N个频域资源块中的每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换，形成N组数据序列，并且待传输数据的傅里叶逆变换点数都为2K，接着对N组数据序列进行傅里叶逆变换，形成一组时域数据序列。通过这种方式形成的N组数据序列中的每组数据序列可以看作是频域资源块级的时域数据序列，其相邻数据间隔都相同，而且每组时域数据序列长度也相同。由于待传输数据的傅里叶逆变换点数都为2K，因此滤波操作后，不仅可以保证相邻资源块正交，而且每组所述傅里叶逆变换生成的时域数据序列的相邻组间隔刚好为时域数据序列长度的一半，这样处理复杂度会比较低，并解决了相关技术中，子载波之间容易发生干扰等问题。
附图说明
此处所说明的附图用来提供对本公开的进一步理解，构成本申请的一部分，本公开的示意性实施例及其说明用于解释本公开，并不构成对本公开的不当限定。在附图中：
图1是根据本公开实施例一种可选的数据传输方法的计算机终端的硬件结构框图；
图2是根据本公开实施例一种可选的的数据传输方法的流程图；
图3是本公开实施例的一种可选的数据传输方法的示意图；
图4是本公开实施例的另一种可选的数据传输方法的示意图；
图5是本公开实施例的又一种可选的数据传输方法的示意图；
图6是根据本公开实施例一种可选的数据传输设备的结构框图。
具体实施方式
下文中将参考附图并结合实施例来详细说明本公开。需要说明的是，在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。
需要说明的是，本公开的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
本申请实施例所提供的方法实施例可以在计算机终端或者类似的运算装置中执行。以运行在计算机终端上为例，图1是本公开实施例的一种数据传输方法的计算机终端的硬件结构框图。如图1所示，计算机终端10可以包括一个或多个(图中仅示出一个)处理器102(处理器102可以包括但不限于微处理器MCU或可编程逻辑器件FPGA等的处理装置)、被设置为存储数据的存储器104、以及被设置为通信功能的传输设备106。本领域普通技术人员可以理解，图1所示的结构仅为示意，其并不对上述电子装置的结构造成限定。例如，计算机终端10还可包括比图1中所示更多或者更少的组件，或者具有与图1所示不同的配置。
存储器104可被设置为存储应用软件的软件程序以及模块，如本公开实施例中的数据传输方法对应的程序指令/模块，处理器102通过运行存储在存储器104内的软件程序以及模块， 从而执行各种功能应用以及数据处理，即实现上述的方法。存储器104可包括高速随机存储器，还可包括非易失性存储器，如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实例中，存储器104可进一步包括相对于处理器102远程设置的存储器，这些远程存储器可以通过网络连接至计算机终端10。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
传输设备106被设置为经由一个网络接收或者发送数据。上述的网络具体实例可包括计算机终端10的通信供应商提供的无线网络。在一个实例中，传输设备106包括一个网络适配器(Network Interface Controller，NIC)，其可通过基站与其他网络设备相连从而可与互联网进行通讯。在一个实例中，传输设备106可以为射频(Radio Frequency，RF)模块，其被设置为通过无线方式与互联网进行通讯。
在本实施例中提供了一种运行于上述计算机终端的数据传输方法，图2是根据本公开实施例一种可选的的数据传输方法的流程图，如图2所示，该流程包括如下步骤：
步骤S202，将待传输数据在N个频域资源块中传输，其中，所述N个频域资源块分别包含相同的子载波数K，K为2的i次幂，i为正整数，N为大于1的整数；
步骤S204，分别对每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换，形成N组数据序列，其中，所述傅里叶逆变换的点数为2K；
步骤S206，对所述N组数据序列进行傅里叶逆变换，形成一组时域数据序列，并传输所述一组时域数据序列。
通过上述步骤，分别对N个频域资源块中的每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换，形成N组数据序列，并且待传输数据的傅里叶逆变换点数都为2K，接着对N组数据序列进行傅里叶逆变换，形成一组时域数据序列。通过这种方式形成的N组数据序列中的每组数据序列可以看作是频域资源块级的时域数据序列，其相邻数据间隔都相同，而且每组时域数据序列长度也相同。由于待传输数据的傅里叶逆变换点数都为2K，因此滤波操作后，不仅可以保证相邻资源块正交，而且每组所述傅里叶逆变换生成的时域数据序列的相邻组间隔刚好为时域数据序列长度的一半，从而解决了相关技术中，子载波之间容易发生干扰等问题。
在一个示例性实施例中，所述N个频域资源块中，相邻频域资源块的频谱间隔相等。
在一个示例性实施例中，所述N个频域资源块的频谱带宽相等。
在一个示例性实施例中，所述N个频域资源块子载波间隔相等。
在一个示例性实施例中，对所述K个子载波上的待传输数据添加K个零，然后对添加K个零的待传输数据进行过采样傅里叶逆变换，形成N组数据序列。
可选的，在本实施例，所述添加K个零，具体为在K个待传输数据的两边分别添加K/2个零。
在一个示例性实施例中，在分别对每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换的过程中，每个所述傅里叶逆变换的零频位置或零子载波在频域的位置不同。
在一个示例性实施例中，在分别对每个资源块的K个子载波上的待传输数据进行傅里叶 逆变换的过程中，每个所述傅里叶逆变换的零频位置或零子载波分别在每个资源块的K个子载波频率范围内。
在一个示例性实施例中，在分别对每个资源块的K个子载波上的待传输数据进行傅里叶逆变换的过程中，每个所述傅里叶逆变换的零频位置或零子载波分别在每个资源块的K个子载波中的一个。
在一个示例性实施例中，所述傅里叶逆变换为过采样傅里叶逆变换，且所述傅里叶逆变换的IFFT点数大于N。
需要说明的是，上述IFFT(inverse fast Fourier trans form)点数即快速傅里叶逆变换的点数。需要说明的是，IFFT点数即为IFFT size。傅里叶逆变换的点数可以理解为是变换前频域数据的个数，或者，傅里叶逆变换的点数可以理解为是IFFT size。
在一个示例性实施例中，所述傅里叶逆变换包括：每N个数据进行一个所述傅里叶逆变换，所述每N个数据分别来自于N组数据序列。
为了帮助理解上述实施例，举个例子，N组数据序列分别在N行，然后按照列取出N个数据，对取出的每N个数据进行一个所述傅里叶逆变换。
可选的，在本实施例，对上述N组数据序列的处理，包括：增加多组零数据序列，然后进行傅里叶逆变换。即对取出的每N个数据添加一些0之后，再进行傅里叶逆变换。
可选的，在本实施例，对上述N组数据序列的处理，包括：对每N个数据添加其他频域资源块的数据之后，进行所述傅里叶逆变换。所述其他资源块不在所述N个资源块中。
可选的，在本实施例，对上述N组数据序列的处理，包括：对每N个数据添加其他频域资源块的数据和零之后，进行所述傅里叶逆变换。所述其他频域资源块不在所述N个频域资源块中。
在一个示例性实施例中，所述一组时域数据序列是由多个所述傅里叶逆变换生成的时域数据序列串行链接而成。
可选的，在本实施例中，对所述N组数据序列进行傅里叶逆变换之前，还包括，对N组数据序列分别添加循环前缀CP。
可选的，在本实施例中，对N组数据序列分别添加保护间隔GI(Guard Interval)，所述保护间隔为空数据(即为数据0)。
在一个示例性实施例中，传输所述一组时域数据序列之前，对所述一组时域数据序列进行滤波，其中，所述滤波包括以下至少之一：单相滤波、多相滤波、加窗操作。
在一个示例性实施例中，所述滤波或加窗的操作包括：对所述一组时域数据序列中的每组所述傅里叶逆变换生成的时域数据序列分别进行重复和加窗操作，然后错位重叠相加形成一组新的时域数据序列；其中，在执行完所述滤波或加窗的操作后，每组所述傅里叶逆变换生成的时域数据序列的相邻组间隔为时域数据序列长度的一半。
在一个示例性实施例中，所述待传输数据包括以下至少之一：星座点调制的数据，参考信号数据。
在一个示例性实施例中，K＝2或K＝4或K＝16或K＝32。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本公开的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本公开各个实施例所述的方法。
图3是本公开实施例的一种可选的数据传输方法的示意图；如图3所示，在本实施例中：
待传输数据在N个频域资源块中传输，这N个资源块分别包含K个子载波，在本实施例中，K＝4，即这N个资源块分别包含4个子载波。
分别对每个资源块的4个子载波上的待传输数据进行点数为8的傅里叶逆变换，形成N组数据序列。这N组数据序列可以看作是频域资源块级的N组时域数据序列，其中，每个点数为8的傅里叶逆变换的零子载波分别为每个资源块的4个子载波中的一个。然后对这N组时域数据序列进行傅里叶逆变换，形成一组时域数据序列，最后再传输这一组时域数据序列。
图4是本公开实施例的另一种可选的数据传输方法的示意图；如图4所示，在本实施例中：
待传输数据在N个频域资源块中传输，N个资源块分别包含K个子载波，在本实施例中，K＝4，N＝3，即本实施例中频域资源块的数量为4，子载波的数量为3。
假设每个资源块的4个子载波上的待传输数据分别为：[A1，A2，A3，A4]，[B1，B2，B3，B4]，[C1，C2，C3，C4]，在这3组待传输数据中分别添加4个零，添加0后的3组数据分别为：[0，0，A1，A2，A3，A4，0，0]，[0，0，B1，B2，B3，B4，0，0]，[0，0，C1，C2，C3，C4，0，0]。分别对每个资源块的待传输数据进行点数为8的过采样傅里叶逆变换，形成3组时域数据序列分别为[a1，a2，a3，a4，a5，a6，a7，a8]，[b1，b2，b3，b4，b5，b6，b7，b8]，[c1，c2，c3，c4，c5，c6，c7，c8]。然后对所述3组时域数据序列进行多个过采样傅里叶逆变换。假设傅里叶逆变换的点数为16，则对[a1，b1，c1]进行16点的快速傅里叶逆变换IFFT(inverse fast Fourier trans form)后形成的第1组数据为[D1-1，D1-2，D1-3，D1-4，D1-5，D1-6，D1-7，D1-8，D1-9，D1-10，D1-11，D1-12，D1-13，D1-14，D1-15，D1-16]，对[a2，b2，c2]进行16点的IFFT后形成的第2组数据为[D2-1，D2-2，D2-3，D2-4，D2-5，D2-6，D2-7，D2-8，D2-9，D2-10，D2-11，D2-12，D2-13，D2-14，D2-15，D2-16]，依次类推，对[a8，b8，c8]进行16点的IFFT后形成的第8组数据为[D8-1，D8-2，D8-3，D8-4，D8-5，D8-6，D8-7，D8-8，D8-9，D8-10，D8-11，D8-12，D8-13，D8-14，D8-15，D8-16]，将这8组数据序列串行链接后形成一组时域数据序列，再传输这一组时域数据序列。
传输这一组时域数据序列，还包括滤波操作。本实施例中，这一滤波操作包括：对所述一组时域数据序列中的8个傅里叶逆变换生成的8组时域数据序列分别进行加窗操作，然后进行错位重叠相加形成一组新的时域数据序列。加窗函数的时域长度大于等于每组时域数据序列长度，在本实施例中，假设加窗函数的时域长度也等于16，则第1组数据加窗后形成的数据为[d1-1，d1-2，d1-3，d1-4，d1-5，d1-6，d1-7，d1-8，d1-9，d1-10，d1-11，d1-12， d1-13，d1-14，d1-15，d1-16]，第2组数据加窗后形成的数据为[d2-1，d2-2，d2-3，d2-4，d2-5，d2-6，d2-7，d2-8，d2-9，d2-10，d2-11，d2-12，d2-13，d2-14，d2-15，d2-16]，依次类推，第8组数据加窗后形成的数据为[d8-1，d8-2，d8-3，d8-4，d8-5，d8-6，d8-7，d8-8，d8-9，d8-10，d8-11，d8-12，d8-13，d8-14，d8-15，d8-16]。每组时域数据序列长度为16，相邻组间隔为8，因此错位重叠相加后的新时域数据序列为[[d1-1，d1-2，d1-3，d1-4，d1-5，d1-6，d1-7，d1-8，d1-9+d2-1，d1-10+d2-2，d1-11+d2-3，d1-12+d2-4，d1-13+d2-5，d1-14+d2-6，d1-15+d2-7，d1-16+d2-8，d2-9+d3-1，d2-10+d3-2，d2-11+d3-3，d2-12+d3-4，d2-13+d3-5，d2-14+d3-6，d2-15+d3-7，d2-16+d3-8，...，d7-9+d8-1，d7-10+d8-2，d7-11+d8-3，d7-12+d8-4，d7-13+d8-5，d7-14+d8-6，d7-15+d8-7，d7-16+d8-8，d8-9，d8-10，d8-11，d8-12，d8-13，d8-14，d8-15，d8-16]。通过上述数据可以看出滤波操作后，每组所述傅里叶逆变换生成的时域数据序列的相邻组间隔为时域数据序列长度的一半。
图5是本公开实施例的又一种可选的数据传输方法的示意图；如图5所示，在本实施例中：
传输一组时域数据序列，还包括：对这一组时域数据序列进行加窗或滤波之后，再进行数模转换器DAC、射频RF(radio frequency)过程。
上述加窗处理包括：对时域数据序列进行分组，然后进行周期延拓，然后点乘预设加窗函数，然后各个组之间进行错位叠加。
上述滤波包括：单相滤波和多相滤波。单相滤波就是普通的滤波；多相滤波需要多个滤波联合进行处理。
图6是根据本公开实施例一种可选的数据传输设备的结构框图。如图6所示，数据传输装置包括：
传输模块62，被设置为将待传输数据在N个频域资源块中传输，其中，所述N个频域资源块分别包含相同的子载波数K，K为2的i次幂，i为正整数，N为大于1的整数；
变换模块64，被设置为分别对每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换，形成N组数据序列，其中，所述傅里叶逆变换的点数为2K；
处理模块66，被设置为对所述N组数据序列进行傅里叶逆变换，形成一组时域数据序列，并传输所述一组时域数据序列。
通过上述装置，分别对N个频域资源块中的每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换，形成N组数据序列，并且待传输数据的傅里叶逆变换点数都为2K，接着对N组数据序列进行傅里叶逆变换，形成一组时域数据序列。通过这种方式形成的N组数据序列中的每组数据序列可以看作是频域资源块级的时域数据序列，其相邻数据间隔都相同，而且每组时域数据序列长度也相同。由于待传输数据的傅里叶逆变换点数都为2K，因此滤波操作后，不仅可以保证相邻资源块正交，而且每组所述傅里叶逆变换生成的时域数据序列的相邻组间隔刚好为时域数据序列长度的一半，这样处理复杂度会比较低，并解决了相关技术中，子载波之间容易发生干扰等问题。
在一个示例性实施例中，所述N个频域资源块中，相邻频域资源块的频谱间隔相等。
在一个示例性实施例中，所述N个频域资源块的频谱带宽相等。
在一个示例性实施例中，所述N个频域资源块子载波间隔相等。
在一个示例性实施例中，变换模块64，还被设置为对所述K个子载波上的待传输数据添加K个零，然后对添加K个零的待传输数据进行过采样傅里叶逆变换，形成N组数据序列。
可选的，在本实施例，变换模块64，还被设置为在K个待传输数据的两边分别添加K/2个零。
在一个示例性实施例中，变换模块64，还被设置为在分别对每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换的过程中，每个所述傅里叶逆变换的零频位置或零子载波在频域的位置不同。
在一个示例性实施例中，变换模块64，还被设置为在分别对每个资源块的K个子载波上的待传输数据进行傅里叶逆变换的过程中，每个所述傅里叶逆变换的零频位置或零子载波分别在每个资源块的K个子载波频率范围内。
在一个示例性实施例中，变换模块64，还被设置为在分别对每个资源块的K个子载波上的待传输数据进行傅里叶逆变换的过程中，每个所述傅里叶逆变换的零频位置或零子载波分别在每个资源块的K个子载波中的一个。
在一个示例性实施例中，所述傅里叶逆变换为过采样傅里叶逆变换，且所述傅里叶逆变换的IFFT点数大于N。
在一个示例性实施例中，每N个数据进行一个所述傅里叶逆变换，所述每N个数据分别来自于N组数据序列。
在一个示例性实施例中，变换模块64，还被设置为对每N个数据添加其他频域资源块的数据之后，进行所述傅里叶逆变换，其中，所述其他频域资源块不在所述N个频域资源块中。
为了帮助理解上述实施例，举个例子，N组数据序列分别在N行，然后按照列取出N个数据，对取出的每N个数据进行一个所述傅里叶逆变换。
可选的，在本实施例，处理模块66，还被设置为增加多组零数据序列，然后进行傅里叶逆变换。即对取出的每N个数据添加一些0之后，再进行傅里叶逆变换。
在一个示例性实施例中，所述一组时域数据序列是由多个所述傅里叶逆变换生成的时域数据序列串行链接而成。
可选的，在本实施例中，处理模块66，还被设置为对N组数据序列分别添加循环前缀CP。
可选的，在本实施例中，处理模块66，还被设置为对N组数据序列分别添加保护间隔GI(Guard Interval)，所述保护间隔为空数据(即为数据0)。
在一个示例性实施例中，处理模块66，对所述一组时域数据序列进行滤波，其中，所述滤波包括以下至少之一：单相滤波、多相滤波、加窗操作。
在一个示例性实施例中，处理模块66，还被设置为所述滤波或加窗的操作包括：对所述一组时域数据序列中的每组所述傅里叶逆变换生成的时域数据序列分别进行重复和加窗操作，然后错位重叠相加形成一组新的时域数据序列；其中，在执行完所述滤波或加窗的操作后， 每组所述傅里叶逆变换生成的时域数据序列的相邻组间隔为时域数据序列长度的一半。
在一个示例性实施例中，所述待传输数据包括以下至少之一：星座点调制的数据，参考信号数据。
在一个示例性实施例中，K＝2或K＝4或K＝16或K-32。
本申请的实施例还提供了一种电子装置，包括存储器和处理器，该存储器中存储有计算机程序，该处理器被设置为运行计算机程序以执行上述任一项方法实施例中的步骤。
可选地，在本实施例中，上述处理器可以被设置为通过计算机程序执行以下步骤：
S1，将待传输数据在N个频域资源块中传输，其中，所述N个频域资源块分别包含相同的子载波数K，K为2的i次幂，i为正整数，N为大于1的整数；
S2，分别对每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换，形成N组数据序列，其中，所述傅里叶逆变换的点数为2K；
S3，对所述N组数据序列进行傅里叶逆变换，形成一组时域数据序列，并传输所述一组时域数据序列。
可选地，在另一实施例中，上述处理器可以被设置为通过计算机程序执行以下步骤：
S1，将待传输数据在N个频域资源块中传输，其中，所述N个频域资源块分别包含相同的子载波数K，K为2的i次幂，i为正整数，N为大于1的整数；
S2，分别对每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换，形成N组数据序列，其中，所述傅里叶逆变换的点数为2K；
S3，对所述N组数据序列进行傅里叶逆变换，形成一组时域数据序列，并传输所述一组时域数据序列。
在一个示例性实施例中，上述电子装置还可以包括传输设备以及输入输出设备，其中，该传输设备和上述处理器连接，该输入输出设备和上述处理器连接。
本实施例中的具体示例可以参考上述实施例及示例性实施方式中所描述的示例，本实施例在此不再赘述。
显然，本领域的技术人员应该明白，上述的本申请的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本申请不限制于任何特定的硬件和软件结合。
以上所述仅为本申请的优选实施例而已，并不用于限制本申请，对于本领域的技术人员来说，本申请可以有各种更改和变化。凡在本申请的原则之内，所作的任何修改、等同替换、改进等，均应包含在本申请的保护范围之内。

Claims (19)

  1. 一种数据传输方法，包括：
    将待传输数据在N个频域资源块中传输，其中，所述N个频域资源块分别包含相同的子载波数K，K为2的i次幂，i为正整数，N为大于1的整数；
    分别对每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换，形成N组数据序列，其中，所述傅里叶逆变换的点数为2K；
    对所述N组数据序列进行傅里叶逆变换，形成一组时域数据序列，并传输所述一组时域数据序列。
  2. 根据权利要求1所述的方法，其中，所述方法还包括：
    所述N个频域资源块中，相邻频域资源块的频谱间隔相等。
  3. 根据权利要求1所述的方法，其中，所述方法还包括：
    所述N个频域资源块的频谱带宽相等。
  4. 根据权利要求1所述的方法，其中，所述方法还包括：
    所述N个频域资源块子载波间隔相等。
  5. 根据权利要求1所述的方法，其中，分别对每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换，形成N组数据序列，包括：
    对所述K个子载波上的待传输数据添加K个零，然后对添加K个零的待传输数据进行过采样傅里叶逆变换，形成N组数据序列。
  6. 根据权利要求1所述的方法，其中，所述方法还包括：在分别对每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换的过程中，每个所述傅里叶逆变换的零频位置或零子载波在频域的位置不同。
  7. 根据权利要求1所述的方法，其中，所述方法还包括：在分别对每个资源块的K个子载波上的待传输数据进行傅里叶逆变换的过程中，每个所述傅里叶逆变换的零频位置或零子载波分别在每个资源块的K个子载波频率范围内。
  8. 根据权利要求1所述的方法，其中，所述方法还包括：在分别对每个资源块的K个子载波上的待传输数据进行傅里叶逆变换的过程中，每个所述傅里叶逆变换的零频位置或零子载波分别在每个资源块的K个子载波中的一个。
  9. 根据权利要求1所述的方法，其中，对所述N组数据序列进行傅里叶逆变换，所述方法还包括：所述傅里叶逆变换为过采样傅里叶逆变换，且所述傅里叶逆变换的IFFT点数大于N。
  10. 根据权利要求1所述的方法，其中，所述方法还包括：每N个数据进行一个所述傅里叶逆变换，所述每N个数据分别来自于N组数据序列。
  11. 根据权利要求10所述的方法，其中，所述方法还包括：
    对每N个数据添加其他频域资源块的数据之后，进行所述傅里叶逆变换，其中，所述其他频域资源块不在所述N个频域资源块中。
  12. 根据权利要求1所述的方法，其中，所述方法还包括：所述一组时域数据序列是由多个所述傅里叶逆变换生成的时域数据序列串行链接而成。
  13. 根据权利要求1所述的方法，其中，传输所述一组时域数据序列之前，所述方法还包括：
    对所述一组时域数据序列进行滤波，其中，所述滤波包括以下至少之一：单相滤波、多相滤波、加窗操作。
  14. 根据权利要求13所述的方法，其中，所述方法还包括：所述滤波或加窗的操作包括：对所述一组时域数据序列中的每组所述傅里叶逆变换生成的时域数据序列分别进行重复和加窗操作，然后错位重叠相加形成一组新的时域数据序列；其中，
    在执行完所述滤波或加窗的操作后，每组所述傅里叶逆变换生成的时域数据序列的相邻组间隔为时域数据序列长度的一半。
  15. 根据权利要求1所述的方法，其中，所述方法还包括：所述待传输数据包括以下至少之一：星座点调制的数据，参考信号数据。
  16. 根据权利要求1所述的方法，其中，所述方法还包括：K＝2或K＝4或K＝16或K＝32。
  17. 一种数据传输装置，包括：
    传输模块，被设置为将待传输数据在N个频域资源块中传输，其中，所述N个频域资源块分别包含相同的子载波数K，K为2的i次幂，i为正整数，N为大于1的整数；
    变换模块，被设置为分别对每个频域资源块的K个子载波上的待传输数据进行傅里叶逆变换，形成N组数据序列，其中，所述傅里叶逆变换的点数为2K；
    处理模块，被设置为对所述N组数据序列进行傅里叶逆变换，形成一组时域数据序列，并传输所述一组时域数据序列。
  18. 一种计算机可读的存储介质，所述存储介质中存储有计算机程序，其中，所述计算机程序被设置为运行时执行所述权利要求1至16任一项中所述的方法。
  19. 一种电子装置，包括存储器和处理器，所述存储器中存储有计算机程序，所述处理器被设置为运行所述计算机程序以执行所述权利要求1至16任一项中所述的方法。
PCT/CN2023/091315 2022-05-05 2023-04-27 数据传输方法、装置、存储介质及电子装置 WO2023213228A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210480845.XA CN117082622A (zh) 2022-05-05 2022-05-05 数据传输方法、装置、存储介质及电子装置
CN202210480845.X 2022-05-05

Publications (1)

Publication Number Publication Date
WO2023213228A1 true WO2023213228A1 (zh) 2023-11-09

Family

ID=88646266

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/091315 WO2023213228A1 (zh) 2022-05-05 2023-04-27 数据传输方法、装置、存储介质及电子装置

Country Status (2)

Country Link
CN (1) CN117082622A (zh)
WO (1) WO2023213228A1 (zh)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107733566A (zh) * 2016-08-12 2018-02-23 法国矿业电信学校联盟/法国国立高等电信布列塔尼学院 数字编码器及编码方法
CN110212927A (zh) * 2018-02-28 2019-09-06 上海中研久弋科技有限公司 信号发射方法、信号发射机、存储介质
CN110582118A (zh) * 2018-06-11 2019-12-17 上海朗帛通信技术有限公司 一种被用于无线通信的用户设备、基站中的方法和装置
CN111901279A (zh) * 2020-07-07 2020-11-06 中兴通讯股份有限公司 数据传输方法、装置、设备和存储介质
KR20210065849A (ko) * 2019-11-27 2021-06-04 한국전자통신연구원 다중 컴포넌트 캐리어를 지원하는 이동 통신 시스템에서 기저대역 송신 신호를 생성하는 방법 및 장치
CN114124325A (zh) * 2020-08-31 2022-03-01 华为技术有限公司 信号生成方法及装置
CN115622854A (zh) * 2021-07-12 2023-01-17 中兴通讯股份有限公司 数据传输、数据调制方法、装置、电子设备和存储介质

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107733566A (zh) * 2016-08-12 2018-02-23 法国矿业电信学校联盟/法国国立高等电信布列塔尼学院 数字编码器及编码方法
CN110212927A (zh) * 2018-02-28 2019-09-06 上海中研久弋科技有限公司 信号发射方法、信号发射机、存储介质
CN110582118A (zh) * 2018-06-11 2019-12-17 上海朗帛通信技术有限公司 一种被用于无线通信的用户设备、基站中的方法和装置
KR20210065849A (ko) * 2019-11-27 2021-06-04 한국전자통신연구원 다중 컴포넌트 캐리어를 지원하는 이동 통신 시스템에서 기저대역 송신 신호를 생성하는 방법 및 장치
CN111901279A (zh) * 2020-07-07 2020-11-06 中兴通讯股份有限公司 数据传输方法、装置、设备和存储介质
CN114124325A (zh) * 2020-08-31 2022-03-01 华为技术有限公司 信号生成方法及装置
CN115622854A (zh) * 2021-07-12 2023-01-17 中兴通讯股份有限公司 数据传输、数据调制方法、装置、电子设备和存储介质

Also Published As

Publication number Publication date
CN117082622A (zh) 2023-11-17

Similar Documents

Publication Publication Date Title
US11290312B2 (en) Transmission apparatus that transmits a block signal
US20090046571A1 (en) Method and apparatus for transmitter timing adjustment
Matthé et al. A reduced complexity time-domain transmitter for UF-OFDM
US10756878B2 (en) Communication method and communications apparatus
US10778476B2 (en) Discontinuous fast-convolution based filter processing
CN111464274A (zh) 一种通信方法及装置
US10491445B2 (en) Data modulation for use in multi-carrier system, demodulation method, frame generation method, and node
WO2018014815A1 (zh) 多载波系统及多载波系统的数据调制、解调方法及装置
US11757584B2 (en) Transmissions using discrete spectra
WO2023213228A1 (zh) 数据传输方法、装置、存储介质及电子装置
CN112422469A (zh) 一种数据处理方法和装置
WO2023213230A1 (zh) 传输数据序列的方法、装置、存储介质及电子装置
EP4373042A1 (en) Data transmission method and apparatus, data modulation method and apparatus, electronic device, and storage medium
WO2023213227A1 (zh) 数据的传输方法、装置、存储介质及电子装置
WO2023213217A1 (zh) 数据序列的形成方法、装置、存储介质及电子装置
CN111294188B (zh) 参考信号信息的确定方法及装置、存储介质、终端
US10917282B2 (en) Data modulation method and device utilized in multi-carrier system
JP7005536B2 (ja) データ伝送方法、ネットワーク装置及び端末装置
WO2023051592A1 (zh) 数据传输方法、数据调制方法、电子设备和存储介质
CN106961407B (zh) 一种数据调制、解调方法和数据调制、解调装置
CN107438037B (zh) 一种数据传输方法和相关装置
CN118118302A (zh) 数据传输方法、设备和存储介质
KR20220069847A (ko) 다중 컴포넌트 캐리어를 지원하는 직교 주파수 분할 다중 접속 시스템에서 기저대역 송신 신호를 생성하는 방법 및 장치

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23799214

Country of ref document: EP

Kind code of ref document: A1