EC2301-NOL.pdf

WWW.VIDYARTHIPLUS.COM

DIGITAL COMMUNICATION III YEAR ECE A &B

UNIT I DIGITAL COMMUNICATION SYSTEM SAMPLING:

rate. samplinghigher haveor bandwidth signal

limit themay wealiasing, avoid .To occurs aliasing

sampling)(under limited-bandnot is signal When the

21 intervalNyquist

2 rateNyquist

)2

( from recovered completely becan signal The.2

.)2

(by described

completely becan , tolimited is which signal 1.a

signals limited-bandstrictly for Theorem Sampling

W

W

W

ng

W

ng

WfW

=

=

<<−

rate sampling:1

period sampling : where

(3.1) )( )()(

signal sampled ideal thedenote )(Let

ss

s

s

n

s

Tf

T

nTtnTgtg

tg

=

−= ∑∞

−∞=

δδ

δ


∑

∑

∑

∑

∑

∑

∑

∞

−∞=

∞

≠−∞=

∞

−∞=

∞

−∞=

∞

−∞=

∞

−∞=

∞

−∞=

−=

=≥=

−+=

−=

−⇔

−=

−∗

⇔−

n

s

mm

sss

s

n

s

m

ss

m

ss

m ss

n

s

W

n fj

W

ngfG

WTWffG

mffGffGffG

nf TjnTgfG

mffGftg

mffGf

T

mf

TfG

nTtt

(3.4) )exp()2

()(

21 and for 0)( If

(3.5) )()()(or

(3.3) )2exp()()(

obtain to(3.1) on Transformier apply Fourmay or we

(3.2) )()(

)(

)(1

)(

)()g(

have weA6.3 Table From

0

π

π

δ

δ

δ

δ

δ

δ

for )(by determineduniquely is )(

(3.7) , )exp()2

(2

1)(

as )( rewritemay we(3.6) into (3.4) ngSubstituti

(3.6) , )(2

1)(

that (3.5) Equationfrom find we

2.2

for 0)(.1

With

nn

gtg

WfWW

nfj

W

ng

WfG

fG

WfWfGW

fG

Wf

WffG

n

s

∞<<∞−

<<−−=

<<−=

=

≥=

∑∞

−∞=

π

δ


)( offormula ioninterpolat an is (3.9)

(3.9) - , )2(sin)2

(

2

)2sin()

2(

(3.8) )2

(2exp 2

1)

2(

)2exp()exp()2

(2

1

)2exp()()(

havemay we, )2

