Scribd
Upload
383 views4 pages

3a Kasami Sequences

Kasami sequences are a class of sequences used in code division multiple access (CDMA) systems that have low cross-correlation. They are constructed by taking an m-sequence and downsampling it by a factor d to create a second sequence b'. The Kasami sequences are then the original sequence b plus b' shifted by multiples of d. The size of the set is 2ν sequences where ν = log2(n) and n is the length of the m-sequence. The period is 2n-1 and the maximum cross-correlation is bounded by (N'+2)/N where N' = 2ν - 1. An example is provided to illustrate generating 4 Kasami sequences from an m-sequence

Uploaded by

Taha
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
383 views4 pages

3a Kasami Sequences

Kasami sequences are a class of sequences used in code division multiple access (CDMA) systems that have low cross-correlation. They are constructed by taking an m-sequence and downsampling it by a factor d to create a second sequence b'. The Kasami sequences are then the original sequence b plus b' shifted by multiples of d. The size of the set is 2ν sequences where ν = log2(n) and n is the length of the m-sequence. The period is 2n-1 and the maximum cross-correlation is bounded by (N'+2)/N where N' = 2ν - 1. An example is provided to illustrate generating 4 Kasami sequences from an m-sequence

Uploaded by

Taha
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Kasami Sequences

Kasami Sequences (Small Set) 
• Consider, an integer   ν,     n = 2ν,   let:  

N = 2n – 1,        N’ = 2ν – 1.      d = 2ν + 1. 


• LLet b be an m‐sequence of period N and let b’ be a 
tbb f i d N d l t b’ b
sequence obtained by down sampling b by d, where 
b’≠ 0. 

• The small set of Kasami sequences is defined as 

K= {b, b + b’, b + Db’, . . . , b + Dαb’}, 
where, α = N’‐1= 2ν − 2
Properties of Small Set of Kasami
Sequences
1. Size=
1 2ν sequences,
Size= 2 sequences
2. Period
Period=N= 2n − 1 
N  2 1
3. Maximum magnitude of cross 
correlation =
( 2ν ) /N = (N’+2)/N
(1 + 2 )/ ( ’ 2)/
Example:
• Consider the degree n=4 . Select feedback vector of  [2 3]8 = [0 1 0 0 1 1]2
and initial load of 0001. 

• The generated code is: b ={100010011010111}  
ν = 2 and d = 22 + 1 = 5. 
• Down sampling b by 5, results in the sequence
b’ = {101 101 101 101 101}. 
The four Kasami sequences thereby generated are
q yg
i. b = 100010011010111
ii. b + b’ = 001111110111010
iii b + Db
iii. b + Db’ = 010100101100001
= 010100101100001
iv. b + D2b’ = 111001000001100

• A check of cross‐correlation values results in ‐5/15 and 3/15, which obey 
the bound of (1 + 2ν ) /N  = 5/15.

You might also like