Digital communication

H V KUMARASWAMY
 Course: Digital Communication
(EC61)
Course instructors:
1. Mr. H. V.KumaraSwamy, RVCE,Bangalore
2. Mr. P.Nagaraju, RVCE, Bangalore
3. Ms. M.N.Suma, BMSCE, Bangalore
 Digital Communication
TEXT BOOK:
Digital Communications
Author: Simon Haykin
Pub: John Wiley Student Edition,
2003
 Reference Books
1. “Digital and Analog Communication
Systems” – K. Sam Shanmugam,
John Wiley, 1996.
2. “An Introduction to Analog and Digital
Communication”- Simon Haykin,
John Wiley, 2003.
 Digital Communication- Topics

• Chapter 1: Introduction
• Chapter 2: Sampling Process
• Chapter 3: Waveform Coding Techniques
• Chapter 4: Base-band shaping
 Digital Communication- Topics

• Chapter 5: Digital Modulation Techniques

• Chapter 6: Detection and Estimation
• Chapter 7: Spread Spectrum Modulation.
 Communication System

The purpose of a Communication

System is to transport an information
bearing signal from a source to a
user destination via a communication
channel.
 MODEL OF A
COMMUNICATION SYSTEM
 Basic Blocks

1. Transmitter
2. Channel
3. Receiver
 Communication

Types of Communication:
1. Analog Communication
2. Digital Communication
DCS - Block diagram
Digital Communication- Blocks
• Information Source
• Source Encoder and Decoder
• Channel Encoder and Decoder
• Modulator and Demodulator
• Channel
Block diagram with additional blocks
 Additional Blocks
• Encryptor
• Decryptor
• Multiplexer
• Demultiplexer.
Digital Communication- Advantages
• Less Distortion, Low noise &
interference.
• Regenerative Repeaters can be used.
• Digital Circuits are more reliable.
• Hardware implementation is more
flexible.
Digital Communication- Advantages
• Secrecy of information.
• Low probability of error due to error
detection and error correction.
• Multiplexing- ( TDM )
• Signal Jamming is avoided.
 Digital Communication-
Disadvantages
• Large Bandwidth
• Synchronization
Channels for Digital Communication

Channel Characteristics:
• Bandwidth
• Power
• Linear or Non-linear
• External interference
 Types of Channels
1. Telephone Channels
2. Coaxial Cables
3. Optical fibers
4. Microwave radio
5. Satellite Channel
 1. Telephone Channels
• Provides voice grade Communication.
• Good for data communication over
long distances.
• Frequency range: 300Hz – 3400Hz.
• High SNR – about 30dB.
1. Telephone Channels contd..
• Flat amplitude response for voice
signals.
• For data & image transmissions
EQUALIZERS are used.
• Transmission rate = 16.8kb/s
 2. Coaxial Cable
• Single-wire conductor inside an outer
Conductor with dielectric between
them.
• Wide Bandwidth
• Low external Interference.
 2. Coaxial Cable contd..
• Closely spaced Repeaters are
required.
• Transmission rate = 274 Mb/s.
 3.Optical fibers
• Communication is by light rays.
• Fiber consists of Inner core and an
outer core called CLADDING.
• Refractive Index of Cladding is less.
 3.Optical fibers
• Larger Bandwidth.
• Immune to cross talk and EMI.
• More secure.
• Low cost.
• Date rate = Terra bits/sec.
 4. Microwave radio
• Transmitter & Receiver With antennas.
• Works on Line-of-sight principle.
• Point to Multipoint communication.
• Reliable & High Speed of
Transmission.
 4. Microwave Radio
• Operating Frequency - (1 – 30)GHz
• System Performance degrades due
to meteorological variations.
 5. Satellite Channel.
• Repeater in the sky.
• Placed in geo-stationary orbit.
• Long distance transmission.
• High Bandwidth.
 5. Satellite Channel

• Operates in microwave frequency.

• Uplink frequency is more than down
link frequency
Topics in this session:
– Geometric interpretation of signal
– Response of bank of correlators to
noisy input
– Detection of known signals in
noise
Geometric interpretation of
signal
Using N orthonormal basis functions we can represent
M signals as
N
S i (t )   S ij j (t ) 0 t  T i  1, 2 , ... .. , M
j 1

Coefficients are given by

T
S ij   S i (t ) j (t ) dt i  1 , 2 , . .. . . , M
0

j  1, 2 , . . . .. , N
  S i1 
S 
 i2 
 . 
Si    i  1, 2 , ..... , M
 . 
 . 
  The vector s is called signal vector

 S iN 
 i

Visualizing signal vectors as a set of M points in an N

