WO2023213217A1 - 数据序列的形成方法、装置、存储介质及电子装置 - Google Patents

数据序列的形成方法、装置、存储介质及电子装置 Download PDF

Info

Publication number
WO2023213217A1
WO2023213217A1 PCT/CN2023/090919 CN2023090919W WO2023213217A1 WO 2023213217 A1 WO2023213217 A1 WO 2023213217A1 CN 2023090919 W CN2023090919 W CN 2023090919W WO 2023213217 A1 WO2023213217 A1 WO 2023213217A1
Authority
WO
WIPO (PCT)
Prior art keywords
frequency domain
domain resource
resource blocks
data
groups
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2023/090919
Other languages
English (en)
French (fr)
Inventor
辛雨
郁光辉
华健
暴桐
许进
胡留军
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to EP23799203.7A priority Critical patent/EP4521832A4/en
Priority to US18/863,080 priority patent/US20250310941A1/en
Priority to KR1020247035044A priority patent/KR20240161828A/ko
Publication of WO2023213217A1 publication Critical patent/WO2023213217A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • 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
    • 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/2602—Signal structure
    • H04L27/26025—Numerology, i.e. varying one or more of symbol duration, subcarrier spacing, Fourier transform size, sampling rate or down-clocking
    • 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/2602—Signal structure
    • H04L27/2604—Multiresolution systems
    • 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
    • H04L27/2633—Inverse Fourier transform modulators, e.g. inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators using partial FFTs
    • 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/2634—Inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators in combination with other circuits for modulation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0001—Arrangements for dividing the transmission path
    • H04L5/0003—Two-dimensional division
    • H04L5/0005—Time-frequency
    • H04L5/0007—Time-frequency the frequencies being orthogonal, e.g. OFDM(A) or DMT
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044—Allocation of payload; Allocation of data channels, e.g. PDSCH or PUSCH
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/0091—Signalling for the administration of the divided path, e.g. signalling of configuration information
    • H04L5/0094—Indication of how sub-channels of the path are allocated
    • 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/0457—Variable allocation of band or rate
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00—Arrangements affording multiple use of the transmission path
    • H04L5/003—Arrangements for allocating sub-channels of the transmission path
    • H04L5/0048—Allocation of pilot signals, i.e. of signals known to the receiver