( from )(t reconstruc To

tg

tnWtcW

ng

n Wt

n Wt

W

ng

dfW

nt fj

WW

ng

df f tjW

n fj

W

ng

W

dfftjfGtg

W

ngtg

n

n

n

W

W

W

Wn

∑

∑

∑ ∫

∫ ∑

∫

∞

−∞=

∞

−∞=

∞

−∞=−

−

∞

−∞=

∞

∞−

∞<<∞−=

−

−=

−=

−=

=

ππ

ππ

π

ππ

π


Figure 3.3 (a) Spectrum of a signal. (b) Spectrum of an

undersampled version of the signal exhibiting the aliasing

phenomenon.

Figure 3.4 (a) Anti-alias filtered spectrum of an information-bearing signal. (b) Spectrum

of instantaneously sampled version of the signal, assuming the use of a sampling rate

greater than the Nyquist rate. (c) Magnitude response of reconstruction filter.

Pulse-Amplitude Modulation :

(3.14) )()()()(

have we,property sifting theUsing

(3.13) )()()(

)()()(

)()()()(

(3.12) )()()(

is )( of versionsampledously instantane The

(3.11)

otherwise

Tt0,t

Tt 0

,

,02

1

,1

)(

(3.10) )( )()(

as pulses top-flat of sequence thedenote )(Let

ss

s

n

s

s

n

s

n

ss

s

n

s

nTthnTmthtm

dthnTnTm

dthnTnTm

dthmthtm

nTtnTmtm

tm

th

nTthnTmts

ts

−=∗

−−=

−−=

−=∗

−=

==

<<

=

−=

∑

∫∑

∫ ∑

∫

∑

∑

∞

∞

∞−

∞

−∞=

∞

∞−

∞

−∞=

∞

∞−

∞

−∞=

∞

−∞=

δ

δδ

δ

τττδ

τττδ

τττ

δ


Pulse Amplitude Modulation – Natural and Flat-Top

Sampling:

(3.18) )()()(

(3.17) )()(M

(3.2) )()( (3.2) Recall

(3.16) )()()(

(3.15) )()()(

is )( signal PAM The

∑

∑

∑

∞

−∞=

∞

−∞=

∞

−∞=

−=

−=

−⇔

=⇔

∗=

k

ss

k

ss

m

ss

δ

fHk ffMffS

k ffMff

mffGftg

fHfMfS

thtmts

ts

δ

δ

δ


� The most common technique for sampling voice in PCM

systems is to a sample-and-hold circuit.

� The instantaneous amplitude of the analog (voice) signal is

held as a constant charge on a capacitor for the duration of

the sampling period Ts.

� This technique is useful for holding the sample constant

while other processing is taking place, but it alters the

frequency spectrum and introduces an error, called aperture


error, resulting in an inability to recover exactly the original

analog signal.

� The amount of error depends on how mach the analog

changes during the holding time, called aperture time.

� To estimate the maximum voltage error possible, determine

the maximum slope of the analog signal and multiply it by

the aperture time DT

Recovering the original message signal m(t) from PAM signal :

.completely recovered be can )( signal original eIdeally th

(3.20) )sin()sinc(

1

)(

1

is responseequalizer Let the

effect aparture

(3.19) )exp()sinc()(

by given is )( of ansformFourier tr

that theNote . )()( isoutput filter The

is bandwidthfilter theWhere

2delaydistortion amplitude

s

tm

f T

f

f TTfH

f Tjf TTfH

th

fHfMf

W

T

π

π

π

==

⇒

−=

=


Other Forms of Pulse Modulation:

� In pulse width modulation (PWM), the width of each pulse is

made directly proportional to the amplitude of the information

signal.

� In pulse position modulation, constant-width pulses are used,

and the position or time of occurrence of each pulse from some

reference time is made directly proportional to the amplitude of

the information signal.

Pulse Code Modulation (PCM) :


� Pulse code modulation (PCM) is produced by analog-to-

digital conversion process.

� As in the case of other pulse modulation techniques, the rate

at which samples are taken and encoded must conform to the

Nyquist sampling rate.

� The sampling rate must be greater than, twice the highest

frequency in the analog signal,

fs > 2fA(max)

Quantization Process:

{ }

function. staircasea is whichstic,characteriquantizer thecalled is

(3.22) )g( mapping The

size. step theis , levels tionreconstrucor tionrepresenta theare

L,1,2, , where isoutput quantizer the then )( If

3.9 Figin shown as )(

amplitude discretea into )( amplitude sample

theing transformof process The:onquantizati Amplitude

. thresholddecision or the level decision theis Where

(3.21) ,,2,1 , :

cell partition Define

1

1

m

mm

tm

nT

nTm

m

Lkmmm

kk

s

s

k

kk

=

−

=∈

=≤<

+

+

ν

ν

L

L

kννJ

J

kkk

k


Figure 3.10 Two types of quantization: (a) midtread and (b)

midrise.

Quantization Noise:

Figure 3.11 Illustration of the quantization process

(3.25) 2

is size-step the

typemidrise theofquantizer uniform a Assuming

(3.24) )0][( ,

(3.23)

valuesample of variable

random by the denoted beerror on quantizati Let the

max

=∆

=−=

−=

m

MEVMQ

mq

qQ

ν


).(bandwidth increasinglly with exponentia increases (SNR)

(3.33) )23

(

)(

)( ofpower average thedenote Let

(3.32) 23

1

(3.31) 2

2

(3.30) log

sampleper bits ofnumber theis where

(3.29) 2

form,binary in expressed is sample quatized When the

o

2

2

max

2o

22

max

2

2

max

R

m

P

PSNR

tmP

m

m

LR

R

L

R

Q

R

Q

R

R

=

=⇒

=

=∆

=

=

−

σ

σ


Pulse Code Modulation (PCM):


Figure 3.13 The basic elements of a PCM system

Quantization (nonuniform quantizer):


Compression laws. (a) m -law. (b) A-law.

≤≤

≤≤

+

+

=

≤≤

≤≤

+

+

+=

++

=

+

+=

(3.51)

11

10

)1(

log1

(3.50)

11

10

log1

)log(1

log1

)(

law-A

(3.49) )1()1log(

(3.48) )1log(

)1log(

law-

mA

Am

mAA

A

d

md

mA

Am

A

mA

A

mA

md

md

m

ν

ν

µµ

µ

ν

µ

µν

µ


Figure 3.15 Line codes for the electrical representations of binary

data.

(a) Unipolar NRZ signaling. (b) Polar NRZ signaling.

(c) Unipolar RZ signaling. (d) Bipolar RZ signaling.

(e) Split-phase or Manchester code.


Noise consideration in PCM systems:

(Channel noise, quantization noise)


Time-Division Multiplexing(TDM):

Digital Multiplexers :

Virtues, Limitations and Modifications of PCM:

Advantages of PCM

1. Robustness to noise and interference

2. Efficient regeneration

3. Efficient SNR and bandwidth trade-off

4. Uniform format

5. Ease add and drop

6. Secure


Delta Modulation (DM) :

[ ]

[ ] [ ] [ ][ ] [ ][ ] [ ] [ ]

[ ] [ ][ ] size step theis and , of version quantized the

is ,output quantizer theis where

(3.54) 1

(3.53) ) sgn(

(3.52) 1

is signalerror The

).( of sample a is )( and period sampling theis where

,2,1,0 , )(Let

∆

+−=

∆=

−−=

±±==

ne

nenm

nenmnm

nene

nmnmne

tmnTmT

nnTmnm

qq

qqq

q

q

ss

s K


The modulator consists of a comparator, a quantizer, and an

accumulator

The output of the accumulator is

Two types of quantization errors :

Slope overload distortion and granular noise

[ ] [ ]

[ ] (3.55)

)sgn(

1

1

∑

∑

=

=

=

∆=

n

i

q

n

i

q

ie

ienm


Slope Overload Distortion and Granular Noise:

Delta-Sigma modulation (sigma-delta modulation):

The modulation which has an integrator can

relieve the draw back of delta modulation (differentiator)

Beneficial effects of using integrator:

1. Pre-emphasize the low-frequency content

2. Increase correlation between adjacent samples

(reduce the variance of the error signal at the quantizer input)

3. Simplify receiver design

Because the transmitter has an integrator , the receiver

consists simply of a low-pass filter.

(The differentiator in the conventional DM receiver is cancelled

by the integrator )

[ ][ ] [ ] [ ]

[ ] [ ] [ ] [ ][ ]

.)( of slope local the torelative large toois

size step when occurs noisegranular hand,other On the

(3.58) )(

max (slope)

require we, distortion overload-slope avoid To

signalinput theof difference backward

first a isinput quantizer the,1for Except

(3.57) 11

have we, (3.52) Recall

(3.56)

, by error on quantizati theDenote

tm

dt

tdm

T

nq

nqnmnmne

nqnmnm

nq

s

q

∆

≥∆

−

−−−−=

−=

Σ−∆


Linear Prediction (to reduce the sampling rate):

Consider a finite-duration impulse response (FIR)

discrete-time filter which consists of three blocks :

1. Set of p ( p: prediction order) unit-delay elements (z-1)

2. Set of multipliers with coefficients w1,w2,…wp

3. Set of adders ( ∑ )

[ ]

[ ] [ ] [ ]

[ ][ ]

[ ][ ] [ ] [ ][ ]

[ ] [ ][ ] (3.62)

2

have we(3.61) and (3.60) (3.59) From

minimize to,,, Find

(3.61) error) square(mean

be eperformanc ofindex Let the

(3.60) ˆ

iserror prediction The

(3.59) )(ˆ

is )input theofpredition linear (Theoutput filter The

1 1

1

2

21

2

1

∑∑

∑

∑

= =

=

=

−−+

−−=

=

−=

−=

p

j

p

k

kj

p

k

k

p

p

k

k

knxjnxEww

knxnxEwnx EJ

Jwww

neEJ

nxnxne

knxwnx

K


[ ][ ] [ ][ ][ ][ ]

[ ] [ ] [ ][ ]

[ ] [ ]

[ ] [ ]

[ ] [ ] [ ]

equations Hopf- Wienercalled are (3.64)

(3.64) 21 ,

022

(3.63) 2

as simplify may We

)(

ation autocorrel The

)(

0)]][[(mean zero with process stationary is )( Assume

1

1

1 11

2

2

222

,p,,kkRkRjkRw

jkRwkRw

J

jkRwwkRwJ

J

knxnxEkRkTR

nxE

nxEnxE

nxEtX

p

j

XXXj

p

j

XjX

k

p

j

p

k

Xkj

p

k

XkX

XsX

X

K=−==−

=−+−=∂

∂

−+−=

−===

=

−=

=

∑

∑

∑ ∑∑

=

=

= ==

σ

τ

σ

[ ]

[ ] [ ] [ ][ ] [ ] [ ]

[ ] [ ] [ ]

[ ] [ ] [ ]

[ ] [ ]

[ ]

2

min

1

12

0

2

1

2

11

2

min

210

1

0

1

than less always is 0,

(3.67)

2

yields (3.63) into (3.64) ngSubstituti

,, 1, 0

021

201

110

]][],...,2[ ],1[[

,,, where

(3.66) exists if , as

XXX

T

X

XX

T

XX

T

XX

p

k

XkX

p

k

Xk

p

k

XkX

XXX

XXX

XXX

XXX

X

T

XXXX

T

p

XXX

J

kRw

kRwkRwJ

pRRR

RpRpR

pRRR

pRRR

pRRR

www

σ

σσ

σ

σ

∴≥

−=−=

−=

+−=

−−

−

−

=

=

=

=

−

−

=

==

−−

∑

∑∑

rRr

rRrwr

R

r

w

rRwR

Q

L

L

MMM

L

L

K


Linear adaptive prediction :

[ ] [ ]

[ ] [ ]

on.presentati of

econveniencfor is 2

1 andparameter size-step a is where

(3.69) 21 ,2

11

1 updateThen .n iteration at value thedenotes

(3.68) 21 ,

ectorgradient v theDefine

descentsteepest of method theusingiteration Do 2.

valuesinitialany starting ,,,2,1 , Compute 1.

sense follow in the adaptive ispredictor The

µ

µ ,p,,kgnwnw

nwnw

,p,,kw

Jg

pkw

kkk

kk

k

k

k

K

K

K

=−=+

+

=∂

∂=

=

[ ] [ ]

[ ] [ ][ ] [ ] [ ][ ]

[ ] [ ]

[ ] [ ] [ ] [ ] [ ] [ ]

[ ] [ ] [ ] [ ] [ ] [ ]

[ ] [ ] [ ]

[ ] [ ] [ ] [ ]

algorithm square-mean-lease called are equations above The

(3.73) (3.60)(3.59)by ˆ where

)72.3( ,,2,1 , ˆ

ˆˆ1ˆ

)71.3( ,,2,1 , 22ˆ

n)expectatio the(ignore

k]]-E[x[n]x[nfor use wecomputing hesimplify t To

(3.70) ,,2,1 , 22

22

1

1

1

1

1

+−−=

=−+=

−−−+=+

=−−+−−=

−

=−−+−−=

−+−=∂

∂=

∑

∑

∑

∑

∑

=

=

=

=

=

jnxnwnxne

pkneknxnw

jnxnwnxknxnwnw

pkknxjnxnwknxnxng

knxnx

pkknxjnxEwknxnxE

jkRwkRw

Jg

p

j

j

k

p

j

jkk

p

j

j

p

j

j

P

j

XjX

k

k

k

K

K

K

µ

µ


Figure 3.27

Block diagram illustrating the linear adaptive prediction process

Differential Pulse-Code Modulation (DPCM):

Usually PCM has the sampling rate higher than the Nyquist rate

.The encode signal contains redundant information. DPCM can

efficiently remove this redundancy.

Figure 3.28 DPCM system. (a) Transmitter. (b) Receiver.


Input signal to the quantizer is defined by:

[ ] [ ] [ ][ ]

[ ] [ ] [ ][ ]

[ ] [ ] [ ] [ ]

[ ][ ] [ ] [ ] (3.78)

(3.77) ˆ

isinput filter prediction The

error.on quantizati is where

(3.75)

isoutput quantizer The

value.prediction a is ˆ

(3.74) ˆ

nqnmnm

nm

nqnenmnm

nq

nqnene

nm

nmnmne

q

q

q

+=⇒

++=

+=

−=

From (3.74)


Processing Gain:

Adaptive Differential Pulse-Code Modulation

(ADPCM):

Need for coding speech at low bit rates , we have two

aims in mind:

1. Remove redundancies from the speech signal as far

as possible.

[ ] [ ]

) (minimize G maximize filter to prediction aDesign

(3.82) G Gain, Processing

(3.81) )SNR(

is ratio noiseon quantizati-to-signal theand

error sprediction theof variance theis where

(3.80))SNR(

))(((SNR)

and 0)]][[( of variancesare and where

(3.79) (SNR)

is system DPCM theof (SNR) The

2

2

2

2

2

2

2

2

2

2

o

22

2

2

o

o

Ep

E

Mp

Q

EQ

E

Qp

Q

E

E

M

QM

Q

M

G

nqnmEnm

σ

σ

σ

σ

σ

σ

σ

σ

σ

σ

σσ

σ

σ

=

=

=

=

=

=


2. Assign the available bits in a perceptually efficient

manner.

Figure 3.29 Adaptive quantization with backward estimation

(AQB).

Figure 3.30 Adaptive prediction with backward estimation (APB).


UNIT II: BASEBAND FORMATTING TECHNIQUES

CORRELATIVE LEVEL CODING:

� Correlative-level coding (partial response signaling)

– adding ISI to the transmitted signal in a controlled

manner

� Since ISI introduced into the transmitted signal is

known, its effect can be interpreted at the receiver

� A practical method of achieving the theoretical

maximum signaling rate of 2W symbol per second in a

bandwidth of W Hertz

� Using realizable and perturbation-tolerant filters

Duo-binary Signaling :

Duo : doubling of the transmission capacity of a straight binary

system

� Binary input sequence {bk} : uncorrelated binary symbol 1, 0

11

01

k

k

k

if symbol b isa

if symbol b is

+=

−1−+= kkk aac


� The tails of hI(t) decay as 1/|t|2, which is a faster rate of

decay than 1/|t| encountered in the ideal Nyquist channel.

� Let represent the estimate of the original pulse ak as

conceived by the receiver at time t=kTb

� Decision feedback : technique of using a stored estimate of

the previous symbol

� Propagate : drawback, once error are made, they tend to

propagate through the output

� Precoding : practical means of avoiding the error propagation

phenomenon before the duobinary coding

)exp()cos()(2

)exp()]exp())[exp((

)]2exp(1)[()(

bbNyquist

bbbNyquist

bNyquistI

fTjfTfH

fTjfTjfTjfH

fTjfHfH

ππ

πππ

π

−=

−−+=

−+=

2cos( )exp( ), | | 1/ 2( )

0,

b b b

I

fT j fT f TH f

otherwise

π π− ≤=

)(

)/sin(

/)(

]/)(sin[

/

)/sin()(

2

tTt

TtT

TTt

TTt

Tt

Ttth

b

bb

bb

bb

b

bI

−=

−

−+=

π

π

π

π

π

π

≤

=otherwise

TffH

b

Nyquist

2/1||

,0

,1)(

1−⊕= kkk dbd

11 1

0

k k

k

symbol if eithersymbol b ord isd

symbol otherwise

−=


� {dk} is applied to a pulse-amplitude modulator, producing a

corresponding two-level sequence of short pulse {ak}, where

+1 or –1 as before

� |ck|=1 : random guess in favor of symbol 1 or 0


1−+= kkk aac

10

02

k

k

k

if datasymbol b isc

if datasymbol b is

=

±


Modified Duo-binary Signaling :

� Nonzero at the origin : undesirable

� Subtracting amplitude-modulated pulses spaced 2Tb second

1−+= kkk aac

( ) ( )[1 exp( 4 )]

2 ( )sin(2 )exp( 2 )

IV Nyquist b

Nyquist b b

H f H f j fT

jH f fT j fT

π

π π

= − −

= −

2 sin(2 )exp( 2 ), | | 1/2( )

0,

b b b

IV

j fT j fT f TH f

elsewhere

π π− ≤=

2

sin ( / ) sin[ ( 2 ) / ]( )

/ ( 2 ) /

2 sin ( / )

(2 )

b b bIV

b b b

b b

b

t T t T Th t

t T t T T

T t T

t T t

π π

π π

π

π

−= −

−

=−


� precoding

2

21 1

0

k k k

k k

d b d

symbol if eithersymbol b ord is

symbol otherwise

−

−

= ⊕

=



| | 1, 1

| | 1, 0

k k

k k

If c say symbol b is

If c say symbol b is

>

<


Generalized form of correlative-level coding:


∑−

−=

1

sin)(N

n b

n nT

tcwth


Baseband M-ary PAM Transmission:

� Produce one of M possible amplitude level

� T : symbol duration

� 1/T: signaling rate, symbol per second, bauds

– Equal to log2M bit per second

� Tb : bit duration of equivalent binary PAM :

� To realize the same average probability of symbol error,

transmitted power must be increased by a factor of

M2/log2M compared to binary PAM


Tapped-delay-line equalization :

� Approach to high speed transmission

– Combination of two basic signal-processing operation

– Discrete PAM

– Linear modulation scheme

� The number of detectable amplitude levels is often limited by

ISI

� Residual distortion for ISI : limiting factor on data rate of the

system

� Equalization : to compensate for the residual distortion

� Equalizer : filter

– A device well-suited for the design of a linear equalizer

is the tapped-delay-line filter

– Total number of taps is chosen to be (2N+1)


� P(t) is equal to the convolution of c(t) and h(t)

� nT=t sampling time, discrete convolution sum

� Nyquist criterion for distortionless transmission, with T used

in place of Tb, normalized condition p(0)=1

� Zero-forcing equalizer

– Optimum in the sense that it minimizes the peak

distortion(ISI) – worst case

– Simple implementation

– The longer equalizer, the more the ideal condition for

distortionless transmission

Adaptive Equalizer :

� The channel is usually time varying

– Difference in the transmission characteristics of the

individual links that may be switched together

– Differences in the number of links in a connection

∑−=

−=N

Nk

k kTtwth )()( δ

∑∑

∑

−=−=

−=

−=−∗=

−∗=∗=

N

Nk

k

N

Nk

k

N

Nk

k

kTtcwkTttcw

kTtwtcthtctp

)()()(

)()()()()(

δ

δ

∑−=

−=N

Nk

k TkncwnTp ))(()(

±±±=

==

≠

==

Nn

n

n

nnTp

.....,,2,1

0

,0

,1

0,0

0,1)(


� Adaptive equalization

– Adjust itself by operating on the the input signal

� Training sequence

– Precall equalization

– Channel changes little during an average data call

� Prechannel equalization

– Require the feedback channel

� Postchannel equalization

� synchronous

– Tap spacing is the same as the symbol duration of

transmitted signal

Least-Mean-Square Algorithm:

� Adaptation may be achieved

– By observing the error b/w desired pulse shape and

actual pulse shape

– Using this error to estimate the direction in which the

tap-weight should be changed

� Mean-square error criterion

– More general in application

– Less sensitive to timing perturbations

� : desired response, : error signal, : actual response

� Mean-square error is defined by cost fuction

� Ensemble-averaged cross-correlation

2

nE eε =

[ ]2 2 2 2 ( )n nn n n n k ex

k k k

e yE e E e E e x R k

w w w

ε−

∂ ∂∂= = − = − = −

∂ ∂ ∂

[ ]( )ex n n kR k E e x −=


� Optimality condition for minimum mean-square error

� Mean-square error is a second-order and a parabolic function

of tap weights as a multidimentional bowl-shaped surface

� Adaptive process is a successive adjustments of tap-weight

seeking the bottom of the bowl(minimum value )

� Steepest descent algorithm

– The successive adjustments to the tap-weight in

direction opposite to the vector of gradient )

– Recursive formular (µ : step size parameter)

� Least-Mean-Square Algorithm

– Steepest-descent algorithm is not available in an

unknown environment

– Approximation to the steepest descent algorithm using

instantaneous estimate

� LMS is a feedback system

0 0, 1,....,k

fork Nw

ε∂= = ± ±

∂

1( 1) ( ) , 0, 1, ....,

2

( ) ( ), 0, 1, ....,

k k

k

k ex

w n w n k Nw

w n R k k N

εµ

µ

∂+ = − = ± ±

∂

= − = ± ±

( )

( 1) ( )

ex n n k

k k n n k

R k e x

w n w n e xµ−

−

=

+ = +

)

) )


