Reduced-Rank Channel Estimation for OFDM Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current channel estimation methods for OFDM systems in fading channels are either computationally complex or require high memory resources, and existing channel length estimation techniques are sensitive to threshold levels and not suitable for practical receiver implementations.
Innovation Solution
The implementation of a reduced-rank time-domain least-squares channel estimation method using the Levinson-Durbin algorithm, which allows for joint channel impulse response and channel length estimation with low complexity and memory requirements, and an efficient Akaike Information Criterion-based approach for channel length estimation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If conventional channel estimation methods are used, then estimation accuracy is improved, but computational complexity and memory requirements increase
Solution Approach 1:
The channel estimation problem is segmented into two independent parts: channel impulse response estimation and channel length estimation. The channel impulse response is estimated using reduced-rank time-domain least-squares method, while channel length is estimated separately using Akaike Information Criterion. This segmentation allows each part to be optimized independently, reducing overall computational complexity while maintaining accuracy.
Solution Approach 2:
The patent changes the parameter approach by using reduced-rank estimation instead of full-rank estimation. By assuming the channel impulse response can be represented with a limited number of significant taps (reduced rank), the computational complexity is significantly reduced while maintaining sufficient estimation accuracy for practical applications.
2Measurement precision
If conventional channel estimation methods are used, then estimation accuracy is improved, but memory requirements increase
Solution Approach 1:
The estimation process is segmented to separate channel impulse response calculation from channel length determination. The reduced-rank approach stores only the significant channel taps rather than all possible taps, significantly reducing memory requirements while maintaining accuracy for the actual channel characteristics.
Solution Approach 2:
By changing from full-rank to reduced-rank parameter representation, the patent reduces the number of parameters that need to be stored in memory. The reduced-rank assumption allows the system to store only the essential channel information rather than complete channel state data, reducing memory burden.
3Measurement precision
If existing channel length estimation techniques are used, then channel length can be estimated, but sensitivity to threshold levels makes them unsuitable for practical implementations
Solution Approach 1:
The Akaike Information Criterion provides a feedback mechanism that automatically determines the optimal channel length without requiring manual threshold adjustment. The AIC metric evaluates different channel length candidates and selects the one that minimizes the criterion, providing automatic adaptation to the actual channel conditions and eliminating the need for sensitive threshold settings.
Solution Approach 2:
The patent changes the estimation approach from threshold-based methods to information-theoretic methods. By using Akaike Information Criterion, the system transitions from arbitrary threshold selection to a systematic parameter selection process that automatically adapts to channel characteristics, making the implementation robust and practical.
Data Source
AI summary
An embodiment of a method for channel estimation for an Orthogonal Frequency Division Multiplexing communication system, including estimating a Time Domain Least Squares channel impulse response having a given maximum number of L taps based on a channel covariance matrix Q, and for each tap l=1, . . . , L a respective channel impulse response in the time-domain ĥl, wherein the channel impulse responses in the time-domain are grouped as a channel impulse response vector in the time domain ĥ. Specifically, an updated channel-impulse-response vector in the time domain {tilde over (h)} is determined by computing for each tap l the solution of the following system: Q1:l, 1:l{tilde over (h)}l×1=ĥ1:l, wherein the updated channel-impulse-response vector in the time domain {tilde over (h)} is computed recursively via a Levinson Durbin algorithm.