Please use this identifier to cite or link to this item: https://doi.org/10.1109/ICC.2008.656
Title: Carrier-frequency offset estimation for OFDMA uplink with generalized subcarrier-assignment
Authors: Wang, Z.
Xin, Y. 
Mathew, G. 
Issue Date: 2008
Citation: Wang, Z., Xin, Y., Mathew, G. (2008). Carrier-frequency offset estimation for OFDMA uplink with generalized subcarrier-assignment. IEEE International Conference on Communications : 3490-3494. ScholarBank@NUS Repository. https://doi.org/10.1109/ICC.2008.656
Abstract: Maximum likelihood (ML) carrier-frequency offset (CFO) estimation in the uplink of an orthogonal frequency-division multiple-access (OFDMA) system with a generalized carrier-assignment scheme (GCAS) is a complex multiple-parameter estimation problem. The computational complexity of the ML solution based on a multi-dimensional exhaustive search is prohibitive. The existing solutions reduce the complexity by replacing the multidimensional search with a sequence of single-dimensional searches. However, those solutions suffer from either poor estimation accuracy or is still of high complexity. In this paper, we propose a new approach called as the divide-and-update frequency estimator (DUFE), which outperforms the existing solutions in the sense that it has lower computational complexity while maintaining high estimation accuracy similar to the exact ML solution. Performance and complexity comparisons are provided with numerical results to illustrate the effectiveness of the proposed method. ©2008 IEEE.
Source Title: IEEE International Conference on Communications
URI: http://scholarbank.nus.edu.sg/handle/10635/69563
ISBN: 9781424420742
ISSN: 05361486
DOI: 10.1109/ICC.2008.656
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

5
checked on Dec 18, 2018

WEB OF SCIENCETM
Citations

3
checked on Dec 18, 2018

Page view(s)

34
checked on Dec 15, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.