WO2024087649A1 - 数据传输方法、数据处理方法、通信设备、介质及产品 - Google Patents

数据传输方法、数据处理方法、通信设备、介质及产品 Download PDF

Info

Publication number
WO2024087649A1
WO2024087649A1 PCT/CN2023/099710 CN2023099710W WO2024087649A1 WO 2024087649 A1 WO2024087649 A1 WO 2024087649A1 CN 2023099710 W CN2023099710 W CN 2023099710W WO 2024087649 A1 WO2024087649 A1 WO 2024087649A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
groups
group
sequences
reference sequence
Prior art date
Application number
PCT/CN2023/099710
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 WO2024087649A1 publication Critical patent/WO2024087649A1/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
    • 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/12—Wireless traffic scheduling

Definitions

  • the embodiments of the present application relate to the field of communication technology, and in particular to a data transmission method, a data processing method, a communication device, a medium and a product.
  • Orthogonal Frequency Division Multiplexing (OFDM) technology is widely used in wireless communications.
  • OFDM technology can reduce the mutual interference (ISI) between sub-channels.
  • Cyclic Prefix-Orthogonal Frequency Division Multiplexing (CP-OFMD) technology is a type of OFDM technology.
  • CP-OFDM can solve the multipath delay problem well, but the CP-OFDM system is prone to inter-subband interference due to large spectrum leakage. As people's requirements for transmission rate become higher and higher, the bandwidth becomes larger and larger, and the inter-subband interference is serious.
  • the problem of inter-band interference is improved by using the guard interval technology in the frequency domain.
  • the above technology reduces the spectrum efficiency. How to reduce the waste of spectrum resources is an issue that needs to be discussed and solved urgently.
  • the embodiments of the present application provide a data transmission method, a data processing method, a communication device, a medium and a product, aiming to reduce the waste of spectrum resources.
  • an embodiment of the present application provides a data transmission method, the method comprising: dividing the data to be transmitted into N groups, where N is an integer greater than or equal to 2; adding a first reference sequence to the header of each group of data, and adding a second reference sequence to the tail of each group of data, to obtain N groups of first data sequences; performing inverse Fourier transform on the N groups of first data sequences, respectively, to obtain N groups of second data sequences; performing inverse Fourier transform on the N groups of second data sequences, to obtain a group of data sequences, and transmitting the group of data sequences on time-frequency resources.
  • an embodiment of the present application provides a data processing method, the method comprising: dividing the data to be transmitted into N groups, where N is an integer greater than or equal to 2; adding a first reference sequence to the header of each group of data, and adding a second reference sequence to the end of each group of data, to obtain N groups of first data sequences; performing inverse Fourier transform on the N groups of first data sequences, respectively, to obtain N groups of second data sequences; performing inverse Fourier transform on the N groups of second data sequences, to obtain a group of data sequences.
  • an embodiment of the present application provides a communication device, comprising: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the computer program, the data transmission method as described in the first aspect or the data processing method as described in the second aspect is implemented.
  • an embodiment of the present application provides a computer-readable storage medium, wherein the computer-readable storage medium stores computer-executable instructions, and the computer-executable instructions are used to execute the data transmission method as described in the first aspect, or the data processing method as described in the second aspect.
  • an embodiment of the present application provides a machine program product, comprising a computer program or computer instructions, wherein the computer program or the computer instructions are stored in a computer-readable storage medium, a processor of a computer device reads the computer program or the computer instructions from the computer-readable storage medium, and the processor executes the computer program or the computer instructions, so that the computer device performs the data transmission method as described in the first aspect, or the data processing method as described in the second aspect.
  • FIG1 is a schematic diagram of a communication system provided in accordance with an embodiment of the present application.
  • FIG. 2 is a flow chart of a data transmission method provided by an embodiment of the present application.
  • FIG. 3 is a schematic diagram of a data transmission process provided by an embodiment of the present application.
  • FIG4 is a schematic diagram of a constellation point modulation data transmission process provided by an embodiment of the present application.
  • FIG5 is a schematic diagram of a data transmission process of a second inverse Fourier transform provided in an embodiment of the present application.
  • FIG6 is a flowchart of a data transmission method provided by another embodiment of the present application.
  • FIG. 7 is a schematic diagram of a data transmission process provided by another embodiment of the present application.
  • FIG8 is a flowchart of a data transmission method provided by another embodiment of the present application.
  • FIG. 9 is a schematic diagram of a data transmission process provided by another embodiment of the present application.
  • FIG. 10 is a flow chart of a data processing method provided in an embodiment of the present application.
  • FIG. 11 is a schematic diagram of the structure of a communication device provided in an embodiment of the present application.
  • the words “further”, “exemplarily” or “optionally” are used to indicate examples, illustrations or descriptions, and should not be interpreted as being more preferred or more advantageous than other embodiments or designs.
  • the use of the words “further”, “exemplarily” or “optionally” is intended to present related concepts in a specific way.
  • LTE Long Term Evolution
  • 4G Full-G
  • OFDM Orthogonal Frequency Division Multiplexing
  • the time-frequency resources composed of subcarriers and OFDM symbols constitute the wireless physical time-frequency resources of the LTE system.
  • OFDM technology is widely used in wireless communications. Due to the use of cyclic prefix CP (Cyclic Prefix), the CP-OFDM system can well solve the multipath delay problem, and divide the frequency selective channel into a set of parallel flat channels, simplifying the channel estimation method, and having a higher channel estimation accuracy.
  • CP Cyclic Prefix
  • the performance of the CP-OFDM system is sensitive to the frequency offset and time offset between adjacent sub-bands, mainly because the spectrum leakage of the system is relatively large, which easily leads to inter-sub-band interference.
  • the LTE system uses a guard interval in the frequency domain to reduce or eliminate interference. In order to ensure the protection effect, the guard interval needs to occupy more resources.
  • the embodiments of the present application provide a data transmission method, a data processing method, a communication device, a medium and a product.
  • the interference or overlapping part can be calculated according to the reference sequence, the interference between sub-bands can be compensated, the protection interval can be reduced, and the spectrum efficiency can be improved; and by performing two inverse Fourier transforms on the data groups to be transmitted, the results of the two IFFTs can be the same as the results of one IFFT, thereby reducing the processing complexity and improving the processing efficiency.
  • FIG1 is a schematic diagram of a communication system provided in an embodiment of the present application.
  • the communication system includes a base station 110 and a terminal 120, and the base station 110 is communicatively connected with the terminal 120 respectively.
  • WCDMA Wideband Code Division Multiple Access mobile communication system
  • E UTRAN Evolved Universal Terrestrial Radio Access Network
  • NG RAN Next Generation Radio Access Network
  • LTE Long Term Evolution
  • WiMAX Worldwide Interoperability For Microwave Access
  • 5G fifth generation
  • NR new generation wireless access technology
  • 6G system future communication systems
  • the technical solution of the embodiment of the present application can be applied to various communication technologies, such as microwave communication, optical wave communication, millimeter wave communication, etc.
  • the embodiment of the present application does not limit the specific technology and specific device form used.
  • the base station 110 in the embodiment of the present application may be an evolved NodeB (eNB), a transmission point (TRP), a next generation NodeB (gNB) in an NR system, a base station in other future mobile communication systems, or an access node in a wireless fidelity (WiFi) system, etc.
  • eNB evolved NodeB
  • TRP transmission point
  • gNB next generation NodeB
  • WiFi wireless fidelity
  • the embodiment of the present application does not limit the specific technology and specific device form adopted by the network device.
  • the terminal 120 in the embodiment of the present application is an entity on the user side for receiving or transmitting signals, such as a mobile phone.
  • the terminal device may also be referred to as a terminal device (terminal), user equipment (UE), mobile station (MS), mobile terminal (MT), etc.
  • the terminal device may be a car with communication function, a smart car, or a mobile phone. Cars, mobile phones, wearable devices, tablet computers, computers with wireless transceiver functions, virtual reality (VR) devices, augmented reality (AR) devices, communication devices in industrial control, communication devices in self-driving, communication devices in remote medical surgery, communication devices in smart grids, communication devices in transportation safety, communication devices in smart cities, communication devices in smart homes, etc.
  • the embodiments of the present application do not limit the specific technology and specific device form used by the device.
  • FIG2 is a flow chart of a data transmission method provided in an embodiment of the present application.
  • the data transmission method may be applied to, but not limited to, a base station, a terminal, or a communication system as provided in FIG1.
  • the data transmission method may include, but is not limited to, steps S110, S120, S130, and S140.
  • Step S110 Divide the data to be transmitted into N groups, where N is an integer greater than or equal to 2.
  • the data to be transmitted are divided into N groups, wherein the number of data in each group is the same.
  • Step S120 Add a first reference sequence to the header of each group of data, and add a second reference sequence to the tail of each group of data, to obtain N groups of first data sequences.
  • the number of data included in each group of first data sequences is 2 raised to the power of i.
  • the data to be transmitted includes constellation point modulated data.
  • the constellation point is a constellation diagram.
  • different modulation modes have corresponding constellation diagrams.
  • the constellation diagram can be used to judge the bit error rate more intuitively and effectively.
  • the main function of the constellation diagram is to be used for mapping during modulation and to judge the sending point during reception, so as to correctly demodulate the data.
  • a first reference sequence is added to the header of each group of data, and a second reference sequence is added to the tail of each group of data.
  • the original reference signal data of the constellation point modulated data is also divided into different data groups and will not conflict with the first reference sequence and the second reference sequence.
  • the data to be transmitted of the present application may also include other data containing reference signals; the present application can group the data containing the reference signal together with the reference signal, and add the first reference sequence and the second reference sequence to the head and tail of each group respectively, and perform subsequent operations, and the reference signal data in the data to be transmitted will not affect the first reference sequence and the second reference sequence.
  • the first reference sequence and the second reference sequence are both known sequences.
  • the overlapping interference part can be obtained according to the known first sequence and the second sequence, thereby avoiding adding an excessively large guard interval to occupy resources.
  • the first reference sequence added to the header of each group of data is the same, and the second reference sequence added to the tail of each group of data is the same. It can be understood that the same first reference sequence can be the same number of data, or the same number of data and data content; the same second reference sequence can be the same number of data, or the same number of data and data content.
  • the first reference sequence added to the header of each group of data is different, and the second reference sequence added to the tail of each group of data is different.
  • the difference in the first reference sequence can be the difference in the number of data, or the difference in the number of data and the data content
  • the difference in the second reference sequence can be the difference in the number of data, or the difference in the number of data and the data content.
  • the first reference sequence and the second reference sequence are the same. It can be understood that the first reference sequence and the second reference sequence being the same may mean that the number of data is the same, or the number of data and the content of the data are the same. Being the same as the second reference sequence, it is convenient to find the overlapping interference based on the reference sequence.
  • the data to be transmitted is divided into N groups, the number of data in each group is the same, and the first reference sequence and the second reference sequence are added to the header and the tail of each group of data respectively, wherein the number of data in the first reference sequence added to each group of data is the same, and the number of data in the second reference sequence added to each group of data is the same.
  • N groups of first data sequences are obtained, and the number of data contained in each group of first data sequences is the same and is 2 to the i-th power.
  • the transmission data is divided into 4 groups, each group of data contains 28 data, a first reference sequence is added to the header of each group of data, wherein the first reference sequence contains 2 data, a second reference sequence is added to the tail of each group of data, wherein the second reference sequence contains 2 data, and 4 groups of first data sequences are obtained, each group of first data sequences contains 32 data and satisfies 2 to the i-th power (2 to the 5th power).
  • the data to be transmitted is divided into N groups, wherein the number of data in at least some of the groups is different, and the header and tail of each group of data are respectively added to the first reference sequence and the second reference sequence to obtain N groups of first data sequences, and the number of data contained in each group of first data sequences is the same and is 2 to the power of i.
  • the transmission data is divided into 4 groups, the first group of data contains 24 data, the second group of data contains 27 data, and the third group of data and the fourth group of data each contain 28 data.
  • a first reference sequence is added to the header of the first group of data, wherein the first reference sequence contains 4 data, a second reference sequence is added to the tail of the first group of data, wherein the second reference sequence contains 4 data, and the first group of data after adding the reference sequence contains 32 data;
  • a first reference sequence is added to the header of the second group of data, wherein the first reference sequence contains 4 data, a second reference sequence is added to the tail of the second group of data, wherein the second reference sequence contains 3 data, and the second group of data after adding the reference sequence contains 32 data;
  • a first reference sequence is added to the header of the third group of data and the fourth group of data, wherein the first reference sequence contains 2 data, a second reference sequence is added to the tail of the third group of data and the fourth group of data, wherein the second reference sequence contains 2 data, and
  • the data to be transmitted is divided into N groups, wherein the number of data in at least some of the groups is different, and a first reference sequence and a second reference sequence are added to the header and tail of each group of data respectively, and the first reference sequence added to the header of each group of data contains at least R data, and the R data are the same between each group; the second reference sequence added to the tail of each group of data contains at least Q data, and the Q data are the same between each group; R and Q are positive integers, and N groups of first data sequences are obtained, and the ratio of the number of data contained in each group of first data sequences is 2 raised to the i-th power.
  • the data to be transmitted are divided into 4 groups, wherein the first group of data and the second group of data each contain 14 data, and the third group of data and the fourth group of data each contain 28 data.
  • a first reference sequence is added to the header of the first group of data and the second group of data, respectively, wherein the first reference sequence contains 1 data, a second reference sequence is added to the tail of the first group of data and the second group of data, respectively, wherein the second reference sequence contains 1 data, and after adding the reference sequence, both the first group of data and the second group of data contain 16 data;
  • a first reference sequence is added to the header of the third group of data and the fourth group of data, respectively, wherein the first reference sequence contains 2 data, a second reference sequence is added to the tail of the third group of data and the fourth group of data, respectively, wherein the second reference sequence contains 2 data, and after adding the reference sequence, both the third group of data and the fourth group of data contain 32 data; wherein the first reference sequence of the first and second groups is the same as the odd number
  • the number of data in each group of first data sequences satisfies the i-th power of 2
  • the number of data between each group of first data sequences is the same or the ratio of the number of data satisfies the i-th power of 2, which can perform inverse Fourier transform more quickly, facilitate calculation during inverse Fourier transform, and increase data processing efficiency; inverse Fourier transform and filter processing can also be performed on data with different subcarrier intervals together.
  • N groups of first data sequences are transmitted in N frequency domain resource blocks respectively; each resource block includes subcarriers, wherein the number of subcarriers is equal to the number of data contained in each group of data sequences.
  • the zero frequency position during the inverse Fourier transform is within the frequency domain resource block corresponding to the group of first data sequences, and the zero frequency positions of different groups of first data sequences during the inverse Fourier transform are different.
  • the inverse Fourier transform is performed on each group of first data sequences respectively, and the zero frequency position (or zero subcarrier) during the inverse Fourier transform of each group of first data sequences is respectively in one of the subcarriers of the corresponding frequency domain resource block.
  • the N frequency domain resource blocks are all or part of the frequency domain resource blocks in the channel bandwidth
  • the data to be transmitted are all or part of the data to be transmitted in the channel bandwidth
  • Step S130 Perform inverse Fourier transform on the N groups of first data sequences respectively to obtain N groups of second data sequences.
  • the N groups of second data sequences contain the same number of data.
  • other data is filled so that the number of data included in the final N groups of second data sequences is the same.
  • the other filled data may be data to be transmitted from other groups after one inverse Fourier transformation, or may be empty data.
  • the number of points for inverse Fourier transform of each group of first data sequences is the same as the number of data included in the corresponding group of the N groups of first data sequences.
  • the ratio of the number of points of inverse Fourier transform of each group of first data sequences satisfies 2 to the power of i.
  • the number of points for inverse Fourier transform of each set of first data sequences is the same.
  • Step S140 Perform inverse Fourier transform on the N groups of second data sequences to obtain a group of data sequences, and transmit the group of data sequences on time-frequency resources.
  • an inverse Fourier transform with zero-padding oversampling is performed on the data of each column in the N groups of second data sequences to obtain a group of data sequences, and the group of data sequences is transmitted on time-frequency resources.
  • step S140 at least includes but is not limited to the following steps:
  • X groups of third data sequences are obtained, where X is the number of data in the second data sequence, that is, the number of groups in the third data sequence is the same as the number of data in the second data sequence.
  • X sub-symbols are connected in series in the time domain to obtain a fourth data sequence.
  • the fourth data sequence is transmitted in the time domain.
  • the number of points for inverse Fourier transform of each group of third data sequences is the same as the number of data included in the corresponding group.
  • the number of points for inverse Fourier transform of each set of third data sequences is greater than N.
  • the fourth data sequence is filtered or windowed.
  • the filtering is single-phase filtering or multi-phase filtering, wherein the multi-phase filtering is to filter the X sub-symbols obtained after the third data sequence is inverse Fourier transformed respectively, so that the results after serial superposition in the time domain are the same as the result of one IFFT.
  • the filtering function used for multi-phase filtering includes at least but is not limited to any one of the following: root raised cosine function, raised cosine function, rectangular function, IOTA (Isotropic Orthogonal Transform Algorithm) function, etc.
  • windowing the fourth data sequence includes: grouping the fourth data sequence, performing period extension after grouping, performing point multiplication of a preset function, and finally performing staggered superposition between the groups.
  • Figure 3 is a schematic diagram of a data transmission process provided by an embodiment of the present application, as shown in Figure 3:
  • the data to be transmitted are divided into 4 groups, each group of data contains 28 data, and a first reference sequence is added to the header of each group of data.
  • the first reference sequence between each group of data is the same, and the first reference sequence contains 2 data;
  • a second reference sequence is added to the end of each group of data, and the second reference sequence between each group of data is the same, and the second reference sequence contains 2 data;
  • 4 groups of first data sequences are obtained, and the number of data in each group of first reference sequences is the same, all contain 32 data, and all satisfy 2 to the i-th power (2 to the 5th power).
  • the interference or overlapping part can be calculated according to the reference sequence, the interference between sub-bands can be compensated, the protection interval can be reduced, and the spectrum efficiency can be improved; and by performing two inverse Fourier transforms on the transmitted data packets, the results of the two IFFTs can be the same as the results of one IFFT, thereby reducing the processing complexity and improving the processing efficiency.
  • FIG4 is taken as an example for exemplary description.
  • FIG4 is a schematic diagram of a constellation point modulation data transmission process provided by an embodiment of the present application, as shown in FIG4:
  • the data to be transmitted is constellation point modulation data, wherein the front part and the back part of the constellation point modulation data carry reference signal data.
  • the constellation point modulation data is divided into 4 groups, each group of data contains 28 data, wherein the reference signal data is divided into the first group and the fourth group respectively.
  • a first reference sequence is added to the head of each group of data, and the first reference sequence between each group of data is the same, wherein the first reference sequence contains 2 data;
  • a second reference sequence is added to the tail of each group of data, and the second reference sequence between each group of data is the same, wherein the second reference sequence contains 2 data;
  • 4 groups of first data sequences are obtained, and the number of data in each group of first reference sequences is the same, all containing 32 data, and all satisfying 2 to the i-th power (2 to the 5th power).
  • Each group of first data sequences is subjected to 32-point IFFT processing to obtain 4 groups of second data sequences.
  • 32 groups of third data sequences are obtained.
  • the 32 groups of third data sequences are subjected to sampling respectively.
  • the same IFFT processing is performed to obtain 32 sub-symbols, and the 32 sub-symbols are connected in series in the time domain to form a set of time domain transmission data sequences, namely, the fourth data sequence.
  • the fourth data sequence is transmitted on the time-frequency resources.
  • reference signal data carried by the data to be transmitted itself will not interact with the first reference sequence and the second reference sequence, and the data transmission method of the present application is also applicable to the data to be transmitted carrying reference signal data or other modulated frequency domain data.
  • FIG5 is an example of a data transmission process of a quadratic inverse Fourier transform provided by an embodiment of the present application, as shown in FIG5 :
  • the data to be transmitted are divided into 4 groups, each group of data contains 28 data, and a first reference sequence is added to the header of each group of data.
  • the first reference sequence between each group of data is the same, and the first reference sequence contains 2 data;
  • a second reference sequence is added to the end of each group of data, and the second reference sequence between each group of data is the same, and the second reference sequence contains 2 data;
  • 4 groups of first data sequences are obtained, and the number of data in each group of first reference sequences is the same, all contain 32 data, and all satisfy 2 to the i-th power (2 to the 5th power).
  • 32 groups of third data sequences are obtained based on the data with the same number of columns in the 4 groups of second data sequences.
  • the number of data in each group of the first data sequence is the same and satisfies 2 to the i-th power (2 to the 5th power), which can more conveniently perform IFFT calculations and improve processing efficiency.
  • IFFT and filter processing can be performed together on data with different subcarrier intervals.
  • FIG6 is a flow chart of a data transmission method provided in another embodiment of the present application.
  • the data transmission method may be applied to, but not limited to, a base station, a terminal, or a communication system as provided in FIG1.
  • the data transmission method may include, but is not limited to, steps S210, S220, S230, S240, S250, S260, and S270.
  • Step S210 Divide the data to be transmitted into N groups, where N is an integer greater than or equal to 2.
  • the data to be transmitted are divided into N groups, wherein the number of data in each group is the same.
  • Step S220 Add a first reference sequence to the header of each group of data, and add a second reference sequence to the tail of each group of data, to obtain N groups of first data sequences, wherein the number of data included in each group of first data sequences is 2 to the power of i.
  • the data to be transmitted includes constellation point modulated data.
  • the data to be transmitted of the present application may also include other data containing reference signals; the present application can group the data containing the reference signal together with the reference signal, and add the first reference sequence and the second reference sequence to the head and tail of each group respectively, and perform subsequent operations, and the reference signal data in the data to be transmitted will not affect the first reference sequence and the second reference sequence.
  • the first reference sequence and the second reference sequence are both known sequences.
  • the reference sequence in the frequency domain can be used to filter the data even if there is some overlap and interference between each set of data.
  • the overlapping interference parts of the known first sequence and second sequence are obtained to avoid adding an excessively large guard interval to occupy resources.
  • first reference sequence and the second reference sequence are the same. It is understandable that the first reference sequence and the second reference sequence being the same may mean that the number of data is the same, or the number of data and the data content are the same. The first reference sequence and the second reference sequence being the same can conveniently calculate the overlap interference according to the reference sequence.
  • the number of data included in at least some groups at least satisfies one of the following conditions: the number of data is the same; the ratio of the number of data is the i-th power of 2. It can be understood that the situation in this embodiment where the number of data is the same or the ratio of the number of data is the i-th power of 2 is the same as the relevant embodiment of step S120 in the above embodiment, and will not be described in detail here.
  • N groups of first data sequences are respectively transmitted in N frequency domain resource blocks; each resource block includes subcarriers, wherein the number of subcarriers is equal to the number of data included in each group of data sequences.
  • Step S230 Perform inverse Fourier transform on the N groups of first data sequences respectively, and obtain P groups of second data sequences based on the N groups of transformed first data sequences and the M groups of fifth data sequences, wherein M is a positive integer, P is the sum of N and M, and the P groups of second data sequences contain the same number of data.
  • the fifth data sequence is a data sequence generated by data other than the data to be transmitted this time, and may be single-carrier or multi-carrier data, or data with different subcarrier intervals.
  • the fifth data sequence may include the first reference sequence and the second reference sequence in the frequency domain, or may not include the first reference sequence and the second reference sequence in the frequency domain.
  • the M groups of fifth data sequences are time domain data, and directly form P groups of second data sequences with the N groups of first data sequences that have undergone one inverse Fourier transform, wherein P is the sum of M and N, and M, N, and P are all positive integers. Furthermore, the number of data in the fifth data sequence is the same as the number of data in the first data sequence that has undergone one inverse Fourier transform, that is, the length of the fifth data sequence is the same as the length of the first data sequence that has undergone one Fourier transform.
  • the M groups of fifth data sequences are frequency domain data
  • the M groups of fifth data sequences and the N groups of first data sequences are respectively Fourier inverse transformed to obtain P groups of second data sequences.
  • the number of data in the fifth data sequence is the same as the number of data in the first data sequence, that is, the length of the fifth data sequence is the same as that of the first data sequence.
  • M groups of fifth data sequences are frequency domain data directly combined with N groups of first data sequences that have undergone one inverse Fourier transform to form P groups of second data sequences, where P is the sum of M and N, and M, N, and P are all positive integers. Furthermore, the number of data in the fifth data sequence is the same as the number of data in the first data sequence, that is, the length of the fifth data sequence is the same as that of the first data sequence.
  • the number of points for inverse Fourier transform of each group of first data sequences is the same as the number of data included in the corresponding group
  • the number of points for inverse Fourier transform of each group of fifth data sequences is the same as the number of data included in the corresponding group.
  • Step S240 Obtain X groups of third data sequences based on the data with the same number of columns in the P groups of second data sequences, where X is the number of data in the second data sequence, that is, the number of groups in the third data sequence is the same as the number of data in the second data sequence.
  • Step S250 Perform inverse Fourier transform on the X groups of third data sequences respectively to obtain X sub-symbols.
  • the number of points for inverse Fourier transform of each group of third data sequences is the same as the number of data included in the corresponding group.
  • the number of points for inverse Fourier transform of each set of third data sequences is greater than N.
  • Step S260 connect X sub-symbols in series in the time domain to obtain a fourth data sequence.
  • Step S270 Transmit the fourth data sequence in the time domain.
  • FIG. 7 is a schematic diagram of a data transmission process provided by another embodiment of the present application, as shown in FIG. 7 :
  • the data to be transmitted are divided into 4 groups, each group of data contains 28 data, and a first reference sequence is added to the header of each group of data.
  • the first reference sequence between each group of data is the same, and the first reference sequence contains 2 data;
  • a second reference sequence is added to the end of each group of data, and the second reference sequence between each group of data is the same, and the second reference sequence contains 2 data;
  • 4 groups of first data sequences are obtained, and the number of data in each group of first reference sequences is the same, all contain 32 data, and all satisfy 2 to the i-th power (2 to the 5th power).
  • Each group of first data sequences is subjected to 32-point IFFT processing, and together with other groups of data sequences (i.e., the fifth data sequence), several groups of second data sequences are formed, and 4 groups of other groups of data sequences are provided, i.e., 4 groups of first data sequences subjected to 32-point IFFT processing and 4 groups of other groups of data sequences form 8 groups of second data sequences.
  • the length of the other groups of data sequences is the same as the length of the first data sequence, i.e., the number of data is the same; the other groups of data sequences do not belong to the data sequence generated by the data to be transmitted, and may be single-carrier or multi-carrier data, or data with different subcarrier intervals, and may not have the same head and tail sequences (first reference sequence and second reference sequence) in the frequency domain.
  • each group of the third data sequence includes 8 data.
  • the 32 groups of third data sequences are respectively subjected to oversampling IFFT processing to obtain 32 sub-symbols, and the 32 sub-symbols are connected in series in the time domain to form a group of fourth data sequences.
  • the fourth data sequence is transmitted on the time-frequency resources.
  • the data transmission method of the present application can also introduce other data after the first IFFT to perform a second IFFT and transmit it together, without causing interference to the data to be sent currently.
  • FIG8 is a flow chart of a data transmission method provided by another embodiment of the present application.
  • the data transmission method may be, but is not limited to, applied to a base station, a terminal, or a communication system as provided in FIG1.
  • the data transmission method may include, but is not limited to, steps S310, S320, S330, S340, S350, S360, S370, and S380.
  • Step S310 Divide the data to be transmitted into N groups, where N is an integer greater than or equal to 2.
  • the data to be transmitted is divided into N groups of data, wherein the number of data in at least one group of data is different from the number of data in the other groups of data.
  • the data to be transmitted is divided into 4 groups, wherein the number of data in the first group of data is 14, and the number of data in the remaining groups of data is 28; or, the data to be transmitted is divided into 4 groups, wherein the number of data in the first group of data and the second group of data is 14, and the number of data in the remaining groups of data is 28, which is not specifically limited here.
  • Step S320 Add a first reference sequence to the header of each group of data, and add a second reference sequence to the tail of each group of data, to obtain N groups of first data sequences, wherein the number of data included in each group of first data sequences is 2 to the power of i.
  • the data to be transmitted includes constellation point modulated data.
  • the data to be transmitted of the present application may also include other data containing reference signals; the present application can group the data containing the reference signal together with the reference signal, and add the first reference sequence and the second reference sequence to the head and tail of each group respectively, and perform subsequent operations, and the reference signal data in the data to be transmitted will not affect the first reference sequence and the second reference sequence.
  • the first reference sequence and the second reference sequence are both known sequences.
  • the overlapping interference part can be obtained according to the known first sequence and the second sequence, thereby avoiding adding an excessively large guard interval to occupy resources.
  • the first reference sequence and the second reference sequence are the same.
  • the sameness of the two reference sequences can mean the same number of data or the same number of data and data content.
  • the sameness of the first reference sequence and the second reference sequence can conveniently calculate the overlapping interference according to the reference sequence.
  • the number of data included in at least some groups at least satisfies one of the following conditions: the number of data is the same; the ratio of the number of data is the i-th power of 2. It can be understood that the situation in this embodiment where the number of data is the same or the ratio of the number of data is the i-th power of 2 is the same as the relevant embodiment of step S120 in the above embodiment, and will not be described in detail here.
  • N groups of first data sequences are respectively transmitted in N frequency domain resource blocks; each resource block includes subcarriers, wherein the number of subcarriers is equal to the number of data included in each group of data sequences.
  • Step S330 Perform inverse Fourier transform on the N groups of first data sequences respectively to obtain N groups of sixth data sequences.
  • the number of points for inverse Fourier transform of each group of first data sequences is the same as the number of data included in the corresponding group.
  • Step S340 add time domain data to at least one of the N groups of sixth data sequences to obtain N groups of second data sequences, wherein the time domain data is a time domain data sequence generated by inverse Fourier transform, and the N groups of second data sequences contain the same number of data.
  • the time domain data is a data sequence obtained by the first IFFT of the first data sequence obtained after other data to be sent are grouped.
  • the purpose of adding the time domain data is to fill the data sequence with fewer data in the sixth data sequence, so that the number of data in each group of the sixth data sequence is the same (that is, the length is the same).
  • the time domain data is other data that needs to be sent in the time domain.
  • the condition that the number of data in each group of the formed second data sequence is the same can be met, and resource utilization and transmission efficiency can be improved.
  • the time domain data may also be empty data, which is equivalent to not adding data to the sixth data sequence and having the effect of idling subcarriers.
  • Step S350 Obtain X groups of third data sequences based on the data with the same number of columns in the N groups of second data sequences, wherein the number of groups in the third data sequence is the same as the number of data in the second data sequence.
  • Step S360 Perform inverse Fourier transform on the X groups of third data sequences respectively to obtain X sub-symbols.
  • the number of points for inverse Fourier transform of each group of third data sequences is the same as the number of data included in the corresponding group.
  • the number of points for inverse Fourier transform of each set of third data sequences is greater than N.
  • Step S370 connect X sub-symbols in series in the time domain to obtain a fourth data sequence.
  • Step S310 Transmit a fourth data sequence in the time domain.
  • FIG9 is an example of a data transmission process provided by another embodiment of the present application, as shown in FIG9 :
  • the data to be transmitted is divided into 4 groups, where the first group of data and the second group of data each contain 14 data, and the third group of data and the fourth group of data each contain 28 data.
  • a first reference sequence is added to the header of the first group of data and the second group of data, and the first reference sequence between each group of data is the same, where the first reference sequence contains 1 data;
  • a second reference sequence is added to the tail of the first group of data and the second group of data, and the second reference sequence between each group of data is the same, where the second reference sequence contains 1 data; after the reference sequence is added, the first group of data and the second group of data each contain 16 data.
  • the first reference sequence is added to the first part of the third and fourth data groups, and the first reference sequence between each data group is the same, wherein the first reference sequence contains 2 data; the second reference sequence is added to the tail of the third and fourth data groups, and the second reference sequence between each data group is the same, wherein the second reference sequence contains 2 data; after adding the reference sequence, the third and fourth data groups each contain 32 data. That is, 4 groups of first data sequences are obtained, of which two groups of first data sequences contain 16 data, and the other two groups of first data sequences contain 32 data.
  • the ratio of the number of data between each group of first data sequences is 1:1:2:2, and the order is from the first group to the fourth group, and the ratio of the number satisfies the i-th power of 2 (the 0th power of 2 and the 1st power of 2).
  • the first two groups of first data sequences are processed by 16-point IFFT respectively, and the last two groups of first data sequences are processed by 32-point IFFT respectively, to obtain 4 groups of sixth data sequences.
  • the first group of sixth data sequences is connected in series with other time domain data sequences to be sent of the same length, i.e., in FIG9 , symbol 1 and symbol 2 are connected in series to obtain the first group of second data sequences; the second group of sixth data sequences is connected in series with other time domain data sequences to be sent of the same length to obtain the second group of second data sequences; and finally 4 groups of second data sequences with the same number of data are obtained.
  • 32 groups of third data sequences are obtained.
  • the 32 groups of third data sequences are respectively subjected to oversampling IFFT processing to obtain 32 sub-symbols, and the 32 sub-symbols are connected in series in the time domain to form a group of time domain transmission sequence, i.e., the fourth data sequence.
  • the fourth data sequence is transmitted on the time-frequency resources.
  • Figure 10 is a flow chart of a data processing method provided in an embodiment of the present application.
  • the data transmission method can be applied to, but not limited to, a base station, a terminal, or a communication system as provided in Figure 1.
  • the data processing method can include, but is not limited to, steps S410 and S420.
  • Step S410 Divide the data to be transmitted into N groups, where N is an integer greater than or equal to 2.
  • Step S420 Add a first reference sequence to the header of each group of data, and add a second reference sequence to the tail of each group of data, to obtain N groups of data sequences, wherein the number of data contained in each group of data sequences is 2 to the power of i.
  • the number of data contained in at least some of the data sequences satisfies one of the following conditions: the number of data is the same; the ratio of the number of data is 2 to the i-th power.
  • the first reference sequence is the same as the second reference sequence.
  • step S420 includes: adding a first reference sequence to the header of each group of data, and adding a second reference sequence to the tail of each group of data, to obtain N groups of first data sequences, wherein the number of data contained in each group of the N groups of first data sequences is 2 to the i-th power.
  • FIG11 is a schematic diagram of the structure of a communication device provided by an embodiment of the present application.
  • the communication device 2000 includes a memory 2100 and a processor 2200.
  • the number of the memory 2100 and the processor 2200 can be one or more, and FIG11 takes a memory 2101 and a processor 2201 as an example; the memory 2101 and the processor 2201 in the network device can be connected via a bus or other means, and FIG11 takes the connection via a bus as an example.
  • the memory 2101 is a computer-readable storage medium that can be used to store software programs, computer executable programs, and modules, such as program instructions/modules corresponding to the method provided in any embodiment of the present application.
  • the processor 2201 executes the storage medium.
  • the software programs, instructions and modules in the memory 2101 implement the data transmission method or data processing method provided by any of the above embodiments.
  • the memory 2101 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system and an application required for at least one function.
  • the memory 2101 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.
  • the memory 2101 further includes a memory remotely arranged relative to the processor 2201, 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.
  • An embodiment of the present application further provides a computer-readable storage medium storing computer-executable instructions, wherein the computer-executable instructions are used to execute a data transmission method or a data processing method as provided in any embodiment of the present application.
  • An embodiment of the present application also provides a computer program product, including a computer program or computer instructions, which are stored in a computer-readable storage medium.
  • a processor of a computer device reads the computer program or computer instructions from the computer-readable storage medium, and the processor executes the computer program or computer instructions, so that the computer device executes a data transmission method or a data processing method provided in any embodiment of the present application.
  • the division between the functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed by several physical components in cooperation.
  • Some physical components or all physical components may be implemented as software executed by a processor, such as a central processing unit, a digital signal processor or a microprocessor, or implemented as hardware, or implemented as an integrated circuit, such as an application-specific integrated circuit.
  • a processor such as a central processing unit, a digital signal processor or a microprocessor
  • Such software may be distributed on a computer-readable medium, which may include a computer storage medium (or non-transitory medium) and a communication medium (or temporary medium).
  • computer storage medium includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules or other data).
  • Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disk (DVD) or other optical disk storage, magnetic cassettes, magnetic tapes, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer.
  • communication media typically embodies computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave or other transport mechanism, and may include any information delivery media.
  • a component can be, but is not limited to, a process running on a processor, a processor, an object, an executable file, an execution thread, a program, or a computer.
  • an application running on a computing device and a computing device can be a component.
  • One or more components can reside in a process or execution thread, Components may be located on one computer or distributed between two or more computers.
  • the components may be executed from various computer-readable media having various data structures stored thereon.
  • Components may communicate, for example, through local or remote processes based on signals having one or more data packets (e.g., data from two components interacting with another component in a local system, a distributed system, or a network, such as the Internet interacting with other systems via signals).
  • signals having one or more data packets (e.g., data from two components interacting with another component in a local system, a distributed system, or a network, such as the Internet interacting with other systems via signals).

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请实施例提供了一种数据传输方法、数据处理方法、通信设备、介质及产品。该数据传输方法包括：将待传输数据分成N组，N为大于等于2的整数；在每组数据首部添加第一参考序列，在每组数据尾部添加第二参考序列，得到N组第一数据序列；对N组第一数据序列分别进行傅里叶逆变换，得到N组第二数据序列；对N组第二数据序列进行傅里叶逆变换，得到一组数据序列，在时频资源上传输一组数据序列。

