A Low-Complexity Symbol Timing Recovery Algorithm for Burst Modem Applications

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.