• DocumentCode
    2405850
  • Title

    Implementation consideration of code division multiple access sequences

  • Author

    Komo, John J. ; Kim, Chulki

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA
  • fYear
    1991
  • fDate
    10-12 Mar 1991
  • Firstpage
    11
  • Lastpage
    15
  • Abstract
    The linear span of a sequence is defined as the minimum number of stages of a linear feedback shift register required to generate the given sequence. Thus, the linear span is a measure of the complexity of the sequence structure. A large complexity or linear span is desired for security of the sequence. The binary No sequence requires nonlinear connections in addition to the linear feedback shift registers. Thus, No sequences have a large complexity and are suited for high security systems. The implementation of Gold, Kasami, and No sequences which are directly applicable for CDMA are presented and compared for complexity. An alternative to the nonlinear connection of the linear feedback shift register for the No sequences is also presented. This alternative is obtained as a direct linear feedback shift register of length equal to the linear span of the No sequence set
  • Keywords
    binary sequences; code division multiple access; codes; feedback; sequential switching; shift registers; CDMA; Gold code set; Kasami code set; binary No sequence; code division multiple access sequences; linear feedback shift register; security systems; Communication system security; Frequency; Gold; Linear approximation; Multiaccess communication; Polynomials;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    System Theory, 1991. Proceedings., Twenty-Third Southeastern Symposium on
  • Conference_Location
    Columbia, SC
  • ISSN
    0094-2898
  • Print_ISBN
    0-8186-2190-7
  • Type

    conf

  • DOI
    10.1109/SSST.1991.138503
  • Filename
    138503