EE5713 : Advanced Digital Communications

Digital Communications - Overview

Lecturer: Assoc. Prof. Dr Noor M Khan

Department of Electronic Engineering,
Muhammad Ali Jinnah University,
Islamabad Campus, Islamabad, PAKISTAN
Ph: +92 (51) 111-878787, Ext. 129
Email: noor@ieee.org, noormkhan@jinnah.edu.pk

1
 Week 1
 This Lecture would be covered on Board and the
following concepts would be delivered:
 Thermal Noise / AWGN
 Signal to Noise Ratio (SNR)
 Channel Bandwidth and Data Rate
 Fourier Transformation and Time/Frequency Domains
 Basic Diagram of A Communication System
 Modulation
 Baseband and Bandpass Modulation
Advanced Digital Communications -Spring-2011-Week-1-2 2
 EE 4723: Digital Communications II
 Instructor: Dr. Noor Muhammad Khan
 Text book
– Bernard Sklar, Digital Communications: Fundamentals
and Applications, Prentice Hall, 2nded, 2001.
 References/Additional readings:
– J. G. Proakis, Digital Communications, 2001
– T. S. Rappaport, Wireless Communications: Principles and Practice,
Prentice Hall, 1999
– Marvin Kenneth Simon, Mohamed-Slim Alouini, Digital Communication
over Fading Channels, John Wiley & Sons, 2004
– Lecture slides, Handouts uploaded on the class folder.

2/25/2013 Muhammad Ali Jinnah University, Islamabad Digital Communications EE3723 3

 Grading Policy
 Midterm: 20%
 1st Major Quiz: 15%
 2nd Major Quiz: 15%
 Project/Assignments: 10%
 Final: 40%

2/25/2013 Muhammad Ali Jinnah University, Islamabad Digital Communications EE3723 4

 Communication System
 Main purpose of communication is to transfer
information from a source to a recipient via a channel or
medium.
 Basic block diagram of a communication system:

Source Transmitter Channel Receiver Recipient

2/25/2013 Muhammad Ali Jinnah University, Islamabad Digital Communications EE3723 5

 Analog and digital communication systems
 Communication system converts information into
electrical electromagnetic/optical signals appropriate for
the transmission medium.
 Analog systems convert analog message into signals that
can propagate through the channel.
 Digital systems convert bits (digits, symbols) into signals
– Computers naturally generate information as
characters/bits
– Most information can be converted into bits
– Analog signals converted to bits by sampling and
quantizing (A/D conversion)
2/25/2013 Muhammad Ali Jinnah University, Islamabad Digital Communications EE3723 6
 Why digital communication?
 Digital techniques need to distinguish between discrete
symbols allowing regeneration versus amplification
 Good processing techniques are available for digital
signals, such as medium.
– Data compression (or source coding)
– Error Correction (or channel coding)
– Equalization
– Security
 Easy to mix signals and data using digital techniques

2/25/2013 Muhammad Ali Jinnah University, Islamabad Digital Communications EE3723 7

 Digital vs Analog
 Advantages of digital communications:
– Regenerator receiver

Original Regenerated
pulse pulse

Propagation distance

Different kinds of digital signal are treated identically.

Voice
Data A bit is a bit!
Media

2006-01-24 Lecture 1 8
 Analog communication system example

Message signals Modulated signals

2/25/2013 Muhammad Ali Jinnah University, Islamabad Digital Communications EE3723 9

 Digital Communication: Transmitter

2/25/2013 Muhammad Ali Jinnah University, Islamabad Digital Communications EE3723 10

 Digital Communication: Receiver

2/25/2013 Muhammad Ali Jinnah University, Islamabad Digital Communications EE3723 11

 Digital communications: Main Points
 Transmitters modulate analog messages or bits in case of
a DCS for transmission over a channel.
 Receivers recreate signals or bits from received signal
(mitigate channel effects)
 Performance metric for analog systems is fidelity, for
digital it is the bit rate and error probability.

2/25/2013 Muhammad Ali Jinnah University, Islamabad Digital Communications EE3723 12

 Performance Metrics
 Analog Communication Systems
ˆ (t )  m(t )
– Metric is fidelity: want m
– SNR typically used as performance metric
 Digital Communication Systems
– Metrics are data rate (R bps) and probability of bit error
Pb  p(bˆ  b)
– Symbols already known at the receiver
– Without noise/distortion/sync. problem, we will never
make bit errors

2/25/2013 Muhammad Ali Jinnah University, Islamabad Digital Communications EE3723 13

 Digital communication blocks

2/25/2013 Muhammad Ali Jinnah University, Islamabad Digital Communications EE3723 14

 Processes Involved

2/25/2013 Muhammad Ali Jinnah University, Islamabad Digital Communications EE3723 15

EE5713 : Advanced Digital Communications

Week 2-3: Digital Communications - Overview