� In the case of small µ, roughly similar to steepest

descent algorithm

Operation of the equalizer:

� square error Training mode

– Known sequence is transmitted and synchorunized

version is generated in the receiver

– Use the training sequence, so called pseudo-noise(PN)

sequence

� Decision-directed mode

– After training sequence is completed

– Track relatively slow variation in channel characteristic

� Large µ : fast tracking, excess mean


Implementation Approaches:

� Analog

– CCD, Tap-weight is stored in digital memory, analog

sample and multiplication

– Symbol rate is too high

� Digital

– Sample is quantized and stored in shift register

– Tap weight is stored in shift register, digital

multiplication

� Programmable digital

– Microprocessor

– Flexibility

– Same H/W may be time shared

Decision-Feed back equalization:

� Baseband channel impulse response : {hn}, input : {xn}


� Using data decisions made on the basis of precursor to take

care of the postcursors

– The decision would obviously have to be correct

� Feedforward section : tapped-delay-line equalizer

� Feedback section : the decision is made on previously

detected symbols of the input sequence

– Nonlinear feedback loop by decision device

Eye Pattern:

� Experimental tool for such an evaluation in an insightful

manner

– Synchronized superposition of all the signal of interest

viewed within a particular signaling interval

� Eye opening : interior region of the eye pattern

