KINERJA SISTEM

KOMUNIKASI
DIGITAL BANDPASS MODULATION
Digital Communication System

2
Why Digital Communication ?

3
 Digital Bandpass Modulation
 Bandpass modulation (either analog or digital) is the process by
which an information is a sinusoidal waveform.
 In digital communications, the modulation process corresponds
to switching or keying the amplitude, frequency, or phase of the
carrier in accordance with the incoming digital data.
 Three basic digital modulation techniques :
 Amplitude-shift keying (ASK) - special case of AM

 Frequency-shift keying (FSK) - special case of FM

 Phase-shift keying (PSK) - special case of PM

4
Digital Bandpass Modulation

Waveforms for the three basic forms of signaling binary information.

(a) Amplitude-shift keying. (b) Phase-shift keying. (c) Frequency-shift keying with
continuous phase.
5
 Digital Bandpass Modulation
 Bandpass modulation (either analog or digital) is the process by
which an information is a sinusoidal waveform.
 In digital communications, the modulation process corresponds
to switching or keying the amplitude, frequency, or phase of the
carrier in accordance with the incoming digital data.
 Three basic digital modulation techniques :
 Amplitude-shift keying (ASK) - special case of AM

 Frequency-shift keying (FSK) - special case of FM

 Phase-shift keying (PSK) - special case of PM

6
 Bandpass Modulation
Bandpass
Modulation

Non-Coherent
Coherent
1. Differential Phase Shift Keying
1. Phase Shift Keying (PSK)
(PSK)
2. Frequency Shift Keying
2. Frequency Shift Keying
3. Amplitude Shift Keying (ASK)
3. Amplitude Shift Keying (ASK)
4. Continuous Phase Modulation
4. Continuous Phase Modulation
(CPM)
(CPM)
5. Hybrids
5. Hybrids

7
 Binary Modulation Types
 In binary signaling, the modulator produces one of two
distinct signals in response to 1 bit of source data at a time.
 Binary modulation types :
 Binary PSK (BPSK)

 Binary FSK (BFSK)

 Binary ASK (BASK)

8
 Binary PSK
 Symbol expression :

s1 (t ) = cos(2πf c t )
2 Eb
‘1’ →
Tb

s2 (t ) = cos(2πf c t + π ) = − cos(2πf c t )
2 Eb 2 Eb
‘0’ →
Tb Tb
 0 ≤ t < Tb, Tb : bit duration
 fc : carrier frequency → fc >> 1/Tb.
 Eb : transmitted signal energy per bit
Eb = ∫ s (t ) dt = ∫ s22 (t ) dt
Tb Tb
2
1
0 0

 The pair of signals differ only in a relative phase shift of 180 degrees
9
 BPSK : Signal Space Representation

 There is one basis function of unit energy :

φ1 (t ) = cos(2πf c t ) ; 0 ≤ t < Tb
2
Tb

 Then, s1 (t ) = Eb φ1 (t ) ; s2 (t ) = − Eb φ1 (t )
 A binary PSK system is therefore characterized by having a signal
space that is one-dimensional and with two message points (i.e.
M = 2)
− Eb Eb d12 = 2 Eb
s2 0 s1 ϕ1(t)

10
 BPSK : Decision Rule
 Assume that P(s1) = P(s2) =0.5, then the optimum
decision boundary is the midpoint of the line joining these
two message points.
s1
Region R1 Region R1
>
− Eb Eb r 0
s2 0 s1 ϕ1(t) <
s2
 Decision rule : Guess signal s1(t) (or binary 1) was
transmitted if the received signal point r falls in region
R1, Guess signal s2(t) (or binary 0) was transmitted
otherwise.

11
 BPSK : Probability of Error
 The conditional probability of the receiver deciding in favor of symbol
s2(t) given that s1(t) is transmitted is :

P(e | s1 ) = P(r < 0 | s1 ) = ∫

0 1
exp−
(
 r − E
b )  dr
2


−∞
πN 0  N0 
 2 Eb 
= Q 

 N0 
 Due to symmetry :
 2 Eb 
P(e | s2 ) = P(r > 0 | s2 ) = Q 

 N0 

12
 BPSK : Probability of Error

 Since the signals s1(t) and s2(t) are equally likely to be transmitted, the
average probability of error is :
 2 Eb 
Pe = 0.5 P(e | s1 ) + 0.5 P(e | s2 ) = Q 

 N0 
13
BPSK : Transmitter

14
 BPSK : Receiver

 θ is the carrier-phase offset, due to propagation delay or oscillators at

transmitter and receiver are not synchronous.
 The detection is coherent

15
 Binary FSK
 Symbol expression :

s1 (t ) = cos(2πf1t )
2 Eb
‘1’ →
Tb