Detection
Matched Filter and Correlator Filter
Error Probability
Signal Space
Orthogonal Signal Space

Advanced Digital Communications -Spring-2011-Week-1-2 16

 Detection
 Matched filter reduces the received signal to a single variable
z(T), after which the detection of symbol is carried out
 The concept of maximum likelihood detector is based on
Statistical Decision Theory
 It allows us to
– formulate the decision rule that operates on the data
– optimize the detection criterion

H1

z(T ) 

0
H2

Advanced Digital Communications -Spring-2011-Week-1-2 17

Detection of Binary Signal in Gaussian Noise

The output of the filtered sampled at T is a Gaussian random process

Advanced Digital Communications -Spring-2011-Week-1-2 18

 Baye’s Decision Criterion and Maximum
Likelihood Detector
 Hence
H1
 (a1  a2 )
z  0
 2
H2
where z is the minimum error criterion and  0 is optimum
threshold
 For antipodal signal, s1(t) = - s2 (t)  a1 = - a2
H1

z 0

H2
Advanced Digital Communications -Spring-2011-Week-1-2 19
 Probability of Error
 Error will occur if
– s1 is sent  s2 is received
P( H 2 | s1 )  P(e | s1 )
0
P(e | s1 )   p( z | s1 ) dz


– s2 is sent  s1 is received
P( H1 | s2 )  P(e | s2 )

P(e | s2 )   p( z | s2 ) dz
0

 The total probability of error is the sum of the errors

2
PB   P(e, si )  P(e | s1 ) P( s1 )  P(e | s2 ) P( s2 )
i 1

 P( H 2 | s1 ) P( s1 )  P( H1 | s2 ) P( s2 )

Advanced Digital Communications -Spring-2011-Week-1-2 20

 If signals are equally probable
PB  P( H 2 | s1 ) P( s1 )  P( H1 | s2 ) P( s2 )
1
  P( H 2 | s1 )  P( H1 | s2 ) 
2
1
PB   P( H 2 | s1 )  P( H1 | s2 ) 
by Symmetry
P( H1 | s2 )
2
 Numerically, PB is the area under the tail of either of the
conditional distributions p(z|s1) or p(z|s2) and is given by:
 
PB   0
P ( H1 | s2 )dz   0
p ( z | s2 )dz

 1  1  z  a2  
2

 exp      dz
0 
0 2  2   0  

Advanced Digital Communications -Spring-2011-Week-1-2 21

  1  1 z  a2 
 
2

PB   exp      dz
0
 0 2  2   0  
( z  a2 )
 u
0
 1  u2 
 
( a1  a2 )
2 0 2
exp    du
 2
 The above equation cannot be evaluated in closed form (Q-
function)
 Hence,  a1  a2 
PB  Q    equation B.18
 2 0 
1  z2 
Q( z )  exp   
z 2  2
Advanced Digital Communications -Spring-2011-Week-1-2 22
 Error probability for binary signals
 Recall:  a1  a0 
PB  Q   equation B.18
 2 0 
 Where we have replaced a2 by a0.

 To minimize PB, we need to maximize:

a1  a0 or (a1  a0 ) 2

0  20
 We have (a1  a0 )2 Ed 2 Ed
 
 20 N0 / 2 N0
 Therefore, a1  a0 1 (a1  a0 ) 2 1 2 Ed Ed
  
2 0 2  0
2
2 N0 2 N0
Advanced Digital Communications -Spring-2011-Week-1-2 23
Table for computing of Q-Functions

Advanced Digital Communications -Spring-2011-Week-1-2 24

 Signals vs vectors
 Representation of a vector by basis vectors
 Orthogonality of vectors
 Orthogonality of signals

Advanced Digital Communications -Spring-2011-Week-1-2 25

 Signal space
 What is a signal space?
– Vector representations of signals in an N-dimensional orthogonal
space
 Why do we need a signal space?
– It is a means to convert signals to vectors and vice versa.
– It is a means to calculate signals energy and Euclidean distances
between signals.
 Why are we interested in Euclidean distances between signals?
– For detection purposes: The received signal is transformed to a
received vectors. The signal which has the minimum distance to the
received signal is estimated as the transmitted signal.

Advanced Digital Communications -Spring-2011-Week-1-2 26

 Orthogonal signal space

 N-dimensional orthogonal signal space is characterized by N


linearly independent functions j (t )N
j 1
called basis functions.
The basis functions must satisfy the orthogonality condition

  j,0i  t1,...,
T
T
 i j( 
*
(
it),
(
jt) (t
) t
)dt
Ki ji
0
N

where
1
 ij
ij
0
 ij

 If all Ki= 1, the signal space is orthonormal.

Advanced Digital Communications -Spring-2011-Week-1-2 27

 Example of an orthonormal bases
• Example: 2-dimensional orthonormal signal space
 2  2 (t )
