Low-Complexity Channel Prediction Using Approximated Recursive DCT

Jorge F. Schmidt

doi:10.1109/TCSI.2011.2158139

Low-Complexity Channel Prediction Using Approximated Recursive DCT

2011-10-01

13

OA

AI

DOI：10.1109/TCSI.2011.2158139

Original

Original request for help

Save

Abstract

En 中文

We present a novel channel estimator/predictor for OFDM systems over time-varying channels using a recursive formulation of a basis expansion model (BEM) based on an approximated discrete cosine transform (DCT). We derive a recursive implementation of the approximated DCT-BEM for tracking time-varying channels based on a filter bank. The recursive approximated DCT-BEM structure is then used for long range channel prediction by proper scaling and time extrapolation of the filter bank. As the implicit BEMis time invariant we further simplify the implementation by employing a steady-state Kalman filter whose overall complexity is comparable to an LMS algorithm. The derived predictor outperforms, in terms of predictor range, previously proposed long range predictors that are based on autoregressive (AR) modeling of the time-varying channel. For a similar performance, in terms of MSE, the computational complexity of the proposed predictor is significantly lower than conventional sum-of-sinusoids (SOS) channel predictors as no channel delays nor Doppler frequencies need to be estimated.

Keywords:

Basis function approximation

channel prediction

discrete cosine transform

Doppler spectrum

fast-fading channel

Kalman filter

narrowband filters

Low-Complexity Channel Prediction Using Approximated Recursive DCT

Abstract

Journal

Organization