• DocumentCode
    3069156
  • Title

    Generalized constructions of polyphase sequence families using shift and addition of multiplicative character sequences

  • Author

    Yu, Nam Yul ; Gong, Guang

  • Author_Institution
    Dept. of Electr. Eng., Lakehead Univ., Thunder Bay, ON, Canada
  • fYear
    2010
  • fDate
    13-18 June 2010
  • Firstpage
    1258
  • Lastpage
    1262
  • Abstract
    In this paper, generalized constructions of polyphase sequence families from the shift and addition of power residue and Sidelnikov sequences are presented. Initially, ψ(0) = 1 is assumed for multiplicative characters ψ to represent power residue and Sidelnikov sequences in a simple form. The Weil bound on multiplicative character sums is refined for the assumption, where the character sums are equivalent to the correlations of sequences represented by multiplicative characters. Generalized constructions are then presented by the addition of multiple cyclic shifts of power residue and Sidelnikov sequences. The refined Weil bound is employed to provide efficient proofs on the maximum correlation magnitudes of the generalized sequence families.
  • Keywords
    information theory; sequences; Sidelnikov sequences; Weil bound; generalized construction; generalized sequence families; maximum correlation magnitude; multiplicative character sequences; multiplicative character sums; polyphase sequence families; power residue; Autocorrelation; Binary sequences; Galois fields; Lakes; Polynomials; Power engineering and energy; Power engineering computing; Timing; Wireless communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
  • Conference_Location
    Austin, TX
  • Print_ISBN
    978-1-4244-7890-3
  • Electronic_ISBN
    978-1-4244-7891-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2010.5513686
  • Filename
    5513686