s2 (t ) = cos(2πf 2t )
2 Eb
‘0’ →
Tb
 0 ≤ t < Tb, Tb : bit duration
 Eb : transmitted signal energy per bit

Eb = ∫ s (t ) dt = ∫ s22 (t ) dt
Tb Tb
2
1
0 0

 fi : transmitted frequency with separation Δf =f1 – f2

 Δf is selected so that s1(t) and s2(t) are orthogonal.
16
 BFSK: Signal Space Representation

 BFSK has two orthonormal basis functions to

represent s1(t) and s2(t).

φ1 (t ) = cos(2πf1t )
2
Tb

φ2 (t ) = cos(2πf 2t )
2
Tb

 Signal space representation

s1 (t ) = Eb φ1 (t ) ; s1 = [ E 0]
b

s2 (t ) = Eb φ2 (t ) ; s2 = [0 E ]
b

17
 BFSK : Decision Regions
 The receiver decides in favor of s1 if the received signal point
represented by the observation vector r falls inside region R1. This
occurs when r1 > r2.
 When r1 < r2 , r falls inside region R2 and the receiver decides in favor
of s2.

18
 BFSK : Probability of Error

 In case of two signals are equally likely to be transmitted, the average

probability of error for coherent binary FSK is :

 Eb 
Pe = Q  → 3 dB worse than BPSK

 N0 

 To achieve the same Pe, BFSK needs 3dB more transmission

power than BPSK.

19
 BFSK : Transmitter & Receiver

Binary
Transmitter wave φ1 (t ) =
2
cos(2πf1t ) +
Binary FSK
Tb
∑ wave
+
Inverter

φ2 (t ) = cos(2πf 2t )
2
Tb

Receiver
Tb r1(t)
∫
0
dt
+ choose 1 if y > 0
r(t) φ1 (t ) y Decision
∑ Device
Tb - choose 0 otherwise
∫
0
dt
r2(t)
φ2 (t )
20
 Binary ASK
 Symbol expression :
‘1’ → s1 (t ) = 2 E cos(2πf c t )
Tb
‘0’ → s2(t) = 0 ; 0 ≤ t< Tb

 Average energy per bit : E+0

Eb = ⇒ E = 2 Eb
2
Region R1 Region R1
s2 s1
d12 = 2 Eb

0 ϕ1(t)
2 Eb 2 Eb
2 21
 BASK : Probability of Error

 The average probability of error is :

 Eb 
Pe = Q 
N 
 0 

22
 Non-Coherent Detection

 Coherent modulation schemes, .e.g. BPSK, BFSK, BASK, needs

coherent detection, assuming that the receiver is able to detect and
track the carrier wave’s phase.
 In many practical situations, strict phase synchronization is not
possible. In these situations, non-coherent reception is required.

23
 BFSK : Non-Coherent Scheme
 The average probability of error is : 1  Eb 
Pe = exp − 
2  2N0 
 Non-coherent receiver structure :

24
 Differential PSK (DPSK)
 DPSK can be viewed as the non-coherent version of PSK which does
not require a reference in phase with the receiver carrier.
 Phase synchronization is eliminated using differential encoding.
 Encoding the information in phase difference between successive

signal transmission.
 In effect: to send “0”, we phase advance the current signal

waveform by 180°. To send “1” the phase left unchanged.

 The differential encoding process starts with an arbitrary first bit,

serving as reference.

25
 Differential PSK (DPSK)
 DPSK signal generation :
The reference bit is chosen arbitrary, here taken as 1.

26
 Differential PSK (DPSK)
 DPSK transmitter
Input binary
sequence
{mi}

 DPSK differential detection

27
Summary of Pe for Different
Binary Modulation

28
 Problems
1. Find the bit error probability for a BPSK system with a bit rate 1
Mbit/s. The received waveforms s1(t)=A cos ω0t and s2(t)=-A cos ω0t,
are coherently detected with a matched filter. The value of A is 10 mV.
Assume thaht the single sided noise power spectral density is N0 = 10-11
W/Hz and that signal power and energy per bit are normalized relative
to a 1-Ω load.
2. Binary data are transmitted over a microwave link at the rate of 106
bits/sec and the PSD of the noise at the receiver input is 10-10
watts/Hz.
a) Find the average carrier power required to maintain an average
probability of error Pe ≤ 10-4 for coherent binary FSK.
b) Repeat the calculation in a) for noncoherent binary FSK
29
 Problems
Answer :
1.
2 Eb 1
A= = 10 − 2 V ; Tb = = 10 −6 s
Tb R
A2Tb
Eb = = 5 ×10 −11 J
2
2 Eb
= 3,16
N0
 2 Eb 
Pe = Q  = Q(3,16) = 8 ×10 − 4

 N0 

30
 Problems
2. a)

31
 M-ary Modulation Techniques
 In binary data transmission, only one of two possible signals during
each bit interval Tb is sent. In contrast, M-ary data transmission, send
one of M possible signals during each signaling interval T.
 In almost all applications, M = 2n and T = nTb, where n is an integer.
Each of the M signals is called a symbol.
 These signals are generated by changing the amplitude, phase or
frequency of a carrier in M discrete steps. Thus, we have M-ary ASK,
M-ary PSK, and M-ary FSK digital modulation schemes. Binary is a
special case of M-ary
 Another way of generating M-ary signals is to combine different
methods of modulation into hybrid forms. For example, we may
combine discrete changes in both the amplitude and phase of a carrier
to produce M-ary amplitude phase keying. A special form of this
hybrid modulation is M-ary QAM (M-QAM)
32
 M-PSK
 The phase of the carrier takes on M possible values:
θm = 2π(m-1)/M , m = 1, …, M
 Signal set :

 2π (m − 1)  Es : energy per symbol

( )
sm t =
2 Es
cos 2πf c t +  fc >> 1/T
T  M m = 1,…,M
0 ≤ t< T
 Basis functions :

φ1 (t ) = cos(2πf c t )
2
T 0 ≤ t< T
φ2 (t ) = sin (2πf c t )
2
T
33
 M-PSK : signal space representation

  2π (m − 1)   2π (m − 1) 
sm =  Es cos  Es sin   m = 1,…,M
  M   M 
34
M-PSK : signal constellations

35
 M-PSK : Probability of error
 The Euclidean distance between any two signal points in the
constellation is :  2π (m − n ) 
d mn = sm − sn = 2 Es 1 − cos 
 M 
 The minimum Euclidean distance plays an important role in
determining error performance. dmin is :
 2π  π
d min = 2 Es 1 − cos  = 2 Es sin
 M M
 An approximation to the symbol error probability is :
 d min / 2 
PMPSK ≈ 2Q  = 2Q 2 Es sin π 
 N /2   M
 0 
36
 QPSK
 Transmitted signal :
 π m = 1,…,M
sm (t ) = ( )
2 Es
cos 2πf c t + 2m − 1  0 ≤ t< T
T  4

 Basis functions :

φ1 (t ) = cos(2πf c t )
2
T 0 ≤ t< T
φ2 (t ) = sin (2πf c t )
2
T

37
 M-QAM
 Signal set :
E0 : energy of the signal with
si (t ) = ai cos(2πf c t ) + bi sin (2πf c t )
2 E0 2 E0
the lowest amplitude
T T ai, bi are a pair of independent
integers
 Basis functions : 0 ≤ t< T
φ1 (t ) = cos(2πf c t )
2
T 0 ≤ t< T
φ2 (t ) = sin (2πf c t )
2
T
 Signal space representation :

si = [ E0 ai E0 bi ]
38
 M-QAM

 It can be shown that the symbol

error probability of M-QAM is
tightly upper bounded as :

 3kEb 
Pe ≤ 4Q 
 (M − 1)N 0 

For M = 2k

Signal contellation

39
 M-FSK or Multitone Signaling
 Signal set :
m = 1,…,M
sm (t ) = cos {2π ( f c + (m − 1) ∆f )t}
2 Es
0 ≤ t< T
T Δf = fm – fm-1, with
fm =fc + m Δf
 Basis functions :
cos 2π ( f c + m∆f )t
2
φm =
T

 Pe is found by integrating conditional probability of error over the

decision region.
 Difficult for multi-dimensions.

 Can be simplified using union bound.

 Pe depends only on the distance profile of signal constellation.

40
 Comparison of M-Ary
Modulation
 Channel bandwidth and transmit power are two primary
communication resources and have to be used as efficient as possible.
 Power utilization efficiency (energy efficiency): measured by the

required Eb/N0 to achieve a certain bit error probability.

 Spectrum utilization efficiency (bandwidth efficiency): measured by

the achievable data rate per unit bandwidth Rb/B.

 It is always desired to maximize bandwidth efficiency at a minimal
required Eb/N0.

41
 Energy Efficiency Comparison
 MFSK:
 At fixed Eb/N0, increase M can provide an improvement on Pe.

 At fixed Pe, increase M can provide a reduction in the Eb/N0

requirement

 MPSK
 BPSK and QPSK have the same energy efficiency.

 At fixed Eb/N0, increase M degrades Pb.

 At fixed Pb, increase M increases the Eb/N0 requirement.

42
Energy Efficiency Comparison

43
Bandwidth Efficiency
Comparison

44
Bandwidth Efficiency
Comparison

45
Bandwidth Efficiency
Comparison

46
 Reference

 B. Sklar, Digital Communications : Fundamental and Applications,

2th edition, New Jersey : Prentice Hall P T R

47