dimensional Euclidean space, which is also called signal
space
The squared-length of any vector si is given by inner
product
N
 ( S i , S i )   S ij2
2
Si
j 1
Two vectors are orthogonal if their inner product is
zero
The energy of the signal is given by
T
E i   S i2 (t ) dt
0
T N N
Ei   [ Sij j (t )] [ Sikk (t )] dt
0 j 1 k 1

N N T
Ei   Sij Sik   j (t )k (t )dt
j 1 k 1 0
 N N T
Ei   Sij Sik   j (t )k (t )dt
j 1 k 1 0

N
Ei   Sij2
j 1
N
  ( Sij  S kj ) 2
2
Si  S k
j 1
T
  [ Si (t )  S k (t )]2 dt
0

Si  S k Is a Euclidean distance between vectors

 Response of bank of correlators
to noisy input
Received Signal X(t) is given by
X (t )  S i (t )  W (t ) 0t T
i 1,2,3......., M
W(t) is AWGN with Zero Mean and PSD N0/2
Output of each correlator
T
X j   X (t ) j (t )dt
o

 S ij  W j j  1,2,........N
First Component
T
S ij   S i (t ) j (t )dt
0

Second Component
T
W j   W (t ) j (t )dt
o

N
X ' (t )  X (t )   X j j (t )
j 1
 N
X'(t) = Si (t)+ W(t)-  (S
j=1
ij + Wj )φ j (t)

N
= W(t)-  W φ (t)
j=1
j j

= W'(t)

N
X(t) =  X jφ j (t) + X'(t)
j=1
N
=  X jφ j (t) + W'(t)
j=1
Mean and variance
m x j  E[ X j ]
 E[ Si j  W j ]
 Sij  E[W j ]
 Sij

 2 x j  Var [ X j ]
 E[( X j  Sij ) 2 ]
 E[W j2 ]
 T T

σ x j = E   W(t)φ j (t)dt
2
0 W(u)φ j (u)du 
0 
T T 
= E    φ j (t)φ j (u)W(t)W(u) dt du 
0 0 

TT
σ2 x j =   φ (t)φ (u)E[ W(t)W(u) ] dt du
0 0
j j

TT
=   φ (t)φ (u)R
0 0
j j w (t,u)dt du

Rw (t , u ) = autocrrelation function
 N0
Rw (t , u )   (t  u )
2

T T
N0
 xj    (t )  j (u ) (t  u ) dt du
2
j
2 0 0

N0 T 2

2 0  j (t ) dt

N0
 2x j  for all j
2
Cov[ X j X k ]  E[( X j  m x j )( X k  m x k )]
 E[( X j  Si j )( X k  S ik )]
 E[W jWk ]
T T

 E   W (t ) j (t ) dt  W (u ) k (u ) du 
0 0 
T T
  
0 0
j (t ) k (u ) R w (t , u ) dt du

T T
N0

2  
0 0
j (t ) k (u ) (t  u ) dt du

T
N
 0
2 
0
 j (t ) k (u ) dt

 0 jk
Detection of known signals in
noise

x(t )  S i (t )  w(t ) 0t T

i  1,2,3,.............., M

x  Si  w i  1,2,3,........., M
Detection of known signals in noise
Digital communication
H V KUMARASWAMY
Assistant Professor
Dept of Telecommunication & P G Studies
R V College of Engineering
Bangalore-59
 Topics to be covered
I Digital Carrier Modulation Schemes
• Optimum receiver for Binary Modulation
Schemes
• Binary ASK, PSK, FSK.
• Comparison of digital modulation schemes,
• M-ary signaling schemes
• Synchronization methods
Topics to be covered (cont.)
II Detection and Estimation
 Gram-Schmidt Orthogonalization
procedure.
 Geometric interpretation of signals.
 Response of bank of correlators to noisy
input.
 Detection of known signals in noise.
Topics to be covered (cont.)
Probability of error.
Correlation receiver.
Matched filter receiver.
Detection of signals with unknown
phase in noise.
Maximum likelihood estimation
Topics in this session:
Detection & Estimation
1 Model of digital communication system
2 Gram-schmidt orthogonalization
procedure
Fundamental Issues in
digital communications

1.Detection
2.Estimation
Detection theory deals with the design and
evaluation of decision – making processor
that observes the received signal and
guesses which particular symbol was
transmitted according to some set of rules.
Estimation Theory deals with the design and
evaluation of a processor that uses
information in the received signal to extract
estimates of physical parameters or
waveforms of interest.
The results of detection and estimation are
always subject to errors
 Model of digital
communication system
{mi} {Si} {Si(t)}

Message Vector Waveform noise

modulator
source transmitter channel

