0% found this document useful (0 votes)
23 views18 pages

Com-I-2425-Lecture 7-8-Performance Analysis of Digital Modulation System

The document covers the analysis and performance of optimum receivers in binary communication, focusing on minimizing error probabilities and optimizing detection thresholds. It discusses various signaling methods, including polar and orthogonal signaling, and introduces coherent receivers for digital carrier modulations. The lecture emphasizes the importance of signal representation in an n-dimensional space and the use of geometrical analysis to determine the optimum receiver for minimizing error in M-ary transmission systems.

Uploaded by

ersanerginn48
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
23 views18 pages

Com-I-2425-Lecture 7-8-Performance Analysis of Digital Modulation System

The document covers the analysis and performance of optimum receivers in binary communication, focusing on minimizing error probabilities and optimizing detection thresholds. It discusses various signaling methods, including polar and orthogonal signaling, and introduces coherent receivers for digital carrier modulations. The lecture emphasizes the importance of signal representation in an n-dimensional space and the use of geometrical analysis to determine the optimum receiver for minimizing error in M-ary transmission systems.

Uploaded by

ersanerginn48
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 18

11/8/2024

Lecture 7-8 9.2 Optimum Receivers in Binary


Communication
Performance Analysis of General
Binary Signaling (Ch.9.2, Ch.9.3,
Ch.9.4)

1 2

3 4
11/8/2024

9.2 Optimum Receivers in Binary


Communication (more general Tx scheme-two
distinct pulses)
𝑝 𝑡 +𝑛 𝑡 0≤𝑡≤𝑇 𝑓𝑜𝑟 𝑑𝑎𝑡𝑎 𝑠𝑦𝑚𝑏𝑜𝑙 1
𝑦 𝑡 =
𝑞 𝑡 +𝑛 𝑡 0≤𝑡≤𝑇 𝑓𝑜𝑟 𝑑𝑎𝑡𝑎 𝑠𝑦𝑚𝑏𝑜𝑙 0

Sampler output

5 6

Sampled output of the filter Optimum Threshold of Detection


• r is a Gaussian RV of variance 𝜎 with mean
• Decision rule
𝜇 = 𝑞 𝑇  m=0
𝜇 = 𝑝 (𝑇 ) m=1 0 𝑖𝑓 𝑟 < 𝑎
The conditional PDFs of the sampled output 𝑟(𝑇 ) are m=
1 𝑖𝑓 𝑟 > 𝑎

• Conditional Error Probability


𝑃(𝜖|𝑚 = 0) «the probability of wrong decision when m=0»  𝐴
𝑎 − 𝑞 (𝑇 ) 𝑃(𝜖|𝑚 = 1) «the probability of wrong decision when m=1»  𝐴
𝑝 𝑇 −𝑎 𝑄( )
𝑄( ) 𝜎
𝜎 ( )
𝑃 =∑ 𝑃 𝜖𝑚 𝑃 𝑚 = 𝐴 +𝐴 = [𝑄( )+𝑄( )]
P(𝜖|m=1) P(𝜖 |m=0)
𝑃 0 = 𝑃 1 = 0.5 The sum Ao+A1 of the shaded area is minimized by choosing a0
at the intersection of the two PDFs
7 8

7 8
11/8/2024

Minimizing error 𝑄( ) ; that is


Finding Optimum Threshold
maximizing 𝛽

SNR  
| H ( f )G ( f )e j 2fT df |2
No
 | H  f  | df
2

To find 𝛽max Cauchy-Schwarz inequality can be applied

9 10

9 10

Optimum Filter for White Gaussian Corresponding 𝛽 for the filter matched
Noise to the pulse p(t)-q(t)

• White noise if PSD of N/2 and k for N/2


Optimum Filter

 This is a filter matched to the pulse p(t)-q(t)

11 12

11 12
11/8/2024

For Gaussian Noise, «Optimum Detection


Obtaining Optimum Threshold Receiver» is the definite optimum

If we subtituting po(Tb),q0(Tb) and H(f) into optimum threshold formula a0

Remember
Parseval

• Means that; This receiver gives the best BER


performance for Gaussian Noise
13 14

13 14

Corresponding 𝛽 for minimum error and Equivalent Optimum Binary Receivers


Bit Error Probability or Bit error Rate (BER)

