• DocumentCode
    864737
  • Title

    New Binary Sequences With Optimal Autocorrelation Magnitude

  • Author

    Yu, Nam Yul ; Gong, Guang

  • Author_Institution
    Dept. of Electr. Eng., Lakehead Univ., Thunder Bay, ON
  • Volume
    54
  • Issue
    10
  • fYear
    2008
  • Firstpage
    4771
  • Lastpage
    4779
  • Abstract
    New binary sequences of period N = 4(2m - 1) for even m ges 4 are found, where the sequences are described by a 4 X (2m - 1) array structure. The new sequences are almost balanced and have four- valued autocorrelation, i.e., {N, 0, plusmn4}, which is optimal with respect to autocorrelation magnitude. The complete autocorrelation distribution and the exact linear complexity of the sequences are mathematically derived. Finally, it is shown that the sequences are implemented by a combination of linear feedback shift registers and a simple logic.
  • Keywords
    binary sequences; correlation methods; binary sequences; feedback shift registers; linear complexity; optimal autocorrelation magnitude; Autocorrelation; Binary sequences; Conferences; Cryptography; Information theory; Linear feedback shift registers; Logic; Multiaccess communication; Random sequences; Timing; Binary sequences; interleaved sequences; linear complexity; optimal autocorrelation;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2008.928999
  • Filename
    4626082