Transmitter
X(t)
X

Vector
detector
receiver

Receiver
Model (cont..)
Consider a source that emits one symbol every T
seconds, with the symbols belonging to an
alphabet of M symbols which we denote
m1, m2, . . . . . . mM.
We assume that all M symbols of the alphabet
are equally likely. Then
pi  P (mi emitted )
1
 for all i
M
The output of the message source is presented to a
vector transmitter producing vector of real number
 S i1 
S 
 i2 
 . 
Si   i  1, 2 , ..... , M
 . 
 . 
  Where the dimension N ≤ M.

 S iN 


The modulator then constructs a distinct signal

si(t) of duration T seconds. The signal si(t) is
necessarily of finite energy
Channel:
 Channel is linear, with a bandwidth that is
large enough to accommodate the
transmission of the modulator output si(t)
without distortion.
 The transmitted signal si(t) is perturbed by an
additive, zero-mean, stationary, white,
Gaussian noise process.
 GRAM – SCHMIDT ORTHOGONALIZATION
PROCEDURE:
In case of Gram-Schmidt Orthogonalization procedure,
any set of ‘m’ energy signals {Si(t)} can be
represented by a linear combination of ‘N’
orthonormal basis functions where N≤m. That is we
may represent the given set of real valued energy
signals S1(t), S2(t). . . . . . . Sm(t) each of duration T
seconds in the form
S1 (t )  S111 (t )  S12 2 (t ) . . . . . . . .  S1N  N (t )

S 2 (t )  S 211 (t )  S 222 (t ) . . . . . . . .  S 2 N  N (t )

S m (t )  S m11 (t )  S m 22 (t ) . . . . . . . .  S mNN (t )

N
0  t  T
S i (t )   S ij j (t ) 
j 1 i  1,2,3 ...... m
T
i  1,2,3. . ... m
S ij (t )   Si (t ) j (t ) 
0  j 1,2,3 ...... n
The co-efficient Sij may be viewed as the jth
element of the N – dimensional Vector Si

 S i1 
S 
 i2 
' 
 
Si  '  i = 1,2,3 . . . . . . m
' 
 
' 
S 
 iN 
Let S1  31 (t )  42 (t )
S 2   1 (t )  2 2 (t )
3   1
S1    S2   
Vector 4  2
 PSK
2 Eb
S1 (t )  Cos 2f c t  Eb 1 (t ) for Symbol ‘1’
Tb
2 Eb 2 Eb
S 2 (t )  Cos(2f ct   )   Cos 2f c t   Eb 1 (t )
Tb Tb
for Symbol ‘0’
 ASK
2 Eb
S1 (t )  Cos 2f c t  Eb 1 (t ) for Symbol ‘1’
Tb

S 2 (t )  0 for Symbol ‘0’

 FSK
2 Eb
S1 (t )  Cos 2f1t  Eb 1 (t ) for Symbol ‘1’
Tb

2 Eb
S 2 (t )  Cos (2f 2t )  Eb 2 (t )
Tb
for Symbol ‘0’
Digital communication

H V KUMARASWAMY
Topics in this session:
– Optimum transmitter &
receiver
– Correlative receiver
– Matched filter
Optimum transmitter &
receiver
 Probability of error depends on signal to
noise ratio
 As the SNR increases the probability of
error decreases
 An optimum transmitter and receiver is one
which maximize the SNR and minimize the
probability of error.
Correlative receiver

Observation
Vector x
Receiver consists of a bank of M product-
integrator or correlators
Φ1(t) ,Φ2(t) …….ΦM(t) orthonormal function
The bank of correlator operate on the
received signal x(t) to produce
observation vector x
Implemented in the form of maximum
likelihood detector
Operates on observation vector x to produce an
estimate of the transmitted symbol
Inner products {(x,sk)} k= 1, 2 ..M
The largest in the resulting set of numbers is selected
The optimum receiver is commonly referred as a
correlation receiver
MATCHED FILTER

y j (t )   x( )h (t   )d

j

h j (t )   j (T  t )

y j (t )   x( ) j (T  t   )d



y j (T )   x( ) j ( )d

 T
y j (T )   x( ) j ( )d
0

Yj(t) = xj x
where j is the j th
correlator output

The impulse response of the matched

filter is time-reversed and delayed
version of the input signal
For causal system
h j (t )  0 t 0
MAXIMIZATION OF OUTPUT
SNR
h(t) = impulse response
 (t ) = input signal
W(t) =white noise

x(t )   (t )  w(t ) 0t T

y (t )  0 (t )  n(t )
MATCHED FILTER

Sample
At t = T

φ(t) Known Signal Impulse Output

+ Response h(t)