Description

数据传输方法、数据处理方法、通信设备、介质及产品
相关申请的交叉引用
本申请基于申请号为202211307244.5、申请日为2022年10月24日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本申请实施例涉及通信技术领域，尤其是一种数据传输方法、数据处理方法、通信设备、介质及产品。
背景技术
正交频分复用(Orthogonal Frequency Division Multiplexing，OFDM)技术在无线通信中广泛应用。通过OFDM技术能够减少子信道之间的相互干扰(Inter Symbol Interference，ISI)。循环前缀正交频分复用(Cyclic Prefix-Orthogonal Frequency Division Multiplexing，CP-OFMD)技术是OFDM技术中的一种。CP-OFDM能够较好地解决多径时延问题，但CP-OFDM系统由于频谱泄漏较大，容易导致子带间干扰。随着人们对传输速率的要求越来越高，带宽越来越大，子带间干扰严重。
相关技术中，通过在频域上使用保护间隔的技术，改善带间干扰的问题。但上述技术降低了频谱效率。如何减少频谱资源的浪费是一个亟待讨论和解决的问题。
发明内容
本申请实施例提供一种数据传输方法、数据处理方法、通信设备、介质及产品，旨在减少频谱资源的浪费。
第一方面，本申请实施例提供一种数据传输方法，所述方法包括：将待传输数据分成N组，N为大于等于2的整数；在每组数据首部添加第一参考序列，在每组数据尾部添加第二参考序列，得到N组第一数据序列；对所述N组第一数据序列分别进行傅里叶逆变换，得到N组第二数据序列；对所述N组第二数据序列进行傅里叶逆变换，得到一组数据序列，在时频资源上传输所述一组数据序列。
第二方面，本申请实施例提供一种数据处理方法，所述方法包括：将待传输数据分成N组，N为大于等于2的整数；在每组数据首部添加第一参考序列，在每组数据尾部添加第二参考序列，得到N组第一数据序列；对所述N组第一数据序列分别进行傅里叶逆变换，得到N组第二数据序列；对所述N组第二数据序列进行傅里叶逆变换，得到一组数据序列。
第三方面，本申请实施例提供一种通信设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，所述处理器执行所述计算机程序时实现如第一方面所述的数据传输方法，或如第二方面所述的数据处理方法。
第四方面，本申请实施例提供一种计算机可读存储介质，其中，所述计算机可读存储介质存储有计算机可执行指令，所述计算机可执行指令用于执行如第一方面所述的数据传输方法，或如第二方面所述的数据处理方法。
第五方面，本申请实施例提供一种机程序产品，包括计算机程序或计算机指令，其中，所述计算机程序或所述计算机指令存储在计算机可读存储介质中，计算机设备的处理器从所述计算机可读存储介质读取所述计算机程序或所述计算机指令，所述处理器执行所述计算机程序或所述计算机指令，使得所述计算机设备执行如第一方面所述的数据传输方法，或如第二方面所述的数据处理方法。
附图说明
图1为本申请一实施例提供的一种通信系统的示意图。
图2为本申请一实施例提供的数据传输方法的流程图。
图3为本申请一实施例提供的数据传输过程的示意图。
图4为本申请一实施例提供的星座点调制数据传输过程的示意图。
图5为本申请一实施例提供的二次傅里叶逆变换的数据传输过程的示意图。
图6为本申请另一实施例提供的数据传输方法的流程图。
图7为本申请另一实施例提供的数据传输过程的示意图。
图8为本申请另一实施例提供的数据传输方法的流程图。
图9为本申请另一实施例提供的数据传输过程的示意图。
图10为本申请一实施例提供的数据处理方法的流程图。
图11是本申请一实施例提供的通信设备的结构示意图。
具体实施方式
为了使本申请的目的、技术方案及优点更加清楚明白，以下结合附图及实施例，对本申请进行进一步详细说明。应当理解，此处所描述的具体实施例仅用以解释本申请，并不用于限定本申请。
需要说明的是，虽然在装置示意图中进行了功能模块划分，在流程图中示出了逻辑顺序，但是在某些情况下，可以以不同于装置中的模块划分，或流程图中的顺序执行所示出或描述的步骤。说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。
本申请实施例的描述中，除非另有明确的限定，设置、安装、连接等词语应做广义理解，所属技术领域技术人员可以结合技术方案的具体内容合理确定上述词语在本申请实施例中的具体含义。
本申请实施例中，“进一步地”、“示例性地”或者“可选地”等词用于表示作为例子、例证或说明，不应被解释为比其它实施例或设计方案更优选或更具有优势。使用“进一步地”、“示例性地”或者“可选地”等词旨在以具体方式呈现相关概念。
相关技术中，长期演进技术(Long Term Evolution，LTE)是4G(Fourth Generation)的 无线蜂窝通信技术。LTE采用正交频分复用(Orthogonal Frequency Division Multiplexing，OFDM)技术，子载波和OFDM符号构成的时频资源组成LTE系统的无线物理时频资源。目前，OFDM技术在无线通信中应用较广，由于采用了循环前缀CP(Cyclic Prefix)，CP-OFDM系统能很好地解决多径时延问题，并且将频率选择性信道分成了一套平行的平坦信道，简化了信道估计方法，并且有较高的信道估计精度。然而，CP-OFDM系统性能对相邻子带间的频偏和时偏比较敏感，主要是由于该系统的频谱泄漏比较大，因此容易导致子带间干扰。目前LTE系统在频域上使用了保护间隔，以降低或者消除干扰，为了保证保护效果，保护间隔需要占用较多的资源。
在OFDM的技术中，进行傅里叶逆变换(Inverse Fast Fourier Transform，IFFT)时，通常是对整个带宽进行一次IFFT处理，涉及的点数较多，计算复杂度较高，处理时间较长。在对时延要求较高或IFFT点数较多的场景中，相关技术的一次IFFT处理无法满足时延要求。
为解决上述问题，本申请实施例提供了一种数据传输方法、数据处理方法、通信设备、介质及产品，通过对待传输数据进行分组，在每组数据首部和尾部添加参考序列，在发生干扰或重叠时，能够根据参考序列将干扰或重叠部分求出来，补偿子带间干扰，减少保护间隔，提高频谱效率；还通过对待传输数据分组进行两次傅里叶逆变换，最终两次IFFT的结果能够与一次IFFT的结果相同，从而降低处理复杂度，提高处理效率。
下面结合附图，对本申请实施例作进一步阐述。
图1是本申请一实施例提供的一种通信系统的示意图，如图所示，在实施例中，示例性地，通信系统包括基站110和终端120，基站110分别与终端120通信连接。
可以理解的是，本实施例的通信系统中的设备数量及设备间通信关系能够根据实际需求进行扩展和变化，在此不做具体限定。
本申请实施例的技术方案可以应用于各种通信系统，例如：宽带码分多址移动通信系统(Wideband Code Division Multiple Access，WCDMA)、演进的全球陆地无线接入网络(Evolved Universal Terrestrial Radio Access Network，E UTRAN)系统、下一代无线接入网络(Next Generation Radio Access Network，NG RAN)系统、长期演进(Long Term Evolution，LTE)系统、全球互联微波接入(Worldwide Interoperability For Microwave Access，WiMAX)通信系统、第五代(5th Generation，5G)系统、如新一代无线接入技术(New Radio Access Technology，NR)、及未来的通信系统，如6G系统等。
本申请实施例的技术方案可以应用于各种通信技术，例如微波通信、光波通信、毫米波通信等。本申请实施例对采用的具体技术和具体设备形态不做限定。
本申请实施例的基站110可以为演进型基站(evolved NodeB，eNB)、传输点(Transmission Reception Point，TRP)、NR系统中的下一代基站(Next Generation NodeB，gNB)、其他未来移动通信系统中的基站或无线保真(Wireless Fidelity，WiFi)系统中的接入节点等。本申请实施例对网络设备所采用的具体技术和具体设备形态不做限定。
本申请实施例的终端120是用户侧的一种用于接收或发射信号的实体，如手机。终端设备也可以称为终端设备(terminal)、用户设备(User Equipment，UE)、移动台(Mobile Station，MS)、移动终端设备(Mobile Terminal，MT)等。终端设备可以是具备通信功能的汽车、智能汽 车、手机(mobile phone)、穿戴式设备、平板电脑(Pad)、带无线收发功能的电脑、虚拟现实(Virtual Reality，VR)设备、增强现实(Augmented Reality，AR)设备、工业控制(Industrial Control)中的通信设备、无人驾驶(Self driving)中的通信设备、远程手术(Remote Medical Surgery)中的通信设备、智能电网(Smart Grid)中的通信设备、运输安全(Transportation Safety)中的通信设备、智慧城市(Smart City)中的通信设备、智慧家庭(Smart Home)中的通信设备等。本申请实施例对设备所采用的具体技术和具体设备形态不做限定。
图2为本申请一实施例提供的数据传输方法的流程图。如图2所示，该数据传输方法可以但不限于应用于基站、终端或如图1提供的通信系统中。在图2的实施例中，该数据传输方法可以包括但不限于步骤S110、S120、S130、S140。
步骤S110：将待传输数据分成N组，N为大于等于2的整数。
在一实施例中，将待传输数据分成N组，其中，每组数据的数据个数相同。
步骤S120：在每组数据首部添加第一参考序列，在每组数据尾部添加第二参考序列，得到N组第一数据序列。
在一实施例中，每组第一数据序列包含的数据个数为2的i次幂。
在一实施例中，待传输数据包括星座点调制的数据。星座点即星座图，在数字调制的过程中，不同的调制方式都有对应的星座图，通过星座图可以更加直观有效的对误码率进行判断，星座图的主要作用是在调制时用于映射，接收时用于判断发送的点，从而正确解调数据。对星座点调制的数据进行分组后，在每组数据的首部添加第一参考序列，每组数据的尾部添加第二参考序列，星座点调制的数据原本的参考信号数据同样被分在不同的数据组中，并不会与第一参考序列和第二参考序列冲突。
可以想到的是，除了上述的星座点调制的数据，本申请的待传输数据还可以包括其他包含有参考信号的数据；本申请能够对本身包含有参考信号的数据连带着参考信号分组后，对每组首尾部分别添加第一参考序列和第二参考序列，以及进行后续操作，待传输数据中的参考信号数据不会和第一参考序列及第二参考序列之间产生影响。
在一实施例中，第一参考序列和第二参考序列均为已知序列。在后续对处理后的数据进行滤波处理时，通过频域的参考序列，即使每组数据之间存在一定的重叠干扰，也可以根据已知的第一序列和第二序列将重叠干扰部分求出，避免加入过大的保护间隔占用资源。
在一实施例中，每组数据首部添加的第一参考序列相同，每组数据尾部添加的第二参考序列相同。可以理解的是，第一参考序列的相同可以是数据个数的相同，也可以是数据个数和数据内容均相同；第二参考序列的相同可以是数据个数的相同，也可以是数据个数和数据内容均相同。
在一实施例中，每组数据首部添加的第一参考序列不相同，每组数据尾部添加的第二参考序列不相同。可以理解的是，第一参考序列的不相同可以是数据个数的不相同，也可以是数据个数和数据内容均不相同；第二参考序列的不相同可以是数据个数的不相同，也可以是数据个数和数据内容均不相同。
在一实施例中，第一参考序列和第二参考序列相同。可以理解的是，第一参考序列和第二参考序列相同可以是数据个数相同，也可以是数据个数及数据内容均相同。第一参考序列 和第二参考序列相同能够方便地根据参考序列求重叠干扰。
在一实施例中，待传输数据分成N组，每组数据的个数相同，每组数据的首部和尾部分别加入第一参考序列和第二参考序列，其中，每组数据加入的第一参考序列的数据个数相同，每组数据加入的第二参考序列的数据个数相同，每组数据加入第一参考序列和第二参考序列后得到N组第一数据序列，每组第一数据序列包含的数据个数相同，且为2的i次幂个。
示例性地，传输数据分成4组，每组数据都包含28个数据，给每组数据的首部加入第一参考序列，其中第一参考序列包含2个数据，给每组数据的尾部加入第二参考序列，其中第二参考序列包含2个数据，得到4组第一数据序列，每组第一数据序列都包含32个数据，且满足2的i次幂(2的5次幂)。
在另一实施例中，待传输数据分成N组，其中，至少部分组的数据个数不同，每组数据的首部和尾部分别加入第一参考序列和第二参考序列，得到N组第一数据序列，每组第一数据序列包含的数据个数相同，且为2的i次幂个。
示例性地，传输数据分成4组，第一组数据包含24个数据，第二组数据包含27个数据，第三组数据和第四数据均包含28个数据。给第一组数据的首部加入第一参考序列，其中第一参考序列包含4个数据，给第一组数据的尾部加入第二参考序列，其中第二参考序列包含4个数据，加入参考序列后的第一组数据包含32个数据；给第二组数据的首部加入第一参考序列，其中第一参考序列包含4个数据，给第二组数据的尾部加入第二参考序列，其中第二参考序列包含3个数据，加入参考序列后的第二组数据包含32个数据；给第三组数据和第四组数据的首部分别加入第一参考序列，其中第一参考序列包含2个数据，给第三组数据和第四组数据的尾部分别加入第二参考序列，其中第二参考序列包含2个数据，加入参考序列后的第三组数据和第四组数据均包含32个数据；即得到4组第一数据序列，每组第一数据序列都包含32个数据，且满足2的i次幂(2的5次幂)。
在另一实施例中，待传输数据分成N组，其中，至少部分组的数据个数不同，每组数据的首部和尾部分别加入第一参考序列和第二参考序列，并每组数据首部添加的第一参考序列至少包含R个数据，R个数据在每组之间相同；每组数据尾部添加的第二参考序列至少包含Q个数据，Q个数据在每组之间相同；R和Q为正整数，得到N组第一数据序列，每组第一数据序列包含的数据个数之比为2的i次幂。
示例性地，待传输数据分成4组，其中，第一组数据和第二组数据均包含14个数据，第三组数和第四组数据均包含28个数据。给第一组数据和第二组数据的首部分别加入第一参考序列，其中第一参考序列包含1个数据，给第一组数据和第二组数据的尾部分别加入第二参考序列，其中第二参考序列包含1个数据，加入参考序列后的第一组数据和第二组数据均包含16个数据；给第三组数据和第四组数据的首部分别加入第一参考序列，其中第一参考序列包含2个数据，给第三组数据和第四组数据的尾部分别加入第二参考序列，其中第二参考序列包含2个数据，加入参考序列后的第三组数据和第四组数据均包含32个数据；其中第一、二组的第一参考序列与第三、四组的第一参考序列的奇数位相同，第一、二组的第二参考序列与第三、四组的第二参考序列的奇数位相同；即得到4组第一数据序列，其中两组第一数据序列包含16个数据，另外两组第一数据序列包含32个数据，每组第一数据序列之间数据 个数比为1：1：2：2，顺序为第一组到第4组，个数之比满足2的i次幂(2的0次幂和2的1次幂)。
每组第一数据序列的数据个数满足2的i次幂，每组第一数据序列之间的数据个数相同或数据个数之比满足2的i次幂，能够更快速地进行傅里叶逆变换，更方便傅里叶逆变换时的计算，增加数据处理效率；还可以对不同子载波间隔的数据一起进行傅里叶逆变换和滤波器处理。
在一实施例中，N组第一数据序列分别在N个频域资源块中传输；每个资源块分别包括子载波，其中，子载波个数等于每组数据序列中包含数据的个数。在后续对每组第一数据序列进行傅里叶逆变换中，傅里叶逆变换时的零频位置在该组第一数据序列对应的频域资源块范围内，不同组的第一数据序列进行傅里叶逆变换时的零频位置不同。进一步地，分别对每组第一数据序列进行傅里叶逆变换，每组第一数据序列进行傅里叶逆变换时的零频位置(或零子载波)分别在对应频域资源块的子载波中的一个。从而保证了每组第一数据序列在频域的正交性。
在一实施例中，N个频域资源块为信道带宽里的全部或部分频域资源块，待传输数据为信道带宽里待传输数据的全部或部分。
步骤S130：对N组第一数据序列分别进行傅里叶逆变换，得到N组第二数据序列。
在一实施例中N组第二数据序列包含的数据个数相同。
在一实施例中，当傅里叶逆变换后的N组第一数据序列的数据个数不同时，通过填充其他数据，使得最终N组第二数据序列包含的数据个数相同。其中，填充的其他数据可以是其他组的经过一次傅里叶逆变换的待传输数据，也可以是空数据。
在一实施例中，每组第一数据序列进行傅里叶逆变换的点数与N组第一数据序列对应组中包含的数据个数相同。
在一实施例中，每组第一数据序列进行傅里叶逆变换的点数之比满足2的i次幂。
在一实施例中，每组第一数据序列进行傅里叶逆变换的点数相同。
步骤S140：对N组第二数据序列进行傅里叶逆变换，得到一组数据序列，在时频资源上传输一组数据序列。
在一实施例中，对N组第二数据序列中每列的数据进行补零过采样的傅里叶逆变换，得到一组数据序列，在时频资源上传输一组数据序列。
在一实施例中，N组第二数据序列中列数相同的数据组成第三数据序列，步骤S140至少包括但不限于以下步骤：
根据N组第二数据序列中列数相同的数据，得到X组第三数据序列。其中，X为第二数据序列的数据个数，即第三数据序列的组数与第二数据序列的数据个数相同。
对X组第三数据序列分别进行傅里叶逆变换，得到X个子符号。
在时域上串联X个子符号，得到一组第四数据序列。
在时域上传输第四数据序列。
在一实施例中，每组第三数据序列进行傅里叶逆变换的点数与对应组中包含的数据个数相同。
在一实施例中，每组第三数据序列进行傅里叶逆变换的点数大于N。
在一实施例中，对第四数据序列进行滤波或加窗。
在一实施例中，滤波为单相滤波或多相滤波，其中，多相滤波是对第三数据序列进行傅里叶逆变换后得到的X个子符号分别进行滤波，使其在时域串联叠加后的结果达到一次IFFT的结果相同。
在一实施例中，多相滤波所使用的滤波函数至少包括但不限于以下任一：根升余弦函数、升余弦函数、矩形函数、IOTA(Isotropic Orthogonal Transform Algorithm)函数等。
在一实施例中，对第四数据序列进行加窗包括：对第四数据序列进行分组，分组后进行周期延拓，再点乘预设函数，最后各组之间进行错位叠加。
通过上述设置，能够使得两次傅里叶逆变换与一次傅里叶逆变换的效果等价，从而实现对数据分组进行两次傅里叶逆变换，减少计算复杂度，提高处理效率。
以图3为例，进行示例性地说明。图3是本申请一实施例提供的数据传输过程的示意图，如图3所示：
在本示例中，将待传输数据分为4组，每组数据均包含28个数据，在每组数据的首部加入第一参考序列，每组数据之间的第一参考序列相同，其中，第一参考序列包含2个数据；在每组数据的尾部加入第二参考序列，每组数据之间的第二参考序列相同，其中，第二参考序列包含2个数据；得到4组第一数据序列，每组第一参考序列的数据个数相同，均包含32个数据，且均满足2的i次幂(2的5次幂)。
对每组第一数据序列均进行32点的IFFT处理，得到4组第二数据序列。根据4组第二数据序列中列数相同的数据，得到32组第三数据序列。分别对32组第三数据序列进行过采样的IFFT处理，得到32个子符号，将32个子符号在时域上串联形成一组时域传输数据序列，即第四数据序列。在时频资源上传输上述的第四数据序列。
通过加入第一参考序列和第二参考序列，能够在发生干扰或重叠时，根据参考序列将干扰或重叠部分求出来，补偿子带间干扰，减少保护间隔，提高频谱效率；还通过对待传输数据分组进行两次傅里叶逆变换，最终两次IFFT的结果能够与一次IFFT的结果相同，从而降低处理复杂度，提高处理效率。
以图4为例，进行示例性地说明。图4是本申请一实施例提供的星座点调制数据传输过程的示意图，如图4所示：
在本示例中，待传输数据为星座点调制数据，其中，星座点调制数据的前段部分和后端部分带有参考信号数据。将星座点调制数据分成4组，每组数据均包含28个数据，其中，参考信号数据被分别被分在第一组和第4组。在每组数据的首部加入第一参考序列，每组数据之间的第一参考序列相同，其中，第一参考序列包含2个数据；在每组数据的尾部加入第二参考序列，每组数据之间的第二参考序列相同，其中，第二参考序列包含2个数据；得到4组第一数据序列，每组第一参考序列的数据个数相同，均包含32个数据，且均满足2的i次幂(2的5次幂)。
对每组第一数据序列均进行32点的IFFT处理，得到4组第二数据序列。根据4组第二数据序列中列数相同的数据，得到32组第三数据序列。分别对32组第三数据序列进行过采 样的IFFT处理，得到32个子符号，将32个子符号在时域上串联形成一组时域传输数据序列，即第四数据序列。在时频资源上传输上述的第四数据序列。
可以理解的是，待传输数据本身携带的参考信号数据并不会与第一参考序列和第二参考序列相互影响，本申请的数据传输方法同样适用于携带参考信号数据的待传输数据或其他经过调制的频域数据。
以图5为例，进行示例性地说明。图5是本申请一实施例提供的二次傅里叶逆变换的数据传输过程的示意图，如图5所示：
在本示例中，将待传输数据分为4组，每组数据均包含28个数据，在每组数据的首部加入第一参考序列，每组数据之间的第一参考序列相同，其中，第一参考序列包含2个数据；在每组数据的尾部加入第二参考序列，每组数据之间的第二参考序列相同，其中，第二参考序列包含2个数据；得到4组第一数据序列，每组第一参考序列的数据个数相同，均包含32个数据，且均满足2的i次幂(2的5次幂)。
分别对每组第一数据序列均进行32点的IFFT处理，得到4组第二数据序列。将4组第二数据序列分别放在4行，按照列取出4个数据，得到一个第三数据序列，例如，将4组第二数据序列的第一列的数据取出得到一个第三数据序列；对一个第三数据序列进行一次过采样的IFFT处理得到一个子符号，例如，由每组第二数据序列的第一列的数据形成的第三数据进行一次过采样的IFFT得到子符号1。依次类推，根据4组第二数据序列中列数相同的数据，得到32组第三数据序列。分别对32组第三数据序列进行过采样的IFFT处理，得到32个子符号(子符号1、子符号2……子符号32)，将32个子符号在时域上串联形成一组时域传输数据序列，即第四数据序列。在时频资源上传输上述的第四数据序列。
可以理解的是，上述图3、图4、图5的示例中，第一数据序列每组的数据个数相同，且满足2的i次幂(2的5次幂)，能够更方便地进行IFFT的计算，提升处理效率，另外，还可以对不同子载波间隔的数据一起进行IFFT和滤波器处理。
图6为本申请另一实施例提供的数据传输方法的流程图。如图6所示，该数据传输方法可以但不限于应用于基站、终端或如图1提供的通信系统中。在图6的实施例中，该数据传输方法可以包括但不限于步骤S210、S220、S230、S240、S250、S260、S270。
步骤S210：将待传输数据分成N组，N为大于等于2的整数。
在一实施例中，将待传输数据分成N组，其中，每组数据的数据个数相同。
步骤S220：在每组数据首部添加第一参考序列，在每组数据尾部添加第二参考序列，得到N组第一数据序列，其中，每组第一数据序列包含的数据个数为2的i次幂。
在一实施例中，待传输数据包括星座点调制的数据。
可以想到的是，除了上述的星座点调制的数据，本申请的待传输数据还可以包括其他包含有参考信号的数据；本申请能够对本身包含有参考信号的数据连带着参考信号分组后，对每组首尾部分别添加第一参考序列和第二参考序列，以及进行后续操作，待传输数据中的参考信号数据不会和第一参考序列及第二参考序列之间产生影响。
在一实施例中，第一参考序列和第二参考序列均为已知序列。在后续对处理后的数据进行滤波处理时，通过频域的参考序列，即使每组数据之间存在一定的重叠干扰，也可以根据 已知的第一序列和第二序列将重叠干扰部分求出，避免加入过大的保护间隔占用资源。
在一实施例中，第一参考序列和第二参考序列相同。可以理解的是，第一参考序列和第二参考序列相同可以是数据个数相同，也可以是数据个数及数据内容均相同。第一参考序列和第二参考序列相同能够方便地根据参考序列求重叠干扰
在一实施例中，N组数据序列中，至少部分组包含的数据个数至少满足以下条件之一：数据个数相同；数据个数之比为2的i次幂。可以理解的是，本实施例中的数据个数相同或数据个数之比为2的i次幂的情况与上述实施例中的步骤S120的相关实施例中相同，在此不做赘述。
在一实施例中，N组第一数据序列分别在N个频域资源块中传输；每个资源快分别包括子载波，其中，子载波个数等于每组数据序列中包含数据的个数。
步骤S230：对N组第一数据序列分别进行傅里叶逆变换，根据N组变换后的第一数据序列和M组第五数据序列，得到P组第二数据序列，其中，M为正整数，P为N与M之和，P组第二数据序列包含的数据个数相同。
在一实施例中，第五数据序列为非本次待传输数据生成的数据序列，可以为单载波或多载波数据，也可以为不同子载波间隔的数据。第五数据序列可以包括频域的第一参考序列和第二参考序列，也可以不包括频率的第一参考序列和第二参考序列。
在一实施例中，M组第五数据序列为时域数据，直接与N组进行过一次傅里叶逆变换的第一数据序列组成P组第二数据序列，其中，P为M与N之和，M、N、P均为正整数。进一步地，第五数据序列的数据个数与进行过一次傅里叶逆变换的第一数据序列的数据个数相同，即第五数据序列与经过一次傅里叶变换的第一数据序列的长度相同。
在另一实施例中，M组第五数据序列为频域数据，M组第五数据序列与N组第一数据序列一起，分别傅里叶逆变换，得到P组第二数据序列。进一步地，第五数据序列的数据个数与第一数据序列的数据个数相同，即第五数据序列与第一数据序列的长度相同。
在另一实施例中，M组第五数据序列为频域数据直接与N组进行过一次傅里叶逆变换的第一数据序列组成P组第二数据序列，其中，P为M与N之和，M、N、P均为正整数。进一步地，第五数据序列的数据个数与第一数据序列的数据个数相同，即第五数据序列与第一数据序列的长度相同。
在一实施例中，每组第一数据序列进行傅里叶逆变换的点数与对应组中包含的数据个数相同，每组第五数据序列进行傅里叶逆变换的点数与对应组中包含的数据个数相同。
步骤S240：根据P组第二数据序列中列数相同的数据，得到X组第三数据序列。其中，X为第二数据序列的数据个数，即第三数据序列的组数与第二数据序列的数据个数相同。
步骤S250：对X组第三数据序列分别进行傅里叶逆变换，得到X个子符号。
在一实施例中，每组第三数据序列进行傅里叶逆变换的点数与对应组中包含的数据个数相同。
在一实施例中，每组第三数据序列进行傅里叶逆变换的点数大于N。
步骤S260：在时域上串联X个子符号，得到一组第四数据序列。
步骤S270：在时域上传输第四数据序列。
以图7为例，进行示例性地说明。图7是本申请另一实施例提供的数据传输过程的示意图，如图7所示：
在本示例中，将待传输数据分为4组，每组数据均包含28个数据，在每组数据的首部加入第一参考序列，每组数据之间的第一参考序列相同，其中，第一参考序列包含2个数据；在每组数据的尾部加入第二参考序列，每组数据之间的第二参考序列相同，其中，第二参考序列包含2个数据；得到4组第一数据序列，每组第一参考序列的数据个数相同，均包含32个数据，且均满足2的i次幂(2的5次幂)。
对每组第一数据序列均进行32点的IFFT处理，并和其他组数据序列(即第五数据序列)一起组成若干组第二数据序列，设有4组其他组数据序列，即4组进行32点IFFT处理的第一数据序列和4组其他组数据序列组成8组第二数据序列。其中，其他组数据序列的长度与第一数据序列的长度相同，即数据个数相同；其他组数据序列不属于该待传输数据生成的数据序列，可以为单载波或多载波数据，也可以为不同子载波间隔的数据，可以没有频域的相同首尾序列(第一参考序列和第二参考序列)。
根据8组第二数据序列中列数相同的数据，得到32组第三数据序列，每组第三数据序列包括8个数据。分别对32组第三数据序列进行过采样的IFFT处理，得到32个子符号，将32个子符号在时域上串联形成一组第四数据序列。在时频资源上传输上述的第四数据序列。
本申请的数据传输方法在第一IFFT后也可以引入其他数据一起进行第二次IFFT并传输，不会对当前需要发送的待发送数据造成干扰。
图8为本申请另一实施例提供的数据传输方法的流程图。如图8所示，该数据传输方法可以但不限于应用于基站、终端或如图1提供的通信系统中。在图8的实施例中，该数据传输方法可以包括但不限于步骤S310、S320、S330、S340、S350、S360、S370、S380。
步骤S310：将待传输数据分成N组，N为大于等于2的整数。
在一实施例中，待传输数据分成N组数据，其中，至少一组数据的数据个数与其他组数据的数据个数不同。示例性地，将待传输数据分为4组，其中，第一组数据的数据个数为14，其余组数据的数据个数为28；又或者，将待传输数据分为4组，其中，第一组数据和第二组数据的数据个数为14，其余组数据的数据个数为28，在此不做具体限定。
步骤S320：在每组数据首部添加第一参考序列，在每组数据尾部添加第二参考序列，得到N组第一数据序列，其中，每组第一数据序列包含的数据个数为2的i次幂。
在一实施例中，待传输数据包括星座点调制的数据。
可以想到的是，除了上述的星座点调制的数据，本申请的待传输数据还可以包括其他包含有参考信号的数据；本申请能够对本身包含有参考信号的数据连带着参考信号分组后，对每组首尾部分别添加第一参考序列和第二参考序列，以及进行后续操作，待传输数据中的参考信号数据不会和第一参考序列及第二参考序列之间产生影响。
在一实施例中，第一参考序列和第二参考序列均为已知序列。在后续对处理后的数据进行滤波处理时，通过频域的参考序列，即使每组数据之间存在一定的重叠干扰，也可以根据已知的第一序列和第二序列将重叠干扰部分求出，避免加入过大的保护间隔占用资源。
在一实施例中，第一参考序列和第二参考序列相同。可以理解的是，第一参考序列和第 二参考序列相同可以是数据个数相同，也可以是数据个数及数据内容均相同。第一参考序列和第二参考序列相同能够方便地根据参考序列求重叠干扰
在一实施例中，N组数据序列中，至少部分组包含的数据个数至少满足以下条件之一：数据个数相同；数据个数之比为2的i次幂。可以理解的是，本实施例中的数据个数相同或数据个数之比为2的i次幂的情况与上述实施例中的步骤S120的相关实施例中相同，在此不做赘述。
在一实施例中，N组第一数据序列分别在N个频域资源块中传输；每个资源快分别包括子载波，其中，子载波个数等于每组数据序列中包含数据的个数。
步骤S330：对N组第一数据序列，分别进行傅里叶逆变换，得到N组第六数据序列。
在一实施例中，每组第一数据序列进行傅里叶逆变换的点数与对应组中包含的数据个数相同。
步骤S340：对N组第六数据序列中的至少一组，添加时域数据，得到N组第二数据序列，其中时域数据为傅里叶逆变换生成的时域数据序列，N组第二数据序列包含的数据个数相同。
在一实施例中，时域数据为其他待发数据分组后得到的第一数据序列经过第一次IFFT得到的数据序列，添加时域数据的目的是为了对第六数据序列中数据个数较少的数据数列进行填充，使得每组第六数据序列的数据个数相同(即长度一致)。
在另一实施例中，时域数据为时域中其他需要发送的数据。
通过对第六数据序列添加时域中其他需要发送的数据，既能够满足形成的第二数据序列每组数据个数相同的条件，又能够提高资源利用率，提高传输效率。
在另一实施例中，时域数据还可以为空数据，相当于不对第六数据序列进行数据添加，空发子载波的效果。
步骤S350：根据N组第二数据序列中列数相同的数据，得到X组第三数据序列。其中，第三数据序列的组数与第二数据序列的数据个数相同。
步骤S360：对X组第三数据序列分别进行傅里叶逆变换，得到X个子符号。
在一实施例中，每组第三数据序列进行傅里叶逆变换的点数与对应组中包含的数据个数相同。
在一实施例中，每组第三数据序列进行傅里叶逆变换的点数大于N。
步骤S370：在时域上串联X个子符号，得到一组第四数据序列。
步骤S310：在时域上传输第四数据序列。
以图9为例，进行示例性地说明。图9是本申请另一实施例提供的数据传输过程的示意图，如图9所示：
在本示例中，将待传输数据分为4组，其中，第一组数据和第二组数据均包含14个数据，第三组数据和第四组数据均包含28个数据。在第一组数据和第二组数据的首部加入第一参考序列，每组数据之间的第一参考序列相同，其中，第一参考序列包含1个数据；在第一组数据和第二组数据的尾部加入第二参考序列，每组数据之间的第二参考序列相同，其中，第二参考序列包含1个数据；加入参考序列后的第一组数据和第二组数据均包含16个数据。在第 三组数据和第四组数据的首部分别加入第一参考序列，每组数据之间的第一参考序列相同，其中第一参考序列包含2个数据；在第三组数据和第四组数据的尾部分别加入第二参考序列，每组数据之间的第二参考序列相同，其中第二参考序列包含2个数据；加入参考序列后的第三组数据和第四组数据均包含32个数据。即得到4组第一数据序列，其中两组第一数据序列包含16个数据，另外两组第一数据序列包含32个数据，每组第一数据序列之间数据个数比为1：1：2：2，顺序为第一组到第四组，个数之比满足2的i次幂(2的0次幂和2的1次幂)。
对前两组第一数据序列分别进行16点的IFFT处理，对后两组的第一数据序列分别进行32点的IFFT处理，得到4组第六数据序列。将第一组第六数据序列与同长度的其他待发送的时域数据序列串联，即图9中，符号1和符号2串联，得到第一组第二数据序列；将第二组第六数据序列与同长度的其他待发送的时域数据序列串联，得到第二组第二数据序列；最终得到4组数据个数相同的第二数据序列。
根据4组第二数据序列中列数相同的数据，得到32组第三数据序列。分别对32组第三数据序列进行过采样的IFFT处理，得到32个子符号，将32个子符号在时域上串联形成一组时域传输数序列，即第四数据序列。在时频资源上传输上述的第四数据序列。
通过用待发送的时域数据填充较短的第六数据序列，以得到数据个数相同的多组第二数据序列，同时还能够提高资源利用率。
图10为本申请一实施例提供的数据处理方法的流程图。如图10所示，该数据传输方法可以但不限于应用于基站、终端或如图1提供的通信系统中。在图10的实施例中，该数据处理方法可以包括但不限于步骤S410、S420。
步骤S410：将待传输数据分成N组，N为大于等于2的整数。
步骤S420：在每组数据首部添加第一参考序列，在每组数据尾部添加第二参考序列，得到N组数据序列，其中，每组数据序列包含的数据个数为2的i次幂。
在一实施例中，N组数据序列中，至少部分数据序列包含的数据个数满足以下条件之一：数据个数相同；数据个数之比为2的i次幂。
在一实施例中，第一参考序列与第二参考序列相同。
在一实施例中，步骤S420包括：在每组数据首部添加第一参考序列，在每组数据尾部添加第二参考序列，得到N组第一数据序列，其中，N组第一数据序列中每组包含的数据个数为2的i次幂。
可以理解的是，本申请实施例的数据处理方法与上述实施例中的数据传输方法中的对应步骤实施细节相同，在此不做赘述。
图11是本申请一实施例提供的通信设备的结构示意图。如图11所示，该通信设备2000包括存储器2100、处理器2200。存储器2100、处理器2200的数量可以是一个或多个，图11中以一个存储器2101和一个处理器2201为例；网络设备中的存储器2101和处理器2201可以通过总线或其他方式连接，图11中以通过总线连接为例。
存储器2101作为一种计算机可读存储介质，可用于存储软件程序、计算机可执行程序以及模块，如本申请任一实施例提供的方法对应的程序指令/模块。处理器2201通过运行存储 在存储器2101中的软件程序、指令以及模块实现上述任一实施例提供的数据传输方法或数据处理方法。
存储器2101可主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序。此外，存储器2101可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件或其他非易失性固态存储器件。在一些实例中，存储器2101进一步包括相对于处理器2201远程设置的存储器，这些远程存储器可以通过网络连接至设备。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
本申请一实施例还提供了一种计算机可读存储介质，存储有计算机可执行指令，该计算机可执行指令用于执行如本申请任一实施例提供的数据传输方法或数据处理方法。
本申请一实施例还提供了一种计算机程序产品，包括计算机程序或计算机指令，该计算机程序或计算机指令存储在计算机可读存储介质中，计算机设备的处理器从计算机可读存储介质读取计算机程序或计算机指令，处理器执行计算机程序或计算机指令，使得计算机设备执行如本申请任一实施例提供的数据传输方法或数据处理方法。
本申请实施例描述的系统架构以及应用场景是为了更加清楚的说明本申请实施例的技术方案，并不构成对于本申请实施例提供的技术方案的限定，本领域技术人员可知，随着系统架构的演变和新应用场景的出现，本申请实施例提供的技术方案对于类似的技术问题，同样适用。
本领域普通技术人员可以理解，上文中所公开方法中的全部或某些步骤、系统、设备中的功能模块/单元可以被实施为软件、固件、硬件及其适当的组合。
在硬件实施方式中，在以上描述中提及的功能模块/单元之间的划分不一定对应于物理组件的划分；例如，一个物理组件可以具有多个功能，或者一个功能或步骤可以由若干物理组件合作执行。某些物理组件或所有物理组件可以被实施为由处理器，如中央处理器、数字信号处理器或微处理器执行的软件，或者被实施为硬件，或者被实施为集成电路，如专用集成电路。这样的软件可以分布在计算机可读介质上，计算机可读介质可以包括计算机存储介质(或非暂时性介质)和通信介质(或暂时性介质)。如本领域普通技术人员公知的，术语计算机存储介质包括在用于存储信息(诸如计算机可读指令、数据结构、程序模块或其他数据)的任何方法或技术中实施的易失性和非易失性、可移除和不可移除介质。计算机存储介质包括但不限于RAM、ROM、EEPROM、闪存或其他存储器技术、CD-ROM、数字多功能盘(DVD)或其他光盘存储、磁盒、磁带、磁盘存储或其他磁存储装置、或者可以用于存储期望的信息并且可以被计算机访问的任何其他的介质。此外，本领域普通技术人员公知的是，通信介质通常包含计算机可读指令、数据结构、程序模块或者诸如载波或其他传输机制之类的调制数据信号中的其他数据，并且可包括任何信息递送介质。
在本说明书中使用的术语“部件”、“模块”、“系统”等用于表示计算机相关的实体、硬件、固件、硬件和软件的组合、软件、或执行中的软件。例如，部件可以是但不限于，在处理器上运行的进程、处理器、对象、可执行文件、执行线程、程序或计算机。通过图示，在计算设备上运行的应用和计算设备都可以是部件。一个或多个部件可驻留在进程或执行线程中， 部件可位于一个计算机上或分布在2个或更多个计算机之间。此外，这些部件可从在上面存储有各种数据结构的各种计算机可读介质执行。部件可例如根据具有一个或多个数据分组(例如来自于自与本地系统、分布式系统或网络间的另一部件交互的二个部件的数据，例如通过信号与其它系统交互的互联网)的信号通过本地或远程进程来通信。
以上参照附图说明了本申请的一些实施例，并非因此局限本申请的权利范围。本领域技术人员不脱离本申请的范围和实质内所作的任何修改、等同替换和改进，均应在本申请的权利范围之内。

