• DocumentCode
    3784678
  • Title

    Binary sequences with low aperiodic autocorrelation for synchronization purposes

  • Author

    S.E. Kocabas;A. Atalar

  • Author_Institution
    Dept. of Electr. & Electron. Eng., Bilkent Univ., Ankara, Turkey
  • Volume
    7
  • Issue
    1
  • fYear
    2003
  • Firstpage
    36
  • Lastpage
    38
  • Abstract
    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 1s. 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 1s) with and without phase ambiguity cases.
  • Keywords
    "Binary sequences","Autocorrelation","Evolutionary computation","Digital communication","Pulse modulation","Phase detection","Digital modulation","Spread spectrum radar","Timing","Shift registers"
  • Journal_Title
    IEEE Communications Letters
  • Publisher
    ieee
  • ISSN
    1089-7798
  • Type

    jour

  • DOI
    10.1109/LCOMM.2002.807438
  • Filename
    1159887