Cart (Loading....) | Create Account
Close category search window
 

Low-Complexity Channel Prediction Using Approximated Recursive DCT

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Schmidt, J.F. ; IIIE, Univ. Nac. del Sur, Bahia Blanca, Argentina ; Cousseau, J.E. ; Wichman, R. ; Werner, S.

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 BEM is 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.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:58 ,  Issue: 10 )

Date of Publication:

Oct. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.