White Noise w(t)

 2
0 (T )
( SNR )0 
E[n 2 (t )]

0 (t )   H ( f )( f ) exp( j 2ft )df


 2

 H ( f )( f ) exp( j 2fT )df

2
0 (T ) 


N0 2
S N( f )  H( f )
2
 
E[n 2 (t )]  S

N ( f )df


N0

2
 H ( f ) df
2 

Schwarz’s inequality

 2

 H ( f )( f ) exp( j 2fT )df


( SNR) 0  
N0

2
H ( f ) df
2 

 2  

 H ( f )( f ) exp( j 2fT )df  H( f )  ( f )

2 2
 df df
  
 
2
 ( f )
2
( SNR) 0  df
N0 

Rayleigh’s energy theorem

 

  (t )  ( f )
2 2
dt  df
 

2
 ( f )
2
( SNR ) 0, max  df
N0 
H opt ( f )   * ( f ) exp( j 2fT )

 * ( f )  ( f )

hopt (t )    * ( f ) exp[ j 2f (T  t )]df


hopt (t )    ( f ) exp[ j 2f (T  t )]df


  (T  t )
Digital communication

H V KUMARASWAMY
Topics in this session:
– Matched filter (cont..)
– Properties of Matched filter
– Problems
MATCHED FILTER

Sample
At t = T

Φ(t) Known Signal Impulse Output

+ Response h(t)

White Noise w(t)

Φ(t) = input signal
h(t) = impulse response
W(t) =white noise
The impulse response of the
matched filter is time-reversed and
delayed version of the input signal
h (t )   (T  t )
h j (t )  0 t 0 For causal system
•Matched filter properties

PROPERTY 1
The spectrum of the output signal of a
matched filter with the matched signal
as input is, except for a time delay
factor, proportional to the energy
spectral density of the input signal.
 0 ( f )  H opt ( f )  ( f )
  * ( f )  ( f ) exp( j 2fT )
2
  ( f ) exp(2 jfT )
 PROPERTY 2
The output signal of a Matched Filter is
proportional to a shifted version of the
AutoCorrelation Function of the input signal to
which the filter is matched.

0 (t )  R (t  T )
At time t = T

0 (T )  R (0)  E
PROPERTY 3

The output Signal to Noise Ratio of a

Matched filter depends only on the ratio of
the signal energy to the power spectral
density of the white noise at the filter input.
SNR at the output of matched filter is
2
0 (T )
( SNR )0 
E[n 2 (t )]

0 (t )   H ( f )( f ) exp( j 2ft )df

 2

 H ( f )( f ) exp( j 2fT )df

2
0 (T ) 


N0 2
S N( f )  H( f )
2
  
N0
E[n (t )]   S N ( f )df   H( f )
2 2
df

2 

 2

 H ( f )( f ) exp( j 2fT )df


( SNR) 0  
N0

2
H ( f ) df
2 

Schwarz’s inequality
 2  

 H ( f )( f ) exp( j 2fT )df  H( f )  ( f )

2 2
 df df
  
 
2
 ( f )
2
( SNR) 0  df
N0 

Rayleigh’s energy theorem

 

  (t )  ( f )
2 2
dt  df
 

2
 ( f )
2
( SNR ) 0,max  df
N0 

2E

N0
PROPERTY 4
The Matched Filtering operation may be
separated into two matching conditions;
namely spectral phase matching that
produces the desired output peak at time T,
and the spectral amplitude matching that
gives this peak value its optimum signal to
noise density ratio.
In polar form

 ( f )   ( f ) exp  j ( f )

Spectral phase matched

H ( f )  H ( f ) exp   j ( f )  j 2fT 

 (t )   H ( f ) ( f ) exp( j 2ft )df
'
0


  H ( f ) ( f ) exp[ j 2f (t  T )]df

 At time t = T, output is maximum

0' (t )  0' (T )   ( f ) H ( f ) df


For spectral amplitude matching

H ( f )  ( f )
Digital communication

H V KUMARASWAMY
Topics in this session:
– Digital modulation techniques
– Digital modulation formats
– Coherent binary modulation
techniques
– Coherent binary PSK [BPSK]
Digital modulation techniques

SHIFT KEYING METHODS

 Amplitude shift keying [ASK]
 Frequency shift keying [FSK]
 Phase shift keying [PSK]
Digital modulation formats
ASK

PSK

FSK
Hierarchy of digital
modulation technique
TYPES OF DIGITAL
MODULATION SYSTEM

1. COHERENT
2. NON- COHERENT
 BPSK

TRANSMITTER
BPSK

RECEIVER
BPSK DECISION

If x1 > 0, the receiver decides in favour of symbol 1.

