11/27/2010

Codesfor
CDMandCDMASystems

PNCodesforCDMAApplications:
ForCDMAspreadingcode,weneedapsedurandom (PN)
sequence(code)thatpassescertainqualitycriterion
f
forrandomness.
d
S
Someofthesecriterionare:
f h
i i
Balance where no of ones is equal to no of zeros +1
Randomness where probability of next bit to be 1 is
equal to probability for the next bit to be 0
Runs probability of long sequence (e.g. 1111) is found
once. Shorter runs occur more often.
Correlation
Correlation properties where periodic correlation
function gives maximum o/p at k=0 (no shift) while gives
0 or -1 at the rest of shifts.

11/27/2010

IntroductiontoSSCodesProperties:
DiscretePeriodicandAperiodic Correlations

Theperiodicautocorrelationfunction
(
(ACF)ofPNcodesforCDMA
) f
d f
applicationshouldbenearlytwo
valuedwithpeaksat0shiftandiszero
elsewhere.i.e.
k =nfork=0mod(n)and=1fork0.

OptimumBinaryCodes:
BarkerCodes
Barkercodesaretheoptimum
binarycodeswithpeaksidelobeto
mainloberatiooftheaperiodic
correlationfunction<=1/N.
Barkercodesarelimitedinnumber
withmaximumlengthof13.
Barkercodeshavemany
applicationssuchas:
Channelidentification
Ch
l id tifi ti
Synchronization.
SpreadingcodesforPulse
compressionradars.
Spreadingcodesinsome802.11
WiLan systems.

11/27/2010

Exampleof
Barkercodes
correlation
correlation
functions:N=7

MSequences
(MaximallengthlinearfeedbackshiftregisterSequences)

DefinitionofMSequence

Maximallengthshiftregistercanbedefinedaslongestsequencethatcan
begeneratedusingshiftregisterwithfeedbackconnections,assumea
shiftregisterwithlengthn,thenthemaximumlengthofthegenerated
sequenceNisgivenbyN=2n1.
TheoutputoftheshiftregisteriscombinedwithXORwithoneofthe
outputswheretheoutputfromXORfunctionisfeedbacktothefirst
stage.
Optimalfeedbackconnectionsleadtomaximallengthsequences

BasicStructureofMSequence

11/27/2010

Additional Properties of M-Sequences as

PN Codes:
Permitive Polynomials:
Optimum FB connections
OptimumFBconnections
mustbeselectedaccording
toperimitive polynomialsof
ordern

ExamplesofPrimitivepolynomials

ReciprocalSequence:
wherethesamesequence
canbegeneratedusingthe
b
h
reversesequence

Example1:n=4,N=15
Forfeedbackconnection[4,1]andInitial
condition1111:
Thesuccessiveshiftregisterstateswillbe:
1111,0111,1011,0101,1010,1101,0110,0011,
1001,0100,0010,0001,1000,1100,1110,1111
Sothecodesequencewillbe111101011001000
Theperiodicautocorrelationisgivenby:
p
g
y

11/27/2010