Definitions

  • Embodiments of the present disclosure relate to the field of communications, and specifically, to a data sequence forming method, device, storage medium, and electronic device.
  • 5G NR Freth Generation New Radio
  • 5G NR Freth Generation New Radio
  • CP-OFDM Cyclic Prefix Orthogonal Frequency Division Multiplexing
  • cyclic prefix As the basic waveform.
  • CP-OFDM Cyclic Prefix Orthogonal Frequency Division Multiplexing
  • time offset the performance of the CP-OFDM system between adjacent sub-bands Frequency offset and time offset are relatively sensitive. This is mainly due to the relatively large spectrum leakage of the CP-OFDM system, which easily leads to inter-subband interference.
  • different parameter sets (Numerology) can be used between two adjacent sub-bands, which will destroy the orthogonality between sub-carriers and bring about new interference problems.
  • one of the more straightforward methods is to insert a guard bandwidth between two transmission bands with different numerologies, but this will waste frequency resources.
  • Embodiments of the present disclosure provide methods, devices, storage media, and electronic devices for forming a data sequence, to at least solve the problem in related technologies that interference between subbands easily occurs when the data sequence is filtered.
  • N frequency domain resource blocks used to transmit data to be transmitted are divided into two groups of frequency domain resource blocks.
  • N frequency domain resource blocks are divided into two groups of frequency domain resource blocks, and the two groups are distributed alternately.
  • the block bandwidths can be different, and waveform functions with different parameters can be used for windowing or filtering; the frequency domain resource block bandwidths in the same group are easier to equal, which is conducive to using the same waveform function for unified windowing or filtering, and Reduce processing complexity.
  • the alternating distribution method can ensure that the intervals between adjacent frequency domain resource blocks in the same group are equal and larger than the bandwidth of the frequency domain resource blocks.
  • the data to be transmitted of each resource block in the same group can be processed by oversampling inverse Fourier transform. The reciprocal of the time domain data interval is equal to the interval between adjacent resource blocks in the group. This can avoid interference from adjacent frequency domain resource blocks in the same group, thereby solving problems in related technologies such as interference between subbands that easily occurs when data sequences are filtered.
  • Figure 1 is a hardware structure block diagram of a computer terminal according to an optional data sequence forming method according to an embodiment of the present disclosure
  • Figure 2 is a flow chart of an optional data sequence forming method according to an embodiment of the present disclosure
  • Figure 3 is a schematic diagram of an optional data sequence forming method in Embodiment 1;
  • Figure 4 is another schematic diagram of an optional data sequence forming method in Embodiment 2;
  • Figure 5 is another schematic diagram of an optional data sequence forming method in Embodiment 3.
  • Figure 6 is a schematic diagram of an optional method of transmitting a set of time domain data sequences in Embodiment 4.
  • Figure 7 is a structural block diagram of an optional data sequence forming device according to an embodiment of the present disclosure.
  • FIG. 1 is a hardware structure block diagram of a computer terminal of an optional data sequence forming method according to an embodiment of the present disclosure.
  • the computer terminal may include one or more (only one is shown in Figure 1) 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) and a memory 104 configured to store data, wherein the above-mentioned computer terminal may also include a transmission device 106 configured as a communication function and an input and output device 108.
  • Figure 1 is only illustrative, and it does not limit the structure of the above-mentioned computer terminal.
  • the computer terminal 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 computer programs, for example, software programs and modules of application software, such as computer programs corresponding to the methods for forming data sequences in embodiments of the present disclosure.
  • the processor 102 stores the data in the memory 104 by running
  • the computer program in the computer is used to perform various functional applications and data processing, that is, to implement 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 mobile terminal 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 mobile terminal.
  • the transmission device 106 includes a network adapter (Network Interface Controller, NIC for short), 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 for short) module, which is configured to communicate with the Internet wirelessly.
  • NIC Network Interface Controller
  • FIG. 2 is a flow chart of a method for forming a data sequence according to an embodiment of the present disclosure. As shown in Figure 2, the process includes follow these steps:
  • Step S204 Process the data to be transmitted on the L(m) frequency domain resource blocks in each group to form L(m) groups of data sequences.
  • N frequency domain resource blocks used to transmit data to be transmitted are divided into two groups of frequency domain resource blocks, each group contains L (m) frequency domain resource blocks, and these two groups of frequency domain resource blocks are interleaved in the frequency domain.
  • N frequency domain resource blocks are divided into two groups of frequency domain resource blocks, and the two groups can be distributed alternately. In this way, the frequency domain resource block bandwidths between different groups can be different, and waveform functions with different parameters can be used.
  • the alternating distribution method can ensure that the intervals between adjacent frequency domain resource blocks in the same group are equal and larger than the bandwidth of the frequency domain resource blocks.
  • the data to be transmitted of each resource block in the same group can be processed by oversampling inverse Fourier transform.
  • the reciprocal of the time domain data interval is equal to the interval between adjacent resource blocks in the group. This can avoid interference from adjacent frequency domain resource blocks in the same group, thereby solving problems in related technologies such as interference between subbands that easily occurs when data sequences are filtered.
  • step S202 "Divide the N frequency domain resource blocks used to transmit the data to be transmitted into two groups"
  • the advantage of dividing the N frequency domain resource blocks into two groups is because: (1) The frequency domain resource block bandwidths between different groups can be different, and waveform functions with different parameters can be used for windowing or filtering. (2) The frequency domain resource block bandwidths within the same group are easier to equalize, which facilitates unified windowing or filtering using the same waveform function and reduces processing complexity. (3) The two groups can be distributed alternately.
  • This method can ensure that the spacing between adjacent frequency domain resource blocks in the same group is equal and greater than the frequency domain resource block bandwidth; or, it can ensure that the spacing of each resource block in the same group to be transmitted.
  • the reciprocal of the time domain data interval after the data undergoes oversampling inverse Fourier transform is equal to the interval between adjacent resource blocks in the group, which can avoid interference from adjacent frequency domain resource blocks in the same group.
  • step S204 Provides the data to be transmitted on the L (m) frequency domain resource blocks in each group separately to form
  • the processing includes: inverse Fourier transform.
  • the inverse Fourier transform is an oversampling inverse Fourier transform, an inverse fast Fourier transform IFFT of the inverse Fourier transform
  • IFFT inverse fast Fourier transform size
  • the number of (inverse fast Fourier transform) points or the number of IDFT (inverse discrete Fourier transform) points is greater than or equal to k(n).
  • the number of IFFT points is also called the inverse fast Fourier transform size (IFFT size).
  • the number of IFFT points is less than the sum of the number of subcarriers included in the N frequency domain resource blocks.
  • an inverse Fourier transform is performed on a certain frequency domain resource block, and the zero frequency position during the inverse Fourier transform operation is within the range of this frequency domain resource block.
  • the zero frequency positions during the inverse Fourier transform operation of different frequency domain resource blocks are different.
  • an inverse Fourier transform is performed on a certain frequency domain resource block.
  • the zero frequency position (or zero subcarrier) during the inverse Fourier transform operation is respectively in one of the k (n) subcarriers of each resource block. .
  • the data to be transmitted undergoes inverse Fourier transform to form a set of data sequences
  • the data to be transmitted on L(m) frequency domain resource blocks undergo inverse Fourier transform to form L(m) sets of data sequences.
  • fast Fourier transform FFT fast Fourier transform
  • discrete Fourier transform DFT discrete Fourier Transform
  • the method further includes: processing the L(m) groups of data sequences to form a group of data sequences; processing the two groups of frequency domain resource blocks corresponding to the group of data sequences.
  • the data sequence is processed to form a combined set of data sequences; the combined set of data sequences is transmitted.
  • each group forms a set of data sequences.
  • L (m) groups of data sequences are processed to form a group of data sequences.
  • This processing includes an inverse Fourier transform, where the inverse Fourier transform is an oversampled Fourier transform. Inverse leaf transform, and the number of IFFT points of the inverse Fourier transform is greater than L(m).
  • this inverse Fourier transform is: perform an inverse Fourier transform for every L(m) data, and each L(m) data comes from L(m) groups of data sequences, for example, L(m) ) group of data sequences are in L(m) rows, then L(m) data are extracted according to columns, and an inverse Fourier transform is performed on each L(m) data extracted.
  • L(m) groups of data sequences also includes adding multiple groups of zero data sequences, and then performing Fourier transformation. Inverse leaf transform.
  • a set of data sequences is a set of time-domain data sequences, which are serially connected by multiple time-domain data sequences generated by inverse Fourier transforms.
  • the two sets of data sequences corresponding to the two sets of frequency domain resource blocks are processed to form a combined set of data sequences.
  • This processing includes: combining the two sets of data sequences.
  • a set of data sequences is formed by adding the above set of data sequences.
  • the N frequency domain resource blocks used to transmit data to be transmitted are divided into two groups, then since the frequency domain resource block bandwidths may be different between different groups, waveform functions with different parameters can be used for addition. Windowing or filtering; In addition, the bandwidth of frequency domain resource blocks in the same group is easier to equal, which is conducive to using the same waveform function for unified windowing or filtering and reducing processing complexity; further, the two groups can Alternating distribution, this method can ensure that the intervals between adjacent frequency domain resource blocks in the same group are equal and larger than the frequency domain resource block bandwidth; or, it can also achieve that the data to be transmitted for each resource block in the same group is oversampled Fourier The reciprocal of the time domain data interval after inverse transformation is equal to the interval between adjacent resource blocks in the group, which can avoid interference from adjacent frequency domain resource blocks in the same group.
  • adding the two sets of data sequences to form a set of data sequences also includes, in the adding operation Before operation, perform dot multiplication operation on at least one set of data sequences.
  • the sequence to be multiplied by the dot multiplication operation is a sequence whose phases change sequentially with equal modulo.
  • adding the two groups of data sequences to form a group of data sequences also includes, before the addition operation, performing a windowing operation or filtering operation on the group of data sequences in each group.
  • a windowing operation or a filtering operation is performed on the two groups of filter functions using different parameters.
  • transmitting the set of data sequences further includes filtering the set of data sequences.
  • transmitting the set of data sequences further includes filtering each frequency domain resource block using the same waveform function.
  • the filtering is single-phase filtering or polyphase filtering.
  • filter functions used in the polyphase filtering include: root raised cosine function, or raised cosine function, or rectangular function, or IOTA (Isotropic Orthogonal Transform Algorithm) function, or 1+D function, etc.
  • transmitting the set of data sequences further includes performing a windowing operation on the set of data sequences.
  • transmitting the set of data sequences further includes filtering each frequency domain resource block using the same waveform function through a windowing operation or a polyphase filtering operation.
  • the data to be transmitted includes constellation point modulated data and reference signal data.
  • the frequency domain resource block bandwidths may be different between different groups, waveform functions with different parameters can be used for windowing or filtering; the frequency domain resource block bandwidths within the same group are easier to equal, which is conducive to using the same
  • the waveform function can be windowed or filtered uniformly, and the processing complexity can be reduced.
  • the alternating distribution method can ensure that the intervals between adjacent frequency domain resource blocks in the same group are equal and larger than the bandwidth of the frequency domain resource blocks.
  • the data to be transmitted of each resource block in the same group can be processed by oversampling inverse Fourier transform. The reciprocal of the time domain data interval is equal to the interval between adjacent resource blocks in the group.
  • the method further includes: the N frequency domain resource blocks are continuously distributed in the frequency domain.
  • the method further includes: the L (m) frequency domain resource blocks of each group are not continuous in the frequency domain, but the spectrum intervals of adjacent frequency domain resource blocks are equal.
  • the method further includes: the frequency domain resource block bandwidth of at least one group of frequency domain resource blocks in the two groups of frequency domain resource blocks is the spectrum of adjacent frequency domain resource blocks in the group. 1/w of the interval, w is a positive integer.
  • the method further includes: The adjacent data time domain interval of the data sequence of at least one group of frequency domain resource blocks in the two groups of frequency domain resource blocks is equal to the reciprocal of the spectrum interval of adjacent resource blocks in the group.
  • the method further includes: the subcarrier intervals of the N frequency domain resource blocks are all equal.
  • the method further includes: among the L (m) frequency domain resource blocks in each group, each frequency domain resource block contains an equal number of subcarriers.
  • the method further includes: in the two groups of frequency domain resource blocks, the bandwidth of the frequency domain resource blocks in each group is equal.
  • the method further includes: in the two groups of frequency domain resource blocks, the bandwidths of frequency domain resource blocks in different groups are not equal.
  • the method further includes: in the two groups of frequency domain resource blocks, different groups of frequency domain resources The block bandwidths are equal.
  • the method further includes: the subcarrier intervals of the N frequency domain resource blocks are all equal.
  • the method further includes: among the L (m) frequency domain resource blocks in each group, each frequency domain resource block contains an equal number of subcarriers.
  • the method further includes: in the two groups of frequency domain resource blocks, the bandwidth of the frequency domain resource blocks in each group is equal.
  • the method further includes: in the two groups of frequency domain resource blocks, the bandwidths of frequency domain resource blocks in different groups are not equal.
  • the method further includes: in the two groups of frequency domain resource blocks, the frequency domain resource blocks of different groups have equal bandwidths.
  • n is the frequency domain resource group number
  • L(m) is the number of frequency domain resource blocks included in the mth group of frequency domain resource blocks.
  • n in Figure 3-5 represents the number of frequency domain resource blocks
  • m represents the number of the group
  • L(m) represents the number of resource blocks in the m-th group.
  • n(1) and n(2) respectively represent the numbers of the frequency domain resource blocks of the first group and the second group.
  • the data to be transmitted is transmitted in N frequency domain resource blocks, and the N resource blocks respectively include k(n) subcarriers, as shown in Figure 3.
  • FIG. 3 is a schematic diagram of an optional data sequence formation method in Embodiment 1.
  • the data to be transmitted on each group of L(m) frequency domain resource blocks is processed to form L(m) groups of data sequences.
  • the data to be transmitted on all L(m) frequency domain resource blocks in each group is subjected to an inverse Fourier transform.
  • This inverse Fourier transform may be an inverse fast Fourier transform.
  • IFFT which can also be the inverse discrete Fourier transform (IDFT)
  • each group forms L (m) groups of data sequences. That is to say, in this embodiment, the data to be transmitted on N frequency domain resource blocks are respectively subjected to inverse Fourier transform to form L (m) groups of data sequences.
  • This inverse Fourier transform is an oversampled inverse Fourier transform or a non-oversampled inverse Fourier transform.
  • the number of IFFT points or IDFT points of the inverse Fourier transform is greater than or equal to 4, and the inverse Fourier transform operation corresponds to The zero frequency is within the scope of this frequency domain resource block.
  • the L(m) data sequences of each group are processed so that each group forms a set of data sequences.
  • the first group of L(1) data sequences are subjected to inverse Fourier transform to form a group of data sequences S1; the second group of L(2) data sequences are subjected to inverse Fourier transform. , forming a set of data sequence S2.
  • the inverse Fourier transform is: perform an inverse Fourier transform for every L(m) data, and each L(m) data comes from L(m) groups of data sequences. For example, L(m) groups of data sequences are in L(m) rows, and then L(m) data are extracted according to columns, and an inverse Fourier transform is performed on each L(m) data extracted.
  • An inverse Fourier transform is performed for every L(m) data, which also includes performing an inverse Fourier transform after adding multiple zero data to every L(m) data, and the number of IFFT points of the inverse Fourier transform is greater than L (m). Every L (m) data is subjected to an inverse Fourier transform to form a time domain data sequence, and multiple time domain data sequences generated by the inverse Fourier transform are serially connected to form a data sequence S1 or S2.
  • the data sequence S1 and the data sequence S2 are then processed to form a set of data sequences.
  • the method of processing the data sequence S1 and the data sequence S2 includes but is not limited to: adding the data sequence S1 and the data sequence S2. After the operation, a set of time domain data sequences is formed.
  • the method further includes: filtering or windowing the time domain data sequences.
  • the filtering is polyphase filtering, and the polyphase filtering uses the same waveform function. That is to say, the N frequency domain resource blocks have the same bandwidth, so each frequency domain resource block uses the same waveform function.
  • the data to be transmitted is transmitted in N frequency domain resource blocks, and the N resource blocks respectively include k(n) subcarriers, as shown in Figure 4.
  • Figure 4 is the formation of an optional data sequence in Embodiment 2. Another schematic diagram of the method.
  • FIG. 4 is a diagram in Embodiment 1. Another schematic diagram of an optional data sequence formation method.
  • the data to be transmitted on each group of L(m) frequency domain resource blocks is processed to form L(m) groups of data sequences.
  • the data to be transmitted on all L (m) frequency domain resource blocks in each group is subjected to an inverse Fourier transform (inverse fast Fourier transform IFFT or inverse discrete Fourier transform IDFT),
  • Each group forms L(m) groups of data sequences. That is to say, in this embodiment, the data to be transmitted on N frequency domain resource blocks are respectively subjected to inverse Fourier transform to form L (m) groups of data sequences.
  • This inverse Fourier transform is an oversampled inverse Fourier transform or a non-oversampled inverse Fourier transform, the inverse fast Fourier transform IFFT (inverse fast Fourier transform) or the inverse discrete Fourier transform
  • IFFT inverse fast Fourier transform
  • IDFT inverse discrete Fourier transform
  • the L(m) data sequences of each group are processed, and each group forms a set of data sequences.
  • the first group of L(1) data sequences are subjected to inverse Fourier transform to form a group of data sequences S1; the second group of L(2) data sequences are subjected to inverse Fourier transform. , forming a set of data sequence S2.
  • this inverse Fourier transform is: perform an inverse Fourier transform for every L(m) data, and each L(m) data comes from L(m) groups of data sequences. For example, L(m) groups of data sequences are in L(m) rows, and then L(m) data are extracted according to columns, and an inverse Fourier transform is performed on each L(m) data extracted.
  • An inverse Fourier transform is performed for every L(m) data, which also includes performing an inverse Fourier transform after adding multiple zero data to every L(m) data, and the number of IFFT points of the inverse Fourier transform is greater than L (m). Every L (m) data is subjected to an inverse Fourier transform to form a time domain data sequence, and multiple time domain data sequences generated by the inverse Fourier transform are serially connected to form a data sequence S1 or S2.
  • the data sequence S1 and the data sequence S2 are then processed to form a set of data sequences.
  • the method of processing the data sequence S1 and the data sequence S2 includes but is not limited to: filtering or windowing the data sequence S1. , perform filtering or windowing, dot multiplication operations, and addition operations on the data sequence 2. Since the frequency domain resource block bandwidths of the first group and the second group are the same, the waveform functions used when performing polyphase filtering operations on the data sequences S1 and S2 are the same. Click and multiply operation is possible Perform a dot multiplication operation on the data sequence S1, and you can also perform a dot multiplication operation on the data sequence S2.
  • the final sequence is added to form a set of time domain data sequences, and this set of time domain data sequences is transmitted.
  • the data to be transmitted is transmitted in N frequency domain resource blocks. These N resource blocks each contain k(n) subcarriers, as shown in Figure 5.
  • FIG. 5 is another schematic diagram of an optional data sequence formation method in Embodiment 3.
  • the number of subcarriers included in each resource block of the first group is 12, and the number of subcarriers included in each resource block of the second group is 4.
  • the data to be transmitted on each group of L(m) frequency domain resource blocks is processed to form L(m) groups of data sequences.
  • the data to be transmitted on all L (m) frequency domain resource blocks in each group is subjected to an inverse Fourier transform (inverse fast Fourier transform IFFT or inverse discrete Fourier transform IDFT),
  • Each group forms L(m) groups of data sequences. That is to say, in this embodiment, the data to be transmitted on N frequency domain resource blocks are respectively subjected to inverse Fourier transform to form N groups of data sequences.
  • the inverse Fourier transform is an oversampled inverse Fourier transform.
  • the number of IFFT points of the first group of the inverse Fourier transform is 16, and the number of IFFT points of the second group of the inverse Fourier transform is 16.
  • the number of points is 8, and the corresponding zero frequency during the inverse Fourier transform operation is within the range of this frequency domain resource block.
  • the L(m) groups of data sequences in each group are processed, and each group forms a set of data sequences.
  • the first group of L(1) data sequences are subjected to inverse Fourier transform to form a group of data sequences S1; the second group of L(2) data sequences are subjected to inverse Fourier transform. , forming a set of data sequence S2.
  • the inverse Fourier transform is: perform one inverse Fourier transform for every L(m) pieces of data, and the L(m) pieces of data respectively come from L(m) sets of data sequences. Performing the inverse Fourier transform for each L(m) piece of data also includes adding multiple sets of zero data, and then performing the inverse Fourier transform.
  • the number of IFFT points of the inverse Fourier transform is greater than L(m).
  • Each L (m) piece of data undergoes one inverse Fourier transform to form a time domain data sequence, and multiple time domain data sequences generated by the inverse Fourier transform are serially connected to form a data sequence S1 or S2.
  • the data sequence S1 and the data sequence S2 are processed to form a set of data sequences.
  • the processing includes: filtering the data sequence S1, filtering the data sequence 2, dot multiplication operation, and addition operation. Since the frequency domain resource block bandwidths of the first group and the second group are different, the data sequences S1 and S2 undergo polyphase filtering operations respectively, and the waveform functions used are different, that is, the waveform function parameters are different (such as different waveform function types, Or the same waveform function type, but different specific parameters).
  • the dot multiply operation can be performed on the data sequence S1 or the data sequence S2.
  • the final sequence is added to form a set of time domain data sequences.
  • Transmitting a set of time domain data sequences also includes: As shown in Figure 6, Figure 6 is a schematic diagram of an optional method of transmitting a set of time domain data sequences in Embodiment 4. In Figure 6, for this set of time domain data sequences, After the time domain data sequence is windowed or filtered, the digital-to-analog converter DAC and radio frequency RF (radio frequency) processes are performed.
  • Figure 6 is a schematic diagram of an optional method of transmitting a set of time domain data sequences in Embodiment 4.
  • the digital-to-analog converter DAC and radio frequency RF (radio frequency) processes are performed.
  • 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.
  • This embodiment also provides a data sequence forming device, which is configured to implement the above embodiments and preferred implementations. What has already been described will not be described again.
  • the term "module” may be a combination of software and/or hardware that implements a predetermined function.
  • the apparatus described in the following embodiments is preferably implemented in software, implementation in hardware, or a combination of software and hardware, is also possible and contemplated.
  • Figure 7 is a structural block diagram of an optional data sequence forming device according to an embodiment of the present disclosure. As shown in Figure 7, it includes:
  • the processing module 74 is configured to separately process the data to be transmitted on the L(m) frequency domain resource blocks in each group to form L(m) groups of data sequences.
  • the N frequency domain resource blocks used to transmit data to be transmitted are divided into two groups of frequency domain resource blocks.
  • the frequency domain resource block bandwidths between different groups can be different, and waveform functions with different parameters can be used.
  • Perform windowing or filtering it is easier to achieve equal bandwidths of frequency domain resource blocks in the same group, which is conducive to using the same waveform function for unified windowing or filtering and reducing processing complexity.
  • the alternating distribution method can ensure that the intervals between adjacent frequency domain resource blocks in the same group are equal and larger than the bandwidth of the frequency domain resource blocks.
  • the data to be transmitted of each resource block in the same group can be processed by oversampling inverse Fourier transform. The reciprocal of the time domain data interval is equal to the interval between adjacent resource blocks in the group. This can avoid interference from adjacent frequency domain resource blocks in the same group, thereby solving problems in related technologies such as interference between subbands that easily occurs when data sequences are filtered.
  • the processing module 74 is also configured to process the data to be transmitted on the L(m) frequency domain resource blocks to form L(m) groups of data sequences.
  • the processing includes: Fourier Inverse transformation.
  • the inverse Fourier transform is the oversampled Fourier Inverse transform, the number of IFFT (or IDFT) points of the inverse Fourier transform is greater than or equal to k(n).
  • the number of IFFT points is less than the sum of the number of subcarriers included in the N frequency domain resource blocks.
  • an inverse Fourier transform is performed on a certain frequency domain resource block, and the zero frequency position during the inverse Fourier transform operation is within the range of this frequency domain resource block.
  • the zero frequency positions during the inverse Fourier transform operation of different frequency domain resource blocks are different.
  • an inverse Fourier transform is performed on a certain frequency domain resource block, and the zero frequency position (or zero subcarrier) during the inverse Fourier transform operation is respectively in the k (n) subcarriers of each resource block. one of.
  • the data to be transmitted undergoes the inverse Fourier transform to form a set of data sequences
  • the data to be transmitted on L (m) frequency domain resource blocks undergo the inverse Fourier transform to form L ( m) A set of data sequences.
  • a Fourier transform operation FFT (or DFT) is also included.
  • the processing module 74 is also configured to process the L (m) groups of data sequences to form a group of data sequences, and the processing includes inverse Fourier transform.
  • the inverse Fourier transform is an oversampled inverse Fourier transform.
  • the number of IFFT points of the inverse Fourier transform is greater than L(m).
  • the inverse Fourier transform is: perform the inverse Fourier transform for every L(m) pieces of data, and each L(m) piece of data comes from L(m) sets of data sequences respectively.
  • L(m) groups of data sequences are in L(m) rows, and then L(m) data are extracted according to columns, and the inverse Fourier transform is performed on each L(m) data extracted.
  • the processing of the L(m) groups of data sequences also includes adding multiple groups of zero data sequences, and then performing inverse Fourier transform.
  • the set of data sequences is a set of time domain data sequences, which is formed by serially connecting multiple time domain data sequences generated by the inverse Fourier transform.
  • the processing module 74 is further configured to process the L (m) groups of data sequences to form a group of data sequences; The set of data sequences is processed to form a combined set of data sequences; the combined set of data sequences is transmitted.
  • each group forms a set of data sequences.
  • the "processing of the two sets of data sequences corresponding to the two sets of frequency domain resource blocks to form a combined set of data sequences" includes: processing the two sets of the set of data sequences. After the addition operation, a set of data sequences is formed.
  • processing module 74 is also configured to perform a dot multiplication operation on at least one set of data sequences before adding the two sets of data sequences to form one set of data sequences.
  • the sequence to be multiplied by the dot multiplication operation is a sequence whose phases change sequentially with equal modulo.
  • processing module 74 is further configured to perform a windowing operation or a filtering operation on each group of data sequences before adding the two groups of data sequences.
  • transmitting the set of data sequences further includes filtering the set of data sequences.
  • the transmitting the set of data sequences further includes filtering each frequency domain resource block using the same waveform function.
  • the filtering is single-phase filtering or polyphase filtering.
  • filter functions used in the polyphase filtering include: root raised cosine function, or raised cosine function, or rectangular function, or IOTA (Isotropic Orthogonal Transform Algorithm) function, or 1+D function, etc.
  • the transmitting the set of data sequences further includes performing a windowing operation on the set of data sequences.
  • transmitting the set of data sequences further includes filtering each frequency domain resource block using the same waveform function through a windowing operation or a polyphase filtering operation.
  • the data to be transmitted includes constellation point modulated data and reference signal data.
  • the N frequency domain resource blocks are continuously distributed in the frequency domain.
  • the L(m) frequency domain resource blocks in each group are discontinuous in the frequency domain, but the spectrum intervals of adjacent frequency domain resource blocks are equal.
  • the frequency domain resource block bandwidth of at least one group of frequency domain resource blocks in the two groups of frequency domain resource blocks is 1/w of the spectrum interval of adjacent frequency domain resource blocks in the group, w is a positive integer.
  • the method further includes: The adjacent data time domain interval of the data sequence of at least one group of frequency domain resource blocks in the two groups of frequency domain resource blocks is equal to the reciprocal of the spectrum interval of adjacent resource blocks in the group.
  • the subcarrier intervals of the N frequency domain resource blocks are all equal.
  • each frequency domain resource block contains an equal number of subcarriers.
  • the frequency domain resource block bandwidths in each group are equal.
  • the bandwidths of frequency domain resource blocks in different groups are not equal.
  • the bandwidths of frequency domain resource blocks in different groups are equal.
  • the subcarrier intervals of the N frequency domain resource blocks are all equal.
  • each frequency domain resource block contains an equal number of subcarriers.
  • the frequency domain resource block bandwidths in each group are equal.
  • the bandwidths of frequency domain resource blocks in different groups are not equal.
  • the bandwidths of frequency domain resource blocks in different groups are equal.
  • each of the above modules can be implemented through software or hardware.
  • it can be implemented in the following ways, but is not limited to this: the above modules are all located in the same processor; or the above modules can be implemented in any combination.
  • the forms are located in different processors.
  • Embodiments of the present disclosure also provide a computer-readable storage medium that stores a computer program, wherein the computer program is configured to execute the steps in any of the above method embodiments when running.
  • the computer-readable storage medium may include but is not limited to: U disk, read-only memory (Read-Only Memory, referred to as ROM), random access memory (Random Access Memory, referred to as RAM) , mobile hard disk, magnetic disk or optical disk and other media that can store computer programs.
  • ROM read-only memory
  • RAM random access memory
  • mobile hard disk magnetic disk or optical disk and other media that can store computer programs.
  • Embodiments of the present disclosure also provide an electronic device, including a memory and a processor, the memory stores a calculation Computer program, the processor is configured to run the computer program to perform the steps in any of the above method embodiments.
  • 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 disclosure 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 present disclosure is not limited to any specific combination of hardware and software.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Discrete Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本公开实施例提供了一种数据序列的形成方法、装置、存储介质及电子装置，该方法包括：将用于传输待传输数据的N个频域资源块分成两组，得到两组频域资源块，其中每组包含L(m)个频域资源块，两组频域资源块在频域交错分布，N和L(m)均为正整数，m＝1或2；分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成L(m)组数据序列。采用上述技术方案，解决现有技术中，数据序列进行滤波处理时子带间容易发生干扰等问题。

