Spreading Codes for Direct Sequence

CDMA
Ramakrishna Shashishekar
rsh@tf.uni-kiel.de

Dept of Information Coding and Theory

University of Kiel

July 20, 2009

Outline

Introduction

Pseudo random Sequences

Non Orthogonal codes

Orthogonal codes

Conclusion

Introduction
Code Division Multiple Access (CDMA)

Multiple access technique .

Users distinguished by codes.

DS CDMA
DS-CDMA

Important class of CDMA

Type of spread spectrum technique.

Pseudo random Sequences [PN]

PN - Characteristics

Randomness

Uniform distributed or balanced

Impulse like auto correlation.

Zero Cross correlation

Maximal Length Sequences M Sequences

Use of Linear Feedback Shift Register.

Shift and add property

LFSR with primitive polynomial generate largest codes

Period length = 2m 1

m-sequences properties
Randomness properties
Sequence has 2m-1 ones and 2m-1 -1 zeros
. 1/2 the runs of ones and zeros have length 1, have
length 2, 1/8 have length 3, and 1/2k length K.
Two valued auto correlation function

Good auto correlation value

Large cross correlation value

GOLD Sequences

Provide large number of codes.

Constructed by the XOR of two m-sequences with the

same clocking

cross correlation between preferred pairs is 3 valued

{ - t(n) , -1 , t(n)-2 } where

t(n) = 1+ 2 (n+1)\2 n= odd

1+ 2 (n+2)\2 n=even

auto correlation function is also a 3 valued

6

Kasami - Sequences

Similar procedure as used in gold codes generation

Two types of Kasami sequence
small set kasami sequence
large set kasami Sequence

Generated by modulo-2 sum of an m-sequence with cyclic shifts of the

decimated m-sequence

Auto correlation and cross correlation take values

{ -1, - (2n/2 + 1), 2n/2 -1 }

Low cross correlation value

Walsh Hadamard Code

Type of Orthogonal code

Generation based on orthogonality property.

Zero cross correlation between sequences.

Use of pilot sequence in order to obtain zero offset.

Codes generated using Hadamard transform

Set of Walsh codes of length n consists of the n rows of an n x n Hadamard

matrix

Example
White Box = +1
Black Box = -1
8

Orthogonal Variable Spreading Factor in WCDMA

Code Tree

OVSF Code allocation Algorithms :

Regional channel assignment ( RCA )

Conclusion
M-Sequences
Provide large pseudo random sequences
Not suitable for a multi-user environment due to high cross correlation,
Good for synchronization due to high auto correlation,
Gold and Kasami Sequences
Provide large set of codes
low cross correlation
Used in 3G applications
Walsh Hadamard Sequences
Provide very low cross correlation values
Used only in synchronized CDMA

10

Additional Information

Primitive polynomial
Any polynomial is said primitive
I.
If a generator polynomial cannot be factorized
II.
If its a factor of XN + 1 ,where [N= 2m -1 ] and m= length of
LFSR
Preferred Pairs
a pair of m-sequences u and v having period N = 2n-1 are preferred pairs
if they satisfy the following properties

n is not divisible by 4 (i.e. n= 2(mod) 4)

v = u[ q ] where
q is odd
q = 2k+1
v is obtained by sampling qth symbol of u

M Sequences

m =3,

N= 7= 23 1

X7 + 1 = ( X + 1) (X3 + X + 1) (X3 + X + 1)

Orthogonal Codes Example

Eg : Walsh Code W(k n)

a) W ( 0 1) = 1
b) W (0 2) = 1 1
W (0 2 ) = 1 -1

Multiple Spreading
Multiple Spreading
1.

Two Layered Spreading

2.

Possible to provide Orthogonality amongst all users while maintaining

mutual randomness only bw users of different cell

4.

Channelization codes

6.

Scrambling codes

8.

Inter cell synchronous operation different Base station use different

time shift of the same sequences