Example2:n=5,N=31
Thecodeperiod=2 1=25 1=32 1=31
Assumeinitialcondition=11111andfeedbackequalto
Assume initial condition = 11111 and feedback equal to 5+
3+1,theoutputcodeisasfollows:
1111100011011101010000100101100
Periodiccorrelation:
)( ={N=312 1

1otherwise}
Theperiodicautocorrelation
function

Example2:Cont.

Aperiodic correlation:
[[ 1,
, ((),
), (()2]
) ]
[n+2/2]
[5+2/2]
t(n)=2
+1=2
+1=23+1=8+1=9
[ 1,9,7]

Seedetailsofthe
trispectralcorrelation
propertynext
p p y

11/27/2010

PreferredPairsandMaximalConnectedSets
Preferredpairsare2msequencesfrom2differentgenerating
p y
polynomialsofthesameorderwiththecrosscorrelationhave
Trispectralpropertywherecrosscorrelationisoneofthe
followingvalues:

Soforn=5givesust(n)=9,andthecrosscorrelationspectrum
is{1,9,+7}.So,themaximumpeakvalue(avsolute)oftwo
prefaied sequencesis9.Thisvaluewilldeterminethe
performanceofthesecodesinCDMAapplications.

Examples:
n=5,t(n)=9andN=31
A Crosscorrelation
A
C
l i
betweenunpreferred pair
ofMSequences.

B Crosscorrelation
between preferred pair of
betweenpreferredpairof
MSequences.

11/27/2010

Maximalconnectedset:
isthelargestsetwhereevery2
pairsinthissetformapreferred
pairandforn=5,them
sequencelemgth
q
g isN=31,there
,
areonly6feedbackconnections
namely(Octalpresentations)
517567andthere
reverseswhichare:
455773
Thefollowingfigureshowsthe
The following figure shows the
connectionbetweenthese
sequences.
Themaximumsizeofa
connectedsetisonly3.

Somedetails:
[5,3] [101001]=(51)8
reverse [100101]=(45)8
[5,4,3,2] [111101]=(75)8
reverse [101111]=(57)8
[5,4,2,1] [110111]=(67)8
reverse [111011]=(73)8

MaximalConnectedSetsFor
n=5 N=31
51
67

75

57

73
45

11/27/2010

Setsizesandcrosscorrelationboundsfor
maximalconnectedsets:

GoldCodes
GoldcodesaregeneratedbyXORingoftwomaximal
length sequences (preferred pair) with the same
lengthsequences(preferredpair)withthesame
length.
Msequence1( = 0)
Gold
Sequence

CLK

Msequence2( = kT)

11/27/2010

PropertiesofGoldCodes
Theoutputcodehasthesamelengthasthetwo
individual M sequences used to create it
individualMsequencesusedtocreateit:
N=2n 1
Thesizeofgoldcodes:
Crosscorrelationfunctionsbetweengoldcodes
functions between gold codes
Crosscorrelation
aretrivalued:
ClosureProperty(ShiftandAddProperty):
gm =M1 +Dm M2

Example:n=5

11/27/2010

ApplicationsofGoldCodes
UMTS(3G)scramblingcode(n=24)
GPSSatellites(n=10)
LTEscramblingcode(n=31)

OrthogonalCodes;
Definition of Orthogonal Functions:
Orthogonal functions have zero correlation.
correlation Two binary sequences
are orthogonal if the process of XORing them results in an
equal number of 1s and 0s.
Example:

0000 +
0101
0101

10

11/27/2010

OrthogonalCodes
Orthogonalcodeshavecrosscorrelation=0
Orthogonalitypreservedonlyifthecodesaresynchronized,
i e start and end together
i.e.,startandendtogether
Ifonecodeisdelayedcomparedtotheother,orthogonaltyis
lost
Systemstillworks,withsomeinterferenceamongusers

Tb
T
cross correlation = C i (t )C j (t ) dt = b
0
0

i =j
i j

Uniquecodeperuser(typically,64or128chips)
SynchronizedWalshcodes=Zerocrosscorrelation
Example:2synchronizedusers

C (t )C (t )dt = 0

Tb

Tb

d1(t)

i =j
i j
Z1(t)

d1(t)

(.) dt

d1(t)

Tb

C1(t)
C1(t)
d2(t)

Carrier

Carrier

C1(t)

d2(t)

C2(t)
C2(t)
Tb

Carrier

Tc

11

11/27/2010

Generation of WalshHadamarad Codes

00
01
00
01

0 0
0 1

Repeat to the Right

00
01
11
10

Repeat
p
Below
Invert diagonally

Applications:
Chanalization spreadingcodesinIS95and3GMobilesystems
Mary orthogonalmodulation

WalshCodesGeneration

LengthN=2n

H 2 = 1 1
1 1

H2

H4

H8

H n H n

H
H n
n

H 2n =

+1
+1

+1
-1

+1
+1
+1
+1

+1
-1
+1
-1

+1
+1
-1
-1

+1
-1
-1
+1

+1
+1
+1
+1
+1
+1
+1
+1

+1
-1
+1
-1
+1
-1
+1
-1

+1
+1
-1
1
-1
+1
+1
-1
-1

+1
-1
-1
1
+1
+1
-1
-1
+1

+1
+1
+1
+1
-1
-1
-1
-1

+1
-1
+1
-1
-1
+1
-1
+1

+1
+1
-1
1
-1
-1
-1
+1
+1

+1
-1
-1
1
+1
-1
+1
+1
-1

12

11/27/2010

Example:Walsh 64 usedinIs95Systemsforspreadingandchannelization.

13

11/27/2010

OrthogonalVariableSpaceFactor(OVSF)
CodesforMultirateMultimediaCDMA
Systems(e.g.3GUMTS)
11111111
1111
1 1 1 1 -1 -1 -1 -1
11

1 1 -1 -1 1 1 -1 -1
1 1 -1 -1
1 1 -1 -1 -1 -1 1 1

1 -1 1 -1 1 -1 1 -1

root

1 -1 1 -1
1 -1 1 -1 -1 1 -1 1

1 -1

1 -1 -1 1 1 -1 -1 1
1 -1 -1 1
1 -1 -1 1 -1 1 1 -1
SF = 1

SF = 2

SF = 4

SF = 8

Fig. 1 Orthogonal variable spreading factor codes

14