Description

数据序列的形成方法、装置、存储介质及电子装置
本公开要求于2022年5月5日提交中国专利局、申请号为202210482314.4、发明名称“数据序列的形成方法、装置、存储介质及电子装置”的中国专利申请的优先权，其全部内容通过引用结合在本公开中。
技术领域
本公开实施例涉及通信领域，具体而言，涉及一种数据序列的形成方法、装置、存储介质及电子装置。
背景技术
5G NR(Fifth Generation New Radio)通信技术采用带循环前缀的正交频分复用系统CP-OFDM(Cyclic Prefix Orthogonal Frequency Division Multiplexing)为基础波形，然而CP-OFDM系统性能对相邻子带间的频偏和时偏比较敏感，这主要是由于CP-OFDM系统的频谱泄漏比较大，因此容易导致子带间干扰。而且两个相邻子带间可以采用不同的参数集(Numerology)，这将破坏子载波之间的正交性，带来新的干扰问题。针对如何解决该干扰问题，其中一个比较直接的方法就是在具有不同Numerology的两个传输带之间插入一个保护带宽，但这样会浪费频率资源。
针对相关技术中，数据序列进行滤波处理时子带间容易发生干扰等问题，尚未提出有效的解决方案。
因此，有必要对相关技术予以改良以克服相关技术中的所述缺陷。
发明内容
本公开实施例提供了数据序列的形成方法、装置、存储介质及电子装置，以至少解决相关技术中，数据序列进行滤波处理时子带间容易发生干扰等问题。
根据本公开的一个实施例，提供了一种数据序列的形成方法，包括：将用于传输待传输数据的N个频域资源块分成两组，得到两组频域资源块，其中，每组包含L(m)个频域资源块，所述两组频域资源块在频域交错分布，N和L(m)均为正整数，m＝1或2；分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成L(m)组数据序列。
根据本公开的一个实施例，提供了一种数据序列的形成装置，包括：划分模块，设置为将用于传输待传输数据的N个频域资源块分成两组，得到两组频域资源块，其中，每组包含L(m)个频域资源块，所述两组频域资源块在频域交错分布，N和L(m)均为正整数，m＝1或2；处理模块，设置为分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成L(m)组数据序列。
通过本公开，将用于传输待传输数据的N个频域资源块分成两组频域资源块，这一N个频域资源块分别包括k(n)个子载波，每组包含L(m)个频域资源块，这两组频域资源块在频域交错分布，n＝1，2，...，N，k(n)和L(m)均为正整数，L(1)+L(2)＝N，m＝1或2；分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成L(m)组数据序列。由于本方案中将N个频域资源块分成两组频域资源块，并且两组之间交替分布。这样，不同组之间频域资源 块带宽可以不相同，可以使用不同参数的波形函数进行加窗或滤波；同组内的频域资源块带宽更容易做到相等，有利于使用相同的波形函数进行统一的加窗或滤波，并降低处理复杂度。交替分布方法可以做到同组内相邻频域资源块间隔相等并大于频域资源块带宽，而且，可以做到同组内每个资源块的待传输数据经过过采样傅里叶逆变换后的时域数据间隔倒数等于组内相邻资源块的间隔。这样可以避免同组内相邻频域资源块的干扰，进而解决相关技术中，数据序列进行滤波处理时子带间容易发生干扰等问题。
附图说明
图1是根据本公开实施例的一种可选的数据序列的形成方法的计算机终端的硬件结构框图；
图2是根据本公开实施例的一种可选的数据序列的形成方法的流程图；
图3是实施例1中一种可选的数据序列的形成方法的示意图；
图4是实施例2中一种可选的数据序列的形成方法的另一示意图；
图5是实施例3中一种可选的数据序列的形成方法的又一示意图；
图6是实施例4中一种可选的传输一组时域数据序列的方法的示意图；
图7是根据本公开实施例的一种可选的数据序列的形成装置的结构框图。
具体实施方式
为了使本技术领域的人员更好地理解本公开方案，下面将结合本公开实施例中的附图，对本公开实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本公开一部分的实施例，而不是全部的实施例。基于本公开中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都应当属于本公开保护的范围。
需要说明的是，本公开的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述特定的顺序或先后次序。应该理解这样使用的数据在适当情况下可以互换，以便这里描述的本公开的实施例能够以除了在这里图示或描述的那些以外的顺序实施。此外，术语“包括”和“具有”以及他们的任何变形，意图在于覆盖不排他的包含，例如，包含了一系列步骤或单元的过程、方法、系统、产品或设备不必限于清楚地列出的那些步骤或单元，而是可包括没有清楚地列出的或对于这些过程、方法、产品或设备固有的其它步骤或单元。
本公开实施例中所提供的方法实施例可以在计算机终端或者类似的运算装置中执行。以运行在计算机终端上为例，图1是本公开实施例的一种可选的数据序列的形成方法的计算机终端的硬件结构框图。如图1所示，计算机终端可以包括一个或多个(图1中仅示出一个)处理器102(处理器102可以包括但不限于微处理器MCU或可编程逻辑器件FPGA等的处理装置)和设置为存储数据的存储器104，其中，上述计算机终端还可以包括设置为通信功能的传输设备106以及输入输出设备108。本领域普通技术人员可以理解，图1所示的结构仅为示意，其并不对上述计算机终端的结构造成限定。例如，计算机终端还可包括比图1中所示更多或者更少的组件，或者具有与图1所示不同的配置。
存储器104可设置为存储计算机程序，例如，应用软件的软件程序以及模块，如本公开实施例中的数据序列的形成方法对应的计算机程序，处理器102通过运行存储在存储器104 内的计算机程序，从而执行各种功能应用以及数据处理，即实现上述的方法。存储器104可包括高速随机存储器，还可包括非易失性存储器，如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实例中，存储器104可进一步包括相对于处理器102远程设置的存储器，这些远程存储器可以通过网络连接至移动终端。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
传输设备106设置为经由一个网络接收或者发送数据。上述的网络具体实例可包括移动终端的通信供应商提供的无线网络。在一个实施例中，传输设备106包括一个网络适配器(Network Interface Controller，简称为NIC)，其可通过基站与其他网络设备相连从而可与互联网进行通讯。在一个实施例中，传输设备106可以为射频(Radio Frequency，简称为RF)模块，其设置为通过无线方式与互联网进行通讯。
在本实施例中提供了一种运行于上述计算机终端的数据序列的形成方法，图2是根据本公开实施例的一种数据序列的形成方法的流程图，如图2所示，该流程包括如下步骤：
步骤S202，将用于传输待传输数据的N个频域资源块分成两组，得到两组频域资源块，其中，每组包含L(m)个频域资源块，所述两组频域资源块在频域交错分布，N和L(m)均为正整数m＝1或2；
需要说明的是，所述N个频域资源块分别包括k(n)个子载波，n＝1，2，...，N，k(n)和L(m)均为正整数，L(1)+L(2)＝N，m＝1或2，其中，L(1)应当指代的是第1组频域资源快包括的频域资源块的个数，L(2)应当指代的是第2组频域资源快包括的频域资源块的个数。
步骤S204，分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成L(m)组数据序列。
通过本公开，将用于传输待传输数据的N个频域资源块分成两组频域资源块，每组包含L(m)个频域资源块，这两组频域资源块在频域交错分布，N和L(m)均为正整数，m＝1或2；分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成L(m)组数据序列。由于本方案中将N个频域资源块分成两组频域资源块，并且两组之间可以交替分布，这样，不同组之间频域资源块带宽可以不相同，可以使用不同参数的波形函数进行加窗或滤波；同组内的频域资源块带宽更容易做到相等，有利于使用相同的波形函数进行统一的加窗或滤波，并降低处理复杂度。交替分布方法可以做到同组内相邻频域资源块间隔相等并大于频域资源块带宽，而且，可以做到同组内每个资源块的待传输数据经过过采样傅里叶逆变换后的时域数据间隔倒数等于组内相邻资源块的间隔。这样可以避免同组内相邻频域资源块的干扰，进而解决相关技术中，数据序列进行滤波处理时子带间容易发生干扰等问题。
需要进一步说明的是，步骤S202“将用于传输待传输数据的N个频域资源块分成两组”中，之所以将N个频域资源块分成2组的好处，是因为：(1)不同组之间频域资源块带宽可以不相同，可以使用不同参数的波形函数进行加窗或滤波。(2)同组内的频域资源块带宽更容易做到相等，有利于使用相同的波形函数进行统一的加窗或滤波，并降低处理复杂度。(3)2组之间可以交替分布，该方法可以做到同组内相邻频域资源块间隔相等并大于频域资源块带宽；或者，可以做到同组内每个资源块的待传输数据经过过采样傅里叶逆变换后的时域数据间隔倒数等于组内相邻资源块的间隔，这样可以避免同组内相邻频域资源块的干扰。
可选的，步骤S204“分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成 L(m)组数据序列”中，所述处理包括：傅里叶逆变换。所述傅里叶逆变换为过采样傅里叶逆变换，傅里叶逆变换的快速傅里叶逆变换IFFT(inverse fast Fourier transform)点数或者离散傅立叶逆变换IDFT(inverse discrete Fourier transform)点数大于等于k(n)。IFFT点数也称为快速傅里叶逆变换大小(IFFT size)。
进一步地，IFFT点数小于N个频域资源块包括的所述子载波的个数之和。
进一步地，对某个频域资源块进行傅里叶逆变换，傅里叶逆变换操作时的零频位置在本频域资源块范围内。不同频域资源块的傅里叶逆变换操作时的零频位置不同。
进一步地，对某个频域资源块进行傅里叶逆变换，傅里叶逆变换操作时的零频位置(或零子载波)分别在每个资源块的k(n)个子载波中的一个。
进一步地，待传输数据经过傅里叶逆变换形成一组数据序列，L(m)个频域资源块上的待传输数据分别经过傅里叶逆变换形成L(m)组数据序列。
进一步地，待传输数据进行所述傅里叶逆变换之前还包括快速傅里叶变换FFT(fast Fourier transform)或者离散傅里叶变换DFT(Discrete Fourier Transform)。
在一个可选实施例中，所述方法还包括：对所述L(m)组数据序列进行处理以形成一组数据序列；对所述两组频域资源块对应的两组所述一组数据序列进行处理以形成组合的一组数据序列；传输所述组合的一组数据序列。
需要说明的是，每组都形成一组数据序列。
需要说明的是，两组频域资源块组合起来形成一组数据序列。
可选的，在本实施例中，对L(m)组数据序列进行处理以形成一组数据序列中，这一处理包括傅里叶逆变换，其中，傅里叶逆变换为过采样傅里叶逆变换，并且傅里叶逆变换的I FFT点数大于L(m)。
进一步地，这一傅里叶逆变换为：每L(m)个数据进行一次傅里叶逆变换，每L(m)个数据分别来自于L(m)组数据序列，比如，L(m)组数据序列分别在L(m)行，然后按照列取出L(m)个数据，对取出的每L(m)个数据进行一次傅里叶逆变换。
进一步地，对每L(m)个数据添加一些0之后，进行傅里叶逆变换，也就是说，L(m)组数据序列的处理，还包括增加多组零数据序列，然后进行傅里叶逆变换。
进一步地，一组数据序列为一组时域数据序列，是由多个傅里叶逆变换生成的时域数据序列串行连接而成。
可选的，在本实施例中，对所述两组频域资源块对应的两组所述一组数据序列进行处理以形成组合的一组数据序列中，这一处理包括：将2组所述一组数据序列进行加操作后形成一组数据序列。
通过上述实施例的描述，在将用于传输待传输数据的N个频域资源块分成两组，那么由于不同组之间频域资源块带宽可以不相同，可以使用不同参数的波形函数进行加窗或滤波；此外，同组内的频域资源块带宽更容易做到相等，有利于使用相同的波形函数进行统一的加窗或滤波，并降低处理复杂度；进一步的，2组之间可以交替分布，该方法可以做到同组内相邻频域资源块间隔相等并大于频域资源块带宽；或者，还可以做到同组内每个资源块的待传输数据经过过采样傅里叶逆变换后的时域数据间隔倒数等于组内相邻资源块的间隔，这样可以避免同组内相邻频域资源块的干扰。
进一步地，将2组所述一组数据序列进行加操作后形成一组数据序列，还包括，在加操 作之前，对至少一组数据序列进行点乘操作。所述点乘操作所点乘的待乘序列为模相等相位依次变化的序列。
进一步地，将所述2组所述一组数据序列进行加操作后形成一组数据序列，还包括，在加操作之前，对每组的所述一组数据序列进行加窗操作或滤波操作。
进一步地，对所述2组使用不同参数的滤波函数进行加窗操作或滤波操作。
可选的，在本实施例中，传输所述一组数据序列，还包括，对所述一组数据序列进行滤波。
进一步地，传输所述一组数据序列，还包括，每个频域资源块使用相同的波形函数进行滤波。
进一步地，所述滤波为单相滤波或多相滤波。
进一步地，所述多相滤波所使用的滤波函数包括：根升余弦函数、或者升余弦函数、或者矩形函数、或者IOTA(Isotropic Orthogonal Transform Algorithm)函数、或者1+D函数等。
进一步地，传输所述一组数据序列，还包括，对所述一组数据序列进行加窗操作。
进一步地，传输所述一组数据序列，还包括，通过加窗操作或多相滤波操作，对每个频域资源块使用相同的波形函数进行滤波。
进一步地，所述待传输数据包括星座点调制的数据，也包括参考信号数据。
基于上述方案，由于不同组之间频域资源块带宽可以不相同，可以使用不同参数的波形函数进行加窗或滤波；同组内的频域资源块带宽更容易做到相等，有利于使用相同的波形函数进行统一的加窗或滤波，并降低处理复杂度。交替分布方法可以做到同组内相邻频域资源块间隔相等并大于频域资源块带宽，而且，可以做到同组内每个资源块的待传输数据经过过采样傅里叶逆变换后的时域数据间隔倒数等于组内相邻资源块的间隔。
在一个可选实施例中，所述方法还包括：所述N个频域资源块在频域连续分布。
在一个可选实施例中，所述方法还包括：所述每组的L(m)个频域资源块在频域不连续，但相邻频域资源块的频谱间隔相等。
在一个可选实施例中，所述方法还包括：在所述两组频域资源块中至少有一组频域资源块的频域资源块带宽为所述组内相邻频域资源块的频谱间隔的1/w，w为正整数。
在一个可选实施例中，分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成L(m)组数据序列的过程中，所述方法还包括：在所述两组频域资源块中至少有一组频域资源块的数据序列的相邻数据时域间隔等于组内相邻资源块的频谱间隔的倒数。
在一个可选实施例中，所述方法还包括：所述N个频域资源块的子载波间隔都相等。
在一个可选实施例中，所述方法还包括：所述每组内的L(m)个频域资源块中，每个频域资源块包含的子载波数相等。
在一个可选实施例中，所述方法还包括：在所述两组频域资源块中，每组内的频域资源块带宽相等。
在一个可选实施例中，所述方法还包括：在所述两组频域资源块中，不同组的频域资源块带宽不相等。
在一个可选实施例中，所述方法还包括：在所述两组频域资源块中，不同组的频域资源 块带宽相等。
在一个可选实施例中，所述方法还包括：不同组的频域资源块带宽之比为1∶U或者U∶1，其中，U＝2i-1，i为大于0的整数；当i＝0时，表示不同组的频域资源块带宽相等。
在一个可选实施例中，所述方法还包括：所述N个频域资源块的子载波间隔都相等。
在一个可选实施例中，所述方法还包括：所述每组内的L(m)个频域资源块中，每个频域资源块包含的子载波数相等。
在一个可选实施例中，所述方法还包括：在所述两组频域资源块中，每组内的频域资源块带宽相等。
在一个可选实施例中，所述方法还包括：在所述两组频域资源块中，不同组的频域资源块带宽不相等。
在一个可选实施例中，所述方法还包括：在所述两组频域资源块中，不同组的频域资源块带宽相等。
在一个可选实施例中，所述方法还包括：不同组的频域资源块带宽之比为1∶U或者U∶1，其中，U＝2i-1，i为大于0的整数；当i＝0时，表示不同组的频域资源块带宽相等。
实施例一
需要说明的是，在以下实施例中，m是频域资源组编号，L(m)是第m组频域资源快包括的频域资源块的个数。附图3-5中的n是代表频域资源块的编号，m是代表组的编号，L(m)是代表第m组的资源块数量。图中n(1)和n(2)分别代表第1组和第2组的频域资源块的编号。
待传输数据在N个频域资源块中传输，所述N个资源块分别包含k(n)个子载波，如图3所示，图3是实施例1中一种可选的数据序列的形成方法的示意图，在本实施例中，N个资源块包含的子载波个数相等，并且k(n)＝4。
将这N个频域资源块分成2组，这2组频域资源块所在的频域范围存在交集，并且在频域上交替分布，例如，在频域上，可以依次第一组频域资源块，第二组频域资源块，第一组频域资源块，第二组频域资源块，……，这样的交替分布。如图3所示，图3是实施例1中一种可选的数据序列的形成方法的示意图，在图3中，这2组频域资源块中包含的资源块个数分别为L(1)和L(2)，并且L(1)+L(2)＝N。
对每组的L(m)个频域资源块上的待传输数据进行处理，以形成L(m)组数据序列。在本实施例中，对每组的所有L(m)个频域资源块上的所述待传输数据都进行傅里叶逆变换，这一傅里叶逆变换可以是快速傅里叶逆变换IFFT，也可以是离散傅立叶逆变换IDFT)，每一组都形成L(m)组数据序列。也就是说，在本实施例中，对N个频域资源块上的待传输数据分别进行傅里叶逆变换，形成L(m)组数据序列。这一傅里叶逆变换为过采样傅里叶逆变换或者为非过采样傅里叶逆变换，傅里叶逆变换的IFFT点数或者IDFT点数大于等于4，并且傅里叶逆变换操作时对应的零频是在本频域资源块范围内。
然后对每组的L(m)组数据序列进行处理，以使得每组都形成一组数据序列。在本实施例中，对第一组的L(1)组数据序列进行傅里叶逆变换，形成一组数据序列S1；对第二组的L(2)组数据序列进行傅里叶逆变换，形成一组数据序列S2。傅里叶逆变换为：每L(m)个数据进行一次傅里叶逆变换，每L(m)个数据分别来自于L(m)组数据序列。比如，L(m)组数据序列分别在L(m)行，然后按照列取出L(m)个数据，对取出的每L(m)个数据进行一次傅里叶逆变换。 每L(m)个数据进行一次傅里叶逆变换，还包括在每L(m)个数据增加多个零数据后，进行傅里叶逆变换，并且傅里叶逆变换的IFFT点数大于L(m)。每L(m)个数据进行一次傅里叶逆变换形成一个时域数据序列，多个所述傅里叶逆变换生成的时域数据序列串行连接形成数据序列S1或S2。
然后对数据序列S1和数据序列S2进行处理以形成一组数据序列，本实施例中，对数据序列S1和数据序列S2进行处理的方法，包括但不限于：数据序列S1与数据序列S2进行加操作后形成一组时域数据序列。
传输一组时域数据序列之前，所述方法还包括：对时域数据序列进行滤波或加窗操作。本实施例中，滤波为多相滤波，多相滤波使用相同的波形函数，也就是说，N个频域资源块的带宽相同，因此每个频域资源块使用相同的波形函数。
实施例二
待传输数据在N个频域资源块中传输，所述N个资源块分别包含k(n)个子载波，如图4所示，图4是实施例2中一种可选的数据序列的形成方法的另一示意图，在本实施例中，N个资源块包含的子载波个数相等，并且k(n)＝4。
将这N个频域资源块分成2组，这2组频域资源块所在的频域范围存在交集，并且在频域上交替分布，如图4所示，图4是实施例1中一种可选的数据序列的形成方法的另一示意图，在图4中，这2组频域资源块中包含的资源块个数分别为L(1)和L(2)，并且L(1)+L(2)＝N。
对每组的L(m)个频域资源块上的待传输数据进行处理，以形成L(m)组数据序列。在本实施例中，对每组的所有L(m)个频域资源块上的所述待传输数据都进行傅里叶逆变换(快速傅里叶逆变换IFFT或离散傅立叶逆变换IDFT)，每一组都形成L(m)组数据序列。也就是说，在本实施例中，对N个频域资源块上的待传输数据分别进行傅里叶逆变换，形成L(m)组数据序列。这一傅里叶逆变换为过采样傅里叶逆变换或者为非过采样傅里叶逆变换，傅里叶逆变换的快速傅里叶逆变换IFFT(inverse fast Fourier trans form)或者离散傅立叶逆变换IDFT(inverse discrete Fourier transform)点数大于等于4，并且傅里叶逆变换操作时对应的零频是在本频域资源块范围内。
然后对每组的L(m)组数据序列进行处理，每组都形成一组数据序列。在本实施例中，对第一组的L(1)组数据序列进行傅里叶逆变换，形成一组数据序列S1；对第二组的L(2)组数据序列进行傅里叶逆变换，形成一组数据序列S2。其中，这一傅里叶逆变换为：每L(m)个数据进行一次傅里叶逆变换，每L(m)个数据分别来自于L(m)组数据序列。比如，L(m)组数据序列分别在L(m)行，然后按照列取出L(m)个数据，对取出的每L(m)个数据进行一次傅里叶逆变换。每L(m)个数据进行一次傅里叶逆变换，还包括在每L(m)个数据增加多个零数据后，进行傅里叶逆变换，并且傅里叶逆变换的IFFT点数大于L(m)。每L(m)个数据进行一次傅里叶逆变换形成一个时域数据序列，多个所述傅里叶逆变换生成的时域数据序列串行连接形成数据序列S1或S2。
然后对数据序列S1和数据序列S2进行处理以形成一组数据序列，本实施例中，对数据序列S1和数据序列S2进行处理的方法，包括但不限于：对数据序列S1进行滤波或加窗、对数据序列2进行滤波或加窗、点乘操作、加操作。由于第一组与第二组的频域资源块带宽相同，因此数据序列S1与S2分别进行多相滤波操作时所使用的波形函数相同。点乘操作可以 对数据序列S1进行点乘操作，也可以对数据序列S2进行点乘操作。本实施例中，数据序列S2进行多相滤波操作之后，再与序列ejθi(其中，i＝0，1，2，...)进行点乘后，然后与数据序列S1进行多相滤波操作后的序列进行加操作，形成一组时域数据序列，并传输这一组时域数据序列。
实施例三
待传输数据在N个频域资源块中传输，这N个资源块分别包含k(n)个子载波，如图5所示，图5是实施例3中一种可选的数据序列的形成方法的又一示意图，在本实施例中，N个频域资源块带宽不全相等，每个频域资源块包含的子载波个数也不相等，并且k(n)＝4或者12。
将这N个频域资源块分成2组，每组内每一个频域资源块带宽都相等。这2组频域资源块所在的频域范围存在交集，并且在频域上交替分布，如图5所示，图5是实施例3中一种可选的数据序列的形成方法的又一示意图，在图5中，这2组包含的资源块个数分别为L(1)和L(2)，L(1)+L(2)＝N。第一组的每个资源块包含的子载波个数为12，第二组的每个资源块包含的子载波个数为4。
对每组的L(m)个频域资源块上的待传输数据进行处理，以形成L(m)组数据序列。在本实施例中，对每组的所有L(m)个频域资源块上的所述待传输数据都进行傅里叶逆变换(快速傅里叶逆变换IFFT或离散傅立叶逆变换IDFT)，每一组都形成L(m)组数据序列。也就是说，在本实施例中，对N个频域资源块上的待传输数据分别进行傅里叶逆变换，形成N组数据序列。在本实施例中，傅里叶逆变换为过采样傅里叶逆变换，第一组的所述傅里叶逆变换的IFFT点数为16，第二组的所述傅里叶逆变换的IFFT点数为8，所述傅里叶逆变换操作时对应的零频是在本频域资源块范围内。
然后对每组的所述L(m)组数据序列进行处理，每组都形成一组数据序列。在本实施例中，对第一组的L(1)组数据序列进行傅里叶逆变换，形成一组数据序列S1；对第二组的L(2)组数据序列进行傅里叶逆变换，形成一组数据序列S2。所述傅里叶逆变换为：每L(m)个数据进行一个所述傅里叶逆变换，所述L(m)个数据分别来自于L(m)组数据序列。对每L(m)个数据进行一个所述傅里叶逆变换，还包括增加多组零数据，然后进行傅里叶逆变换，所述傅里叶逆变换的IFFT点数大于L(m)。每L(m)个数据进行一个所述傅里叶逆变换形成一个时域数据序列，多个所述傅里叶逆变换生成的时域数据序列串行连接形成数据序列S1或S2。
然后对数据序列S1和数据序列S2进行处理以形成一组数据序列中，所述处理包括：对数据序列S1进行滤波、对数据序列2进行滤波、点乘操作、加操作。由于第一组与第二组的频域资源块带宽不同，因此数据序列S1与S2分别进行多相滤波操作，并且所使用的波形函数不同，即波形函数参数不同(比如不同的波形函数类型，或者同一种波形函数类型，但具体参数不同)。点乘操作可以对数据序列S1进行点乘操作，也可以对数据序列S2进行点乘操作。本实施例中，数据序列S2进行多相滤波操作之后，再与序列ejθi(其中，i＝0，1，2，...)进行点乘后，然后与数据序列S1进行多相滤波操作后的序列进行加操作，形成一组时域数据序列。
传输一组时域数据序列。
实施例四
传输一组时域数据序列，还包括：如图6所示，图6是实施例4中一种可选的传输一组时域数据序列的方法的示意图，在图6中，对这一组时域数据序列进行加窗或滤波之后，再进行数模转换器DAC、射频RF(radio frequency)过程。
通过以上的实施方式的描述，本领域的技术人员可以清楚地了解到根据上述实施例的方法可借助软件加必需的通用硬件平台的方式来实现，当然也可以通过硬件，但很多情况下前者是更佳的实施方式。基于这样的理解，本公开的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如ROM/RAM、磁碟、光盘)中，包括若干指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本公开各个实施例所述的方法。
在本实施例中还提供了一种数据序列的形成装置，该装置设置为实现上述实施例及优选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置较佳地以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图7是根据本公开实施例的一种可选的数据序列的形成装置的结构框图，如图7所示，包括：
划分模块72，设置为将用于传输待传输数据的N个频域资源块分成两组，得到两组频域资源块，其中，每组包含L(m)个频域资源块，所述两组频域资源块在频域交错分布，n＝1，2，...，N，k(n)和L(m)均为正整数，L(1)+L(2)＝N，m＝1或2；
需要说明的是，所述N个频域资源块分别包括k(n)个子载波，n＝1，2，...，N，k(n)和L(m)均为正整数，L(1)+L(2)＝N，m＝1或2，其中，L(1)应当指代的是第1组频域资源快包括的频域资源块的个数，L(2)应当指代的是第2组频域资源快包括的频域资源块的个数。
处理模块74，设置为分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成L(m)组数据序列。
通过上述装置，将用于传输待传输数据的N个频域资源块分成两组频域资源块，这一N个频域资源块分别包括k(n)个子载波，每组包含L(m)个频域资源块，这两组频域资源块在频域交错分布，n＝1，2，...，N，k(n)和L(m)均为正整数，L(1)+L(2)＝N，m＝1或2；分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成L(m)组数据序列。由于本方案中将N个频域资源块分成两组频域资源块，因此多组之间可以交替分布，这样，不同组之间频域资源块带宽可以不相同，可以使用不同参数的波形函数进行加窗或滤波；同组内的频域资源块带宽更容易做到相等，有利于使用相同的波形函数进行统一的加窗或滤波，并降低处理复杂度。交替分布方法可以做到同组内相邻频域资源块间隔相等并大于频域资源块带宽，而且，可以做到同组内每个资源块的待传输数据经过过采样傅里叶逆变换后的时域数据间隔倒数等于组内相邻资源块的间隔。这样可以避免同组内相邻频域资源块的干扰，进而解决相关技术中，数据序列进行滤波处理时子带间容易发生干扰等问题。
可选的，处理模块74，还设置为所述L(m)个频域资源块上的所述待传输数据进行处理以形成L(m)组数据序列中，所述处理包括：傅里叶逆变换。所述傅里叶逆变换为过采样傅里叶 逆变换，所述傅里叶逆变换的IFFT(或者IDFT)点数大于等于k(n)。
进一步地，所述IFFT点数小于所述N个频域资源块包括的所述子载波的个数之和。
进一步地，对某个频域资源块进行傅里叶逆变换，所述傅里叶逆变换操作时的零频位置在本频域资源块范围内。不同频域资源块的傅里叶逆变换操作时的零频位置不同。
进一步地，对某个频域资源块进行傅里叶逆变换，所述傅里叶逆变换操作时的零频位置(或零子载波)分别在每个资源块的k(n)个子载波中的一个。
进一步地，所述待传输数据经过所述傅里叶逆变换形成一组数据序列，L(m)个频域资源块上的所述待传输数据分别经过所述傅里叶逆变换形成L(m)组数据序列。
进一步地，所述待传输数据进行所述傅里叶逆变换之前还包括傅里叶变换操作FFT(或者DFT)。
可选的，在一个实施例中，处理模块74，还设置为对所述L(m)组数据序列进行处理以形成一组数据序列中，所述处理包括傅里叶逆变换。所述傅里叶逆变换为过采样傅里叶逆变换。所述傅里叶逆变换的IFFT点数大于L(m)。
进一步地，所述傅里叶逆变换为：每L(m)个数据进行一个所述傅里叶逆变换，所述每L(m)个数据分别来自于L(m)组数据序列。(比如，L(m)组数据序列分别在L(m)行，然后按照列取出L(m)个数据，对取出的每L(m)个数据进行一个所述傅里叶逆变换。)
进一步地，对每L(m)个数据添加一些0之后，进行所述傅里叶逆变换。(或者说，所述L(m)组数据序列的处理，还包括增加多组零数据序列，然后进行傅里叶逆变换。)
进一步地，所述一组数据序列为一组时域数据序列，是由多个所述傅里叶逆变换生成的时域数据序列串行连接而成。
在一个可选实施例中，处理模块74，还设置为对所述L(m)组数据序列进行处理以形成一组数据序列；对所述两组频域资源块对应的两组所述一组数据序列进行处理以形成组合的一组数据序列；传输所述组合的一组数据序列。
需要说明的是，每组都形成一组数据序列。
需要说明的是，两组频域资源块组合起来形成一组数据序列。
所述“对所述两组频域资源块对应的两组所述一组数据序列进行处理以形成组合的一组数据序列中”，所述处理包括：将2组所述一组数据序列进行加操作后形成一组数据序列。
进一步地，处理模块74，还设置为将2组所述一组数据序列进行加操作后形成一组数据序列之前，对至少一组数据序列进行点乘操作。点乘操作所点乘的待乘序列为模相等相位依次变化的序列。
进一步地，处理模块74，还设置为将所述2组所述一组数据序列进行加操作之前，对每组的所述一组数据序列进行加窗操作或滤波操作。
进一步地，所述传输所述一组数据序列，还包括，对所述一组数据序列进行滤波。
进一步地，所述传输所述一组数据序列，还包括，每个频域资源块使用相同的波形函数进行滤波。
进一步地，所述滤波为单相滤波或多相滤波。
进一步地，所述多相滤波所使用的滤波函数包括：根升余弦函数、或者升余弦函数、或者矩形函数、或者IOTA(Isotropic Orthogonal Transform Algorithm)函数、或者1+D函数等。
进一步地，所述传输所述一组数据序列，还包括，对所述一组数据序列进行加窗操作。
进一步地，所述传输所述一组数据序列，还包括，通过加窗操作或多相滤波操作，对每个频域资源块使用相同的波形函数进行滤波。
进一步地，所述待传输数据包括星座点调制的数据，也包括参考信号数据。
在一个可选实施例中，所述N个频域资源块在频域连续分布。
在一个可选实施例中，所述每组的L(m)个频域资源块在频域不连续，但相邻频域资源块的频谱间隔相等。
在一个可选实施例中，在所述两组频域资源块中至少有一组频域资源块的频域资源块带宽为所述组内相邻频域资源块的频谱间隔的1/w，w为正整数。
在一个可选实施例中，分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成L(m)组数据序列的过程中，所述方法还包括：在所述两组频域资源块中至少有一组频域资源块的数据序列的相邻数据时域间隔等于组内相邻资源块的频谱间隔的倒数。
在一个可选实施例中，所述N个频域资源块的子载波间隔都相等。
在一个可选实施例中，所述每组内的L(m)个频域资源块中，每个频域资源块包含的子载波数相等。
在一个可选实施例中，在所述两组频域资源块中，每组内的频域资源块带宽相等。
在一个可选实施例中，在所述两组频域资源块中，不同组的频域资源块带宽不相等。
在一个可选实施例中，在所述两组频域资源块中，不同组的频域资源块带宽相等。
在一个可选实施例中，不同组的频域资源块带宽之比为1∶U或者U∶1，其中，U＝2i-1，i为大于0的整数；当i＝0时，表示不同组的频域资源块带宽相等。
在一个可选实施例中，所述N个频域资源块的子载波间隔都相等。
在一个可选实施例中，所述每组内的L(m)个频域资源块中，每个频域资源块包含的子载波数相等。
在一个可选实施例中，在所述两组频域资源块中，每组内的频域资源块带宽相等。
在一个可选实施例中，在所述两组频域资源块中，不同组的频域资源块带宽不相等。
在一个可选实施例中，在所述两组频域资源块中，不同组的频域资源块带宽相等。
在一个可选实施例中，不同组的频域资源块带宽之比为1∶U或者U∶1，其中，U＝2i-1，i为大于0的整数；当i＝0时，表示不同组的频域资源块带宽相等。
需要说明的是，上述各个模块是可以通过软件或硬件来实现的，对于后者，可以通过以下方式实现，但不限于此：上述模块均位于同一处理器中；或者，上述各个模块以任意组合的形式分别位于不同的处理器中。
本公开的实施例还提供了一种计算机可读存储介质，该计算机可读存储介质中存储有计算机程序，其中，该计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
在一个示例性实施例中，上述计算机可读存储介质可以包括但不限于：U盘、只读存储器(Read-Only Memory，简称为ROM)、随机存取存储器(Random Access Memory，简称为RAM)、移动硬盘、磁碟或者光盘等各种可以存储计算机程序的介质。
本公开的实施例还提供了一种电子装置，包括存储器和处理器，该存储器中存储有计算 机程序，该处理器被设置为运行计算机程序以执行上述任一项方法实施例中的步骤。
在一个示例性实施例中，上述电子装置还可以包括传输设备以及输入输出设备，其中，该传输设备和上述处理器连接，该输入输出设备和上述处理器连接。
本实施例中的具体示例可以参考上述实施例及示例性实施方式中所描述的示例，本实施例在此不再赘述。
显然，本领域的技术人员应该明白，上述的本公开的各模块或各步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在某些情况下，可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成各个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本公开不限制于任何特定的硬件和软件结合。
以上所述仅为本公开的优选实施例而已，并不用于限制本公开，对于本领域的技术人员来说，本公开可以有各种更改和变化。凡在本公开的原则之内，所作的任何修改、等同替换、改进等，均应包含在本公开的保护范围之内。

