TY - GEN
T1 - Low-complexity leakage-based carrier frequency offset estimation techniques for OFDMA uplink systems
AU - Lee, Kilbom
AU - Moon, Sung Hyun
AU - Lee, Inkyu
PY - 2010
Y1 - 2010
N2 - In this paper, we propose an efficient carrier frequency offset (CFO) estimation technique based on the space alternating generalized expectation-maximization (SAGE) for uplink orthogonal frequency division multiple access (OFDMA) systems. In general, the SAGE method transforms a multidimensional search problem into a sequence of one-dimensional searches, which greatly simplifies the estimation procedure. However, the conventional algorithms based on the SAGE method require a large amount of computations to estimate the CFO due to exhaustive grid search. To reduce the computational burden, we exploit the leakage on the fast Fourier transform (FFT) output of the received signal after the multiple access interference is removed by the SAGE method. Then, this leakage-based approach reduces the complexity of the conventional SAGE algorithm regardless of an employed carrier assignment scheme by avoiding grid search. Simulation results show that our modified SAGE algorithm approaches the Cramer Rao bound at all signal to noise ratio (SNR) region with greatly reduced complexity compared to the conventional SAGE algorithms.
AB - In this paper, we propose an efficient carrier frequency offset (CFO) estimation technique based on the space alternating generalized expectation-maximization (SAGE) for uplink orthogonal frequency division multiple access (OFDMA) systems. In general, the SAGE method transforms a multidimensional search problem into a sequence of one-dimensional searches, which greatly simplifies the estimation procedure. However, the conventional algorithms based on the SAGE method require a large amount of computations to estimate the CFO due to exhaustive grid search. To reduce the computational burden, we exploit the leakage on the fast Fourier transform (FFT) output of the received signal after the multiple access interference is removed by the SAGE method. Then, this leakage-based approach reduces the complexity of the conventional SAGE algorithm regardless of an employed carrier assignment scheme by avoiding grid search. Simulation results show that our modified SAGE algorithm approaches the Cramer Rao bound at all signal to noise ratio (SNR) region with greatly reduced complexity compared to the conventional SAGE algorithms.
UR - http://www.scopus.com/inward/record.url?scp=79551627481&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79551627481&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2010.5683447
DO - 10.1109/GLOCOM.2010.5683447
M3 - Conference contribution
AN - SCOPUS:79551627481
SN - 9781424456383
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
T2 - 53rd IEEE Global Communications Conference, GLOBECOM 2010
Y2 - 6 December 2010 through 10 December 2010
ER -