If x1 < 0, the receiver decides in favour of symbol 0.

 Representation of BPSK

2 Eb
S1 (t )  Cos 2f c t
Tb

2 Eb 2 Eb
S 2 (t )  Cos (2f c t   )   Cos 2f c t
Tb Tb

Where Eb= Average energy transmitted per bit

Eb 0  Eb1
Eb 
2
 In BPSK system
2
1 (t )  Cos 2f c t 0  t  Tb
Tb

S 1(t )  Eb 1 (t )

S 2(t )   Eb 1 (t )
BPSK CO-EFFECIENTS

Tb

S11   S1 (t ) 1 (t ) dt   Eb
0
Tb

S 21   S 2 (t ) 1 (t ) dt   Eb
0
Digital communication

H V KUMARASWAMY
Topics in this session:
– Digital modulation techniques
– Design goals
– Coherent binary modulation
techniques
– Coherent binary PSK [BPSK]
– Coherent binary FSK [BFSK]
Digital modulation techniques

DESIGN GOALS
 Maximum data rate
 Minimum probability of symbol error
 Minimum transmitted power
 Minimum channel bandwidth
 Maximum resistance to interfering signals
 Minimum circuit complexity
Digital modulation formats
ASK

PSK

FSK
BPSK

TRANSMITTER
BPSK

RECEIVER
BPSK DECISION

If x1 > 0, the receiver decides in favour of symbol 1

.
If x1 < 0, the receiver decides in favour of symbol 0.
 Representation of BPSK

2 Eb
S1 (t )  Cos 2f c t
Tb

2 Eb 2 Eb
S 2 (t )  Cos (2f c t   )   Cos 2f c t
Tb Tb

Where Eb= Average energy transmitted per bit

Eb 0  Eb1
Eb 
2
Probability of Error Calculation
In BPSK system
2
1 (t )  Cos 2f c t 0  t  Tb
Tb

S 1(t )  Eb 1 (t )

S 2(t )   Eb 1 (t )
 Tb

S11   S1 (t ) 1 (t ) dt   Eb
0
Tb

S 21   S 2 (t ) 1 (t ) dt   Eb
0
The observation vector x1 is related to the
received signal x(t) by
T
x1   x(t )1 (t ) dt
0

The error is of two types

1) Pe(0/1) i.e. transmitted as ‘1’ but received as ‘0’
2) Pe(1/0) i.e. transmitted as ‘0’ but received as ‘0’
Error of 1st kind is given by

1  ( x1   ) 2 
Pe (1 / 0) 
2 2
0 exp 2 2  dx1

μ = mean value =  Eb
for the transmission of symbol ‘0’
 2 = Variance = N2 0

for additive white Gaussian noise.

Threshold Value λ = 0. [Indicates lower limit in
integration]
Probability of Error Calculation [Contd..]
1
  ( x1  Eb ) 2 
Pe 0  Pe (1 / 0)  
N 0 0
exp 
 N0
 dx1


x1  Eb
Z
N0

Pe 0  Pe (1 / 0) 
1
 exp (  Z 
) 2

dz
 ( Eb / N 0 )

1 Eb
Pe (1 / 0)  erfc
2 N0
 similarly
1 Eb
Pe (0 / 1)  erfc
2 N0
The total probability of error
Pe  Pe (1 / 0) Pe (0)  Pe (0 / 1) Pe (1)

assuming probability of 1’s and 0’s are equal.

1
Pe  [ Pe (1 / 0)  Pe (0 / 1)]
2

1 Eb
Pe  erfc
2 N0
Coherent Binary FSK
2 Eb
S 1(t )  Cos 2f1t for symbol 1
Tb

2 Eb
S 2 (t )  Cos 2f 2 t for symbol 0
Tb

Basic orthogonal functions

2
1 (t )  Cos 2f 1t
Tb
2
2 (t )  Cos 2f 2 t for 0  t  Tb and Zero Otherwise
Tb
 coefficients
 Eb  0 
S1    S2   
0  E
 b 

M=2 N=2

Transmitter
Receiver
The correlator outputs are the subtracted one
from the other and resulting a random vector
‘l’ (l=x1-x2). The output ‘l’ is compared with
threshold of zero volts.
If l > 0, the receiver decides in favour of
symbol 1.
l < 0, the receiver decides in favour of
symbol 0.
Probability of Error Calculation
2
1 (t )  Cos 2f1t 0  t  Tb
Tb

2
2 (t )  Cos 2f 2 t 0  t  Tb
Tb

The transmitted signals S1(t) and S2(t) are given by

S 1(t )  Eb 1 (t ) for symbol 1