• Ep  energy of p(t)
• Eq  energy of q(t)
ht   p T  t  H ( f )  P f e  j 2fT
• BER This filter can be realized as a parallel combination of two filters matched to p(t) and q(t)

• Detection Threshold
15 16

15 16
11/8/2024

Realization of the optimum binary Performance Analysis of General Binary


threshold detector Systems
18
Equivalent to shifting the
threshold to 0, since the  We apply the techniques derived for the general binary
threshold is (Ep+Eq)/2 receivers; a filter matched to the pulse p(t)-q(t) is
following
Typo in
the book

 Bit Error Rate (BER)


Equivalent form in the case of
Ep=Eq, not need to subtract
Ep/2 and Eq/2

 Optimum Threshold

17

17 18

19 20

19 20
11/8/2024

21 22

21 22

23 24

23 24
11/8/2024

25 26

25 26

Polar Signaling (1/3) Polar Signaling (2/3)


27 28

 Optimum Threshold Detector for Polar Signaling


 q(t)=-p(t) so

 BER
0.5 h(t)

 Filter response Multiplication of h(t) with any constant amplifies both the signal and the noise
by the same factor, and so does not affect the system performance.

 Eb/N is the normalized energy


 Optimum Detection Threshold
per bit
 Signal power=(Eb) x (bit rate)
 Energy per bit

27 28
11/8/2024

Polar Signaling (3/3) On-Off Signaling


29 30

 q(t)=0 so

 For optimum threshold  BER


detection, the polar system
performance depends not on
the pulse shape, but on the
pulse energy.  Filter response

 Pb as a function of  Optimum Detection Threshold


Eb/N (in decibel)

 Energy per bit


P(m=0)=P(m=1)

29 30

Orthogonal Signaling
31 32

 p(t) and q(t) are orthhogonal


 over the interval (0,Tb) so

 BER

 Filter response

 Optimum Detection Threshold

 Energy per bit Eb


P(m=0)=P(m=1)

31 32
11/8/2024

33 34

33 34

9.3. Coherent Receivers for Digital Carrier


Modulations
35 36

BER Analysis for


9.3. Coherent Receivers for Digital Carrier  ASK
Modulations  FSK
 PSK

35 36
11/8/2024

Coherent Receivers for Digital Carrier


Modulations; Optimum Threshold and Min BER Minimum BER for BFSK
37 38
BPSK Binary ASK

 We should select ∆𝜔 for BFSK such that


Binary FSK sinc(∆𝜔𝑇 ) is minimum

37 38

Minimum Shift Keying (MSK) Minimum Shift Keying (MSK)


39 40
 In MSK when switching between 𝑓 + ∆𝑓 𝑎𝑛𝑑 𝑓 − ∆𝑓 at the
transmitter phase continuity need to be preserved.
Epq=0  orthogonal signaling
 FSK schemes maintaining phase continuity are known as
For ∆𝑓 = 𝑛⁄2𝑇 where n is any continuous phase FSK (CPFSK), of which MSK is one special
integer. 2𝜋𝑓𝑇 = 𝜋 case. Advantage of this schemes are rapid spectral roll-off
and better spectral efficiency.
∆𝑓 = 1⁄2𝑇  If MSK is coherently detected as ordinary FSK using an
observation interval of 𝑇 then it is inferior to the optimum
case

 FSK using this minimum value for orthogonal


signaling is known as Minimum Shift Keying (MSK)
Coherent detection as ordinary FSK Minimum BER for BFSK

39 40
11/8/2024

Continuous Phase FSK;


Minimum Shift Keying (MSK),
phase of each pulse is dependent on the past data sequence
41 42

 When =0  orthogonal signaling


𝐸 = 0 𝑓𝑜𝑟 ∆𝑓 = , n ->integer

1
𝑛=1 , 2𝜋𝑓𝑇 = 𝜋 , 𝑓=
2𝑇

1
𝑛=2 , 2𝜋𝑓𝑇 = 2𝜋 , 𝑓=
𝑇
 By using a Gaussian pulse shape,
 MSK being an orthogonal scheme GMSK is used Cellular
Communication system GSM
 Coherently as Ordinary FSK Detection  It has self synchronization
capabilities
 BW=1,5Rb
 Rapid decay 1/f4
 Detection over a period of 2Tb,

41 42

43 44

43 44
11/8/2024

