A simple solution for the carrier frequency offset estimation for tile-based OFDMA uplink

Authors:
Pengfei Sun;Li Zhang
Affiliations:
School of Electronic and Electrical Engineering, University of Leeds, Leeds, UK;School of Electronic and Electrical Engineering, University of Leeds, Leeds, UK
Venue:
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Year:
2009

Citing 4
Cited 0

Asymptotically Efficient Reduced Complexity Frequency Offset and Channel Estimators for Uplink MIMO-OFDMA Systems

IEEE Transactions on Signal Processing
Line search based iterative joint estimation of channels and frequency offsets for uplink OFDM systems

IEEE Transactions on Wireless Communications
A time and frequency synchronization scheme for multiuser OFDM

IEEE Journal on Selected Areas in Communications
Channel-independent synchronization of orthogonal frequency division multiple access systems

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper examines the challenging carrier frequency offset (CFO) estimation problem in the tile-based orthogonal frequency division multiple access (OFDMA) uplink systems. The existing solutions to this problem are either restricted to less flexible subcarrier assignments or too complex to Implement in practice. This paper proposes simple Iterative solutions with extremely low computational load, based on the repetitive structure of a tile-based training sequence. The proposed algorithm iteratively estimates the multiple CFOs and compensates the inter-carrier interference (lCI) and multi-user interference (MUI). The CFO estimation is conducted without the need of exhaustive search and requires significantly lower complexity compared to any other existing algorithms. The algorithm is modified to achieve further complexity reduction by performing the compensation based on a banded matrix. The proposed algorithms can be used with any subcarrier assignment schemes. The simulation results show that the proposed algorithms provides remarkable computational saving with their performance closely approaching the Cramer-Rao Bound (CRB).