0

0 0

n k n k

k

n k n k k n k

k k

y h x

h x h x h x

−

− −

< >

=

= + +

∑

∑ ∑

(1)

(2)

n

n

n

wc

w

=

)

)n

n

n

xv

a

= ) T

n n n ne a c v= − (1) (1)

1 1 1

(2) (2)

1 1 1

n n n n

n n n n

w w e x

w w e a

µ

µ

+ +

+ +

= −

= −

) )

) ) )


� In the case of an M-ary system, the eye pattern contains (M-

1) eye opening, where M is the number of discreteamplitude

levels


Interpretation of Eye Diagram:


UNIT III BASEBAND CODING TECHNIQUES


ASK, OOK, MASK:

• The amplitude (or height) of the sine wave varies to transmit

the ones and zeros


• One amplitude encodes a 0 while another amplitude encodes

a 1 (a form of amplitude modulation)

Binary amplitude shift keying, Bandwidth:

• d ≥ 0-related to the condition of the line

B = (1+d) x S = (1+d) x N x 1/r


Implementation of binary ASK:

Frequency Shift Keying:

• One frequency encodes a 0 while another frequency encodes

a 1 (a form of frequency modulation)


FSK Bandwidth:

• Limiting factor: Physical capabilities of the carrier

• Not susceptible to noise as much as ASK

