You are on page 1of 56

Dr.

Uri Mahlab 1
Communication system

Information Transmitter
Transmitter Receiver
Receiver
Channel Decision
source

Dr. Uri Mahlab 2


Block diagram of an Binary/M-ary signaling
scheme
Timing

X(t(
HT(f) XT(t( Hc(f)
Information Pulse Trans
channel
source generator filter
+
Channel noise
n(t) +
Y(t) Receiver
Output A/D filter

HR(f)
Clock
recovery
network

Dr. Uri Mahlab 3


Block diagram Description
pg (t)
{dk}={1,1,1,1,0,0,1,1,0,0,0,1,1,1} Tb

Tb Timing
X(t( HT(f) XT(t(
Information Pulse Trans
source generator filter

pg (t)

 a if d k "1";
For bk=1 Tb
ak  
 a if d k "0";
For bk=0 Tb

Dr. Uri Mahlab 4


Block diagram Description (Continue - 1)

{dk}={1,1,1,1,0,0,1,1,0,0,0,1,1,1}

Tb Timing
X(t( HT(f) XT(t(
Information Pulse Trans
source generator filter

pg (t) pg (t )
For bk=1 Tb Tb
Transmitter
For bk=0 Tb filter Tb

Dr. Uri Mahlab 5


Block diagram Description (Continue - 2)

{dk}={1,1,1,1,0,0,1,1,0,0,0,1,1,1}

Tb Timing
X(t( HT(f) XT(t(
Information Pulse Trans
source generator filter

100110 
X (t )  a
k  
k p g (t  kTb )

Tb 2Tb 5Tb 6Tb


3Tb 4Tb t
Dr. Uri Mahlab 6
Block diagram Description (Continue - 3)

a
{dk}={1,1,1,1,0,0,1,1,0,0,0,1,1,1}
X (t )  k p g (t  kTb )
k  
Tb Timing
X(t( HT(f) XT(t(
Information Pulse Trans
100110 source generator filter

Tb 2Tb 5Tb 6Tb


3Tb 4Tb t

Tb 2Tb 5Tb 6Tb


3Tb 4Tb
t
Dr. Uri Mahlab 7
Block diagram Description (Continue - 4)
Timing
X(t( HT(f) HR(f)
Information Pulse Trans
source generator filter
+ Receiver
filter
Channel noise n(t)

Tb 2Tb 5Tb 6Tb


3Tb 4Tb
t

Tb 2Tb 5Tb 6Tb


3Tb 4Tb t

Dr. Uri Mahlab 8


Block diagram Description (Continue - 5)

Tb 2Tb 5Tb 6Tb


3Tb 4Tb
t

Tb 2Tb 5Tb 6Tb


3Tb 4Tb t

Y (t )   Ak pr (t  t d  kTb )  n0 (t )
k

Dr. Uri Mahlab 9


Block diagram of an Binary/M-ary signaling
scheme
Timing

X(T(
HT(f) Hc(f)
Xt(T(
Information Pulse Trans
channel
source generator filter
+
Channel noise
n(t) +
Y(t) Receiver
Output A/D filter

HR(f)
Clock
recovery
network

Y (t )  Dr.AUrik pMahlab
r (t  t d  kTb )  n0 (t )10
k
Block diagram Description

Tb 2Tb 5Tb 6Tb


3Tb 4Tb
t

Tb 2Tb 5Tb 6Tb


3Tb 4Tb t

t
1 0 0 0 1 0
1 0 0 1 1 0
Dr. Uri Mahlab 11
Block diagram of an Binary/M-ary signaling
scheme
Timing

X(t(
HT(f) XT(t( Hc(f)
Information Pulse Trans
channel
source generator filter
+
Channel noise
n(t) +
Y(t) Receiver
Output A/D filter

HR(f)
Clock
recovery
network

Dr. Uri Mahlab 12


Explanation of Pr(t)

Pg(t) HT(f) Hc(f) HR(f)


Pr(t)
Trans Receiver
channel
filter filter

Y (t )   Ak pr (t  t d  kTb )  n0 (t )
k

Pg(f) HT(f) Hc(f) HR(f) Pr(f)


Dr. Uri Mahlab
p r ( 0)  1 13
The output of the pulse generator X(t),is given by

X t   a p t  k T 
k  
k g b

Pg(t) is the basic pulse whose amplitude ak depends on


.the kth input bit

Dr. Uri Mahlab 14


The input to the A/D converter is

Y (t )   Ak pr (t  t d  kTb )  n0 (t )
k

For tm =mTb+td and td is the total time delay in the


system, we get.

Y t m 
t
t2 t3
t1 tm t
Dr. Uri Mahlab 15
The output of the A/D converter at the sampling time

tm =mTb+td

Y (t )   Ak pr (t  t d  kTb )  n0 (t )
k

Y t m   Am   A p  m  k  T   n  t 
Km
k r b 0 m

Tb 2Tb 5Tb 6Tb


Y t m  3Tb 4Tb t
t2 t3
t1 Dr. Uri Mahlab tm t
16
Y t m   Am   A p  m  k  T   n  t 
Km
k r b 0 m

ISI - Inter Symbol


Interference

Y t m 

t2 t3
t1 Dr. Uri Mahlab tm t
17
Explanation of ISI
Pg(t) HT(f) Hc(f) HR(f)
Pr(t)
Trans Receiver
channel
filter filter

t
t
Fourier
Fourier BandPass Transform
Transform Filter

f f

HT(f) Hc(f) HR(f)


Pg(f) Trans Receiver
Pr(f)
channel
filter Dr. Uri Mahlab filter 18
Explanation of ISI - Continue
t
t
Fourier
Fourier BandPass Transform
Transform Filter

f f

Tb 2Tb 5Tb 6Tb


3Tb 4Tb t

Dr. Uri Mahlab 19


-The pulse generator output is a pulse waveform

X (t )  a
k  
k p g (t  kTb )

p g (0)  1

a If kth input bit is 1


ak  
 a if kth input bit is 0
-The A/D converter input Y(t)

Y (t )   Ak pr (t  t d  kTb )  n0 (t )
k Dr. Uri Mahlab 20
T y p e o f Im p o rta n t P a ra m e te rs In v o l v e d In T h e D e s ig n
O f a P A M S y s te m

D a ta E rro r T ra n s m i t te d N o is e N o is e S y s te m
ra te ra te power power S p e c tra l c o m p le x it y
d e n s it y

Dr. Uri Mahlab 21


5.2 BASEBAND BINARY PAM SYSTEMS

D e s ig n o f a b a s e b a n d
b in a r y P A M s y s t e m

P u ls e s h a p e s p r( t ) H R (f) H T(t)
p g(t)

- minimize the combined effects of inter symbol


interference and noise in order to achieve minimum
probability of error for given data rate.
Dr. Uri Mahlab 22
5.2.1 Baseband pulse shaping
The ISI can be eliminated by proper choice
of received pulse shape pr (t).

1 for n  0 
p r ( nTb )   
0 for n  0
Doe’s not Uniquely Specify Pr(t) for all
values of t.

Dr. Uri Mahlab 23


To meet the constraint, Fourier Transform Pr(f) of Pr(t), should
satisfy a simple condition given by the following theorem
Theorem

k
if 
k  
Pr (f 
Tb
)  Tb for f  1 / 2Tb

1 for n  0
Then p r ( nTb )  
0 for n  0

Proof

p r (t)  p

r (f ) exp( j2ft )df

( 2 k 1) / 2 Tb

p r ( t )  k  

Dr.
(2k
p
1)Uri
r (f ) exp( j2ft )df
/ 2Mahlab
Tb 24
( 2 k 1) / 2Tb

pr ( nTb )   k
p r ( f ) exp( j 2fnTb t ) df
( 2 k 1) / 2Tb

1 / 2 Tb
k
p r ( nTb )   k  p r (f '
Tb
) exp( j2f ' nTb )df '
1 / 2 Tb
1 / 2 Tb
k
p r ( nTb )   (  k p r (f  )) exp( j2fnTb )df
1 / 2 Tb
Tb
1 / 2 Tb
sin( n)
p r ( nTb )   Tb exp( j2fnTb )df 
1 / 2 Tb
n

Which verify that the Pr(t) with a transform Pr(f)


Satisfy ZERO ISI
Dr. Uri Mahlab 25
The condition for removal of ISI given in the theorem is called
Nyquist (Pulse Shaping) Criterion

Y( t m )  A m   A k Pr ((m  k )Tb )  n 0 ( t m )
km

1 for n  0 
p r ( nTb )   
0 for n  0
1
sin( n)
p r ( nTb ) 
n
-2Tb -Tb Tb 2Tb

Dr. Uri Mahlab 26


The Theorem gives a condition for the removal of ISI using a Pr(f) with
a bandwidth larger then rb/2/.
ISI can’t be removed if the bandwidth of Pr(f) is less then rb/2.

Pg(f) HT(f) Hc(f) HR(f)


Pr(f)
Tb 2Tb 5Tb 6Tb
3Tb 4Tb t

Dr. Uri Mahlab 27


Particular choice of Pr(t) for a
given application

p r( t )

R a te o f d e c a y S h a p i n g f i lt e r s
o f p r( t )

The smallest values near Tb, 2Tb, … Shape of Pr(f) determines the ease
In such that timing error (Jitter) with which shaping filters can be
will not Cause large ISI realized.
Dr. Uri Mahlab 28
A Pr(f) with a smooth roll - off characteristics is preferable
over one with arbitrarily sharp cut off characteristics.

Pr(f) Pr(f)

Dr. Uri Mahlab 29


In practical systems where the bandwidth available for
transmitting data at a rate of rb bits\sec is between rb\2 to rb
Hz, a class of pr(t) with a raised cosine frequency
characteristic is most commonly used.
A raise Cosine Frequency spectrum consist of a flat amplitude portion and a roll off
portion that has a sinusoidal form.

Tb , f  rb / 2  

 2  rb rb rb
Pr (f )  Tb cos ( f   ),    f  
 4 2 2 2
0, f  rb / 2  

FT 1  Pr (f ) 
cos 2t  sin rb t 
 Pr ( t )   
1  ( 4 t ) 2  rb t 
Dr. Uri Mahlab 30
raised cosine frequency characteristic

Dr. Uri Mahlab 31


Summary
The BW occupied by the pulse spectrum is B=rb/2+.
The minimum value of B is rb/2 and the maximum value is rb.

Larger values of  imply that more bandwidth is required for a


given bit rate, however it lead for faster decaying pulses, which
means that synchronization will be less critical and will not cause
large ISI.

 =rb/2 leads to a pulse shape with two convenient properties.


The half amplitude pulse width is equal to Tb, and there are zero
crossings at t=3/2Tb, 5/2Tb…. In addition to the zero crossing
at Tb, 2Tb, 3Tb,…...
Dr. Uri Mahlab 32
5.2.2

Optimum transmitting and receiving


filters
The transmitting and receiving filters are chosen to provide
a proper

H T ,H R

p u ls e s h a p i n g n o is e im m u n ity

Dr. Uri Mahlab 33


-One of design constraints that we have for selecting the filters
is the relationship between the Fourier transform of pr(t) and
pg(t).

p g ( f ) H T ( f ) H R ( f )  K c Pr ( f ) exp(2 j 2ftd )
Where td, is the time delay Kc normalizing constant.

In order to design optimum filter Ht(f) & Hr(f), we will assume that Pr(f),
Hc(f) and Pg(f) are known.
Portion of a baseband PAM system

Dr. Uri Mahlab 34


Pg(f) HT(f) Hc(f) HR(f)
Pr(f)
If we choose Pr(t) {Pr(f)} to produce Zero ISI we are left
only to be concerned with noise immunity, that is will choose

 H T (f ) and  H R (f )  minimum of noise effects

Dr. Uri Mahlab 35


Noise Immunity
Problem definition:

For a given :
•Data Rate - rb
•Transmission power - ST
•Noise power Spectral Density - Gn(f)
•Channel transfer function - Hc(f)
•Raised cosine pulse - Pr(f)
Choose
 H T (f ) and  H R (f )  minimum of noise effects
Dr. Uri Mahlab 36
Error probability Calculations
At the m-th sampling time the input to the A/D is:

Y( t m )  A m   A k Pr ((m  k )Tb )  n 0 ( t m )
km

"1" if Y( t m )  0
We decide:
"0" if Y( t m )  0

Perror  Pr ob Y( t m )  0 "0" was sent   Pr ob To sent "0"  


Pr ob Y( t m )  0 "1" was sent   Pr ob To sent "1" 

Dr. Uri Mahlab 37


Y( t m )   A  n0 ( t m ) if "1"
Y( t m )  A  n0 ( t m ) if "0"
A=aKc

 Pr ob To sent "0"   Pr ob To sent "1"   0.5


1
Perror   Pr ob n 0 ( t m )   A   Pr ob n 0 ( t m )  A 
2
The noise is assumed to be zero mean Gaussian at the receiver input
then the output should also be Zero mean Gaussian with variance No
given by:

N 0   G n (f ) H R (f ) df
2


Dr. Uri Mahlab 38
1 e  n  2 / 2 N0  1 e  n A )  2 / 2 N0 
2N 0 2N 0

y(tm)
0 A

Perror  Pr ob n  b  
1
e   z )  2 / 2 N 0 
dz
b 2N 0

b
Dr. Uri Mahlab 39
1 e  y( t m ) A )  2 / 2 N0  1 e  y ( t m )A )  2 / 2 N 0 
2N 0 2N 0

y(tm)
-A A
Perror  Pr ob Y( t m )  0 Pr ob Y( t m )  0

y(tm)
0
Dr. Uri Mahlab 40
1 e  y( t m ) A )  2 / 2 N0  1 e  y ( t m )A )  2 / 2 N 0 
2N 0 2N 0

y(tm)
-A A

VTransmit
Vreceived
Dr. Uri Mahlab 41

Pe  1 / 2 
1

exp  x / 2 N 0 dx 
2

x A 2N 0


1

exp  x / 2 N 0 dx
2
 zx / N0

A 2N 0

 
Pe  
1

exp  z 2 / 2 dz Q
A
 N 

A / N0 2  0 


Q u   
1

exp  z 2 / 2 dz 
u 2
Dr. Uri Mahlab 42
Q(u)

Q u   
1
 
exp  z 2 / 2 dz
u 2

 dz=
u
U


 A 
Pe  
1

exp  z / 2 dz Q
2
 N 

A / N0 2  0 


Q u   
1

exp  z / 2 dz
2

u 2
Dr. Uri Mahlab 43
A
 Signal to Noise Ratio
N0

Perror decreases asA / N 0 increase


Hence we need to maximize the signal
to noise Ratio

Thus for maximum noise immunity the filter transfer functions HT(f)
and HR(f) must be xhosen to maximize the SNR

Dr. Uri Mahlab 44


Optimum filters design calculations

We will express the SNR in terms of HT(f) and HR(f)

We will start with the signal:



X (t )  a
k  
k p g (t  kTb )

2 2

G X (f ) 
p g (f )
Tb
 
E ak
2
a p g (f )
Tb

The psd of the transmitted signal is given by::


2
G X ( f )  H T (f )  G X ( f )

Dr. Uri Mahlab 45


And the average transmitted power ST is

a2 2
 P (f )
2
ST  g  H T (f ) df A k K ca k 
Tb  A K ca


A2 2

2
 ST  2
Pg (f )  H T (f ) df
K c Tb 

2
ST K c Tb
A2  
2
 P (f )
2
g  H T (f ) df


The average output noise power of n0(t) is given by:

G
2
No  n (f ) H R (f ) df

Dr. Uri Mahlab 46
The SNR we need to maximize is

A2 ST Tb

No   
Pr (f )
2

  G n (f ) H R (f ) df  
2
2
df 
    H c (f ) H R (f ) 
where Pr (f )  H c (f )H R (f )H T (f )
Or we need to minimize

  
Pr (f )
2
 
min   G n (f ) H R (f ) df  
2
2
df    min  2
 
   H c (f ) H R ( f )  
Dr. Uri Mahlab 47
Using Schwartz’s inequality
   2

   V(f ) W (f )df
2 2
V (f ) df  W (f ) df 
  

The minimum of the left side equaity is reached when


V(f)=const*W(f)
If we choose :
1/ 2
V (f )  H R (f ) G n (f )
Pr (f )
W (f ) 
H R (f ) H c (f )

Dr. Uri Mahlab 48


 2 is minimized when
2 K Pr (f )
H R (f )  1/ 2
H c (f ) G n (f )
2 1/ 2
2 K c Pr (f ) G n (f )
H T (f )  2
K H c (f ) Pg (f )
K  an arbitrary positive constant

The filter should have alinear phase response in a total time delay of td

Dr. Uri Mahlab 49


Finally we obtain the maximum value of the SNR to be:

 A2  ST Tb
   2
 N o  max  Pr (f ) G n (f ) 
 1 / 2

 df 
 H c (f ) 

  A 2  
Perror  Q  
 N 
 o  max 

Dr. Uri Mahlab 50


For AWGN with G n (f )   / 2
and
pg(f) is chosen such that it does not change much over the
bandwidth of interest we get.
2 p r (f )
H R (f )  K1
H c (f )
2 p r (f )
H T (f )  K2
H c (f )
Rectangular pulse can be used at the input of HT(f).

1 for t   / 2;   Tb
pg (t)  
0 elsewhere
Dr. Uri Mahlab 51
5.2.3 Design procedure and Example

The steps involved in the design procedure.


Example:Design a binary baseband PAM system to
transmit data at a a bit rate of 3600 bits/sec with a bit
error probability less than 10 4.
The channel response is given by:
102 for f  2400
Hc ( f )  
0 _ elewhere

The noise spectral density is Gn ( f )  10 14 watt / Hz


Dr. Uri Mahlab 52
Solution:
rb  3600bits / sec
pe  10  4
B  2400 Hz
Gn ( f )  10  4 watt / Hz

If we choose a braised cosine pulse spectrum with


  rb / 6  600
 1
 3600 , f 1200

pr ( f )   1 
cos 2 ( f  1200),1200  f  2400
 3600 2400

 0, f  2400
Dr. Uri Mahlab 53
We choose a pg(t)
1, t 1200
p g (t )  
0, elsewhere;  Tb / 10  (0.28)(10 4 )
sin f
pg ( f )   ( )
f
p g (0)   , p g (2400)  0.973  

1/ 2
H T ( f )  K1 p r ( f )
1/ 2
H R ( f )  Pr ( f )
We choose K1  (3600)(103 )

Dr. Uri Mahlab 54
p g ( f ) H T ( f ) H c ( f ) H R ( f )  pr ( f )
Plots of Pg(f),Hc(f),HT(f),HR(f),and Pr(f).

Dr. Uri Mahlab 55


4
P
To maintain a e  10
( A2 / N 0 ) max
Q( ( A2 / N 0) max  10 4
( A2 / N 0 ) max  3.75
( A2 / N 0 ) max  14.06

2 2
1 A  Pr ( f ) G ( f ) 
2  1/ 2
 1014    
ST  ( ) max   n
df   (3600)(14.06)  4    Pr ( f )df 
Tb N 0   Hc ( f )   10    

For Pr(f) with raised cosine shape  P ( f ) df

r 1

And hence ST  (14.06)(3600)(10 10 )  23dBm


Dr. Uri Mahlab 56
Which completes the design.

You might also like