Coherent Detection of Digital Modulated signals


Bandpass Matched Filter as a Coherent Receiver
45 46
For both BPSK and BASK

9.4 SIGNAL SPACE ANALYSIS OF


OPTIMUM DETECTION
Binary FSK

Optimum correlation
receiver for binary FSK

45 46

9.4 SIGNAL SPACE ANALYSIS OF OPTIMUM


DETECTION Geometrical Signal Space
47 48

 So far, we studied the optimum digital receiver for


linear threshold detection for binary transmission  To answer the question of optimum receiver we
under Gaussian channel noise. analyze the problem of digital signal detection.
NOW: We are going to answer the question:  Channel output y(t) 0 ≤ 𝑡 ≤ 𝑇 is a random
process and receiver must make a decision by
Given an M-ary transmission with channel noise transforming y(t) into a finite-dimensional
n(t) and channel output decision space!
y(t)=pi(t)+n(t) 0 ≤ 𝑡 ≤ 𝑇 i=1,…,M  To do this analysis a geometrical representation
what is OPTIMUM receiver that can lead to of signals and noise will be used !
minimum error probability?

47 48
11/8/2024

Signal representation Remember Definitions!


49 50

 Any vector 𝑥 = 𝑥 , 𝑥 , … , 𝑥 can be expressed as a


 A signal in an M-ary transmission system is in linear combination of n unit vectors,
reality an n-dimensional vector
𝑥 = 𝑥 𝜑 + 𝑥 𝜑 + ⋯ +𝑥 𝜑
 Therefore this signal can be represented by a
point in an n-dimensional hyperspace (𝑛 ≤ 𝑀)
= 𝑥 𝜑

Inner product Norm Orthogonal


< 𝑥, 𝑦 >= 𝑥 𝑦 < 𝑥, 𝑥 >= 𝑥 = 𝑥 < 𝑥, 𝑦 >= 0

49 50

Def: Basis vectors, orhonormal set Def:Complete Orthonormal Set


51 52

 If 𝑦 , 𝑦 , … , 𝑦 is an independent set, then the equality  Basis vectors constract a orthonormal set of vectors.
They capture an orthogonal vector space.
𝑎 𝑦 + 𝑎 𝑦 +, … + 𝑎 𝑦 = 0 hold if 𝑎 = 0, 𝑖 = 1, … , 𝑚.
 An n-dimensional space can have at most n independent vectors.  Any vector 𝑥 = 𝑥 , 𝑥 , … , 𝑥 can be represented as
If a space has a maximum of n independent vectors, then every 𝑥 = 𝑥 𝜑 + 𝑥 𝜑 + ⋯ +𝑥 𝜑
vector x in this space can be expressed as a linear combination of
these n independent vectors.  Where 𝑥 is the projection of x on the basis vector 𝜑
 Thus any vector in this space can be specified by n-tuples. and is the k th coordinate.
 A set of n independent vectors in an n-dimensional space can be  By using the orthonormality equation, the kth
its basis vectors. If they are mutually orthogonal and have coordinate can be obtained from
normalized length. That is
 < 𝑥 , 𝜑 >=𝑥 𝑘 = 1,2, … , 𝑛
0 𝑗≠𝑘  Since any vector in the n-dimensional space can be
 < 𝜑 ,𝜑 > =
1 𝑗=𝑘 represented by this set of n basis vectors, this set
forms a complete orthonormal (CON) set.

51 52
11/8/2024

Geometric Representation of Signals Have we seen this before?


53 54

Mogasseri Mogasseri

53 54

Conditions on basis functions


Expressing signals as a weighted sum
55 56

Mogasseri

55 56
11/8/2024

Components of the signal vector Signal space dimension


57 58

57 58

Example 10.11: four signal set


Example: Fourier series Represent these signals geometrically in the vector space
59 60

59 60
11/8/2024

Components of s1(t) Interpretation


61 62

61 62

Signal constellation Learning from the constellation


63 64

63 64
11/8/2024

Finding the energy from the constellation Exploiting the orthogonality of basis functions
65 66

65 66

Energy in simple language Constrained energy signals


67 68

𝐸 = 𝑠 𝑑𝑡 = 𝑠

67 68
11/8/2024

Correlation of two signals Find the angle between s1 and s2


69 70

69 70

Distance between two signals


71

71

You might also like