Frame synchronization is traditionally achieved by inserting a given sequen
ce periodically into the data stream. Here, a new method of synchronization
is introduced in which the synchronization sequence is not contiguous, but
is interleaved with the data symbols. The properties of these distributed
sequences are investigated, and requirements are specified for detectibilit
y of these sequences when inserted in random data. Methods for constructing
and searching for good sequences are presented. It is demonstrated that th
is new method reduces the probability of false synchronization over traditi
onal methods in the presence of additive white Gaussian noise.