WO2021093862A1 - Ofdm时域加窗方法及装置 - Google Patents

Ofdm时域加窗方法及装置 Download PDF

Info

Publication number
WO2021093862A1
WO2021093862A1 PCT/CN2020/128767 CN2020128767W WO2021093862A1 WO 2021093862 A1 WO2021093862 A1 WO 2021093862A1 CN 2020128767 W CN2020128767 W CN 2020128767W WO 2021093862 A1 WO2021093862 A1 WO 2021093862A1
Authority
WO
WIPO (PCT)
Prior art keywords
data
windowing
data segment
length
ifft
Prior art date
Application number
PCT/CN2020/128767
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 深圳市中兴微电子技术有限公司
Priority to US17/776,578 priority Critical patent/US20220385510A1/en
Publication of WO2021093862A1 publication Critical patent/WO2021093862A1/zh

Links

Images

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
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2602—Signal structure
    • H04L27/2605—Symbol extensions, e.g. Zero Tail, Unique Word [UW]
    • H04L27/2607—Cyclic extensions
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L27/00—Modulated-carrier systems
    • H04L27/26—Systems using multi-frequency codes
    • H04L27/2601—Multicarrier modulation systems
    • H04L27/2626—Arrangements specific to the transmitter only
    • H04L27/2627—Modulators
    • H04L27/2628—Inverse Fourier transform modulators, e.g. inverse fast Fourier transform [IFFT] or inverse discrete Fourier transform [IDFT] modulators
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • 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), DMT

