Binary sequences with low aperiodic autocorrelation for synchronization purposes
Kocabaş, Ş. E.
IEEE Communications Letters
36 - 38
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/24551
An evolutionary algorithm is used to find three sets of binary sequences of length 49-100 suitable for the synchronization of digital communication systems. Optimization of the sets are done by taking into consideration the type of preamble used in data frames and the phase-lock mechanism of the communication system. The preamble is assumed to be either a pseudonoise (PN) sequence or a sequence of 1's. There may or may not be phase ambiguity in detection. With this categorization, the first set of binary sequences is optimized with respect to aperiodic autocorrelation which corresponds to the random (PN) preamble without phase ambiguity case. The second and third sets are optimized with respect to a modified aperiodic autocorrelation for different figures of merit corresponding to the predetermined preamble (sequence of 1's) with and without phase ambiguity cases.