( )

=ts( )tfA 22cos π 1binary

( )tfA 22cos π 0binary


• Applications

– On voice-grade lines, used up to 1200bps

– Used for high-frequency (3 to 30 MHz) radio

transmission

– used at higher frequencies on LANs that use coaxial

cable

DBPSK:

• Differential BPSK

– 0 = same phase as last signal element

– 1 = 180º shift from last signal element


Concept of a constellation :

( )

=ts

+

42cos

ππ tfA c

11

+

4

32cos

ππ tfA c

−

4

32cos

ππ tfA c

−

42cos

ππ tfA c

01

00

10


M-ary PSK:

Using multiple phase angles with each angle having more than one

amplitude, multiple signals elements can be achieved

– D = modulation rate, baud

– R = data rate, bps

– M = number of different signal elements = 2L

– L = number of bits per signal element

M

R

L

RD

2log==


QAM:

– As an example of QAM, 12 different phases are

combined with two different amplitudes

– Since only 4 phase angles have 2 different amplitudes,

there are a total of 16 combinations

– With 16 signal combinations, each baud equals 4 bits of

information (2 ^ 4 = 16)

– Combine ASK and PSK such that each signal

corresponds to multiple bits

– More phases than amplitudes

– Minimum bandwidth requirement same as ASK or PSK


QAM and QPR:

• QAM is a combination of ASK and PSK

– Two different signals sent simultaneously on the same

carrier frequency

– M=4, 16, 32, 64, 128, 256

• Quadrature Partial Response (QPR)

– 3 levels (+1, 0, -1), so 9QPR, 49QPR


Offset quadrature phase-shift keying (OQPSK):

• QPSK can have 180 degree jump, amplitude fluctuation

• By offsetting the timing of the odd and even bits by one bit-

period, or half a symbol-period, the in-phase and quadrature

components will never change at the same time.


Generation and Detection of Coherent BPSK:

Figure 6.26 Block diagrams for (a) binary FSK transmitter and

(b) coherent binary FSK receiver.


FFiigguurree 66..3300 ((aa)) IInnppuutt bbiinnaarryy sseeqquueennccee.. ((bb)) WWaavveeffoorrmm ooff ssccaalleedd

ttiimmee ffuunnccttiioonn ss11ff11((tt)).. ((cc)) WWaavveeffoorrmm ooff ssccaalleedd ttiimmee ffuunnccttiioonn ss22ff22((tt))..

((dd)) WWaavveeffoorrmm ooff tthhee MMSSKK ssiiggnnaall ss((tt)) oobbttaaiinneedd bbyy aaddddiinngg ss11ff11((tt)) aanndd

s f t

Fig. 6.28

6.28


Figure 6.29 Signal-space diagram for MSK system.


Generation and Detection of MSK Signals:

Figure 6.31 Block diagrams for (a) MSK transmitter and (b)

coherent MSK receiver.


UNIT IV BASEBAND RECEPTION TECHNIQUES

• Forward Error Correction (FEC)

– Coding designed so that errors can be corrected at the

receiver

– Appropriate for delay sensitive and one-way

transmission (e.g., broadcast TV) of data

– Two main types, namely block codes and convolutional

codes. We will only look at block codes

Block Codes:

• We will consider only binary data

• Data is grouped into blocks of length k bits (dataword)

• Each dataword is coded into blocks of length n bits

(codeword), where in general n>k

• This is known as an (n,k) block code

• A vector notation is used for the datawords and codewords,

– Dataword d = (d1 d2….dk)

– Codeword c = (c1 c2……..cn)

• The redundancy introduced by the code is quantified by the

code rate,

– Code rate = k/n

– i.e., the higher the redundancy, the lower the code rate

Hamming Distance:

• Error control capability is determined by the Hamming

distance

• The Hamming distance between two codewords is equal to

the number of differences between them, e.g.,

10011011

11010010 have a Hamming distance = 3

• Alternatively, can compute by adding codewords (mod 2)

=01001001 (now count up the ones)

• The maximum number of detectable errors is


• That is the maximum number of correctable errors is given

by,

where dmin is the minimum Hamming distance between 2

codewords and means the smallest integer

Linear Block Codes:

• As seen from the second Parity Code example, it is possible

to use a table to hold all the codewords for a code and to

look-up the appropriate codeword based on the supplied

dataword

• Alternatively, it is possible to create codewords by addition

of other codewords. This has the advantage that there is now

no longer the need to held every possible codeword in the

table.

• If there are k data bits, all that is required is to hold k linearly

independent codewords, i.e., a set of k codewords none of

which can be produced by linear combinations of 2 or more

codewords in the set.

• The easiest way to find k linearly independent codewords is

to choose those which have ‘1’ in just one of the first k

positions and ‘0’ in the other k-1 of the first k positions.

• For example for a (7,4) code, only four codewords are

required, e.g.,

1min −d

−=

2

1mindt

1111000

1100100

1010010

0110001


• So, to obtain the codeword for dataword 1011, the first, third

and fourth codewords in the list are added together, giving

1011010

• This process will now be described in more detail

• An (n,k) block code has code vectors

d=(d1 d2….dk) and

c=(c1 c2……..cn)

• The block coding process can be written as c=dG

where G is the Generator Matrix

• Thus,

• ai must be linearly independent, i.e.,

Since codewords are given by summations of the ai vectors,

then to avoid 2 datawords having the same codeword the ai vectors

must be linearly independent.

