• DocumentCode
    829926
  • Title

    On the linear complexity of nonlinearly filtered PN-sequences

  • Author

    Kolokotronis, Nicholas ; Kalouptsidis, Nicholas

  • Author_Institution
    Dept. of Informatics & Telecommun., Nat. & Kapodistrian Univ. of Athens, Greece
  • Volume
    49
  • Issue
    11
  • fYear
    2003
  • Firstpage
    3047
  • Lastpage
    3059
  • Abstract
    Binary sequences of period 2n-1 generated by a linear feedback shift register (LFSR) whose stages are filtered by a nonlinear function, f, are studied. New iterative formulas are derived for the calculation of the linear complexity of the output sequences. It is shown that these tools provide an efficient mechanism for controlling the linear complexity of the nonlinearly filtered maximal-length sequences.
  • Keywords
    binary sequences; computational complexity; feedback; iterative methods; nonlinear filters; polynomials; pseudonoise codes; shift registers; binary sequences; iterative formulas; linear complexity; linear feedback shift register; nonlinear filter function; nonlinear function; nonlinearly filtered PN-sequences; primitive characteristic polynomial; pseudonoise statistics; Binary sequences; Boolean functions; Cryptography; Error correction; Galois fields; Linear feedback shift registers; Nonlinear filters; Polynomials; Spread spectrum communication; Statistics;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2003.818400
  • Filename
    1246031
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=829926