Digital Communication

Lecture 3
Last time we talked about:
 Transforming the information source to a form
compatible with a digital system
 Sampling
 Aliasing
 Quantization
 Uniform and non-uniform
 Baseband modulation

Binary pulse

modulation M-ary pulse
modulation
 M-PAM (M-ary
Pulse amplitude
modulation)

Lecture 3 2
 Formatting and transmission of baseband signal

Digital info. Bit stream Pulse waveforms

(Data bits) (baseband signals)
Textual Format
source info.
Pulse
Analog Sample Quantize Encode modulate
info.

Sampling at rate Encoding each q. value to

f s  1/ Ts l  log 2 L bits
(sampling (Data bit duration
time=Ts) Tb=Ts/l)
Quantizing each sampled Mapping every m  log 2 M data bits to a
value to one of the symbol out of M symbols and
L levels in quantizer. transmitting
a baseband waveform with duration T
 Information (data) rate: Rb  1/ [bits/sec]

Symbol rate : R  1/ T Tb

For real time transmission: Rb  mR
[symbols/sec] Lecture 3 3
 Quantization example
amplitude
x(t)
111 3.1867
110 2.2762
Quant. levels
101 1.3657
100 0.4552

011 -0.4552
boundaries
010 -1.3657

001 - x(nTs): sampled values

2.2762 xq(nTs): quantized values
000 -3.1867
Ts: sampling time
PCM t
codeword 110 110 111 110 100 010 011 100
011 PCM sequence
100
Lecture 3 4
Example of M-ary PAM

Assuming real time transmission and equal energy per

transmission data bit for binary-PAM and 4-ary PAM:
• 4-ary: T=2Tb and Binary: T=Tb

•
A 2

10B 2
Binary PAM 4-ary PAM
(rectangular pulse) (rectangular pulse)

3B

‘11’
‘1’ B

T ‘00’ T T

‘0’ ‘10’
-A. -3B

Lecture 3 5
Example of M-ary PAM …
0 Ts 2Ts

2.2762 V 1.3657 V
0 T 2T 3T 4Tb 5Tb 6Tb
b b
b

1 1 0 1 0
1

R =1/T =3/T
b b
s
R=1/T=1/T =3/T
b
0 T 2T 3T 4T 5T 6T s

R =1/T =3/T
b b
s
R=1/T=1/2T =3/2T =1.5/T
b
0 T 2T 3T
s
Lecture 3 s
6
Today we are going to talk about:
 Receiver structure

Demodulation (and sampling)

Detection
 First step for designing the receiver
 Matched filter receiver
 Correlator receiver

Lecture 3 7
 Demodulation and
detection
Format m Pulse g (t) Bandpass
i i si (t) M-ary modulation
modulate modulate
i  1,, M
channel
transmitted symbol hc (t)

estimated symbol n(t)

Format Detect
Demod.
m z(T & sample r(t)
ˆi )
 Major sources of errors:
 Thermal noise (AWGN)
 disturbs the signal in an additive fashion (Additive)
 has flat spectral density for all frequencies of interest

 (White) is modeled by Gaussian random process (Gaussian

 Noise)
Inter-Symbol Interference (ISI)
 Due to the filtering effect of transmitter, channel and
receiver, symbols are “smeared”.
Lecture 3 8
Example: Impact of the channel
Lecture 3

9
 Example: Channel impact …

hc (t)   (t)  0.5 (t 

0.75T )

Lecture 3 10
Receiver tasks
 Demodulation and sampling:
 Waveform recovery and preparing the received
signal for detection:
 Improving the signal power to the noise power
(SNR) using matched filter
 Reducing ISI using equalizer
 Sampling the recovered
waveform
 Detection:
 Estimate the transmitted symbol based on the
received sample

Lecture 3 11
 Receiver structure

Step 1 – waveform to sample transformation Step 2 – decision making

Demodulate & Sample Detect

Threshold m
r(t) Frequency Receiving Equalizing
down-conversion filter filter comparison ˆi

For bandpass signals Compensation for

channel induced ISI

Received waveform Baseband pulse

Baseband pulse Sample
(possibly distored)
(test statistic)