• Sum (mod 2) of any 2 codewords is also a codeword, i.e.,

Since for datawords d1 and d2 we have;

So,

=

=

k

2

1

21

22221

11211

a

.

a

a

...

......

...

...

G

knkk

n

n

aaa

aaa

aaa

∑=

=k

i

iid1

ac

213 d d d +=

∑∑∑∑====

+=+==k

i

ii

k

i

ii

k

i

iii

k

i

ii ddddd1

2

1

1

1

21

1

33 aa)a(ac

213 c c c +=


Error Correcting Power of LBC:

• The Hamming distance of a linear block code (LBC) is

simply the minimum Hamming weight (number of 1’s or

equivalently the distance from the all 0 codeword) of the

non-zero codewords

• Note d(c1,c2) = w(c1+ c2) as shown previously

• For an LBC, c1+ c2=c3

• So min (d(c1,c2)) = min (w(c1+ c2)) = min (w(c3))

• Therefore to find min Hamming distance just need to search

among the 2k codewords to find the min Hamming weight –

far simpler than doing a pair wise check for all possible

codewords.

•

Linear Block Codes – example 1:

• For example a (4,2) code, suppose;

a1 = [1011]

a2 = [0101]

• For d = [1 1], then;

Linear Block Codes – example 2:

• A (6,5) code with

=

1010

1101 G

0111

____

1010

1101

c

=

+=

=

110000

101000

100100

100010

100001

G


• Is an even single parity code

Systematic Codes:

• For a systematic block code the dataword appears unaltered

in the codeword – usually at the start

• The generator matrix has the structure,

R = n - k

• P is often referred to as parity bits

I is k*k identity matrix. Ensures data word appears as beginning of

codeword P is k*R matrix.

Decoding Linear Codes:

• One possibility is a ROM look-up table

• In this case received codeword is used as an address

• Example – Even single parity check code;

Address Data

000000 0

000001 1

000010 1

000011 0

……… .

• Data output is the error flag, i.e., 0 – codeword ok,

• If no error, data word is first k bits of codeword

• For an error correcting code the ROM can also store data

words

[ ]P|I

..1..00

................

..0..10

..0..01

G

21

22221

11211

=

=

kRkk

R

R

ppp

ppp

ppp


• Another possibility is algebraic decoding, i.e., the error flag

is computed from the received codeword (as in the case of

simple parity codes)

• How can this method be extended to more complex error

detection and correction codes?

Parity Check Matrix:

• A linear block code is a linear subspace S sub of all length n

vectors (Space S)

• Consider the subset S null of all length n vectors in space S

that are orthogonal to all length n vectors in S sub

• It can be shown that the dimensionality of S null is n-k, where

n is the dimensionality of S and k is the dimensionality of

S sub

• It can also be shown that S null is a valid subspace of S and

consequently S sub is also the null space of S null

• S null can be represented by its basis vectors. In this case the

generator basis vectors (or ‘generator matrix’ H) denote the

generator matrix for S null - of dimension n-k = R

• This matrix is called the parity check matrix of the code

defined by G, where G is obviously the generator matrix for

S sub - of dimension k

• Note that the number of vectors in the basis defines the

dimension of the subspace

• So the dimension of H is n-k (= R) and all vectors in the null

space are orthogonal to all the vectors of the code

• Since the rows of H, namely the vectors bi are members of

the null space they are orthogonal to any code vector

• So a vector y is a codeword only if yHT=0

• Note that a linear block code can be specified by either G or

H


Parity Check Matrix:

R = n - k

• So H is used to check if a codeword is valid,

• The rows of H, namely, bi, are chosen to be orthogonal to

rows of G, namely ai

• Consequently the dot product of any valid codeword with any

bi is zero

This is so since,

and so,

• This means that a codeword is valid (but not necessarily

correct) only if cHT = 0. To ensure this it is required that the

rows of H are independent and are orthogonal to the rows of

G

• That is the bi span the remaining R (= n - k) dimensions of

the codespace

• For example consider a (3,2) code. In this case G has 2 rows,

a1 and a2

• Consequently all valid codewords sit in the subspace (in this

case a plane) spanned by a1 and a2

=

=

R

2

1

21

22221

11211

b

.

b

b

...

......

...

...

H

RnRR

n

n

bbb

bbb

bbb

∑=

=k

i

iid1

ac

∑∑==

===k

i

ii

k

i

ii dd1

j

1

jj 0)b.(aa.b.cb


• In this example the H matrix has only one row, namely b1.

This vector is orthogonal to the plane containing the rows of

the G matrix, i.e., a1 and a2

• Any received codeword which is not in the plane containing

a1 and a2 (i.e., an invalid codeword) will thus have a

component in the direction of b1 yielding a nonzero dot

product between itself and b1.

Error Syndrome:

• For error correcting codes we need a method to compute the

required correction

• To do this we use the Error Syndrome, s of a received

codeword, cr

s = crHT

• If cr is corrupted by the addition of an error vector, e, then

cr = c + e

and

s = (c + e) HT = cHT + eHT

s = 0 + eHT

Syndrome depends only on the error

• That is, we can add the same error pattern to different code

words and get the same syndrome.

– There are 2(n - k) syndromes but 2n error patterns

– For example for a (3,2) code there are 2 syndromes and

8 error patterns

– Clearly no error correction possible in this case

– Another example. A (7,4) code has 8 syndromes and

128 error patterns.

– With 8 syndromes we can provide a different value to

indicate single errors in any of the 7 bit positions as

well as the zero value to indicate no errors

• Now need to determine which error pattern caused the

syndrome


• For systematic linear block codes, H is constructed as

follows,

G = [ I | P] and so H = [-PT | I]

where I is the k*k identity for G and the R*R identity for H

• Example, (7,4) code, dmin= 3

Error Syndrome – Example:

• For a correct received codeword cr = [1101001]

In this case,

[ ]

==

1111000

0110100

1010010

1100001

P|I G [ ]

==

1001011

0101101

0011110

I|P- H T

[ ] [ ]000

100

010

001

111

011

101

110

1001011Hc s T

r =

==


Standard Array:

• The Standard Array is constructed as follows,

• The array has 2k columns (i.e., equal to the number of valid

codewords) and 2R rows (i.e., the number of syndromes)

Hamming Codes:

• We will consider a special class of SEC codes (i.e., Hamming

distance = 3) where,

– Number of parity bits R = n – k and n = 2R – 1

– Syndrome has R bits

– 0 value implies zero errors

– 2R – 1 other syndrome values, i.e., one for each bit that

might need to be corrected

– This is achieved if each column of H is a different

binary word – remember s = eHT

• Systematic form of (7,4) Hamming code is,

c1 (all zero)

e1

e2

e3

…

eN

c2+e1

c2+e2

c2+e3

……

c2+eN

c2

cM+e1

cM+e2

cM+e3

……

cM+eN

cM

……

……

……

……

……

…… s0

s1

s2

s3

…

sN

[ ]

==

1111000

0110100

1010010

1100001

P|I G [ ]

==

1001011

0101101

0011110

I|P- H T


• The original form is non-systematic,

• Compared with the systematic code, the column orders of

both G and H are swapped so that the columns of H are a

binary count

• The column order is now 7, 6, 1, 5, 2, 3, 4, i.e., col. 1 in the

non-systematic H is col. 7 in the systematic H.

Convolutional Code Introduction:

• Convolutional codes map information to code bits

sequentially by convolving a sequence of information bits

with “generator” sequences

• A convolutional encoder encodes K information bits to N>K

code bits at one time step

• Convolutional codes can be regarded as block codes for

which the encoder has a certain structure such that we can

express the encoding operation as convolution

• Convolutional codes are applied in applications that require

good performance with low implementation cost. They

operate on code streams (not in blocks)

• Convolution codes have memory that utilizes previous bits to

encode or decode following bits (block codes are

memoryless)

• Convolutional codes achieve good performance by

expanding their memory depth

• Convolutional codes are denoted by (n,k,L), where L is code

(or encoder) Memory depth (number of register stages)

=

1001011

0101010

0011001

0000111

G

=

1010101

1100110

1111000

H


• Constraint length C=n(L+1) is defined as the number of

encoded bits a message bit can influence to

• Convolutional encoder, k = 1, n = 2, L=2

– Convolutional encoder is a finite state machine (FSM)

processing information bits in a serial manner

– Thus the generated code is a function of input and the

state of the FSM

– In this (n,k,L) = (2,1,2) encoder each message bit

influences a span of C= n(L+1)=6 successive output

bits = constraint length C

– Thus, for generation of n-bit output, we require n shift

registers in k = 1 convolutional encoders


Here each message bit influences

a span of C = n(L+1)=3(1+1)=6

successive output bits

3 2'

j j j jx m m m

− −= ⊕ ⊕

3 1''

j j j jx m m m

− −= ⊕ ⊕

2'''

j j jx m m

−= ⊕


Convolution point of view in encoding and generator matrix:

Example: Using generator matrix


Representing convolutional codes: Code tree:

(n,k,L) = (2,1,2) encoder

(1)

( 2 )

[1 0 11]

[111 1]

= =

g

g

2 1

2

'

''

j j j j

j j j

x m m m

x m m

− −

−

= ⊕ ⊕

= ⊕

1 1 2 2 3 3' '' ' '' ' '' ...

outx x x x x x x=


Representing convolutional codes compactly: code trellis and

state diagram:

State diagram

Inspecting state diagram: Structural properties of

convolutional codes:

• Each new block of k input bits causes a transition into new

state

• Hence there are 2k branches leaving each state


• Assuming encoder zero initial state, encoded word for any

input of k bits can thus be obtained. For instance, below for

u=(1 1 1 0 1), encoded word v=(1 1, 1 0, 0 1, 0 1, 1 1, 1 0, 1

1, 1 1) is produced:

•

- encoder state diagram for (n,k,L)=(2,1,2) code

- note that the number of states is 2L+1 = 8

Distance for some convolutional codes:


THE VITERBI ALGORITHEM:

• Problem of optimum decoding is to find the minimum

distance path from the initial state back to initial state (below

from S0 to S0). The minimum distance is the sum of all path

metrics

• that is maximized by the correct path

• Exhaustive maximum likelihood

method must search all the paths

in phase trellis (2k paths emerging/

entering from 2 L+1 states for

an (n,k,L) code)

• The Viterbi algorithm gets its

efficiency via concentrating intosurvivor paths of the trellis

0ln ( , ) ln ( | )jm j mjp p y x

∞

=∑=y x


THE SURVIVOR PATH:

• Assume for simplicity a convolutional code with k=1, and up

to 2k = 2 branches can enter each state in trellis diagram

• Assume optimal path passes S. Metric comparison is done by

adding the metric of S into S1 and S2. At the survivor path

the accumulated metric is naturally smaller (otherwise it

could not be the optimum path)


• For this reason the non-survived path can

be discarded -> all path alternatives need not

to be considered

• Note that in principle whole transmitted

sequence must be received before decision.

However, in practice storing of states for

input length of 5L is quite adequate

The maximum likelihood path:


The decoded ML code sequence is 11 10 10 11 00 00 00 whose

Hamming

distance to the received sequence is 4 and the respective decoded

sequence is 1 1 0 0 0 0 0 (why?). Note that this is the minimum

distance path.

(Black circles denote the deleted branches, dashed lines: '1' was

applied)

How to end-up decoding?

• In the previous example it was assumed that the register was

finally filled with zeros thus finding the minimum distance

path

• In practice with long code words zeroing requires feeding of

long sequence of zeros to the end of the message bits: this

wastes channel capacity & introduces delay

• To avoid this path memory truncation is applied:

– Trace all the surviving paths to the

depth where they merge


– Figure right shows a common point

at a memory depth J

– J is a random variable whose applicable

magnitude shown in the figure (5L)

has been experimentally tested for

negligible error rate increase

– Note that this also introduces the

delay of 5L!

Hamming Code Example:

• H(7,4)

• Generator matrix G: first 4-by-4 identical matrix

5 stages of the trellisJ L>


• Message information vector p

• Transmission vector x

• Received vector r

and error vector e

• Parity check matrix H

Error Correction:

• If there is no error, syndrome vector z=zeros

• If there is one error at location 2

• New syndrome vector z is


Example of CRC:


Example: Using generator matrix:

(1)

( 2 )

[1 0 11]

[111 1]

= =

g

g

11 10

01

11 00 01 11 01⊕ ⊕ ⊕ =123 1231442443


correct:1+1+2+2+2=8;8 ( 0.11) 0.88

false:1+1+0+0+0=2;2 ( 2.30) 4.6

total path metric: 5.48

⋅ − = −

⋅ − = −

−


Turbo Codes:

• Backgound

– Turbo codes were proposed by Berrou and Glavieux in

the 1993 International Conference in Communications.

– Performance within 0.5 dB of the channel capacity limit

for BPSK was demonstrated.

• Features of turbo codes

– Parallel concatenated coding

– Recursive convolutional encoders

– Pseudo-random interleaving

– Iterative decoding


Motivation: Performance of Turbo Codes

• Comparison:

– Rate 1/2 Codes.

– K=5 turbo code.

– K=14 convolutional code.

• Plot is from:

– L. Perez, “Turbo Codes”, chapter 8 of Trellis Coding by

C. Schlegel. IEEE Press, 1997

Pseudo-random Interleaving:

• The coding dilemma:

– Shannon showed that large block-length random codes

achieve channel capacity.

– However, codes must have structure that permits

decoding with reasonable complexity.

– Codes with structure don’t perform as well as random

codes.


– “Almost all codes are good, except those that we can

think of.”

• Solution:

– Make the code appear random, while maintaining

enough structure to permit decoding.

– This is the purpose of the pseudo-random interleaver.

– Turbo codes possess random-like properties.

– However, since the interleaving pattern is known,

decoding is possible.

Why Interleaving and Recursive Encoding?

• In a coded systems:

– Performance is dominated by low weight code words.

• A “good” code:

– will produce low weight outputs with very low

probability.

• An RSC code:

– Produces low weight outputs with fairly low

probability.

– However, some inputs still cause low weight outputs.

• Because of the interleaver:

– The probability that both encoders have inputs that

cause low weight outputs is very low.

– Therefore the parallel concatenation of both encoders

will produce a “good” code.

Iterative Decoding:

• There is one decoder for each elementary encoder.

• Each decoder estimates the a posteriori probability (APP) of

each data bit.

• The APP’s are used as a priori information by the other

decoder.

• Decoding continues for a set number of iterations.


– Performance generally improves from iteration to

iteration, but follows a law of diminishing returns

The Turbo-Principle:

Turbo codes get their name because the decoder uses feedback,

like a turbo engine

Performance as a Function of Number of Iterations:


Turbo Code Summary:

• Turbo code advantages:

– Remarkable power efficiency in AWGN and flat-fading

channels for moderately low BER.

– Deign tradeoffs suitable for delivery of multimedia

services.

• Turbo code disadvantages:

– Long latency.

– Poor performance at very low BER.

– Because turbo codes operate at very low SNR, channel

estimation and tracking is a critical issue.

• The principle of iterative or “turbo” processing can be

applied to other problems.

– Turbo-multiuser detection can improve performance of

coded multiple-access systems.

0.5 1 1.5 210

-7

10-6

10-5

10-4

10-3

10-2

10-1

100

Eb/N

o in dB

BE

R

1 iterat ion

2 iterations

3 iterations6 iterat ions

10 iterations

18 iterat ions


UNIT V BANDPASS SIGNAL TRANSMISSION AND

RECEPTION

• Spread data over wide bandwidth

• Makes jamming and interception harder

• Frequency hoping


– Signal broadcast over seemingly random series of

frequencies

• Direct Sequence

– Each bit is represented by multiple bits in transmitted

signal

– Chipping code

Spread Spectrum Concept:

• Input fed into channel encoder

– Produces narrow bandwidth analog signal around

central frequency

• Signal modulated using sequence of digits

– Spreading code/sequence

– Typically generated by pseudonoise/pseudorandom

number generator

• Increases bandwidth significantly

– Spreads spectrum

• Receiver uses same sequence to demodulate signal

• Demodulated signal fed into channel decoder

General Model of Spread Spectrum System:


Gains:

• Immunity from various noise and multipath distortion

– Including jamming

• Can hide/encrypt signals

– Only receiver who knows spreading code can retrieve

signal

• Several users can share same higher bandwidth with little

interference

– Cellular telephones

– Code division multiplexing (CDM)

– Code division multiple access (CDMA)

Pseudorandom Numbers:

• Generated by algorithm using initial seed

• Deterministic algorithm

– Not actually random

– If algorithm good, results pass reasonable tests of

randomness

• Need to know algorithm and seed to predict sequence

Frequency Hopping Spread Spectrum (FHSS):

• Signal broadcast over seemingly random series of

frequencies


• Receiver hops between frequencies in sync with transmitter

• Eavesdroppers hear unintelligible blips

• Jamming on one frequency affects only a few bits

Basic Operation:

• Typically 2k carriers frequencies forming 2k channels

• Channel spacing corresponds with bandwidth of input

• Each channel used for fixed interval

– 300 ms in IEEE 802.11

– Some number of bits transmitted using some encoding

scheme

• May be fractions of bit (see later)

– Sequence dictated by spreading code

Frequency Hopping Example:

Frequency Hopping Spread Spectrum System (Transmitter):


Frequency Hopping Spread Spectrum System (Receiver):

Slow and Fast FHSS:

• Frequency shifted every Tc seconds


• Duration of signal element is Ts seconds

• Slow FHSS has Tc ≥ Ts

• Fast FHSS has Tc < Ts

• Generally fast FHSS gives improved performance in noise

(or jamming)

Slow Frequency Hop Spread Spectrum Using MFSK (M=4,

k=2)

Fast Frequency Hop Spread Spectrum Using MFSK (M=4,

k=2)


FHSS Performance Considerations:

• Typically large number of frequencies used

– Improved resistance to jamming

Direct Sequence Spread Spectrum (DSSS):

• Each bit represented by multiple bits using spreading

code

• Spreading code spreads signal across wider frequency

band

– In proportion to number of bits used


– 10 bit spreading code spreads signal across 10

times bandwidth of 1 bit code

• One method:

– Combine input with spreading code using XOR

– Input bit 1 inverts spreading code bit

– Input zero bit doesn’t alter spreading code bit

– Data rate equal to original spreading code

• Performance similar to FHSS

Direct Sequence Spread Spectrum Example:

Direct Sequence Spread Spectrum Transmitter:


Direct Sequence Spread Spectrum Receiver:


Direct Sequence Spread Spectrum Using BPSK

Example:

Code Division Multiple Access (CDMA):

• Multiplexing Technique used with spread spectrum

• Start with data signal rate D

– Called bit data rate

• Break each bit into k chips according to fixed pattern specific

to each user

– User’s code

• New channel has chip data rate kD chips per second

• E.g. k=6, three users (A,B,C) communicating with base

receiver R

• Code for A = <1,-1,-1,1,-1,1>

• Code for B = <1,1,-1,-1,1,1>


• Code for C = <1,1,-1,1,1,-1>

CDMA Example:

• Consider A communicating with base

• Base knows A’s code

• Assume communication already synchronized

• A wants to send a 1

– Send chip pattern <1,-1,-1,1,-1,1>

• A’s code

• A wants to send 0

– Send chip[ pattern <-1,1,1,-1,1,-1>

• Complement of A’s code

• Decoder ignores other sources when using A’s code to

decode


– Orthogonal codes

CDMA for DSSS:

• n users each using different orthogonal PN sequence

• Modulate each users data stream

– Using BPSK

• Multiply by spreading code of user

CDMA in a DSSS Environment:

******************** ALL THE BEST ******************

EC2301-NOL.pdf

Documents

Transcript of EC2301-NOL.pdf