By Topic

High mobility orthogonal frequency division multiple access channel estimation using basis expansion model

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
$33 $31
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

3 Author(s)
Rabbi, M.F. ; Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore, Singapore, Singapore ; Hou, S.-W. ; Ko, C.C.

Owing to the loss of subcarrier orthogonalities in high-speed applications, the use of conventional frequency-domain-based channel estimation in high mobility orthogonal frequency division multiple access (OFDMA) systems such as mobile WiMax may give rise to an unacceptable high channel estimation error floor. To alleviate this problem, the authors develop some basis expansion model (BEM)-based estimation schemes for the OFDMA uplink. Specifically, the authors express the time-varying channel as a superposition of a small number of complex exponential basis functions spanning the entire Doppler range, and then formulate least square (LS) and linear minimum mean square error (LMMSE) algorithms to estimate the basis coefficients for two different types of pilot patterns. The authors also derive the respective Cramer-Rao lower bounds for these estimators. It has been shown that the time domain BEM using a pilot scheme where pilots are placed over time axis will give better performance under a high Doppler scenario. Lastly, using simulation results, the proposed algorithms have been found to have better estimation accuracy over current frequency domain estimation techniques. This is in addition to the advantage that the proposed algorithms have in general a lower computational complexity.

Published in:

Communications, IET  (Volume:4 ,  Issue: 3 )