Definitions

  • This application relates to the field of communications, for example, to an orthogonal frequency division multiplexing (OFDM) time-domain windowing method and device.
  • OFDM orthogonal frequency division multiplexing
  • the entire signal frequency band is divided into N non-overlapping frequency sub-channels.
  • Each sub-channel transmits an independent modulation symbol, and then N sub-channels are frequency-multiplexed. This way of avoiding channel spectrum overlap seems to help eliminate interference between channels, but it cannot effectively use spectrum resources.
  • OFDM is a multi-carrier transmission method that can make full use of spectrum resources. It can combine diversity, space-time coding, interference and inter-channel interference suppression, and smart antenna technology to maximize system performance. OFDM can well resist the frequency selective fading of wireless channels, and suppress multipath effects and narrow-band radio frequency interference.
  • the channel allocation of conventional frequency division multiplexing and OFDM is shown in Figure 1. It can be seen from Figure 1 that OFDM can save at least half of the spectrum resources.
  • OFDM uses Inverse Fast Fourier Transform (Inverse Fast Fourier Transform, IFFT) and Fast Fourier Transform (Fast Fourier Transform, FFT) to realize modulation and demodulation, and the processing flow is shown in Figure 2.
  • IFFT Inverse Fast Fourier Transform
  • FFT Fast Fourier Transform
  • the OFDM modulation and demodulation process is as follows:
  • the transmitter When the transmitter transmits data, it converts high-speed serial data into low-speed parallel and uses multiple orthogonal sub-carriers for data transmission; 2. Multiple sub-carriers use independent modulators and demodulators; 3. Multiple sub-carriers It requires complete orthogonality and complete synchronization of the reception and transmission of multiple sub-carriers; 4. The transmitter and the receiver must be accurately at the same frequency, synchronization, and accurate bit sampling; 5. The receiver performs synchronous sampling at the back end of the demodulator , Get the data, and then convert to high-speed serial.
  • the multi-carrier characteristics and channel time-varying characteristics of the OFDM system determine that it has strict requirements on the orthogonality of sub-carriers in the channel, and frequency deviation will cause interference between sub-carriers. Therefore, the main problem of OFDM technology is that it is very sensitive to the frequency offset of the receiving and transmitting carrier. If the frequency offset occurs, Intercarrier Interference (ICI) will occur, which will increase the bit error rate of the receiving end and cause The performance of the system has dropped significantly.
  • ICI Intercarrier Interference
  • the finite-length sequence should be intercepted for analysis.
  • the infinite sequence is suddenly truncated, which is equivalent to multiplying a rectangular window in the time domain, and the data in the window does not change.
  • the sudden truncation of an infinite sequence is equivalent to the periodic convolution of the frequency spectrum of the wireless long sequence and the frequency spectrum of the sequence in the rectangular window.
  • the energy originally concentrated at the base is dispersed into two wider frequency bands, thus Produce spectral energy leakage and produce frequency dispersion distortion.
  • Using different interception window functions to intercept the signal can reduce spectral energy leakage, which is closely related to the spectral characteristics of the window function.
  • Intercepting the signal with a slow-changing window function and using a sampling frequency n times higher than the signal frequency is a common method to solve spectral energy leakage. If the energy of the window function is relatively concentrated in the main lobe, and the amplitude of the side lobes tends to zero, the signal spectrum can be truly restored.
  • An ideal window function should have the characteristics of narrow main lobe width, low side lobe width, and fast side lobe attenuation speed.
  • the embodiments of the present application provide an OFDM time-domain windowing method and device to at least solve the problems of large processing delay and high power consumption caused by independent processing of OFDM windowing and FFT data processing in the related art.
  • an OFDM time-domain windowing method including: analyzing current OFDM symbol data according to configuration tasks, and performing IFFT processing on the current OFDM symbol data; Add a cyclic prefix CP to the IFFT data; determine the time-domain windowing mode of the current OFDM symbol data according to the configuration task, and perform a windowing operation on the IFFT data after the CP is added according to the determined time-domain windowing mode, and Output windowed IFFT data.
  • an OFDM time-domain windowing device including: an IFF processing module configured to parse current OFDM symbol data according to configuration tasks, and perform IFFT processing on the current OFDM symbol data Cyclic prefix module, set to add cyclic prefix CP to the IFFT data after IFFT processing; windowing module, set to determine the time domain windowing mode of the current OFDM symbol data according to the configuration task, and according to the determined The time domain windowing mode performs a windowing operation on the IFFT data after adding the CP, and outputs the IFFT data after the windowing operation.
  • a storage medium in which a computer program is stored, wherein the computer program is configured to execute the steps in any one of the foregoing method embodiments when running.
  • an electronic device including a memory and a processor, the memory is stored with a computer program, and the processor is configured to run the computer program to execute any of the above Steps in the method embodiment.
  • Figure 1 is a schematic diagram of channel allocation of frequency division multiplexing and OFDM according to related technologies
  • FIG. 2 is a flow chart of OFDM data processing according to related technologies
  • Fig. 3 is a flowchart of an OFDM time-domain windowing method according to an embodiment of the present application
  • FIG. 4 is a processing flowchart of a windowed bypass mode according to an embodiment of the present application.
  • Fig. 5 is a processing flowchart of windowing mode 1 according to an embodiment of the present application.
  • Fig. 6 is a processing flowchart of windowing mode 2 according to an embodiment of the present application.
  • Fig. 7 is a processing flowchart of windowing mode 3 according to an embodiment of the present application.
  • FIG. 8 is a schematic diagram of implementing windowing mode 1 according to an embodiment of the present application.
  • FIG. 9 is a schematic diagram of partial data caching of windowing mode 1 according to an embodiment of the present application.
  • FIG. 10 is a schematic diagram of implementing windowing mode 2 according to an embodiment of the present application.
  • FIG. 11 is a schematic diagram of partial data caching of windowing mode 2 according to an embodiment of the present application.
  • FIG. 12 is a schematic diagram of implementing windowing mode 3 according to an embodiment of the present application.
  • FIG. 13 is a structural diagram of a time domain windowing implementation module according to an embodiment of the present application.
  • Fig. 14 is a block diagram of an OFDM time-domain windowing device module structure according to an embodiment of the present application.
  • FIG. 3 is a flowchart of the method according to an embodiment of the present application. As shown in FIG. 3, the process includes the following steps:
  • Step S302 Analyze the current OFDM symbol data according to the configuration task, and perform IFFT processing on the current OFDM symbol data.
  • Step S304 Add a cyclic prefix CP to the IFFT data after IFFT processing.
  • Step S306 Determine the time-domain windowing mode of the current OFDM symbol data according to the configuration task, and perform a windowing operation on the CP-added IFFT data according to the determined time-domain windowing mode, and output the windowing operation After the IFFT data.
  • step S302 in this embodiment may further include the step of: performing task configuration on the current OFDM symbol data, where the configuration task includes task parameters, read addresses of windowed data, and windowing coefficients.
  • step S306 of this embodiment when the time domain windowing mode is the windowed bypass mode, the IFFT data with the added cyclic prefix CP is directly output to the subsequent module.
  • a data copy of length A0 is taken from the header of the previous OFDM symbol as a cyclic suffix, and the cyclic suffix and the last length of the previous OFDM symbol are
  • the data of A0 is composed of data segment B1 with a length of 2 ⁇ A0; the data of length A0 is taken from the CP header of the current OFDM symbol, and the data of length A0 before CP is taken out to form a data segment A2 of length 2 ⁇ A0 , Where the length 2 ⁇ A0 is equal to the length of CP; the data segment A2 is multiplied by the rising window coefficient, the data segment B1 is multiplied by the falling window coefficient, and then superimposed to obtain the data segment C; the previous length of the data segment C is A0 The data of the previous OFDM symbol replaces the last data of the length A0 of the previous OFDM symbol, and the data of the last length of the data segment C of the data segment C replaces the data of the previous length of A0 of the
  • a data copy with a length of 2 ⁇ A0 is taken from the header of the previous OFDM symbol as the cyclic suffix data segment B1, where the length of 2 ⁇ A0 is less than or equal to the length of CP ;
  • Data segment B1 windowed data the data segment A1 and the data segment B1 windowed data are superimposed to obtain data segment C, the data segment C is replaced by the data segment A1 of the current OFDM symbol, and the current OFDM symbol is replaced by the data segment A1.
  • the remaining data segment A2 of the CP of the symbol is reserved as the CP.
  • a data segment A with a length of 2 ⁇ A0 is taken from the CP header of the current OFDM symbol, where the length 2 ⁇ A0 is less than the length of the CP; Segment A is multiplied by the rising window coefficient to replace the data of the data segment A; take the data segment B with a length of 2 ⁇ A0 from the end of the current OFDM symbol, and multiply the data segment B by the falling window coefficient to replace the data segment B The data.
  • the method may further include a step of sorting the IFFT data after the windowing operation, and then transmitting it through a wireless channel.
  • the IFFT transformation and windowing steps in the OFDM system are combined to process, and the processing method of time-domain windowing for different scenarios is enhanced, thereby Reduce processing delay, reduce power consumption, improve system performance, and enhance the transmission quality of received signals.
  • the technical problem to be solved in this embodiment is to enhance the configuration flexibility of time-domain windowing processing, reduce the integrated processing delay of windowing and IFFT operation, improve system performance, and reduce system power consumption.
  • the windowing operation is after the IFFT operation.
  • the rising window coefficient and the falling window coefficient of the window coefficient are symmetrical, and only half of the window coefficient needs to be stored.
  • the data volume of the windowing operation is less than the CP data volume.
  • This embodiment utilizes the above-mentioned time-domain windowing feature to provide a time-domain windowing method for a wireless communication system, as shown in Figs. 4 to 7, which mainly includes the following steps:
  • the external main control module sends the processing task configuration to the FFT processing module.
  • Windowing mode judgment There are four windowing modes, namely, windowing bypass mode, windowing mode 1, windowing mode 2, and windowing mode 3.
  • the task is issued through the switch configuration of the register. If it is the windowed bypass mode, directly bypass the IFFT data after the IFFT operation. If it is windowing mode 1, then jump to the processing flow of windowing mode 1. If it is windowing mode 2, then jump to the processing flow of windowing mode 2. If it is windowed mode 3, then jump to the processing flow of windowed mode 3.
  • Data organization organize data and prepare for sending.
  • Data sending Send data to subsequent modules for processing.
  • Figure 4 shows the processing flow of the windowed bypass mode.
  • the windowed bypass mode when the windowed bypass mode is configured, the IFFT data with the added cyclic prefix CP is directly output to the subsequent module. That is, to organize the data, prepare for the data transmission, and then send the data to the subsequent module for processing.
  • FIG. 8 is a schematic diagram of the implementation process of windowing mode 1.
  • first take the data copy of length A0 from the head of the previous symbol k as the cyclic suffix, then the cyclic suffix and the last data of symbol k with the length of A0 form the data segment B1, and the length of the data segment B1 is 2 ⁇ A0.
  • the data segment A2 is multiplied by the rising window coefficient, the data segment B1 is multiplied by the falling window coefficient, and then the data segment C is superimposed.
  • the data with the length A0 before the data segment C replaces the data with the last length A0 of the symbol k; the data with the length A0 after the data segment C replaces the data with the length A0 before the CP of the symbol k+1.
  • the length 2 ⁇ A0 must be equal to the CP length.
  • Each symbol must be shifted forward by at least A0 points, that is, the data whose length is A0 after the symbol k is output with the symbol k+1. Therefore, when the symbol k is processed, the data segment B1 of the symbol k needs to be multiplied by the falling window coefficient and output to the memory address indicated by win_addr and win_addr_offset to cache it, and then read it out when the symbol k+1 is processed.
  • the windowed data of the data segment A2 of the symbol k+1 completes the superposition processing.
  • the output buffer data composition is shown in Figure 9. First output the data with length Wa-A0 before data segment B1, and then output the data with length 2 ⁇ A0 after data segment B1 is windowed, and finally the remaining length of Wa-A0 point space is filled with 0, and it is filled with 2 ⁇ Wa sampling points.
  • the first symbol and the uplink/downlink switching point shall assume that the data of the previous symbol is all 0.
  • the data is organized to prepare for data transmission, and then the data is sent to the subsequent module for processing.
  • FIG. 6 is a flowchart of windowing mode 2.
  • FIG. 10 is a schematic diagram of the implementation process of windowing mode 2.
  • a data copy with a length of 2 ⁇ A0 is taken from the head of the previous symbol k as a cyclic suffix (data segment B1).
  • a data segment A1 with a length of 2 ⁇ A0 is taken from the CP header of k+1 of the latter symbol.
  • the remaining part A2 of the CP of the symbol k+1 is still reserved as the CP.
  • the output data of the FFT is the output (Output) of A1+A2+IFFT for each symbol, because the data segment A1 of the symbol k+1 is related to the windowed data of the data segment B1 of the previous symbol k. Therefore, when the symbol k is processed, the data segment B1 of the symbol k needs to be multiplied by the data after the falling window and output to the memory address indicated by win_data_addr to be cached, and then read when the k+1 symbol is processed and the data segment A1 windowed The data is superimposed.
  • Data segment B1 indicates to cache 2 ⁇ A0 data, but considering that in the dynamic TTI time division scenario, the number of points and window length of the two adjacent symbols FFT are inconsistent, in order to ensure that the processing is error-free, use the parameter Wa(win_data_wa) to indicate that the data segment needs to be cached
  • the data length of B1 the amount of buffered data is 2*Wa sampling points. Wa must be greater than or equal to W0, and 2 ⁇ Wa ⁇ CP length, W0 is the windowing coefficient.
  • the output buffer data is shown in Figure 11. First output the data segment B1 windowed with the length of 2 ⁇ A0 data, and then add 0 to the remaining length of 2 ⁇ (Wa-A0) to fill up 2 ⁇ Wa sampling points. When powering on for the first time and switching between uplink and downlink tasks, it is assumed that the last symbol data is all 0.
  • the data is organized to prepare for data transmission, and then the data is sent to the subsequent module for processing.
  • FIG. 12 is a schematic diagram of the implementation process of windowing mode 3. As shown in Figure 12, this mode is a windowing mode that only adds windows without overlapping. At this time, two adjacent symbols are directly uncoupled. First, a data segment (data segment A) with a length of 2 ⁇ A0 is taken from the CP header of the symbol k+1, and then the data segment A is multiplied by the rising window coefficient to replace the data segment A. Take the data of 2 ⁇ A0 (data segment B) from the end of the symbol k+1, and then multiply the data segment B by the drop window coefficient to replace the data segment B. Both A and B only add windows and do not overlap.
  • the length of 2 ⁇ A0 must be less than the length of CP.
  • windowing mode 3 After the processing of windowing mode 3 is completed, the data is organized to prepare for data transmission. Then, send the data to subsequent modules for processing.
  • the embodiment of the present application also provides a time-domain windowing implementation device for a wireless communication system, as shown in FIG. 13, which includes the following modules:
  • Module A task configuration: configure task parameters and read address of windowing data and windowing coefficient.
  • Module B IFFT processing: Use IFFT to transform the signal from the discrete frequency domain to the discrete time domain, as if the signal were multiplied by different sub-carrier frequencies.
  • Module C insert a cyclic prefix: the signal tail part is moved to the signal front end to reduce the impact of multipath interference on the system.
  • Windowing mode 1 Multiply the window function to reduce the high frequency signals that may be generated due to the extremely discontinuous phase angle changes between the two received signals.
  • Windowing mode 2 Multiply the window function to reduce the high frequency signals that may be generated due to the extremely discontinuous phase angle changes between the two received signals.
  • Windowing mode 3 Multiply the window function to reduce the high frequency signals that may be generated due to the extremely discontinuous phase angle changes between the two received signals.
  • Module G channel transmission: data transmission through wireless channel.
  • module A configures the task, configures the current symbol-related data, parameters, and the read address and data of the windowing coefficient.
  • Module B analyzes and processes the tasks configured by module A, and starts IFFT processing according to the configured parameters. Take out the data whose tail length is CP from the output data of the B module and put it at the head of the current symbol data queue. The data is directly output to the module G for sending processing, and output to the wireless channel.
  • module A configures the task, configures the current symbol-related data, parameters, and the read address and data of the windowing coefficient.
  • Module B analyzes and processes the tasks configured by module A, and starts IFFT processing according to the configured parameters. Take out the data whose tail length is CP from the output data of module B and put it at the head of the current symbol data queue. If module A is configured with windowing mode 1, then the data is input to module D, and module D performs data buffering and windowing operation according to the processing flow of windowing mode 1, and outputs the current IFFT data after the operation is completed.
  • Module G processes the output data of module D and sends the processed data to the wireless channel.
  • module A configures the task, configures the current symbol-related data, parameters, and the read address and data of the windowing coefficient.
  • Module B analyzes and processes the tasks configured by module A, and starts IFFT processing according to the configured parameters. Take out the data whose tail length is CP from the output data of module B and put it at the head of the current symbol data queue.
  • module A If module A is configured with windowing mode 2, then data is input to module E, and module E performs data buffering and windowing operations according to the processing flow of windowing mode 2, and outputs the current IFFT data after the calculation is completed.
  • Module G processes the output data of module E and sends the processed data to the wireless channel.
  • module A configures the task, configures the current symbol-related data, parameters, and the read address and data of the windowing coefficient.
  • Module B analyzes and processes the tasks configured by module A, and starts IFFT processing according to the configured parameters. Take out the data whose tail length is CP from the output data of module B and put it at the head of the current symbol data queue. If module A is configured with windowing mode 3, then the data is input to module F, and module F performs data buffering and windowing operation according to the processing flow of windowing mode 3, and outputs the current IFFT data after the operation is completed.
  • Module G processes the output data of module F and sends it to the wireless channel.
  • the technical solution of the present application can be embodied in the form of a software product.
  • the computer software product is stored in a storage medium (such as Read-Only Memory, ROM)/Random Access Memory (Random Access Memory). , RAM), magnetic disk, optical disk), including multiple instructions to make a terminal device (which can be a mobile phone, a computer, a server, or a network device, etc.) execute the methods described in multiple embodiments of the present application.
  • a storage medium such as Read-Only Memory, ROM)/Random Access Memory (Random Access Memory).
  • RAM Random Access Memory
  • magnetic disk magnetic disk
  • optical disk including multiple instructions to make a terminal device (which can be a mobile phone, a computer, a server, or a network device, etc.) execute the methods described in multiple embodiments of the present application.
  • an OFDM time-domain windowing device is also provided, which is used to implement the above-mentioned embodiments and optional implementation manners, and those that have been described will not be repeated.
  • the term "module” can implement a combination of software and/or hardware with predetermined functions.
  • the devices described in the following embodiments can be implemented by software, implementation by hardware or a combination of software and hardware is also possible and conceived.
  • FIG. 14 is a structural block diagram of an OFDM time domain windowing device according to an embodiment of the present application. As shown in FIG. 14, the device includes an IFF processing module 10, a cyclic prefix module 20, and a windowing module 30.
  • the IFF processing module 10 is configured to analyze the current OFDM symbol data according to the configuration task, and perform IFFT processing on the current OFDM symbol data.
  • the cyclic prefix module 20 is configured to add a cyclic prefix CP to the IFFT data after IFFT processing.
  • the windowing module 30 is configured to determine the time-domain windowing mode of the current OFDM symbol data according to the configuration task, and perform a windowing operation on the CP-added IFFT data according to the determined time-domain windowing mode, and Output windowed IFFT data.
  • the above-mentioned multiple modules can be implemented by software or hardware. For the latter, it can be implemented in the following ways, but not limited to this: the above-mentioned modules are all located in the same processor; or, the above-mentioned multiple modules are respectively in the form of any combination. Located in different processors.
  • the embodiment of the present application also provides a storage medium in which a computer program is stored, wherein the computer program is configured to execute the steps in any of the foregoing method embodiments when running.
  • the foregoing storage medium may include, but is not limited to: U disk, ROM, RAM, mobile hard disk, magnetic disk, or optical disk, and other media that can store computer programs.
  • An embodiment of the present application also provides an electronic device, including a memory and a processor, the memory stores a computer program, and the processor is configured to run the computer program to execute the steps in any one of the foregoing method embodiments.
  • the aforementioned electronic device may further include a transmission device and an input-output device, where the transmission device is connected to the aforementioned processor, and the aforementioned input-output device is connected to the aforementioned processor.

