On the design of symbol timing recovery for WLAN OFDM systems

Abstract

We present a simple and robust symbol timing recovery algorithm for OFDM systems, such as IEEE 802.11a/g. The algorithm is derived according to a maximum likelihood (ML) algorithm utilizing the cyclic extension or cyclic prefix (CP), which is appended in front of each OFDM symbol. Simulation results show that the performance of the proposed algorithm is better than the conventional ML algorithm in the additive white Gaussian noise (AWGN) channel and approaches to the ML algorithm in the Rayleigh fading channel. Furthermore, the implementation complexity is lower than that of the ML algorithm.