arrow
返回

Low-Complexity Channel Prediction Using Approximated Recursive DCT

delete2011-10-01
delete13
delete
OA
AI
J
Jorge F. Schmidt *
J
Juan Cousseau
R
Risto Wichman
S
Stefan Werner
DOI:10.1109/TCSI.2011.2158139delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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.
Keyword:
Basis function approximation
channel prediction
discrete cosine transform
Doppler spectrum
fast-fading channel
Kalman filter
narrowband filters

期刊

IEEE Transactions on Circuits and Systems I-Regular Papers 封面图
IEEE Transactions on Circuits and Systems I-Regular Papers
IF:
5.2
论文数:
9.8K
被引数:
2.2W

机构

N
national university of the south
学者数:
2.3K
论文数: 1.7K
被引数: 2
I
instituto de investigaciones en ingenieria electrica (iiie)
学者数:
636
论文数: 469
被引数: 0
引用论文

引用论文

err分享
err收藏
err分享
err收藏
学者 查看更多内容