Landscapes

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

Abstract

本申请提供了一种OFDM时域加窗方法及装置，该方法包括：按照配置任务对当前OFDM符号数据进行解析，并对所述当前OFDM符号数据进行IFFT处理；对进行IFFT处理后的IFFT数据增加循环前缀CP；按照所述配置任务确定所述当前OFDM符号数据的时域加窗模式，并按照确定的所述时域加窗模式对增加CP后的IFFT数据进行加窗运算，并输出加窗运算后的IFFT数据。

Description

OFDM时域加窗方法及装置
本申请要求在2019年11月14日提交中国专利局、申请号为201911114928.1的中国专利申请的优先权，该申请的全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信领域，例如涉及一种正交频分复用(Orthogonal Frequency Division Multiplexing，OFDM)时域加窗方法及装置。
背景技术
在传统的并行数据传输系统中，整个信号频段被划分为N个相互不重叠的频率子信道。每个子信道传输独立的调制符号，然后再将N个子信道进行频率复用。这种避免信道频谱重叠的方式看起来有利于消除信道间的干扰，但是这样又不能有效利用频谱资源。
在向第三代移动通信系统(the 3rd Generation mobile communication system，3G)/第四代移动通信系统(the 4th Generation mobile communication system，4G)/第五代移动通信系统(the 5th Generation mobile communication system，5G)演进的过程中，OFDM是一种能够充分利用频谱资源的多载波传输方式，可以结合分集，时空编码，干扰和信道间干扰抑制以及智能天线技术，最大限度的提高系统性能。OFDM可以很好地抵抗无线信道的频率选择性衰落，抑制多径效应和窄带上的射频干扰。常规频分复用与OFDM的信道分配情况如图1所示，从图1可以看出OFDM至少能够节约二分之一的频谱资源。
OFDM利用快速傅立叶反变换(Inverse Fast Fourier Transform，IFFT)和快速傅立叶变换(Fast Fourier Transform，FFT)来实现调制和解调，处理流程如图2所示。
OFDM的调制解调流程如下：
1.发射机在发射数据时，将高速串行数据转为低速并行，利用正交的多个子载波进行数据传输；2.多个子载波使用独立的调制器和解调器；3.多个子载波之间要求完全正交、多个子载波的接收和发送完全同步；4.发射机和接收机要精确同频、同步，准确进行位采样；5.接收机在解调器的后端进行同步采样，获得 数据，然后转为高速串行。
OFDM系统的多载波特性和信道时变特性决定了其对信道中子载波的正交性有严格要求，频率偏差会造成子载波之间的干扰。因此，OFDM技术的主要问题在于对接收和发送载波频率偏移非常敏感，若发生频率偏移会导致出现子载波间的干扰(Intercarrier Interference，ICI)，由此增加了接收端的误码率，导致系统的性能明显下降。
同时，由于计算机无法实现对无限长的信号进行FFT运算和测量，应截取有限长序列进行分析。无限长序列被突然截断，相当于在时域乘以一个矩形窗口，窗内数据并不改变。在频域中，无限长序列被突然截断等同于无线长序列的频谱和矩形窗口内的序列的频谱的周期卷积，原来集中在基处的能量被分散到两个较宽的频带中，从而产生频谱能量泄露，产生频率扩散畸变。采用不同的截取窗函数对信号进行截断可以减少频谱能量泄露，频谱能量泄露与窗函数频谱特性密切相关。
用变化缓慢的窗函数截取信号，并用高于信号频率n倍的采样频率是解决频谱能量泄露的常用方法。若窗函数能量相对集中在主瓣，两侧瓣幅度趋于零，则可以真实的还原信号频谱。一个理想的窗函数应具有主瓣宽度窄、旁瓣宽度低、旁瓣衰减速度快的特点。
在传统的处理流程中，加窗处理和FFT数据处理是分别独立进行的。传统的方案设计比较简单，对于流量小的场景下是有效的。但是，随着协议的演进和系统容量的增加，如4G/5G系统，系统容量大幅增加，对处理时延要求较高，并且处理数据量也大幅增加。如果还采用传统方案，那么对于外部存储器的带宽要求就会非常高，而且性能不能有效提升，并且会导致功耗急剧增加。
发明内容
本申请实施例提供了一种OFDM时域加窗方法及装置，以至少解决相关技术中OFDM的加窗和FFT数据处理分别独立进行，所导致的处理时延大，功耗较高的问题。
根据本申请的一个实施例，提供了一种OFDM时域加窗方法，包括：按照配置任务对当前OFDM符号数据进行解析，并对所述当前OFDM符号数据进行IFFT处理；对进行IFFT处理后的IFFT数据增加循环前缀CP；按照所述配置任 务确定所述当前OFDM符号数据的时域加窗模式，并按照确定的所述时域加窗模式对增加CP后的IFFT数据进行加窗运算，并输出加窗运算后的IFFT数据。
根据本申请的另一个实施例，提供了一种OFDM时域加窗装置，包括：IFF处理模块，设置为按照配置任务对当前OFDM符号数据进行解析，并对所述当前OFDM符号数据进行IFFT处理；循环前缀模块，设置为对进行IFFT处理后的IFFT数据增加循环前缀CP；加窗模块，设置为按照所述配置任务确定所述当前OFDM符号数据的时域加窗模式，并按照确定的所述时域加窗模式对增加CP后的IFFT数据进行加窗运算，并输出加窗运算后的IFFT数据。
根据本申请的又一个实施例，还提供了一种存储介质，所述存储介质中存储有计算机程序，其中，所述计算机程序被设置为运行时执行上述任一项方法实施例中的步骤。
根据本申请的又一个实施例，还提供了一种电子装置，包括存储器和处理器，所述存储器中存储有计算机程序，所述处理器被设置为运行所述计算机程序以执行上述任一项方法实施例中的步骤。
附图说明
此处所说明的附图用来提供对本申请的进一步理解，构成本申请的一部分，本申请的示意性实施例及其说明用于解释本申请，并不构成对本申请的不当限定。在附图中：
图1是根据相关技术的频分复用与OFDM的信道分配情况示意图；
图2是根据相关技术的OFDM数据处理流程图；
图3是根据本申请实施例的OFDM时域加窗方法流程图；
图4是根据本申请实施例的加窗绕过(bypass)模式处理流程图；
图5是根据本申请实施例的加窗模式1处理流程图；
图6是根据本申请实施例的加窗模式2处理流程图；
图7是根据本申请实施例的加窗模式3处理流程图；
图8是根据本申请实施例的加窗模式1实现示意图；
图9是根据本申请实施例的加窗模式1部分数据缓存示意图；
图10是根据本申请实施例的加窗模式2实现示意图；
图11是根据本申请实施例的加窗模式2部分数据缓存示意图；
图12是根据本申请实施例的加窗模式3实现示意图；
图13是根据本申请实施例的时域加窗实现模块结构图；
图14是根据本申请实施例的OFDM时域加窗装置模块结构图。
具体实施方式
下文中将参考附图并结合实施例来说明本申请。本申请的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象，而不必用于描述指定的顺序或先后次序。
在本实施例中提供了一种OFDM时域加窗方法，图3是根据本申请实施例的方法流程图，如图3所示，该流程包括如下步骤：
步骤S302，按照配置任务对当前OFDM符号数据进行解析，并对所述当前OFDM符号数据进行IFFT处理。
步骤S304，对进行IFFT处理后的IFFT数据增加循环前缀CP。
步骤S306，按照所述配置任务确定所述当前OFDM符号数据的时域加窗模式，并按照确定的所述时域加窗模式对增加CP后的IFFT数据进行加窗运算，并输出加窗运算后的IFFT数据。
在本实施例的步骤S302之前，还可以包括步骤：对所述当前OFDM符号数据进行任务配置，其中，所述配置任务中包括任务参数和加窗数据的读地址及加窗系数。
在本实施例的步骤S306中，当所述时域加窗模式为加窗bypass模式时，将增加循环前缀CP的所述IFFT数据直接输出至后级模块。
当所述时域加窗模式为第一加窗模式时，从前一个OFDM符号的头部取出长度为A0的数据复制作为循环后缀，将所述循环后缀与所述前一个OFDM符 号最后的长度为A0的数据组成长度为2×A0的数据段B1；从当前OFDM符号的CP头部取出长度为A0的数据，再取出CP之前的长度为A0的数据，组成长度为2×A0的数据段A2，其中长度2×A0等于CP的长度；将所述数据段A2乘以上升窗系数，所述数据段B1乘以下降窗系数，然后叠加得到数据段C；将数据段C的前长度为A0的数据替换所述前一个OFDM符号的最后的长度为A0的数据，数据段C的后长度为A0的数据替换当前OFDM符号的CP的前长度为A0的数据。
当所述时域加窗模式为第二加窗模式时，从前一个OFDM符号的头部取出长度为2×A0的数据复制作为循环后缀数据段B1，其中长度2×A0小于或等于CP的长度；从当前OFDM符号的CP头部取出长度为2×A0的数据段A1；将所述数据段A1乘以上升窗系数得到数据段A1加窗后的数据，数据段B1乘以下降窗系数得到数据段B1加窗后的数据，将所述数据段A1和所述数据段B1加窗后的数据叠加得到数据段C，将所述数据段C替换当前OFDM符号的数据段A1，将当前OFDM符号的CP剩余的数据段A2作为CP保留。
当所述时域加窗模式为第三加窗模式时，从当前OFDM符号的CP头部取出长度为2×A0的数据段A，其中，长度2×A0小于CP的长度；将所述数据段A乘以上升窗系数后替换所述数据段A的数据；从当前OFDM符号的最后取长度为2×A0的数据段B，将所述数据段B乘以下降窗系数后替换数据段B的数据。
在本实施例的步骤S306之后，还可以包括步骤：将所述加窗运算后的IFFT数据进行整理后，通过无线信道进行传输。
在本申请的上述实施例中，利用OFDM的算法特性以及数据读写的特点，将OFDM系统中的IFFT变换和加窗步骤结合在一起处理，增强针对不同场景 时域加窗的处理方式，从而减少处理延时，降低功耗，提高系统性能，增强接收信号的传输质量。
为了便于对申请实施例所提供的技术方案的理解，下面将结合应用场景的实施例进行描述。
本实施例所要解决的技术问题是：增强时域加窗处理的配置灵活性，降低加窗和IFFT运算的综合处理延时，提高系统性能，降低系统功耗。
时域加窗有以下特点：
1、加窗运算是在IFFT运算之后。
2、窗系数的上升窗系数和下降窗系数是对称的，只需要存储一半的窗系数。
3、对于两个相关运算的加窗处理，需要缓存前一个符号的数据，以便进行加窗处理运算。
4、加窗运算的数据量小于CP数据量。
本实施例利用上述时域加窗特点，提供了一种用于无线通信系统的时域加窗方法，如图4至7所示，主要包括如下步骤：
任务下发：外部主控模块发送处理任务配置给FFT处理模块。
加窗模式判断：加窗模式一共有四种，分别为加窗bypass模式、加窗模式1、加窗模式2和加窗模式3。任务下发通过寄存器进行开关配置。如果是加窗bypass模式，直接bypass IFFT运算后的IFFT数据。如果是加窗模式1，则跳转到加窗模式1的处理流程。如果是加窗模式2，则跳转到加窗模式2的处理流程。如果是加窗模式3，则跳转到加窗模式3的处理流程。
加CP：增加循环前缀。
数据整理：对数据整理，为发送做准备。
数据发送：发送数据到后续模块进行处理。
下面将分别对上述的四种加窗模式处理进行说明。
图4为加窗bypass模式的处理流程，如图4所示，当配置为加窗bypass模式时，增加完循环前缀CP的IFFT数据直接输出到后级模块。即，进行数据整理，为数据发送做准备，然后发送数据到后续模块进行处理。
图5为加窗模式1的处理流程。图8为加窗模式1的实现过程示意图。如图8所示，首先，从前一个符号k的头部取出长度为A0的数据复制作为循环后缀，然后循环后缀与符号k最后的长度为A0的数据组成数据段B1，数据段B1的长度为2×A0。然后从后一个符号k+1的CP头部取出长度为A0的数据，再取出CP之前的长度为A0的点数据，组成总长度为2×A0的数据作为数据段A2。数据段A2乘以上升窗系数，数据段B1乘以下降窗系数，然后叠加得到数据段C。数据段C的前长度为A0的数据替换符号k的最后的长度为A0的数据；数据段C的后长度为A0的数据，替换符号k+1的CP前长度为A0的数据。
在此模式下，长度2×A0必须等于CP长度。每个符号至少要向前偏移A0个点，即将符号k的后长度为A0的数据随符号k+1输出。因此，在符号k处理时，需要将符号k的数据段B1乘以下降窗系数之后的数据输出到win_addr和win_addr_offset指示的存储(memory)地址缓存起来，等符号k+1处理时再读出来与符号k+1的数据段A2加窗后的数据完成叠加处理。
在此模式下，至少需要缓存2×A0的数据，同时考虑到动态传输时间间隔(Transmission Time Interval，TTI)时分场景下，相邻两个符号的FFT点数和窗长不一致，为了保证处理不出错，使用参数Wa(win_data_wa)表示需要缓存数据段B1的数据长度，缓存数据量为2×Wa个采样点，此时每个符号向前偏移Wa个点。Wa必须大于A0，并且Wa+cp_len<＝FFT点数，cp_len为CP的长度。
如果Wa>A0，则输出的缓存数据组成如图9所示。先输出数据段B1之前 的长度为Wa-A0的数据，再输出数据段B1加窗后的长度为2×A0的数据，最后剩余的长度为Wa-A0的点空间补0处理，补够2×Wa个采样点。第一个符号以及上下行切换点要假设上个符号数据全为0。
在加窗模式1处理完成后，进行数据整理，为数据发送做准备，然后发送数据到后续模块进行处理。
图6为加窗模式2的流程图。图10为加窗模式2的实现过程示意图。
如图10所示，首先，从前一个符号k的头部取出长度为2×A0的数据复制作为循环后缀(数据段B1)。然后，从后一个符号的k+1的CP头部取出长度为2×A0的数据段A1。再将数据段A1乘以上升窗系数，数据段B1乘以下降窗系数，将数据段A1和数据段B1加窗后的数据叠加得到数据C，将数据C替换符号k+1的数据A1，符号k+1的CP剩余的部分A2仍然作为CP保留。
在此模式下，长度2×A0必须小于或等于CP的长度。FFT的输出数据为每个符号的A1+A2+IFFT的输出(Output)，由于符号k+1的数据段A1与之前的一个符号k的数据段B1加窗后的数据有关。因此在符号k处理时，需要将符号k的数据段B1乘以下降窗之后的数据输出到win_data_addr指示的memory地址缓存起来，等k+1符号处理时再读出来与数据段A1加窗后的数据完成叠加处理。
数据段B1指示缓存2×A0的数据，但是考虑到动态TTI时分场景下，相邻两个符号FFT的点数和窗长不一致，为了保证处理不出错，使用参数Wa(win_data_wa)表示需要缓存数据段B1的数据长度，缓存数据量为2*Wa个采样点。Wa必须大于或等于W0，并且2×Wa≤CP的长度，W0为加窗系数。
如果Wa>W0，则输出的缓存数据如图11所示。先输出数据段B1加窗后的长度为2×A0的数据，然后再将剩余的长度为2×(Wa-A0)的空间补0处理， 补够2×Wa个采样点。上电初次工作和上下行任务切换时，要假设上个符号数据全为0。
在加窗模式2处理完成后，进行数据整理，为数据发送做准备，然后发送数据到后续模块进行处理。
图7为加窗模式3处理流程图。图12为加窗模式3的实现过程示意图。如图12所示，此模式为只加窗不交叠的加窗方式，此时相邻两个符号直接不耦合。首先，从符号k+1的CP头部取出长度为2×A0的数据段(数据段A)，然后将数据段A乘以上升窗系数，替换数据段A。从符号k+1的最后取2×A0的数据(数据段B)，然后将数据段B乘以下降窗系数，替换数据段B。A和B均只加窗，不叠加。
在此模式下，2×A0的长度必须小于CP的长度。
在加窗模式3处理完成后，进行数据整理，为数据发送做准备。然后，发送数据到后续模块进行处理。
本申请实施例还提供了一种用于无线通信系统的时域加窗实现装置，如图13，包含以下模块：
模块A，任务配置：配置任务参数和加窗数据的读地址及加窗系数。
模块B，IFFT处理：利用IFFT，将信号做转换，由离散频域转变成离散时域，如同信号分别乘上不同子载波频率一样。
模块C，插入循环前缀：信号尾端的部分移到信号前端，减少多径干扰对系统的影响。
模块D，加窗模式1：乘上窗函数，减少接收到的两个信号之间可能因为极不连续的相角变化而产生的高频信号。
模块E，加窗模式2：乘上窗函数，减少接收到的两个信号之间可能因为极 不连续的相角变化而产生的高频信号。
模块F，加窗模式3：乘上窗函数，减少接收到的两个信号之间可能因为极不连续的相角变化而产生的高频信号。
模块G，信道传输：通过无线信道进行数据传输。
下面将分别针对不同加窗模式，描述上述多个模块的工作流程：
对于加窗bypass模式，模块A配置任务，配置当前符号相关数据、参数，以及加窗系数的读地址和数据。模块B对模块A配置的任务进行解析处理，根据配置的参数开始进行IFFT处理。对B模块的输出数据取出尾部长度为CP的数据放到当前符号数据队列的头部。数据直接输出到模块G进行发送处理，输出到无线信道中。
对于加窗模式1，模块A配置任务，配置当前符号相关数据、参数，以及加窗系数的读地址和数据。模块B对模块A配置的任务进行解析处理，根据配置的参数开始进行IFFT处理。对模块B的输出数据取出尾部长度为CP的数据放到当前符号数据队列的头部。如果模块A配置的是加窗模式1，此时数据输入到模块D，模块D按照加窗模式1的处理流程进行数据缓存和加窗运算，运算完成后输出当前的IFFT数据。模块G对模块D的输出数据进行处理，将处理后的数据发送到无线信道中。
对于加窗模式2，模块A配置任务，配置当前符号相关数据、参数，以及加窗系数的读地址和数据。模块B对模块A配置的任务进行解析处理，根据配置的参数开始进行IFFT处理。对模块B的输出数据取出尾部长度为CP的数据放到当前符号数据队列的头部。
如果模块A配置的是加窗模式2，此时数据输入到模块E，模块E按照加窗模式2的处理流程进行数据缓存和加窗运算，运算完成后输出当前的IFFT数 据。模块G对模块E的输出数据进行处理，将处理后的数据发送到无线信道中。
对于加窗模式3，模块A配置任务，配置当前符号相关数据、参数，以及加窗系数的读地址和数据。模块B对模块A配置的任务进行解析处理，根据配置的参数开始进行IFFT处理。对模块B的输出数据取出尾部长度为CP的数据放到当前符号数据队列的头部。如果模块A配置的是加窗模式3，此时数据输入到模块F，模块F按照加窗模式3的处理流程进行数据缓存和加窗运算，运算完成后输出当前的IFFT数据。模块G对模块F的输出数据进行处理，发送到无线信道中。
通过以上的实施方式的描述，本领域的技术人员可以了解到根据上述实施例的方法可借助软件加通用硬件平台的方式来实现，当然也可以通过硬件实现。基于这样的理解，本申请的技术方案可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质(如只读存储器(Read-Only Memory，ROM)/随机存取存储器(Random Access Memory，RAM)、磁碟、光盘)中，包括多个指令用以使得一台终端设备(可以是手机，计算机，服务器，或者网络设备等)执行本申请的多个实施例所述的方法。
在本实施例中还提供了一种OFDM时域加窗装置，该装置用于实现上述实施例及可选实施方式，已经进行过说明的不再赘述。如以下所使用的，术语“模块”可以实现预定功能的软件和/或硬件的组合。尽管以下实施例所描述的装置可以以软件来实现，但是硬件，或者软件和硬件的组合的实现也是可能并被构想的。
图14是根据本申请实施例的OFDM时域加窗装置的结构框图，如图14所示，该装置包括IFF处理模块10、循环前缀模块20和加窗模块30。
IFF处理模块10，设置为按照配置任务对当前OFDM符号数据进行解析， 并对所述当前OFDM符号数据进行IFFT处理。
循环前缀模块20，设置为对进行IFFT处理后的IFFT数据增加循环前缀CP。
加窗模块30，设置为按照所述配置任务确定所述当前OFDM符号数据的时域加窗模式，并按照确定的所述时域加窗模式对增加CP后的IFFT数据进行加窗运算，并输出加窗运算后的IFFT数据。
上述多个模块是可以通过软件或硬件来实现的，对于后者，可以通过以下方式实现，但不限于此：上述模块均位于同一处理器中；或者，上述多个模块以任意组合的形式分别位于不同的处理器中。
本申请的实施例还提供了一种存储介质，该存储介质中存储有计算机程序，其中，该计算机程序被设置为运行时执行上述任一个方法实施例中的步骤。
可选地，在本实施例中，上述存储介质可以包括但不限于：U盘、ROM、RAM、移动硬盘、磁碟或者光盘等多种可以存储计算机程序的介质。
本申请的实施例还提供了一种电子装置，包括存储器和处理器，该存储器中存储有计算机程序，该处理器被设置为运行计算机程序以执行上述任一项方法实施例中的步骤。
可选地，上述电子装置还可以包括传输设备以及输入输出设备，该传输设备和上述处理器连接，该输入输出设备和上述处理器连接。
可选地，本实施例中的示例可以参考上述实施例及可选实施方式中所描述的示例，本实施例在此不再赘述。
本领域的技术人员应该明白，上述的本申请的多个模块或步骤可以用通用的计算装置来实现，它们可以集中在单个的计算装置上，或者分布在多个计算装置所组成的网络上，可选地，它们可以用计算装置可执行的程序代码来实现，从而，可以将它们存储在存储装置中由计算装置来执行，并且在一些情况下， 可以以不同于此处的顺序执行所示出或描述的步骤，或者将它们分别制作成多个集成电路模块，或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。这样，本申请不限制于任何指定的硬件和软件结合。

