Modified Kasami sequences for CDMA

John Joseph Komo, S.-C. Liu · 2002

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 2/sup L/ binary sequences of length N=2/sup L/-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 2/sup L/-1 and 2/sup M/-1 (M>

Read the paper · More papers on PaperTik