Nonbinary Kasami sequences over GF(p)

Author

Liu, Shyh-Chang ; Komo, John J.

Author_Institution

Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA

Volume

38

Issue

4

fYear

1992

fDate

7/1/1992 12:00:00 AM

Firstpage

1409

Lastpage

1412

Abstract

The correlation values and the distribution of these correlation values for the small set of nonbinary Kasami sequences over GF(p) (p prime) are presented. The correlation results are an extension of the binary results and have p+2 correlation levels. This nonbinary Kasami set is asymptotically optimum with respect to its correlation properties. These sequences are obtained, as in the binary case, from a large primitive polynomial of degree n=2 m and a small primitive polynomial of degree m that yields a sequence length of pⁿ-1 and maximum nontrivial correlation value of 1+p^m. Nonbinary Kasami sequences are directly implemented using shift registers and are applicable for code division multiple access systems

Keywords

code division multiple access; codes; correlation theory; polynomials; CDMA; GF(p); asymptotically optimum; code division multiple access; correlation values; maximum nontrivial correlation value; nonbinary Kasami sequences; primitive polynomial; shift registers; Autocorrelation; Chirp; Electrons; Frequency modulation; Multiaccess communication; Notice of Violation; Polynomials; Pulse compression methods; Radar; Shift registers;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.144728

Filename

144728