Claims (10)

  1. 一种正交频分复用OFDM时域加窗方法，包括：
    按照配置任务对当前OFDM符号数据进行解析，并对所述当前OFDM符号数据进行快速傅立叶反变换IFFT处理；
    对进行IFFT处理后的IFFT数据增加循环前缀CP；
    按照所述配置任务确定所述当前OFDM符号数据的时域加窗模式，并按照确定的所述时域加窗模式对增加CP后的IFFT数据进行加窗运算，并输出加窗运算后的IFFT数据。
  2. 根据权利要求1所述的方法，按照配置任务对当前OFDM符号数据进行解析之前，还包括：
    对所述当前OFDM符号数据进行任务配置，其中，所述配置任务中包括任务参数和加窗数据的读地址及加窗系数。
  3. 根据权利要求1所述的方法，其中，按照确定的所述时域加窗模式对增加CP后的IFFT数据进行加窗运算，包括：
    在所述时域加窗模式为加窗绕过bypass模式的情况下，将增加CP后的IFFT数据直接输出至后级模块。
  4. 根据权利要求1所述的方法，其中，按照确定的所述时域加窗模式对增加CP后的IFFT数据进行加窗运算，包括：
    在所述时域加窗模式为第一加窗模式的情况下，从前一个OFDM符号的头部取出长度为A0的数据复制作为循环后缀，将所述循环后缀与所述前一个OFDM符号最后的长度为A0的数据组成数据段B1；
    从当前OFDM符号的CP头部取出长度为A0的数据，再取出CP之前的长度为A0的数据，组成数据段A2，其中，长度2×A0等于CP的长度；
    将所述数据段A2乘以上升窗系数得到数据段A2加窗后的数据，将所述数据段B1乘以下降窗系数得到数据段B1加窗后的数据，将数据段A2加窗后的数据和数据段B1加窗后的数据叠加得到数据段C；
    将数据段C的前长度为A0的数据替换所述前一个OFDM符号的最后的长度为A0的数据，将数据段C的后长度为A0的数据替换当前OFDM符号的CP的前长度为A0的数据。
  5. 根据权利要求1所述的方法，其中，按照确定的所述时域加窗模式对增加CP后的IFFT数据进行加窗运算，包括：
    在所述时域加窗模式为第二加窗模式的情况下，从前一个OFDM符号的头部取出长度为2×A0的数据复制作为循环后缀数据段B1，其中，长度2×A0小于或等于CP的长度；
    从当前OFDM符号的CP头部取出长度为2×A0的数据段A1；
    将所述数据段A1乘以上升窗系数得到数据段A1加窗后的数据，将数据段B1乘以下降窗系数得到数据段B1加窗后的数据，将数据段A1加窗后的数据和数据段B1加窗后的数据叠加得到数据段C，将所述数据段C替换当前OFDM符号的数据段A1，将当前OFDM符号的CP的剩余的数据段A2作为CP保留。
  6. 根据权利要求1所述的方法，其中，按照确定的所述时域加窗模式对增加CP后的IFFT数据进行加窗运算，包括：
    在所述时域加窗模式为第三加窗模式的情况下，从当前OFDM符号的CP头部取出长度为2×A0的数据段A，其中，长度2×A0小于CP的长度；
    将所述数据段A乘以上升窗系数后替换所述数据段A的数据；
    从当前OFDM符号的最后取长度为2×A0的数据段B，将所述数据段B乘以下降窗系数后替换数据段B的数据。
  7. 根据权利要求1至6任一所述的方法，输出加窗运算后的IFFT数据之后，还包括：
    将所述加窗运算后的IFFT数据进行整理后，通过无线信道传输整理后的IFFT数据。
  8. 一种正交频分复用OFDM时域加窗装置，包括：
    IFF处理模块，设置为按照配置任务对当前OFDM符号数据进行解析，并对所述当前OFDM符号数据进行快速傅立叶反变换IFFT处理；
    循环前缀模块，设置为对进行IFFT处理后的IFFT数据增加循环前缀CP；
    加窗模块，设置为按照所述配置任务确定所述当前OFDM符号数据的时域加窗模式，并按照确定的所述时域加窗模式对增加CP后的IFFT数据进行加窗运算，并输出加窗运算后的IFFT数据。
  9. 一种计算机可读存储介质，存储有计算机程序，所述计算机程序被设置为运行时执行所述权利要求1至7任一项中所述的方法。
  10. 一种电子装置，包括存储器和处理器，所述存储器中存储有计算机程序，所述处理器被设置为运行所述计算机程序以执行所述权利要求1至7任一项中所述的方法。
