A recursive algorithm for the estimation of symbol timing in PSK burst modems

An algorithm for the estimation of symbol timing in burst modems which uses recursion within a feedforward structure is described. The algorithm does not suffer from the usual acquisition-time/steady-state performance tradeoff, requires no preamble, and uses only two samples per symbol. The performance of the algorithm is analyzed and compared to that of the Cramer-Rao bound and the DFT method.<<ETX>>