Claims (15)

  1. 一种数据序列的形成方法，包括：
    将用于传输待传输数据的N个频域资源块分成两组，得到两组频域资源块，其中，每组包含L(m)个频域资源块，所述两组频域资源块在频域交错分布，N和L(m)均为正整数，m＝1或2；
    分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成L(m)组数据序列。
  2. 根据权利要求1所述的方法，其中，分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成L(m)组数据序列之后，所述方法还包括：
    对所述L(m)组数据序列进行处理以形成一组数据序列；
    对所述两组频域资源块对应的两组所述一组数据序列进行处理以形成组合的一组数据序列；
    传输所述组合的一组数据序列。
  3. 根据权利要求1所述的方法，其中，所述方法还包括：
    所述N个频域资源块在频域连续分布。
  4. 根据权利要求1所述的方法，其中，所述方法还包括：
    所述每组的L(m)个频域资源块在频域不连续，但相邻频域资源块的频谱间隔相等。
  5. 根据权利要求1所述的方法，其中，所述方法还包括：
    在所述两组频域资源块中至少有一组频域资源块的频域资源块带宽为所述组内相邻频域资源块的频谱间隔的1/w，w为正整数。
  6. 根据权利要求1所述的方法，其中，所述方法还包括：
    在所述两组频域资源块中至少有一组频域资源块的数据序列的相邻数据时域间隔等于组内相邻资源块的频谱间隔的倒数。
  7. 根据权利要求1所述的方法，其中，所述方法还包括：
    所述N个频域资源块的子载波间隔都相等。
  8. 根据权利要求1所述的方法，其中，所述方法还包括：
    所述每组内的L(m)个频域资源块中，每个频域资源块包含的子载波数相等。
  9. 根据权利要求1所述的方法，其中，所述方法还包括：
    在所述两组频域资源块中，每组内的频域资源块带宽相等。
  10. 根据权利要求1所述的方法，其中，所述方法还包括：
    在所述两组频域资源块中，不同组的频域资源块带宽不相等。
  11. 根据权利要求1所述的方法，其中，所述方法还包括：
    在所述两组频域资源块中，不同组的频域资源块带宽相等。
  12. 根据权利要求1所述的方法，其中，所述方法还包括：
    不同组的频域资源块带宽之比为1∶U或者U∶1，其中，U＝2i-1，i为大于0的整数；当i＝0时，表示不同组的频域资源块带宽相等。
  13. 一种数据序列的形成装置，包括：
    划分模块，设置为将用于传输待传输数据的N个频域资源块分成两组，得到两组频域资源块，其中，每组包含L(m)个频域资源块，所述两组频域资源块在频域交错分布，N和L(m)均为正整数，m＝1或2；
    处理模块，设置为分别对每组里的L(m)个频域资源块上的待传输数据进行处理以形成L(m)组数据序列。
  14. 一种存储介质，所述存储介质中存储有计算机程序，其中，所述计算机程序被设置为运行时执行所述权利要求1至12任一项中所述的方法。
  15. 一种电子装置，包括存储器和处理器，所述存储器中存储有计算机程序，所述处理器被设置为运行所述计算机程序以执行所述权利要求1至12任一项中所述的方法。
