DocumentCode
1832514
Title
A Low-Complexity Symbol Timing Recovery Algorithm for Burst Modem Applications
Author
Wu, Luo ; Liu, Bin
Author_Institution
Sch. of Electr. Eng. & Comput. Sci., Peking Univ., Beijing
fYear
2006
fDate
22-26 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
filtering theory; burst modem applications; efficient nondate-aided symbol timing recovery algorithm; frequency offset sensitivity; low-complexity symbol timing recovery algorithm; quadratic approximation algorithm; standard deviation; tone filtering algorithm; Approximation algorithms; Baseband; Conferences; Filtering algorithms; Frequency estimation; Hardware; Information theory; Matched filters; Modems; Timing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop, 2006. ITW '06 Chengdu. IEEE
Conference_Location
Chengdu
Print_ISBN
1-4244-0067-8
Electronic_ISBN
1-4244-0068-6
Type
conf
DOI
10.1109/ITW2.2006.323729
Filename
4119380
Link To Document