Tracking Performance of Symbol Synchronizers for Manchester Coded Data

Abstract

The implementation and tracking performance of symbol synchronizers for Manchester coded data is presented with motivation provided by maximum a posteriori (MAP) estimation theory. In particular, it is shown herein that for uncoded data symbols, with, however, arbitrary data transition probabilities, certain physically realizable closed-loop structures, which are readily implemented in practice, are suggested by the theory. The tracking performance of these loops is optimized and comparisons are made among the various configurations over a wide range of system parameters. Although not the major intent of the paper, the acquisition problem is briefly addressed.