PCT/CN2023/090919 2022-05-05 2023-04-26 数据序列的形成方法、装置、存储介质及电子装置 Ceased WO2023213217A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
EP23799203.7A EP4521832A4 (en) 2022-05-05 2023-04-26 METHOD AND APPARATUS FOR FORMING A DATA SEQUENCE, AND STORAGE MEDIUM AND ELECTRONIC APPARATUS
US18/863,080 US20250310941A1 (en) 2022-05-05 2023-04-26 Method and Apparatus for Forming Data Sequence, and Storage Medium, and Electronic Apparatus
KR1020247035044A KR20240161828A (ko) 2022-05-05 2023-04-26 데이터 시퀀스의 형성 방법, 장치, 저장 매체 및 전자 장치

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210482314.4A CN117082623A (zh) 2022-05-05 2022-05-05 数据序列的形成方法、装置、存储介质及电子装置
CN202210482314.4 2022-05-05

Publications (1)

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

Family

ID=88646260

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/090919 Ceased WO2023213217A1 (zh) 2022-05-05 2023-04-26 数据序列的形成方法、装置、存储介质及电子装置

Country Status (5)

Country Link
US (1) US20250310941A1 (zh)
EP (1) EP4521832A4 (zh)
KR (1) KR20240161828A (zh)
CN (1) CN117082623A (zh)
WO (1) WO2023213217A1 (zh)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN120415986A (zh) * 2024-02-01 2025-08-01 中兴通讯股份有限公司 数据传输方法、网络设备及存储介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101150553A (zh) * 2006-09-19 2008-03-26 中兴通讯股份有限公司 一种基于正交频分复用系统的资源块分配方法
US20170346669A1 (en) * 2015-01-16 2017-11-30 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for extracting resource block from signal
CN111901877A (zh) * 2020-05-08 2020-11-06 中兴通讯股份有限公司 一种资源分配方法、设备和存储介质
CN112469126A (zh) * 2019-09-09 2021-03-09 北京东土科技股份有限公司 实时通信方法、装置、计算机设备及存储介质
CN114071740A (zh) * 2020-08-06 2022-02-18 北京紫光展锐通信技术有限公司 上行复用时频资源的确定方法及装置
WO2023051351A1 (zh) * 2021-09-29 2023-04-06 中兴通讯股份有限公司 数据传输方法、数据调制方法、电子设备和存储介质

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101854638A (zh) * 2009-03-30 2010-10-06 中兴通讯股份有限公司 一种资源块分组波束赋形的方法和装置
CN108306841B (zh) * 2017-01-11 2022-02-11 中兴通讯股份有限公司 用于ofdm通信的信号设计方法及系统、发射机、接收机

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101150553A (zh) * 2006-09-19 2008-03-26 中兴通讯股份有限公司 一种基于正交频分复用系统的资源块分配方法
US20170346669A1 (en) * 2015-01-16 2017-11-30 Telefonaktiebolaget Lm Ericsson (Publ) Method and apparatus for extracting resource block from signal
CN112469126A (zh) * 2019-09-09 2021-03-09 北京东土科技股份有限公司 实时通信方法、装置、计算机设备及存储介质
CN111901877A (zh) * 2020-05-08 2020-11-06 中兴通讯股份有限公司 一种资源分配方法、设备和存储介质
CN114071740A (zh) * 2020-08-06 2022-02-18 北京紫光展锐通信技术有限公司 上行复用时频资源的确定方法及装置
WO2023051351A1 (zh) * 2021-09-29 2023-04-06 中兴通讯股份有限公司 数据传输方法、数据调制方法、电子设备和存储介质

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP4521832A4