Claims (23)

  1. 一种数据传输方法，所述方法包括：
    将待传输数据分成N组，N为大于等于2的整数；
    在每组数据首部添加第一参考序列，在每组数据尾部添加第二参考序列，得到N组第一数据序列；
    对所述N组第一数据序列分别进行傅里叶逆变换，得到N组第二数据序列；
    对所述N组第二数据序列进行傅里叶逆变换，得到一组数据序列，在时频资源上传输所述一组数据序列。
  2. 根据权利要求1所述的方法，其中，所述对所述N组第二数据序列进行傅里叶逆变换，包括：
    对所述N组第二数据序列中每列的数据进行补零过采样的傅里叶逆变换。
  3. 根据权利要求1所述的方法，其中：
    所述每组第一数据序列包含的数据个数为2的i次幂。
  4. 根据权利要求1或3所述的方法，其中：
    所述N组第二数据序列包含的数据个数相同或数据个数之比为2的i次幂。
  5. 根据权利要求1至3任一项所述的方法，其中，所述对所述N组第二数据序列进行傅里叶逆变换，得到一组数据序列，在时频资源上传输所述一组数据序列包括：
    根据所述N组第二数据序列中列数相同的数据，得到X组第三数据序列，其中，X为所述第二数据序列的列数；
    对所述X组第三数据序列分别进行傅里叶逆变换，得到X个子符号；
    在时域上串联X个子符号，得到一组第四数据序列；
    在时域上传输第四数据序列。
  6. 根据权利要求1所述的方法，其中：
    所述待传输数据至少包括以下之一：
    星座点调制的数据；
    参考信号数据。
  7. 根据权利要求1所述的方法，其中：
    所述N组第一数据序列中的，至少部分组包含的数据个数满足以下条件之一：
    数据个数相同；
    数据个数之比为2的i次幂。
  8. 根据权利要求1或6所述的方法，其中：
    所述第一参考序列至少满足以下条件之一：
    每组数据首部添加的所述第一参考序列的数据相同；
    每组数据首部添加的所述第一参考序列至少包含R个数据，R为正整数，所述R个数据在每组之间相同。
  9. 根据权利要求1或6所述的方法，其中：
    所述第二参考序列至少满足以下条件之一：
    每组数据首部添加的所述第二参考序列的数据相同；
    每组数据首部添加的所述第二参考序列至少包含Q个数据，Q为正整数，所述Q个数据在每组之间相同。
  10. 根据权利要求1或6所述的方法，其中：
    所述N组第一数据序列分别在N个频域资源块中传输；
    所述每个资源块分别包括子载波，其中，所述子载波个数等于每组数据序列中包含数据的个数。
  11. 根据权利要求1或2所述的方法，其中：
    所述对所述N组第一数据序列分别进行傅里叶逆变换时，每组傅里叶逆变换数据的零频位置在对应的频域资源块内，每组傅里叶逆变换数据进行傅里叶逆变换时的零频位置不同，所述零频位置分别在每组傅里叶逆变换数据对应的频域资源块的子载波中的一个。
  12. 根据权利要求11所述的方法，其中：
    所述每组傅里叶逆变换数据对应的频域资源块为信道带宽里的全部或部分频域资源块，所述待传输数据为信道带宽里的全部或部分待传输数据。
  13. 根据权利要求1或6所的方法，其中：每组数据序列进行傅里叶逆变换的点数与对应组中包含的数据个数相同；每组数据序列进行傅里叶逆变换的点数之比为2的i次幂，其中，i为整数。
  14. 根据权利要求1或6所的方法，其中，所述在时域上传输第四数据序列包括：对所述第四数据序列进行滤波或加窗。
  15. 根据权利要求1所述的方法，其中：
    所述对所述N组第二数据序列进行傅里叶逆变换，包括：
    根据所述N组第二数据序列和M组第五数据序列组成P组第六数据序列，对所述P组第六数据序列每列的数据进行补零过采样的傅里叶逆变换，其中，M为正整数，P为N与M之和。
  16. 根据权利要求1所述的方法，其中：
    所述对所述N组第二数据序列进行傅里叶逆变换，包括：
    对所述N组第二数据序列中的至少一组，添加时域数据，得到N组第七数据序列，其中所述时域数据为傅里叶逆变换生成的时域数据序列，所述N组第七数据序列包含的数据个数相同；对所述N组第七数据序列每列的数据进行补零过采样的傅里叶逆变换。
  17. 一种数据处理方法，所述方法包括：
    将待传输数据分成N组，N为大于等于2的整数；
    在每组数据首部添加第一参考序列，在每组数据尾部添加第二参考序列，得到N组第一数据序列；
    对所述N组第一数据序列分别进行傅里叶逆变换，得到N组第二数据序列；
    对所述N组第二数据序列进行傅里叶逆变换，得到一组数据序列。
  18. 根据权利要求17所述的方法，其中：
    所述N组第一数据序列的数据个数为2的i次幂，且至少部分组包含的数据个数满足以下条件之一：
    数据个数相同；
    数据个数之比为2的i次幂。
  19. 根据权利要求17或18所述的方法，其中：
    所述第一参考序列至少满足以下条件之一：
    每组数据首部添加的所述第一参考序列的数据相同；
    每组数据首部添加的所述第一参考序列至少包含R个数据，R为正整数，所述R个数据在每组之间相同。
  20. 根据权利要求17或18所述的方法，其中：
    所述第二参考序列至少满足以下条件之一：
    每组数据首部添加的所述第二参考序列的数据相同；
    每组数据首部添加的所述第二参考序列至少包含Q个数据，Q为正整数，所述Q个数据在每组之间相同。
  21. 一种通信设备，包括：存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，所述处理器执行所述计算机程序时实现如权利要求1至16中任意一项所述数据传输方法，或如权利要求17至20中任意一项所述数据处理方法。
  22. 一种计算机可读存储介质，所述计算机可读存储介质存储有计算机可执行指令，所述计算机可执行指令用于执行如权利要求1至16中任意一项所述数据传输方法，或如权利要求17至20中任意一项所述数据处理方法。
  23. 一种计算机程序产品，包括计算机程序或计算机指令，所述计算机程序或所述计算机指令存储在计算机可读存储介质中，计算机设备的处理器从所述计算机可读存储介质读取所 述计算机程序或所述计算机指令，所述处理器执行所述计算机程序或所述计算机指令，使得所述计算机设备执行如权利要求1至16中任意一项所述数据传输方法，或如权利要求17至20中任意一项所述数据处理方法。
