TY - GEN
T1 - Efficient carrier frequency offset estimation for OFDM using periodic training sequences
AU - Chai, Xiaomeng
AU - Zhang, Zhongshan
AU - Zhang, Xu
AU - Long, Keping
PY - 2013
Y1 - 2013
N2 - Periodic training sequences for carrier frequency offset estimation in orthogonal frequency division multiplexing (OFDM) systems are discussed. By exploiting the independent conditional Probability Density Functions (PDF) of different subblocks in a received training sequence, a new complexity efficient frequency offset estimator is proposed in this paper. The same accuracy as that of Best Linear Unbiased Estimator (BLUE) proposed by Morelli can be achieved in the proposed algorithm, however, with a complexity of only about 4/3M-2 that of the later (M is the number of sub-blocks that a training sequence comprising). A new frequency offset acquisition algorithm is also proposed in this paper, whose maximum acquisition range is up to ±M/2 times subcarrier spacing, and a negligible acquisition error probability can be achieved. Since the complexity of the proposed algorithm doesn't change as the increases of M (as compared to it, the complexity of Morelli algorithm is a monotonously increasing function of M), its estimation accuracy can be improved by optimizing M without degrading its complexity efficiency, as proven by computer simulation.
AB - Periodic training sequences for carrier frequency offset estimation in orthogonal frequency division multiplexing (OFDM) systems are discussed. By exploiting the independent conditional Probability Density Functions (PDF) of different subblocks in a received training sequence, a new complexity efficient frequency offset estimator is proposed in this paper. The same accuracy as that of Best Linear Unbiased Estimator (BLUE) proposed by Morelli can be achieved in the proposed algorithm, however, with a complexity of only about 4/3M-2 that of the later (M is the number of sub-blocks that a training sequence comprising). A new frequency offset acquisition algorithm is also proposed in this paper, whose maximum acquisition range is up to ±M/2 times subcarrier spacing, and a negligible acquisition error probability can be achieved. Since the complexity of the proposed algorithm doesn't change as the increases of M (as compared to it, the complexity of Morelli algorithm is a monotonously increasing function of M), its estimation accuracy can be improved by optimizing M without degrading its complexity efficiency, as proven by computer simulation.
UR - http://www.scopus.com/inward/record.url?scp=84893218306&partnerID=8YFLogxK
U2 - 10.1109/WOCC.2013.6676361
DO - 10.1109/WOCC.2013.6676361
M3 - Conference contribution
AN - SCOPUS:84893218306
SN - 9781467356992
T3 - Proceedings - 2013 Wireless and Optical Communications Conference, WOCC 2013
SP - 160
EP - 165
BT - Proceedings - 2013 Wireless and Optical Communications Conference, WOCC 2013
T2 - 22nd Wireless and Optical Communications Conference, WOCC 2013
Y2 - 16 May 2013 through 18 May 2013
ER -