1(t)  2t /T)
cos( 0t T
 T

 (t)  2
2t /T)
sin( 0t T


2
T  1 (t )
T
0
1(t),2(t) 1(t)2(t)dt0
0

1(t)  2(t) 1

• Example: 1-dimensional orthonornal signal space

 1 (t )
1 1(t) 1
T
 1 (t )
0 T t 0

Advanced Digital Communications -Spring-2011-Week-1-2 28

 Signal space …
 Any arbitrary finite set of waveforms si (t )iM1
where each member of the set is of duration T, can be expressed
as a linear combination of N orthonogal waveforms
where . j (t)Nj 1
NM
N
si(t)aj(t)
ij
i 1,...,M
j
1 NM

 K
j 1,...,N
T
where a 1 1 *

ij s
(
it),
K
j
(
jt
) s
(
it)(
jt)
dt 0  t T
j0
i 1,...,M
N

i 
2
i
s (a,a
i1 i2,...,
a )
iN E Kj aij
j
1
Vector representation of waveform Waveform energy (Parseval’s theorem)
Advanced Digital Communications -Spring-2011-Week-1-2 29
 Signal space …
T N
si(t) j(t)
1
aij    *
si (t ) j (t ) dt a
ij
Kj 0 j
1
Waveform to vector conversion Vector to waveform conversion

 1 (t )  1 (t )
T ai1

ai1
 a i1   a i1 
  
0 sm
si (t )     sm
si (t )
 N (t )      N (t )
T  a iN   a iN 
 0 aiN aiN

s m  (ai1 , ai 2 ,..., aiN )

Advanced Digital Communications -Spring-2011-Week-1-2 30

Example: Baseband Antipodal Signals

Advanced Digital Communications -Spring-2011-Week-1-2 31

 Example: BPSK

Advanced Digital Communications -Spring-2011-Week-1-2 32

 Example QPSK

Advanced Digital Communications -Spring-2011-Week-1-2 33

Synthesis Equation = Modulation

Advanced Digital Communications -Spring-2011-Week-1-2 34

Example: Baseband Antipodal Signals

Advanced Digital Communications -Spring-2011-Week-1-2 35

 Example: BPSK

Advanced Digital Communications -Spring-2011-Week-1-2 36

 Correlation
 Measure of similarity between two signals

1
cn 
Eg Ez  g (t ) z(t )dt.


 Cross correlation

 gz ( )   g (t ) z (t   )dt.


 Autocorrelation

 g ( )   g (t ) g (t   )dt.


Advanced Digital Communications -Spring-2011-Week-1-2 37

Analysis Equation = Detection

Advanced Digital Communications -Spring-2011-Week-1-2 38

Correlation Detector

Advanced Digital Communications -Spring-2011-Week-1-2 39

Correlation Detector: Examples

Advanced Digital Communications -Spring-2011-Week-1-2 40

Correlation Detector Example: QPSK

Advanced Digital Communications -Spring-2011-Week-1-2 41

 The probability of bit error is given by:
 Ed 
PB  Q 
 (3.63)
 2N0 

Ed   s1 (t )  s0 (t ) dt
T 2

  s1 (t ) dt   s0 (t ) dt  2 s1 (t ) s0 (t )

T 2 T 2 T

0 0 0

Advanced Digital Communications -Spring-2011-Week-1-2 42

 The probability of bit error for antipodal signals:

 2 Eb 
PB  Q 

 N0 
 The probability of bit error for orthogonal signals:

 Eb 
PB  Q 

 N 0 

 The probability of bit error for unipolar signals:

 Eb 
PB  Q 

 2N 0 

Advanced Digital Communications -Spring-2011-Week-1-2 43

 Bipolar signals require a factor of 2 increase in energy compared to
orthogonal signals
 Since 10log102 = 3 dB, we say that bipolar signaling offers a 3 dB better
performance than orthogonal

Advanced Digital Communications -Spring-2011-Week-1-2 44

 Comparing BER Performance

For Eb / N 0  10dB
PB ,orthogonal  9.2x10  2
PB ,antipodal  7.8x10  4

 For the same received signal to noise ratio, antipodal provides

lower bit error rate than orthogonal

Advanced Digital Communications -Spring-2011-Week-1-2 45

 Relation Between SNR (S/N) and Eb/N0
 In analog communication the figure of merit used is the
average signal power to average noise power ration or SNR.
 In the previous few slides we have used the term Eb/N0 in the
bit error calculations. How are the two related?
 Eb can be written as STb and N0 is N/W. So we have:

Eb STb S W  N0
    where  
2

N0 N / W N  Rb  2
 Thus Eb/N0 can be thought of as normalized SNR.
 Makes more sense when we have multi-level signaling.
 Reading: Page 117 and 118.

Advanced Digital Communications -Spring-2011-Week-1-2 46