S 2 (t )  Eb 2 (t ) for symbol 0
 The observation vector x1 and x2
Tb

x1   x(t )1 (t )dt

0
Tb

x2   x(t ) 2 (t )dt
0

Assuming zero mean additive white Gaussian noise with input

PSD =N0/2 hence variance = N0/2

The new observation vector ‘l’ is the difference of two

random variables x1 & x2.
l = x 1 – x2
conditional mean of random variable ‘l’ for symbol 1
was transmitted
l  x  x 
E   E 1   E 2 
1  1 1
 Eb  0
 Eb

similarly for ‘0’ transmission

l 
E     Eb
0
 Var [l ]  Var [ x1 ]  Var [ x2 ]
 N0

1
  (l  Eb ) 2 
Pe (1 / 0)  Pe 0 
2N 0 0 exp  2 N 0  dl
 

l Eb
let Z
2N0


1
Pe 0    2
exp( z )dz
 Eb
2 N0

1  Eb 
 erfc  
2  2N0 
similarly

1  Eb 
Pe1  erfc  
2  2 N 0 

1
The total probability of error = [ Pe 0  Pe1 ]
2

1  Eb 
Pe  erfc  
2  2N0 
Digital communication

H V KUMARASWAMY
Topics in this session:
– Digital modulation techniques
(Contd..)
– ASK [or Binary ASK]
– QPSK
BASK

Transmitter
BASK Receiver
 2
1 (t )  Cos 2f c t 0  t  Tb
Tb

S1 (t )  Eb  1 (t ) for Symbol 1

S 2 (t )  0 for Symbol 0

Probability of error

1  Eb 
Pe  erfc  
2  2N0 
A 2Tb
0
Eb 0  Eb1 2 A 2Tb
Eb   
2 2 4
 BPSK

TRANSMITTER
BPSK

RECEIVER
COHERENT QUADRIPHASE –
SHIFT KEYING [QPSK]

Transmitter
QPSK Receiver
  2E  
 cos 2f ct  (2i  1 )  0  t  T
si (t )   T  4
0 elsewhere

 2E  
 cos  ( 2i  1 )  cos(2f ct )
 T  4
 2E  
si (t )    sin (2i  1)  sin(2f ct ) 0  t  T
 T  4
0 elsewhere


 Transmitted signals

2E  
S 1 (t )  T
cos2

f c
t 
4
 for input dibit 10

2E  3 
S 2 (t )  T
cos2

f c
t
4 
 for input.dibit 00

2E  5 
S 3 (t )  T
cos2

f c
t
4 
 for input dibit 01

2E  7 
S 4 (t )  T
cos2

f c
t
4 
 for input dibit 11

E = the transmitted signal energy per symbol.

T = Symbol duration.
 Basic functions

 (t ) 
2

cos 2 f t  0  t T
1
T b
c

 (t ) 
2

sin 2 f t  0  t T
2
T b
c

Message points

  
 E cos   2 i  1  
4
Si    i  1,2,3,4
   
  E sin   2i  1  
 4  
Signal vectors, Si1 & Si2
Signal Space Representation
x(t )  si (t )  w(t ) 0  t  T
i 1,2,3,4
T
x1   x(t )  (t ) dt
0
1

 
 E cos ( 2i  1)   w1
 4
T
x2   x(t ) 
0
2 (t ) dt

 
  E sin ( 2i  1)   w2
 4
Probability of error

-The signal energy per bit E

2
-The noise spectral density is N 0

 E 
P1 
1
2
erfc  2
 N 
E  E 2
 0

1  E 
 erfc  
2  2 N 0 
P C

 1  P1  2

2
 1  E 
 1  erfc  
 2  2 No  
 E  1  E 
 1  erfc    erfc 
2

 2 No  4  2 No 
P e
 1  PC
 E  1  E 
 erfc    erfc 
2

 2 No  4  2 No 

E Eb
Pe  erfc 2 No or Pe  erfc 2 No
In QPSK E = 2 Eb
Digital communication

H V KUMARASWAMY
Topics in this session:
– Probability of error in QPSK
– Non coherent ASK, FSK
– DPSK
Probability of error

-The signal energy per bit E

2
-The noise spectral density is N 0

 E 
P1 
1
2
erfc  2
 N 
E  E 2
 0

1  E 
 erfc  
2  2 N 0 
P C

 1  P1  2

2
 1  E 
 1  erfc  
 2  2 No  
 E  1  E 
 1  erfc    erfc 2
 
 2 No  4  2 No 

P e
 1 P C

 E  1  E 
 erfc    erfc 2
 
 2 No  4  2 No 

E or Eb
Pe  erfc 2 No Pe  erfc 2 No
In QPSK E = 2 Eb
BASK

