Adaptive symbol tracking using discrete stochastic approximation for wireless OFDM systems

TitleAdaptive symbol tracking using discrete stochastic approximation for wireless OFDM systems
Publication TypeConference Paper
Year of Publication2004
AuthorsAthaudage, C. R. N., and V. Krishnamurthy
Conference NameCommunications, 2004 IEEE International Conference on
Pagination2457 - 2463 Vol.4
Date Publishedjun.
Keywordsadaptive symbol tracking, approximation theory, brute force maximum-likelihood methods, computational complexity, discrete stochastic approximation, fading channels, frequency offsets, maximum likelihood estimation, OFDM modulation, orthogonal frequency division multiplexing, radio networks, self-learning capability, stochastic processes, synchronisation, time selective fading channels, time synchronization, time varying time delays, time-varying channels, wireless OFDM systems

This paper presents discrete stochastic approximation (DSA) algorithms for time synchronization in OFDM systems. It is shown that the discrete stochastic approximation algorithms can be effectively used to achieve a significant reduction in computational complexity compared to brute force maximum-likelihood (ML) methods for OFDM synchronization. The most important property of the proposed algorithms is their recursive self-learning capability - most of the computational effort is spent at the global or a local optimizer of the objective function. An adaptive version of the discrete stochastic approximation algorithm is also presented for tracking time varying time delays and frequency offsets in time selective fading channels. Detailed numerical examples illustrate the performance gains of these DSA based synchronization algorithms.


a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia