DocumentCode
1801061
Title
A Low-Complexity Symbol Timing Recovery Algorithm for Burst Modem Applications
Author
Luo Wu ; Bin Liu
Author_Institution
School of EECS, Peking University, Beijing, P.R. China, 100871. Email: luow@pku.edu.cn
fYear
2006
fDate
Oct. 2006
Firstpage
655
Lastpage
657
Abstract
In this paper, we describe and analyze an efficient non-date-aided (NDA) symbol timing recovery algorithm named the Quadratic Approximation (QA) algorithm. Compared with the Tone Filtering (TF) algorithm, the algorithm presented here is low-complexity. It requires only one multiplication per burst. Its performance is better than that of the TF algorithm in terms of the estimated standard deviation and sensitivity to frequency offsets.
Keywords
Algorithm design and analysis; Approximation algorithms; Baseband; Filtering algorithms; Frequency estimation; Hardware; Matched filters; Maximum likelihood estimation; Modems; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 2006. ITW '06 Punta del Este. IEEE
Conference_Location
Punta del Este, Uruguay
Print_ISBN
1-4244-0035-X
Electronic_ISBN
1-4244-0036-8
Type
conf
DOI
10.1109/ITW.2006.322900
Filename
4117555
Link To Document