DocumentCode :
2332626
Title :
Modified Kasami sequences for CDMA
Author :
Komo, John J. ; Liu, Shyh-Chang
Author_Institution :
Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA
fYear :
1990
fDate :
11-13 Mar 1990
Firstpage :
219
Lastpage :
222
Abstract :
Kasami sequences yield a set of sequences that have low cross correlation and are applicable in CDMA (code-division multiple-access) communication systems. A Kasami set of sequences is a set of 2L binary sequences of length N=2L-1 where L is the degree of the higher order primitive polynomial used to generate the set and is even. The degree of the second primitive polynomial used to generate the Kasami set is L/2. Modified Kasami sequences that are obtained from primitive polynomials of degree L and M are presented. The length of these modified Kasami sequences is the least common multiple of 2L-1 and 2 M-1 (ML), and when M divides L the length of the modified Kasami sequences is 2L-1. Thus, the modified Kasami sequences reduce to the Kasami sequences when M=L/2
Keywords :
binary sequences; code division multiple access; telecommunication systems; binary sequences; code-division multiple-access; communication systems; cross correlation; modified Kasami sequences; primitive polynomial; Autocorrelation; Binary sequences; Galois fields; Gold; Multiaccess communication; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
System Theory, 1990., Twenty-Second Southeastern Symposium on
Conference_Location :
Cookeville, TN
ISSN :
0094-2898
Print_ISBN :
0-8186-2038-2
Type :
conf
DOI :
10.1109/SSST.1990.138142
Filename :
138142
Link To Document :
بازگشت