PCT/CN2023/099710 2022-10-24 2023-06-12 数据传输方法、数据处理方法、通信设备、介质及产品 WO2024087649A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202211307244.5 2022-10-24
CN202211307244.5A CN117979424A (zh) 2022-10-24 2022-10-24 数据传输方法、数据处理方法、通信设备、介质及产品

Publications (1)

Publication Number Publication Date
WO2024087649A1 true WO2024087649A1 (zh) 2024-05-02

Family

ID=90829890

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/099710 WO2024087649A1 (zh) 2022-10-24 2023-06-12 数据传输方法、数据处理方法、通信设备、介质及产品

Country Status (2)

Country Link
CN (1) CN117979424A (zh)
WO (1) WO2024087649A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107733566A (zh) * 2016-08-12 2018-02-23 法国矿业电信学校联盟/法国国立高等电信布列塔尼学院 数字编码器及编码方法
CN108737310A (zh) * 2017-04-25 2018-11-02 华为技术有限公司 处理信号的方法和装置
CN111510412A (zh) * 2019-01-30 2020-08-07 中兴通讯股份有限公司 一种数据调制方法、装置和设备
CN111901279A (zh) * 2020-07-07 2020-11-06 中兴通讯股份有限公司 数据传输方法、装置、设备和存储介质
WO2022007699A1 (zh) * 2020-07-07 2022-01-13 中兴通讯股份有限公司 数据调制方法、通信设备及存储介质

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107733566A (zh) * 2016-08-12 2018-02-23 法国矿业电信学校联盟/法国国立高等电信布列塔尼学院 数字编码器及编码方法
CN108737310A (zh) * 2017-04-25 2018-11-02 华为技术有限公司 处理信号的方法和装置
CN111510412A (zh) * 2019-01-30 2020-08-07 中兴通讯股份有限公司 一种数据调制方法、装置和设备
CN111901279A (zh) * 2020-07-07 2020-11-06 中兴通讯股份有限公司 数据传输方法、装置、设备和存储介质
WO2022007699A1 (zh) * 2020-07-07 2022-01-13 中兴通讯股份有限公司 数据调制方法、通信设备及存储介质

