OFDM Channel Estimation via 2D FFT Matrix Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing OFDM-based wireless communication systems face challenges in accurately estimating the radio channel, particularly in frequency-selective and time-varying environments, where linear interpolation methods provide poor results and require significant computational resources and memory.
Innovation Solution
A technique involving the transmission of a block of OFDM symbols with known pilot symbols in a predetermined periodic pattern, forming an N×M matrix, and applying a two-dimensional inverse Fourier transform to generate multiple channel estimates, followed by a two-dimensional Fourier transform to obtain accurate channel estimates for each position in the OFDM block, allowing for effective equalization of received data symbols.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If linear interpolation is used for channel estimation, then implementation is simple, but estimation accuracy is poor in frequency selective time-varying environments
Solution Approach 1:
The patent replaces linear interpolation (a simple mathematical approach) with a two-dimensional FFT-based channel estimation method that operates in the frequency domain. This substitution transforms the estimation process from time-domain interpolation to frequency-domain transformation, achieving both accuracy and computational efficiency through the inherent orthogonality of OFDM subcarriers.
Solution Approach 2:
The patent changes the domain of channel estimation from time domain to frequency domain by applying 2D FFT to the received pilot signals. This parameter transformation allows accurate channel estimation across the entire frequency spectrum without requiring complex interpolation, as each frequency component can be independently estimated.
2Measurement precision
If linear MMSE interpolation is used for channel estimation, then estimation accuracy improves with correct model selection, but memory requirements and computational complexity increase significantly
Solution Approach 1:
The patent substitutes complex time-domain MMSE interpolation algorithms with a frequency-domain 2D FFT approach. This replacement eliminates the need for complex channel models (like Jakes model) and large memory buffers, while maintaining high estimation accuracy through the orthogonality property of OFDM.
Solution Approach 2:
The patent transitions from one-dimensional time-domain interpolation to two-dimensional frequency-time domain transformation using 2D FFT. This dimensional change allows simultaneous processing of multiple frequency subcarriers and time symbols, achieving linear complexity scaling rather than quadratic or higher complexity.
Data Source
AI summary
A radio channel estimation technique is described for use in a OFDM-based radio communications system. A block of OFDM symbols is transmitted from multiple antennas over multiple sub-carrier frequencies. The block of OFDM symbols includes known pilot symbols as well as data symbols to be determined by a receiver. The pilot symbols are transmitted in a predetermined pattern at periodic times on periodic sub-carriers. A pilot channel estimate is determined for each pilot symbol in the received block of OFDM symbols. An N×M matrix of points corresponding to the received OFDM symbol block is formed. N is the number of sub-carriers and M is the number of OFDM symbols in the OFDM symbol block. The matrix is formed by inserting pilot channel estimates at predetermined positions in the N×M matrix according to the predetermined pilot pattern and inserting zeros in remaining positions in the N×M matrix. A two dimensional inverse Fourier transform of the N×M matrix is calculated resulting in multiple copies of a channel estimate in the time domain. One is selected, and a two dimensional Fourier transform of the selected channel estimate is calculated to obtain a channel estimate at each point in the OFDM block.