Transmitter
BASK Receiver
Non coherent ASK
Coherent FSK

Transmitter
Coherent FSK

Receiver
Non coherent FSK
 BPSK

TRANSMITTER
Coherent BPSK

RECEIVER
DPSK [Differential PSK]
Non-coherent PSK

Transmitter
Receiver
Input Binary Sequence {bK} 1 0 0 1 0 0 1 1

{b’K} 0 1 1 0 1 1 0 1

{dK-1} 1 1 0 1 1 0 1 1

{d’K-1} 0 0 1 0 0 1 0 0

{bKdK-1} 1 0 0 1 0 0 1 1

{b’Kd’K-1} 0 0 1 0 0 1 0 0

Differentially Encoded 1 1 0 1 1 0 1 1 1
sequence {dK}

Transmitted Phase 0 0 Π 0 0 Π 0 0 0

Received Sequence 1 0 0 1 0 0 1 1
(Demodulated Sequence)
Input Binary Sequence {bK} 1 0 0 1 0 0 1 1

Differentially Encoded 1 1 0 1 1 0 1 1 1
sequence {dK}

Transmitted Phase 0 0 Π 0 0 Π 0 0 0

Received Sequence 1 0 0 1 0 0 1 1
(Demodulated Sequence)
Digital communication

H V KUMARASWAMY
Topics to be covered in this session
I Minimum shift keying
II M-ary FSK
III M-ary PSK
Minimum shift keying
Proper utilization of phase during detection, for improving
. performance
noise
Complexity increases
CPFSK (Continuous-phase frequency-shift keying)
 2 Eb
 Cos [2f1t   (0) ] for Symbol 1
 Tb
s (t )  
 2 Eb Cos [2f t   (0) ] for Symbol 0
 T 2
 b

θ(0) denotes the value of the phase at time t=0

 An angle-modulated wave

2 Eb
s (t )  Cos [2f c t   (t ) ]
Tb

θ(t) is the phase of s(t), continuous function of time.

1
Carrier frequency f c  ( f1  f 2 )
2
h
Phase  (t )   (0)  t 0  t  Tb
Tb
Deviation ratio h  Tb ( f1  f2 )
Measured with respect to bit rate 1/Tb
At time t=Tb
h for Symbol 1
 (Tb )   (0)  
 h for Symbol 0

Phase Tree
Phase Trellis, for sequence 1101000
In terms of In phase and Quadrature Component

2 Eb 2 Eb
s (t )  Cos [ (t )] Cos (2f c t )  Sin [ (t )] Sin (2f c t )
Tb Tb

h=1/2

 (t )   (0)  t 0  t  Tb
2Tb

+ Sign corresponds to symbol 1

- Sign corresponds to symbol 0
 In phase components
For the interval of  Tb  t  Tb
2 Eb
s1 (t )  Cos [  (t ) ]
Tb
2 Eb   
 Cos [  (0) ] Cos t 
Tb  2Tb 
2 Eb   
 Cos t   Tb  t  Tb
Tb  2Tb 
Half cosine pulse

+ Sign corresponds to θ(0) =0

- Sign corresponds to θ(0) = п
Quadrature components
2 Eb
sQ (t )  Sin [ (t ) ]
Tb
2 Eb   
 Sin [ (Tb ) ] Cos t 
Tb  2Tb 
2 Eb   
 Cos t  0  t  2Tb
Tb  2Tb 

+ Sign corresponds to θ(Tb) =п/2

- Sign corresponds to θ(Tb) = -п/2
Half sine pulse
Four possibilities
 Basic functions
2   
1 (t )  Cos  t  Cos (2f c t )  Tb  t  Tb
Tb  2Tb 

2   
 2 (t )  Sin  t  Sin (2f c t ) 0  t  2Tb
Tb  2Tb 

s (t )  s11 (t )  s 2 2 (t ) 0  t  Tb
 coefficients
Tb

s1   s(t ) 1 (t ) dt
Tb

 Eb Cos  (0)  Tb  t  Tb
2Tb

s2   s (t ) 2 (t ) dt
0b

  Eb Sin  (Tb ) 0  t  2Tb

Signal Space Characterization of MSK
 Tb

x1   x(t ) 1 (t ) dt
Tb

 s1  w1  Tb  t  Tb
2Tb

x 2   x(t )  2 (t ) dt
0

 s 2  w2 0  t  2Tb

 Eb  1  Eb 
Pe  erfc    erfc 
 4
2
 N 

 N 0   0 

 Eb 
Pe  erfc  

 N 0 
MSK receiver