Lecture 3 12
Baseband and bandpass
 Bandpass model of detection process is
equivalent to baseband model because:
 The received bandpass waveform is first
transformed to a baseband waveform.

 Equivalence theorem:
 Performing bandpass linear signal processing followed
by heterodyning the signal to the baseband, yields the
same results as heterodyning the bandpass signal to the
baseband , followed by a baseband linear signal
processing.

Lecture 3 13
Steps in designing the
receiver
 Find optimum solution for receiver design with the
following goals:
1. Maximize SNR
2. Minimize ISI
 Steps in design:
 Model the received signal
 Find separate solutions for each of the
 goals.
First, we focus on designing a receiver which
maximizes the SNR.

Lecture 3 14
 Design the receiver filter to maximize the SNR

 Model the received signal

si (t) hc (t) r(t) r(t)  si (t)  h c (t)  n(t)

n(t)
AWGN
 Simplify the model:
 Received signal in AWGN

Ideal channels
si (t) r(t) r(t)  si (t) 
hc (t)   (t)
n(t)
n(t)
AWGN

Lecture 3 15
Matched filter receiver
 Problem:
 Design the receiver filter h(t ) such that the SNR is
maximized at the sampling time when si (t ), i  1,...,
M
is transmitted.
 Solution:
 The optimum filter, is the Matched filter, given by
h(t )  hopt (t )  s i * (T 
H ( f ) t )H opt ( f )  S i ( f ) exp( j 2
*

fT )
which is the time-reversed and delayed version of the
conjugate of the transmitted hsignal
(t)
si (t) h(t)  opt

0 T t 0 T t
Lecture 3 16
 Example of matched filter

h opt (
y(t)  si (t)  h opt
si (t) t) (t)
A2
A A
T T

T T 0 T 2T t

t t

h opt (
y(t)  si (t)  h opt
si (t t) (t)
A2
) A
A T
T
 T/2 T t 0 T/2 T 3T/2 2T t
  T/2 T t  A  A2
2
A T
T

Lecture 3 17
Properties of the matched filter
The Fourier transform of a matched filter output with the matched signal as input
is, except for a time delay factor, proportional to the ESD of the input signal.

Z ( f )  | S ( f ) |2 exp( j2
The output signal of afTmatched
) filter is proportional to a shifted version of the
autocorrelation function of the input signal to which the filter is matched.

z(t)  Rs (t  T )  z(T ) 
Rs (0)  Es
The output SNR of a matched filter depends only on the ratio of the signal energy
to the PSD of the white noise at the filter input.
Es
max 
S

Two matching conditions in 

 N T N / operation:
the matched-filtering
2 desired
spectral phase matching that gives the
0
output peak at time T.
spectral amplitude matching that gives optimum SNR to the peak value.

Lecture 3 18
Correlator receiver
 The matched filter output at the sampling time,
can be realized as the correlator output.

z(T ) hopt (T )  r(T

)
T
  r( )s*i( )d   r(t),
s(t) 
0

Lecture 3 19
Implementation of matched filter receiver
Bank of M matched filters

z1
(T )  z1
*
s1 (T 
r(t) t)  Matched filter output:
z Observation
 z
sM * (T  zM

t)
(T )
zM

zi  r(t)  s i (T  i  1,...,
M 
zt) (z1 (T ), z 2 (T ),..., z M (T ))  (z1 ,
z2 ,..., z M )

Lecture 3 20
Implementation of correlator receiver
Bank of M correlators
s  1 (t)
T
z1 )
 0 (T
 z1 Correlators output:
r(t)  z Observation
z
s  M (t)
T
 vector

 0 zM ( T

 
) z
 M
z  (z1 (T ), z 2 (T ),..., z M (T ))  (z1 ,
z2 ,..., z M ) 
T i  1,...,
zi   r(t)si M
(t)dt Lecture 3 21
 Implementation example of matched filter
receivers

s1 (t)
A
Bank of 2 matched filters
T

0 T t A z1
T
(T ) 
0 T
s (t) z1 

0 T 
0 T t
 
AT AT

Lecture 3 22