Also Published As

Publication number Publication date
CN117082623A (zh) 2023-11-17
EP4521832A1 (en) 2025-03-12
KR20240161828A (ko) 2024-11-12
EP4521832A4 (en) 2025-08-13
US20250310941A1 (en) 2025-10-02

Similar Documents

Publication Publication Date Title
EP4373042A1 (en) Data transmission method and apparatus, data modulation method and apparatus, electronic device, and storage medium
US12513034B2 (en) Data transmission method, data modulation method, and electronic device and storage medium
WO2023213230A1 (zh) 传输数据序列的方法、装置、存储介质及电子装置
CN106576092A (zh) Fbmc信号的发送方法、接收方法和发射机以及接收机
WO2023213228A1 (zh) 数据传输方法、装置、存储介质及电子装置
EP4395251A1 (en) Data transmission method, data modulation method, electronic device, and storage medium
WO2023213217A1 (zh) 数据序列的形成方法、装置、存储介质及电子装置
CN107026809B (zh) 一种数据处理方法和装置
CN107438041B (zh) 一种发送信号和接收信号的方法及装置
CN106488579B (zh) 一种信号处理方法及装置
WO2023213227A1 (zh) 数据的传输方法、装置、存储介质及电子装置
CN118118302A (zh) 数据传输方法、设备和存储介质
WO2025066391A1 (zh) 数据传输方法、设备及存储介质
WO2026016478A1 (zh) 一种数据传输方法
WO2026016497A1 (zh) 一种数据传输方法
EP4597962A1 (en) Data transmission method, data processing method, communication device, medium and product
WO2025161524A1 (zh) 数据传输方法、存储介质和电子装置
WO2025066394A1 (zh) 数据传输方法、设备及存储介质
WO2025066279A1 (zh) 数据传输方法、设备及存储介质
WO2026051389A1 (zh) 数据调制方法
WO2025066404A1 (zh) 数据传输方法、设备及存储介质
WO2025066128A1 (zh) 数据传输方法、设备及存储介质

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: 23799203

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 20247035044

Country of ref document: KR

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 1020247035044

Country of ref document: KR

WWE Wipo information: entry into national phase

Ref document number: 18863080

Country of ref document: US

WWE Wipo information: entry into national phase

Ref document number: 2023799203

Country of ref document: EP

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2023799203

Country of ref document: EP

Effective date: 20241205

WWP Wipo information: published in national office

Ref document number: 18863080

Country of ref document: US