PCT/CN2020/128767 2019-11-14 2020-11-13 Ofdm时域加窗方法及装置 WO2021093862A1 (zh)

Priority Applications (1)

Application Number Priority Date Filing Date Title
US17/776,578 US20220385510A1 (en) 2019-11-14 2020-11-13 Ofdm time domain windowing method and apparatus

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201911114928.1A CN112804177B (zh) 2019-11-14 2019-11-14 Ofdm时域加窗方法及装置
CN201911114928.1 2019-11-14

Publications (1)

Publication Number Publication Date
WO2021093862A1 true WO2021093862A1 (zh) 2021-05-20

Family

ID=75804088

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/128767 WO2021093862A1 (zh) 2019-11-14 2020-11-13 Ofdm时域加窗方法及装置

Country Status (3)

Country Link
US (1) US20220385510A1 (zh)
CN (1) CN112804177B (zh)
WO (1) WO2021093862A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10958530B1 (en) * 2019-08-29 2021-03-23 Jump Algorithms, Llc Networking systems and methods using multipath asynchronous Galois information coding
CN115102820A (zh) * 2022-06-09 2022-09-23 Oppo广东移动通信有限公司 处理信号的方法及相关装置

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014123926A1 (en) * 2013-02-05 2014-08-14 Interdigital Patent Holdings, Inc. Pulse-shaped orthogonal frequency division multiplexing
CN104639281A (zh) * 2013-11-12 2015-05-20 华为技术有限公司 一种控制数据传输的方法、装置及系统
CN106878222A (zh) * 2015-12-14 2017-06-20 中兴通讯股份有限公司 一种多载波信号的生成方法和装置
CN109565679A (zh) * 2016-08-20 2019-04-02 华为技术有限公司 Ofdm信号传输的复杂度降低

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102957653B (zh) * 2011-08-23 2017-04-26 中兴通讯股份有限公司 一种降低频谱泄漏的方法及装置
CN102938751B (zh) * 2012-11-15 2016-04-20 清华大学 时域同步正交频分复用系统的时域加窗方法及装置
CN105516032B (zh) * 2014-09-23 2018-11-16 华为技术有限公司 自适应窄带干扰消除方法和装置
JP6619234B2 (ja) * 2016-01-08 2019-12-11 国立大学法人京都大学 送信装置、送信方法および受信装置
CN107204952A (zh) * 2017-04-19 2017-09-26 哈尔滨工程大学 一种滤波ofdm系统的子带滤波处理方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014123926A1 (en) * 2013-02-05 2014-08-14 Interdigital Patent Holdings, Inc. Pulse-shaped orthogonal frequency division multiplexing
CN104639281A (zh) * 2013-11-12 2015-05-20 华为技术有限公司 一种控制数据传输的方法、装置及系统
CN106878222A (zh) * 2015-12-14 2017-06-20 中兴通讯股份有限公司 一种多载波信号的生成方法和装置
CN109565679A (zh) * 2016-08-20 2019-04-02 华为技术有限公司 Ofdm信号传输的复杂度降低

