DocumentCode
722508
Title
Adaptive OFDM synchronization using quadratic search step sizes
Author
Ramlall, Rohan
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Univ. of California, Irvine, Irvine, CA, USA
fYear
2015
fDate
9-12 Jan. 2015
Firstpage
23
Lastpage
28
Abstract
Conventional blind joint symbol time offset (STO) and carrier frequency offset (CFO) estimators for orthogonal frequency division multiplexing (OFDM) systems are high in computational complexity, which increases power consumption and reduces the lifetime of the communications device. In this paper, a novel, real-time, low complexity, blind, and adaptive synchronization algorithm for OFDM systems is presented. It is shown through simulation that the proposed estimator performs better than previously proposed adaptive and conventional non-adaptive algorithms in terms of mean squared error (MSE) once the algorithm has converged, has quicker convergence times than previously proposed adaptive algorithms, and is robust to both small and large changes in STO.
Keywords
OFDM modulation; computational complexity; mean square error methods; quadratic programming; CFO estimators; MSE; OFDM systems; STO; adaptive OFDM synchronization; adaptive synchronization algorithm; carrier frequency offset; communications device; computational complexity; mean squared error; non adaptive algorithms; orthogonal frequency division multiplexing; power consumption; quadratic search step sizes; symbol time offset; Adaptive algorithms; Computational complexity; Convergence; Cost function; Logic gates; OFDM; Synchronization; OFDM; adaptive; synchronization;
fLanguage
English
Publisher
ieee
Conference_Titel
Consumer Communications and Networking Conference (CCNC), 2015 12th Annual IEEE
Conference_Location
Las Vegas, NV
ISSN
2331-9860
Print_ISBN
978-1-4799-6389-8
Type
conf
DOI
10.1109/CCNC.2015.7157941
Filename
7157941
Link To Document