Practical timing and frequency synchronization for OFDM-based cooperative systems

Authors:
Qinfei Huang;Mounir Ghogho;Jibo Wei;Philippe Ciblat
Affiliations:
School of Electronic Science and Engineering, National University of Defense Technology, Changsha, China;School of Electronics and Electrical Engineering, Leeds University, Leeds, UK;School of Electronic Science and Engineering, National University of Defense Technology, Changsha, China;Département Comélec, ENST, Paris, France
Venue:
IEEE Transactions on Signal Processing
Year:
2010

Citing 7
Cited 1

Training design for repetitive-slot-based CFO estimation in OFDM

IEEE Transactions on Signal Processing
The forward-backward averaging technique applied to TLS-ESPRITprocessing

IEEE Transactions on Signal Processing
A robust timing and frequency synchronization for OFDM systems

IEEE Transactions on Wireless Communications
Time and Frequency Synchronization for OFDMA Uplink System using the SAGE Algorithm

IEEE Transactions on Wireless Communications
Synchronization algorithms for MIMO OFDMA systems

IEEE Transactions on Wireless Communications
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks

IEEE Transactions on Information Theory
A time and frequency synchronization scheme for multiuser OFDM

IEEE Journal on Selected Areas in Communications

Full length article: Capacity and resource allocation of cooperative MIMO in ad hoc networks

Physical Communication

Quantified Score

Hi-index	35.68

Visualization

Abstract

In this paper, we investigate the timing and carrier frequency offset (CFO) synchronization problem in decode and forward cooperative systems operating over frequency selective channels. A training sequence which consists of one orthogonal frequency-division multiplexing (OFDM) block having a tile structure in the frequency domain is proposed to perform synchronization. Timing offsets are estimated using correlation-type algorithms. By inserting some null subcarriers in the proposed tile structure, we propose a computationally efficient subspace decomposition-based algorithm for CFO estimation. The issue of optimal tile length is studied both theoretically and through simulations. By judiciously designing the tile size of the pilot, the proposed algorithms are shown to have better performance, in terms of synchronization errors and bit error rate, than the time-division multiplexing-based training method and the computationally demanding space-alternating generalized expectation-maximization algorithm.