Also Published As

Publication number Publication date
CN112804177A (zh) 2021-05-14
CN112804177B (zh) 2024-01-09
US20220385510A1 (en) 2022-12-01

Similar Documents

Publication Publication Date Title
WO2021093862A1 (zh) Ofdm时域加窗方法及装置
CN115001923B (zh) 基于序列的信号处理方法及装置
US20230208575A1 (en) Data sending method, data receiving and processing method, and related device
CN109995692A (zh) 发送数据的方法及装置
CN111901279A (zh) 数据传输方法、装置、设备和存储介质
JP4615404B2 (ja) マルチキャリア無線通信システム、送信機及び受信機並びにマルチキャリア無線通信方法
KR20160088792A (ko) 필터 뱅크 멀티 캐리어 변조 기반의 통신 방법 및 장치
US20200044897A1 (en) Wireless communication method, apparatus, and system
Kumar et al. Impact of “Better than Nyquist” pulse shaping in GFDM PHY with LTE-compatible frame structure
US10581546B2 (en) Transmitter, transmission method, and receiver based on time-domain windows
US11737077B2 (en) Transmission device and transmission method
WO2022062904A1 (zh) 参考信号传输方法、装置、通信节点及存储介质
BS Performance Analysis of OFDM, FBMC and UFMC Modulation Schemes for 5G Mobile Communication MIMO systems
CN112448903B (zh) 消除基于ofdm系统的子载波间干扰的方法和装置
US11050449B1 (en) System and method for extensionless adaptive transmitter and receiver windowing
CN110971554B (zh) 数据传输方法及装置
US11418377B2 (en) Sending and receiving of orthogonal frequency multiplexing using an extended sequence
WO2017101602A1 (zh) 多天线分集发射、多天线分集接收方法及装置
US20200084070A1 (en) Transmission device, transmission method, reception device, and reception method
US9025649B2 (en) Method and apparatus for acquiring estimated value of transmitted signal and a system-on-chip
CN115396271B (zh) 单载波双天线信号在多径信道下的发射、接收方法和设备
CN112543085B (zh) 传输用子载波的选择方法、装置、设备及存储介质
CN109450827A (zh) 基于下一代无线波形fbmc-oqam的信道估计方法及系统
CN114095316B (zh) 导频传输方法和设备
CN112468424B (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: 20888410

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20888410

Country of ref document: EP

Kind code of ref document: A1