
Low complexity scheme for carrier frequency offset estimation in orthogonal frequency division multiple access uplink
Author(s) -
Shah Hardip K.,
Dasgupta Kankar S.,
Soni Himanshu
Publication year - 2013
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2012.0815
Subject(s) - carrier frequency offset , telecommunications link , orthogonal frequency division multiple access , frequency offset , orthogonal frequency division multiplexing , computer science , scheme (mathematics) , offset (computer science) , division (mathematics) , frequency divider , telecommunications , algorithm , mathematics , arithmetic , channel (broadcasting) , programming language , mathematical analysis , power dividers and directional couplers
Maximum likelihood (ML) carrier‐frequency offset estimation for orthogonal frequency‐division multiple access uplink is a complex multi‐parameter estimation problem. The ML approach is a global optima search problem, which is prohibitive for practical applications because of the requirement of multidimensional exhaustive search for a large number of users. There are a few attempts to reduce the complexity of ML search by applying evolutionary optimisation algorithms. In this study, the authors propose a novel canonical particle swarm optimisation (CPSO)‐based scheme, to reduce the computational complexity without compromising the performance and premature convergence. The proposed technique is a two‐step process, where, in the first step, low resolution alternating projection frequency estimation (APFE) is used to generate a single better positioned particle for CPSO, followed by an actual CPSO procedure in second step. The mean square error performance of the proposed scheme is compared with existing low complexity algorithms namely APFE and linear particle swarm optimisation with mutation. Simulation results presented in this study show that the new scheme completely avoids premature convergence for a large number of users as high as 32.