Also Published As

Publication number Publication date
CN117979424A (zh) 2024-05-03

Similar Documents

Publication Publication Date Title
WO2020238573A1 (zh) 信号处理方法及装置
IL264474B2 (en) Information transmission method and information transmission device
CN115001923B (zh) 基于序列的信号处理方法及装置
WO2020155889A1 (zh) 通信方法及装置
WO2021223503A1 (zh) 资源分配方法、设备和存储介质
EP3716558A1 (en) Data transmission method and device
TW201822560A (zh) 傳輸資訊的方法、終端設備和網路設備
CN112532368B (zh) 基于序列的信号处理方法及信号处理装置
CN111565458B (zh) 一种下行传输方法及其装置
JP7463477B2 (ja) 系列に基づく信号処理方法および装置
CN106470179B (zh) 移动终端上行信号生成方法及装置
US10999108B2 (en) Wireless communication method, apparatus, and system
TWI762531B (zh) 資源映射的方法和通訊設備
WO2021081831A1 (zh) 符号处理的方法与装置
WO2021000712A1 (zh) 符号处理的方法与装置
WO2024087649A1 (zh) 数据传输方法、数据处理方法、通信设备、介质及产品
WO2023093821A1 (zh) 通信方法及装置
CN109873783B (zh) 信息的发送方法及装置
WO2018126968A1 (zh) 一种信号发送、接收方法及装置
CN107682295B (zh) 信息传输、接收方法及装置、通信系统
AU2019472104B2 (en) Symbol processing method and apparatus
WO2023202667A1 (zh) 一种参考信号传输方法、装置及存储介质
WO2024113975A1 (zh) 数据调制方法、装置、介质及存储介质
WO2023143159A1 (zh) 一种符号处理的方法与装置
WO2023142825A1 (zh) 一种数据处理方法、装置及相关设备