Q-channel
Sketch the waveform of the MSK signal for the sequence
for the 101101.Assume that the carrier frequency
a) Is 1.25 times the bit rate. b) Equal to the bit

Solution (a) fc =(f1+f2)/2 =1.25/ Tb OR f1+f2=2.5/Tb

Also f1-f2=1/(2Tb)
Solving f1=1.5/Tb f2=1/Tb

(b) fc=1/Tb f1+f2=2/Tb f1-f2=1/(2Tb)\

Solving f1=1.25/Tb f2=0.75/Tb
Digital communication

H V KUMARASWAMY
Topics in this session:
M-ary Modulation Technique
M-ary PSK and FSK
Problems
Bandwidth calculation
M - ary PSK

2E  2i 
si (t )  Cos  2f ct   i  0,1,2,......................., M  1
T  M 

Orthogonal Functions

2
1 (t )  Cos  2f c t  0t T
T

2
 2 (t )  Sin  2f c t  0t T
T
Signal Constellation for octaphase – shift - keying

M=8
The decision making process in the phase discriminator is
based on the noisy inputs
 2i 
xI  E Cos    wI i  0,1..........M  1
 M 
 2i 
xQ   E Sin    wQ i  0,1..........M  1
M 

Receiver for Coherent M-ary PSK

M - ary QAM
Block Diagram of M –ary QAM System
- Transmitter
Block Diagram of M –ary QAM System
- Receiver
Signalling Constellation M=16

M-ary QPSK M-ary QAM

 M-ary FSK

Serial to
D/A VCO
Parallel
Binary Data M-ary FSK
Problems
A bandpass data transmission scheme uses a
PSK signalling scheme with
10
S 2 (t )  ACosc t , 0  t  Tb , c 
Tb
S1 (t )   ACosc t , 0  t  Tb , Tb  0.2mSec

The Carrier Amplitude at the receiver input is 1mV

and the PSD of the Additive white gaussian Noise
at the input is 10-11 Watts/Hz. Assume that an ideal
correlation receiver is used. Calculate average bit
error rate of the receiver.
  1 
Tb  0.2mSec    Using erfc function
 Rb 
Ac  1mV
N0
 1011Watt / Hz
2
1 Eb 1 A2Tb
Pe  erfc  erfc
2 N0 2 2N0
1 (103 ) 2 * 0.2 *10 3 1
 erfc 11
 erfc 5
2 2 * (2 10 ) 2
1 1
 erfc (2.236)  1.44  103
2 2
 0.7 103
Using Q function

 A2T 
Pe  Q b 
 Q 10
 N0 
 
 Q(3.2)  0.00069  0.7 10 3
Bandwidth calculation

1 ASK BW=2rb
2 PSK BW=2rb
3 FSK BW>2rb
Digital communication

H V KUMARASWAMY
Topics in this session:
Synchronization
Carrier synchronization
Symbol synchronization
Applications
1 Voice-grade modem
2 Digital radio
3 Digital communication by satellite
Synchronization

1 carrier recovery or Carrier Synchronization

2 Clock recovery or Symbol Synchronization
3 Word Synchronization
•Carrier Synchronization

 Mth power loop

 Square loop ( M = 2 )
 Costas loop
Mth power loop
Costas loop
 •Symbol Synchronization

1 Transmitting clock along with the data-bearing signal

[ multiplexed form ]
- waste of clock power
2 Use a noncoherent detector to extract clock
3 Clock is extracted from the demodulated base band
signal
•Matched filter
•Early-late gate synchronizer
•Applications
1 Voice-grade Modems
Voice frequency range- 300-3400 Hz

Modem Modem

Mod Mod
A/D D/A
Dem Dem voice
voice
Telephone channel

FSK modem operating at 1200bps, commonly used frequencies

1300Hz & 2100Hz
Phase jitter in M-ary PSK & DPSK
DPSK limited to 4800bps
M-ary QAM

16 QAM
 •Digital radio
- Information originating from a source is transmitted
to its destination by means of digital modulation
techniques over an appropriate number of
microwave radio links.
- LOS [ Line Of Sight ] propagation.
- 64kbps PCM is used
- M-ary QAM [ M=64, M=256 ]
- Multipath fading
- Diversity Techniques
LOS [ Line Of Sight ] propagation

Reflected wave

Building
Digital Communication by Satellite
Digital Communication by Satellite

-TDMA
-Transmission are organized into frames
-A frame contain N bursts
-Preamble , Post amble, guar time
Digital Communication by Satellite
M-ary PSK
Coherent MSK
QPSK for BW saving
-Power efficiency is increased by using TWT near saturation
-Independent simultaneous provisions for carrier and clock
recovery, overhead recovery time is minimized