Digital Modulation Techniques

DIGITAL MODULATION
TECHNIQUES
Digital Modulation Formats
Modulation is defined as the process by which
some characteristic of a carrier is varied in
accordance with a modulating wave
With a sinusoidal carrier, the feature that is
used by the modulator to distinguish one
signal from another is a step change in
amplitude, frequency, or phase of the carrier
The result of this modulation process is
Amplitude-shift keying (ASK)
Frequency-shift keying (FSK)
Phase-shift keying (PSK)
FSK
PSK
ASK
cc cch iu ch khc
QPSK
MPSK
QAM
The scheme that attains as many of the
following design goals as possible
Maximum data rate
Minimum probability of symbol error
Minimum transmitted power
Minimum channel bandwidth
Maximum resistance to interfering signals
Minimum circuit complexity
Coherent Binary Modulation
Techniques
Coherent binary PSK
The pair of signal s
1
(t) and s
2
(t), used to represent
binary symbols 1 and 0, respectively, are defined
0 t T
b
and E
b
is the transmitted signal energy per bit
( ) t f
T
E
t s
c
b
b
t 2 cos
2
) (
1
=
( ) ( ) t f
T
E
t f
T
E
t s
c
b
b
c
b
b
t t t 2 cos
2
2 cos
2
) (
2
= + =
Bit 1
Bit 0
Techniques
Coherent binary PSK
The basis function
We may expand the transmitted signal s
1
(t)
and s
2
(t) in terms of
1
(t)
) 2 cos(
2
) (
1
t f
T
t
c
b
t | =
) ( ) (
1 1
t E t s
b
| =
) ( ) (
1 2
t E t s
b
| =
b
T t s s 0
b
T t s s 0
b
T t s s 0
Techniques
Coherent binary PSK
The coordinates of the message point
equal
dt t t s s
b
T
) ( ) (
1
0
1 11
|
}
=
b
E + =
dt t t s s
b
T
) ( ) (
1
0
2 21
|
}
=
b
E =
Techniques
Coherent binary PSK
Techniques
Coherent binary PSK
The probability of symbol error
|
|
.
|
\
|
=
0
2
1
N
E
erfc P
b
e
Pht bit 1, thu c x
1
= sqrt(E
b
)+ n
1
Pht bit 0, thu c x
2
= -sqrt(E
b
)+ n
2
--> tng cht lng, tng cng sut pht
Techniques
Coherent binary PSK
+1 vi bit 1
-1 vi bit 0
Techniques
Coherent binary PSK
Techniques
Coherent binary FSK
In binary FSK system, symbols 1 and 0 are distinguished
from each other by transmitting one of two sinusoidal waves
that differ in frequency by a fixed amount
Where i = 1, 2; symbol 1 is represented by s
1
(t) and symbol 0
by s
2
(t)
E
b
is the transmitted signal energy per bit
Transmitted frequency
( ) t f
T
E
t s
i
b
b
i
t 2 cos
0
2
) (
=
elsewhere
T t
b
s s 0
b
c
i
T
i n
f
+
=
BFSK:
s1 ~ f1
s2 ~ f2
chn fi = nTb
ngha:
- hai hm cos trc giao vi nhau (chng minh)
- f
i
= nT
b
f2 = f0 + 2/Tb
f1 = f
0
+ 1/T
b
Techniques
Coherent binary FSK
The most useful form for the set of
orthonormal basis functions is
( ) t f
T
t
i
b
i
t | 2 cos
0
2
) (
=
elsewhere
T t
b
s s 0
Techniques
Coherent binary FSK
The coefficient s
ij
for i = 1, 2 and j = 1, 2 is
defined
dt t t s s
b
T
j i ij
}
=
0
) ( ) ( |
( ) ( )dt t f
T
t f
T
E
i
b
i
T
b
b
b
t t 2 cos
2
2 cos
2
0
}
=
=
0
b
E
j i
j i
=
=
Techniques
Coherent binary FSK
The two message points are defined by the
signal vectors
11
1
12
0
b
s
E
s
(
(
= =
(
(

s
21
2
22
0
b
s
s
E
(
(
= =
(
(
(

s
Techniques
Coherent binary FSK
Techniques
Coherent binary FSK
Techniques
Coherent binary FSK
Received signal: x(t)=s
i
(t) + n(t), where
n(t)~N(0,N
0
/2)
Let x = [x
1
x
2
]
T
( ) dt t t x x
b
T
) (
1
0
1
|
}
=
( ) dt t t x x
b
T
) (
2
0
2
|
}
=
Techniques
Coherent binary FSK
x1
x2
s2
s1
(1)
(0)
1
2
Techniques
Coherent binary FSK
Define a random variable l whose sample
value l is equal to the difference between
x
1
and x
2
The mean value of l depends on which binary
symbol was transmitted
2 1
x x l =
Techniques
Coherent binary FSK
Assume that s
1
(t) is transmitted:
1
1
2
2
b
x
E n
x
n
(
( +
= =
(
(

x
1 2 1 2 b
l x x E n n = = +
( )
( )
0
~ , 1
b l
l N E N f l =
N0/2 + N0/2
Techniques
Coherent binary FSK
The probability of error of bit 1 is the
probability that the receiver is in favor of 0
( )
(01) 0
e
P P l = <
( )
( )
0
2
0
0
0
| 1
1
exp
2
2
l
b
f l dl
l E
dl
N
N t
=
(
(
=
(
(

}
}
( )
2
0
0
0
1
exp
2
2
b
l E
dl
N
N t

(
(
=
(
(

}
Techniques
Coherent binary FSK
Put
We may rewrite
0
2
b
l E
z
N
=
( )
0
2
2
1
(01) exp
b
e
E N
P z dz
t

=
}
|
|
.
|
\
|
=
0
2 2
1
N
E
erfc
b
= 1/2*erfc( )
d
2*sqrt(N0)
Techniques
Coherent binary FSK
Probability of symbol error
{ } { } { } { }
0
Pr 1 Pr 0 1 Pr 0 Pr 1 0
1
2 2
e
P
E
b
erfc
N
= +
| |
|
=
|
\ .
{ } { }
{ } { }
Pr 0 Pr 1 1/ 2
Pr 0 1 Pr 1 0
= =
=
Techniques
Coherent quadrature-modulation
techniques
The quadrature-carrier multiplexing system
produces a modulated wave described as
s
I
(t) is the in-phase component of the
modulated wave
s
Q
(t) is the quadrature component
( ) ( ) t f t s t f t s t s
c Q c I
t t 2 sin ) ( 2 cos ) ( ) ( =
Techniques
Quadriphase-shift keying (QPSK)
In QPSK, the phase of the carrier takes on one of
four equally space values, such as /4, 3/4, 5/4,
7/4
i = 1, 2, 3, 4; E is the transmitted signal energy per
symbol
T is the symbol duration, and the carrier frequency f
c
equals n
c
/T for some fixed integer n
c
( )
+
=
0
4
1 2 2 cos
2
) (
t
t i t f
T
E
t s
c
i
elsewhere
T t s s 0
00
01
11
10
1
2
Techniques
We may rewrite
( ) ( )
( ) ( )

=
0
2 sin
4
1 2 sin
2

2 cos
4
1 2 cos
2
) (
t f i
T
E
t f i
T
E
t s
c
c
i t
t
t
t
elsewhere
T t s s 0
Techniques
Quadiphase-shift keying (QPSK)
There are only two orhtonormal basis functions,
1
(t) and
2
(t), contained in the expansion of s
i
(t)
T t s s 0
( ) t f
T
t
c
t | 2 cos
2
) (
1
=
( ) t f
T
t
c
t | 2 sin
2
) (
2
=
T t s s 0
Techniques
There are four message points, and the
associated signal vectors are defined by
( )
( )
(
(
(
(
|
.
|
\
|

|
.
|
\
|

=
4
1 2 sin
4
1 2 cos
t
t
i E
i E
i
s
4 , 3 , 2 , 1 = i
Techniques
Quadraphase-shift keying (QPSK)
Techniques
Techniques
Techniques
The received signal, x(t), is defined by
w(t) is the sample function of a white Gaussian
noise process of zero mean and power spectral
density N
0
/2
) ( ) ( ) ( t w t s t x
i
+ =
4 , 3 , 2 , 1
0
=
s s
i
T t
Techniques
The observation vector, x, of a coherent QPSK
receiver has two elements, x
1
and x
2
x
1
and x
2
are sample values of independent Gaussian
random variables with mean values equal to
with common variance equal to N
0
/2
] 4 ) 1 2 cos[( t i E
sin[(2 1) 4] E i t
}
=
T
dt t t x t x
0
1 1
) ( ) ( ) ( |
( )
1
4
1 2 cos w i E +
(
=
t
}
=
T
dt t t x t x
0
2 2
) ( ) ( ) ( |
( )
2
4
1 2 sin w i E +
(
=
t
Techniques
Techniques
The probability of correct detection , P
c
,
equals the conditional probability of joint
event x
1
> 0 and x
2
> 0, given that signal
s
4
(t) was transmitted
Techniques
Since the random variables X
1
and X
2
are
(with sample value x
1
and x
2
, respectively) are
independent, P
c
also equals the product of the
conditional probabilities of the events x
1
> 0
and x
2
> 0, both given s
4
(t) was transmitted
( ) ( )
2
0
2
2
0
0
1
0
2
1
0
0
2
exp
1
2
exp
1
dx
N
E x
N
dx
N
E x
N
P
c
(
(

(
(
=
} }

t t
xc sut ng
Techniques
Let
We may rewrite
z
N
E x
N
E x
=
0
2
0
1
2 2
( )
2
2
2
0
exp
1
|
.
|
\
|
=
}
dz z P
N E
e
b
t
Techniques
Since
We have
( )
|
|
.
|
\
|
=
}
0
2
2
2 2
1
1 exp
1
0
N
E
erfc dz z
N E
b
t
2
0
2 2
1
1
(
(
|
|
.
|
\
|
=
EN
E
erfc P
c
|
|
.
|
\
|
+
|
|
.
|
\
|
=
0
2
0
2 4
1
2
1
N
E
erfc
N
E
erfc
Techniques
The average probability of symbol error for
coherent QPSK is
c e
P P =1
|
|
.
|
\
|
|
|
.
|
\
|
=
0
2
0
2 4
1
2 N
E
erfc
N
E
erfc
Techniques
If E/2N
0
>> 1, the average probability of
symbol error for coherent QPSK as
|
|
.
|
\
|
~
0
2N
E
erfc P
e
E: nng lng ca 1 symbol
Techniques
In QPSK system, there are two bits per
symbol. This mean that the transmitted signal
energy per symbol is twice the signal energy
per bit, that is
We may express the average probability of
symbol error in terms of the ratio E
b
/N
0
b
E E 2 =
|
|
.
|
\
|
~
0
N
E
erfc P
b
e
tc truyn tng gp i
xc sut li bit tng gp i vs PSK
Techniques
Techniques
Techniques
Minimum Shift Keying (MSK)
Consider a continuous-phase frequency-shift keying
(CPFSK) signal, which is defined for the interval 0 t
T, as follows
for symbol 1
for symbol 0
E
b
is the transmitted sinal energy per bit, and T
b
is the
bit duration
| |
| |
+
+
=
) 0 ( 2 cos
2
) 0 ( 2 cos
2
) (
2
1
u t
u t
t f
T
E
t f
T
E
t s
b
b
b
b
Techniques
Minimum shift Keying (MSK)
The phase (0), denoting the value of the
phase at time t = 0, depends on the past
history of the modulation process
The frequencies f
1
and f
2
are sent in
response to binary symbols 1 and 0
appearing at the modulator input,
respectively
Techniques
Signal s(t) may be expressed in the conventional
form of an angle-modulated wave
where (t) is the phase of s(t)
when the phase (t) is a continuous function of time, the
modulated wave s(t) itself is also continuous at all times,
including the inter-bit switching time
| | ) ( 2 cos
2
) ( t t f
T
E
t s
c
b
b
u t + =
Techniques
The nominal carrier frequency f
c
is
chosen as the arithmetic mean of the
two frequencies f
1
and f
2
( )
2 1
2
1
f f f
c
+ =
Techniques
Minimum Shift Keying
The phase (t) of a CPFSK signal increases or
decreases linearly with time during each bit period of
T
b
seconds
The plus sign corresponds to sending symbol 1, and the
minus sign corresponds to sending symbol 0
The parameter is referred to as the deviation ratio,
measured with respect to the bit rate 1/T
b
t
T
h
t
b
t
u u = ) 0 ( ) (
b
T t s s 0
( )
2 1
f f T h
b
=
Techniques
At the time t = T
b
for symbol 1
for symbol 0
=
h
h
T
b
t
t
u u ) 0 ( ) (
Techniques
Techniques
Using a well-known trigonometic identity,
we may express the CPFSK signal s(t) in
terms of its in-phase and quadrature
components as follows
| | ( ) | | ( ) t f t
T
E
t f t
T
E
t s
c
b
b
c
b
b
t u t u 2 sin ) ( sin
2
2 cos ) ( cos
2
) ( =
Techniques
With deviation ratio h =
The plus sign corresponds to symbol 1 and the minus
sign corresponds to symbol 0
A similar result holds for (t) in the interval -T
b
t 0
Since the phase (0) is 0 or , depending on the past
history of the modulation process, in the interval -T
b
t
+T
b
, the polarity of cos[(t)] depends only on (0),
regardless of the sequence of 1s or 0s transmitted before
or after t = 0
t
T
t
b
2
) 0 ( ) (
t
u u =
b
T t s s 0
Techniques
For this time interval -T
b
t +T
b
, the in-phase component,
s
I
(t) consists of a half-cosine pulse defined as follows
the plus sign corresponds to (0) = 0, and minus sign
corresponds to (0) =
| | ) ( cos
2
) ( t
T
E
t s
b
b
u =
| |
2
cos (0) cos
2
2
cos
2
b
b b
b
b b
E
t
T T
E
t
T T
t
u
t
| |
=
|
\ .
| |
=
|
\ .
b b
T t T s s
Techniques
In the interval 0 t 2T
b
, the quadrature component, s
Q
(t),
consists of a half-sine pulse, whose polarity depends only on
(T
b
)
the plus sign corresponds to (T
b
) = /2 and the minus sign
corresponds to (T
b
) = -/2
| | ) ( sin
2
) ( t
T
E
t s
b
b
Q
u =
| |
|
|
.
|
\
|
=
|
|
.
|
\
|
=
t
T T
E
t
T
T
T
E
b b
b
b
b
b
b
2
sin
2
2
sin ) ( sin
2
t
t
u
b
T t 2 0 s s
Techniques
With h = 1/2 , the frequency deviation (i.e., the
difference between the two signaling frequencies
f
1
and f
2
) equals half of bit rate
This is the minimum frequency spacing that allows
the two FSK signals representing symbols 1 and 0,
to be coherently orthogonal in the sense that they
do not interfere with one another in the process of
detection
CPFSK signal with a deviation ratio of one-half is
referred to as minimum-shift keying (MSK)
Techniques
One of four possibilities can arise, as described
The phase (0) = 0 and (T
b
) = /2, corresponding to the
transmission of symbol 1
The phase (0) = and (T
b
) = /2, corresponding to the
The phase (0) = and (T
b
) = - /2 (or, equivalently,
3/2, modulo 2), corresponding to the transmission of
symbol 1
The phase (0) = 0 and (0) = - /2, corresponding to the
Techniques
In MSK signal, the appropriate form for the
orthonormal basis functions
1
(t) and
2
(t) is as
follows
Both
1
(t) and
2
(t) are defined for a period equal to
twice the bit duration
( ) t f t
T T
t
c
b b
t
t
| 2 cos
2
cos
2
) (
1
|
|
.
|
\
|
=
b b
T t T s s
( ) t f t
T T
t
c
b b
t
t
| 2 sin
2
sin
2
) (
2
|
|
.
|
\
|
=
b
T t 2 0 s s
Techniques
Correspondingly, we may express the MSK
signal in the form
The coefficients s
1
and s
2
are related to the
phase states (0) and (T
b
), respectively
) ( ) ( ) (
2 2 1 1
t s t s t s | | + =
b
T t s s 0
Techniques
The in phase component of s(t)
The quadrature component of s(t)
}
=
T
T
b
dt t t s s ) ( ) (
1 1
|
| | ) 0 ( cosu
b
E =
b b
T t T s s
}
=
b
T
dt t t s s
2
0
2 2
) ( ) ( |
| | ) ( sin
b b
T E u =
b
T t 2 0 s s
Techniques
Both integrals are evaluated for a time interval
equal to twice the bit duration, for which
1
(t) and
2
(t) are orthogonal
Both the lower and upper limits of the product
integration used to evaluate the coefficient s
1
are
shifted by T
b
seconds with respect to those used
to evaluate the coefficient s
2
The time interval 0 t T
b
, for which the phase
state (0) and (T
b
) are defined is common to
both integrals
Techniques
Techniques
Techniques
Techniques
In a case of an AWGN channel, the
received signal is given by
s(t) is the transmitted MSK signal, and w(t) is
the sample function of a white Gaussian noise
process of zero mean and power spectral
density N
0
/2
) ( ) ( ) ( t w t s t x + =
Techniques
In order to decide whether symbol 1 or symbol 0
was transmitted in the interval 0 t T
b
, we have
to establish a procedure for the use of x(t) to
detect the phase states (0) and (T
b
)
For optimum detection of (0), we have to
determine the projection of the received signal x(t)
onto the reference signal
1
(t) and
2
(t)
Techniques
dt t t x x
b
b
T
T
) ( ) (
1 1
}
= |
1 1
w s + =
b b
T t T s s
dt t t x x
b
T
) ) (
2
0
2 2
}
= |
2 2
w s + =
b
T t 2 0 s s
Techniques
The average symbol error for the MSK is
given by
|
|
.
|
\
|
|
|
.
|
\
|
=
0
2
0
4
1
N
E
erfc
N
E
erfc P
b b
e
|
|
.
|
\
|
~
0
N
E
erfc P
b
e
Techniques
Techniques
Noncoherent Binary
Modulation Techniques
Noncoherent Orthogonal Modulation
Consider a binary signaling scheme that
involves the use of two orthogonal signal
s
1
(t) and s
2
(t), which have equal energy
During the interval 0 t T, one of these
two signals is sent over an imperfect
channel that shifts the carrier phase by an
unknown amount
Noncoherent Binary
Let g
1
(t) and g
2
(t) denote the phase-shifted
versions of s
1
(t) and s
2
(t), respectively
It is assumed that g
1
(t) and g
2
(t) remain
orthogonal and of equal energy, regardless
of the unknown carrier phase
We refer to such a signaling scheme as
noncoherent orthogonal modulation
Noncoherent Binary
The channel also introduces an AWGN w(t) of zero
mean and power spectral density N
0
/2
We may express the received signal x(t) as
Requirement: x(t) is used to discriminate between s
1
(t) and
s
2
(t) , regardless of the carrier phase
+
+
=
) ( ) (
) ( ) (
) (
2
1
t w t g
t w t g
t x
T t
T t
s s
s s
0
0
Noncoherent Binary
The receiver consists of a pair of filters matched
to the basis function
1
(t) and
2
(t) that are
scaled versions of the transmitted signal s
1
(t) and
s
2
(t), respectively
Because the carrier phase is unknown, the
receiver relies on amplitude as the only possible
discriminant
Accordingly, the matched filter outputs are
envelope detected, sampled, and then compared
with each other.
Noncoherent Binary
Noncoherent Binary
The quadrature receiver itself has two path
In in-phase path, the receiver signal x(t) is correlated
against the basis function
i
(t), representing a scaled
version of the transmitted signal s
1
(t) or s
2
(t) with zero
carrier phase.
In the quadrature path, signal x(t) is correlated against
another basis function , representing the version of
i
(t) that results from shifting the carrier phase by -90
0
Naturally,
i
(t) and are orthogonal to each other
) (
t
i
|
) (
t
i
|
Noncoherent Binary
Noncoherent Binary
The average probability of error for the noncoherent
receiver will be calculated by making use of the equivalence
depicted previous picture
Since the carrier phase is unknown, noise at the output of
each matched filter has two degrees of freedom, namely, in-
phase and quadrature.
Accordingly, the noncoherent receiver has a total of four
noise parameters that are statistical independent and
identically distributed, denoted by x
I1
, x
Q1
, x
I2
, x
Q2
The first two account for degrees of freedom associated with
the upper path
The latter two account for degrees of freedom associated with
the lower path
Noncoherent Binary
Since the receiver has a symmetric structure, the
probability of choosing s
2
(t), given that s
1
(t) was
transmitted, is the same as the probability of
choosing s
1
(t), given that s
2
(t) was transmitted
This means that the average probability of error
may be obtained by transmitting s
1
(t) and
calculating the probability of choosing s
2
(t), or vice
versa
Noncoherent Binary
Suppose that signal s
1
(t) is transmitted for
the interval 0 t T, an error occurs if the
receiver noise w(t) is such that the output
l
2
is greater than the output l
1
The receiver makes a decision in favor of
s
2
(t) rather than s
1
(t)
Noncoherent Binary
To calculate the probability of error, we must have
the probability density function of the random
variable L
2
(represented by sample value l
2
).
Since the filter in the lower path is matched to
s
2
(t), and s
2
(t) is orthogonal to the transmitted
signal s
1
(t), it follows that the output of this
matched filter is due to noise alone.
Noncoherent Binary
Let x
I2
and x
Q2
denote the in-phase and
quadrature components of the matched filter
output in the lower path
For i = 2
2
2
2
2 2 Q I
x x l + =
Noncoherent Binary
Let
2
2
2
2 2
1
exp
( ) 2 2
0
D
d
d
f d t
| |
|
=
\ .
2
0 d
elsewhere
>
2
2
0
/ 2
L
D
N
=
Noncoherent Binary
Since the filter in the path is matched to s
1
(t),
and it is assumed that s
1
(t) is transmitted, it
follows that l
1
is due to signal plus noise
Let x
i1
and x
Q1
denote the components at the
output of the matched filter (in the upper
path) that are in-phase and quadrature to the
received signal
2 2
1 1 1 I Q
l x x = +
Noncoherent Binary
X
I1
= \ E cosu+ n
I1
represented by sample
value x
I1
is Gaussian distributed with mean
\ E cos u and variance N
0
/2, where E is the
signal energy per symbol
X
Q1
= \ E sinu+ n
Q1
represented by
sample x
Q1
is Gaussian distributed with \ E
sinu and variance N
0
/2
Noncoherent Binary
Let
2
1
1 0 1
1 1 0 0
1 2 2
exp
( ) 2 2
0
D
d E E
d I d
f d N N t
| | | |

+
| |
`
| |
=

)
\ . \ .
1
0 d
elsewhere
>
1
1
0
/ 2
L
D
N
=
I
0
(x) is the modified Bessel function of zeroth order.
Noncoherent Binary
Probability of a correct decision is the
probability that D
1
>D
2
:
{ } { } ( )
1 2 1 2 1 1 1 1
0
Pr Pr
c D
P D D D D D f d dd
= > = >
}
{ } ( )
1 2
1
1 2 1 2 2 2
0
Pr 1 exp
2
d
D
d
D D D f d dd
| |
> = =
|
\ .
}
0
1
1 exp
2 2
c
E
P
N
| |
=
|
\ .
Noncoherent Binary
Accordingly
0
1
1 exp
2 2
e c
E
P P
N
| |
= =
|
\ .
Noncoherent Binary
Noncoherent Binary FSK
In the case of binary FSK
( )
=
0
2 cos
2
) (
t f
T
E
t s
i
b
b
i
t
b
T t s s 0
Noncoherent Binary
Noncoherent Binary
Noncoherent Binary FSK
The noncoherent binary FSK described is a
special case of noncoherent orthogonal
modulation with
The probability of error
b
T T =
b
E E =
|
|
.
|
\
|
=
0
2
exp
2
1
N
E
P
b
e
Noncoherent Binary
Differential Phase-shift Keying (DPSK)
DPSK eliminates the need for a coherent reference
signal at the receiver by combining two basic
operations at the transmitter
Differential encoding of the input binary wave
Phase-shift keying
In effect, to send symbol 0 we phase advance the
current signal waveform by 180
0
, and to send
symbol 1 we leave the phase of the current signal
waveform unchanged
Noncoherent Binary
Noncoherent Binary
The differential encoding process at the transmitter
input starts with an arbitrary first bit, serving as
reference, and thereafter the differentially encoded
sequence {d
k
} is generated by
b
k
is the input binary digit at time KT
b
d
k-1
is the previous value of the differentially encoded bit
k k k k k
b d b d d
1 1
+ =
Noncoherent Binary
Noncoherent Binary
The receiver is equipped with a storage capability,
so that it can measure the relative phase
difference between the waveforms received during
two successive bit intervals
Assumed that the unknown phase contained in
the received wave varies slowly (that is, slow
enough for it to be considered essentially constant
over two bit intervals), the phase difference
between waveforms received in two successive bit
intervals will be independent of
Noncoherent Binary
Noncoherent Binary
Let s
1
(t) denote the transmitted DPSK signal in the
case of symbol 1 at the transmitter input
( )
( )
1
cos 2
2
( )
cos 2
2
b
c
b
b
c
b
E
f t
T
s t
E
f t
T
t
t
b b
b
T t T
T t
2
0
s s
s s
Noncoherent Binary
Let s
2
(t) denote the transmitted DPSK signal in the
case symbol 0 at the transmitter input
( )
( )
2
cos 2
2
( )
cos 2
2
b
c
b
b
c
b
E
f t
T
s t
E
f t
T
t
t t
b b
b
T t T
T t
2
0
s s
s s
Noncoherent Binary
s
1
(t) and s
2
(t) are orthogonal over the two-
bit interval 0 t 2T
b
DPSK is a special case of noncoherent
orthogonal modulation with
b
T T 2 =
b
E E 2 =
Noncoherent Binary
The probability of symbol error
|
|
.
|
\
|
=
0
exp
2
1
N
E
P
b
e
M-Ary Modulation Techniques
In M-ary signaling scheme, we may send one
of M possible signals, s
1
(t), s
2
(t), , s
M
(t),
during each signaling interval of duration T
In almost applications M = 2
n
The symbol duration T = nT
b
These signals are generated by changing
amplitude, phase, or frequency of a carrier in
M discrete steps. Thus we have:
M-ary ASK
M-ary PSK
M-ary FSK
M-ary PSK
In M-ary PSK, the phase of the carrier takes one
of M possible values,
i
= 2i/M, where i = 0, 1, ,
M-1
Accordingly, during each signaling interval of
duration T, one of possible signals
E is the signal energy per symbol
Carrier frequency f
c
= n
c
/T for some fixed integer n
c
|
.
|
\
|
+ =
M
i
t f
T
E
t s
c i
t
t
2
2 cos
2
) (
1 ,... 1 , 0 = M i
M-ary PSK
Each s
i
(t) may be expanded in terms of two
basis function
) 2 cos(
2
) (
1
t f
T
t
c
t | =
) 2 sin(
2
) (
2
t f
T
t
c
t | =
T t s s 0
T t s s 0
M-ary PSK
The signal constellation of M-ary PSK is
two dimensional.
The M message points are equally spaced
on a circle of radius , and center at the
origin
E
M-ary PSK
M-ary PSK
The optimum receiver for coherent M-ary PSK
includes a pair of correlators with reference
signals in phase quadrature
The two correlators outputs, denoted as x
I
and x
Q
,
are fed into a phase discriminator that first
computes the phase estimate
The phase discriminator then selects from the set
{s
i
(t), i = 0, , M-1} that particular signal whose
phase is closet to the estimate
|
|
.
|
\
|
=
I
Q
x
x
1
tan
u
u

M-ary PSK
M-ary PSK
In the presence of noise, the decision-making
process in the phase discriminator is based on the
noisy input
Where w
I
and w
Q
are samples of two independent
Gaussian random variables W
I
and W
Q
whose is mean
zero and common variance equals N
0
/2
I I
w
M
i
E x +
|
.
|
\
|
=
t 2
cos
Q Q
w
M
i
E x +
|
.
|
\
|
=
t 2
sin
1 ,... 1 , 0 = M i
1 ,... 1 , 0 = M i
M-ary PSK
The message points exhibit circular
symmetry
Both random variables W
I
and W
Q
have a
symmetric probability density function
The average probability of symbol error P
e
is independent of the particular signal s
i
(t)
is transmitted
M-ary PSK
We may simplify the calculation of P
e
by
setting
i
= 0, which corresponds to the
message point whose coordinates along
the
1
(t)- and
2
(t)-axes are and 0,
respectively
The decision region pertaining to this
message point is bounded by the threshold
below the
1
(t)-axis and the
threshold above the
1
(t)-axis
E
M t u =
M t u + =

M-ary PSK
The probability of correct reception is
is the probability density function of the
random variable whose sample value equals the
phase discriminator output produced in
response to a received signal that consists of the
signal s
0
(t) plus AWGN
}
O
=
M
M
c
d f P
t
t
u u

)
(
)
(u
O
f
O
u
|
|
.
|
\
|
+
=

I
Q
W E
W
1
tan
u
M-ary PSK
The probability density function has a
known value. Especially, for we
may write
)
(u
O
f
t u t s s
( )
(
|
|
.
|
\
|
|
|
.
|
\
|
+
|
|
.
|
\
|
=
O
u u u
t t
u
cos
2
1
1
sin exp
cos exp
2
1
0
2
0 0 0
N
E
erfc
N
E
N
E
N
E
f
M-ary PSK
A decision error is made if the angle
falls outside
u
M M t u t + s s

c e
P P =1
}
O
=
M
M
d f
t
t
u u

)
( 1
M-ary PSK
For large M and high values of E/N
0
, we
may derive an approximate formula for P
e
For high values of E/N
0
and for , we
may use the approximation
2
t u <
|
|
.
|
\
|
~
|
|
.
|
\
|
u
u
t
u
cos exp
cos
1
cos
2
0
0
0
N
E
E
N
N
E
erfc
M-ary PSK
We get
|
|
.
|
\
|
~
O
u u
t
u
sin exp
cos )
(
2
0 0
N
E
N
E
f
2
t
u <
}
|
|
.
|
\
|
~
M
M
e
d
N
E
N
E
P
t
t
u u u
t

sin exp
cos 1
2
0 0
|
|
.
|
\
|
|
.
|
\
|
=
M N
E
erfc
t
sin
0
M-ary PSK
M-ary QAM
In an M-ary PSK system, in-phase and quadrature
components of the modulated signal are
interrelated in such a way that the envelope is
constrained to remain constant. This constraint
manifests itself in a circular constellation for the
message points
However, if this constraint is removed, and the in-
phase and quadrature components are thereby
permitted to be independent, we get a new
modulation scheme called M-ary quadrature
amplitude modulation (QAM)
M-ary QAM
The signal
constellation for
M-ary QAM
consists of a
square lattice of
message points.
M-ary QAM
The corresponding
signal constellations
the in-phase and
quadrature
components of the
amplitude phase
modulated wave are
shown
M-ary QAM
The general form of M-ary QAM is defined
by the transmitted signal
E
0
is the energy of the signal with the lowest
amplitude
a
i
and b
i
are a pair of independent integers
chosen in accordance with the location of the
pertinent message point
( ) ( )
0 0
2 2
( ) cos 2 sin 2
i i c i c
E E
s t a f t b f t
T T
t t = + T t s s 0
M-ary QAM
The signal s
i
(t) can be expanded in terms
of a pair of basis functions
) 2 cos(
2
) (
1
t f
T
t
c
t | =
) 2 sin(
2
) (
2
t f
T
t
c
t | =
T t s s 0
T t s s 0
M-ary QAM
The coordinates of the ith message point
are and , where (a
i
, b
i
) is an
element of the L-by-L matrix ( )
E a
i
E b
i
{ }
(
(
(
(
+ + + + +
+ +
+ +
=
) 1 , 1 ( ) 1 , 3 ( ) 1 , 1 (
) 3 , 1 ( ) 3 , 3 ( ) 3 , 1 (
) 1 , 1 ( ) 1 , 3 ( ) 1 , 1 (
,
L L L L L L
L L L L L L
L L L L L L
b a
i i
M L =
M-ary QAM
For example, for the 16-QAM whose signal
constellation is
{ }
( ) ( ) ( ) ( )
( ) ( ) ( ) ( )
( ) ( ) ( ) ( )
( ) ( ) ( ) ( )
(
(
(
(

=
3 , 3 3 , 1 3 , 1 3 , 3
1 , 3 1 , 1 1 , 1 1 , 3
1 , 3 1 , 1 1 , 1 1 , 3
3 , 3 3 , 1 3 , 1 3 , 3
,
i i
b a
M-ary QAM
M-ary QAM
Since the in-phase and quadrature
components of M-ary QAM are
independent, the probability of correct
detection for such a scheme may be
written as
Where is the probability of symbol error for
either component
( )
2
'
1
e c
P P =
'
e
P
M-ary QAM
The signal constellation for the in-phase or
quadrature component has a geometry
similar to that for discrete pulse-amplitude
modulation (PAM) with a corresponding
number of amplitude levels
We may write
|
|
.
|
\
|
|
.
|
\
|
=
0
0
'
1
1
N
E
erfc
L
P
e
M-ary QAM
The probability of symbol error for M-ary
QAM is given
where it is assumed that
c e
P P =1
( )
'
2
'
2
1 1
e
e
P
P
~
=
1
'
<<
e
P
M-ary QAM
The probability of symbol error for M-ary
QAM may be written
|
|
.
|
\
|
|
.
|
\
|
~
0
0
1
1 2
N
E
erfc
M
P
e
M-ary QAM
The transmitted energy in M-ary QAM is variable
in that its instantaneous value depends on the
particular symbol transmitted
It is logical to express P
e
in terms of the average
value of the transmitted energy rather than E
0
Assuming that the L amplitude levels of the in-
phase or quadrature component are equally likely,
we have
( )
(
=

=
2
1
2
0
1 2
2
2
L
i
av
i
L
E
E
M-ary QAM
The limits of the summation take account
of the symmetric nature of the pertinent
amplitude levels around zero
We get
( )
3
1 2
0
2
E L
E
av

=
( )
3
1 2
0
E M
=
M-ary QAM
Accordingly, we may rewrite probability of
symbol error in terms of E
av
|
|
.
|
\
|
|
.
|
\
|
~
0
) 1 ( 2
3 1
1 2
N M
E
erfc
M
P
av
e
M-ary QAM
M-ary FSK
In an M-ary FSK scheme, the transmitted signals
are defined by
i = 1, 2, , M
The carrier frequency f
c
= n
c
/2T for some fixed integer n
c
The transmitted signals are of equal duration T and have
equal energy E
( )
(
+ = t i n
T T
E
t s
c i
t
cos
2
) ( T t s s 0
M-ary FSK
Since the individual signal frequencies are
separated by 1/2T Hz, the signals are
orthogonal
0 ) ( ) (
0
=
}
dt t s t s
j
T
i
M-ary FSK
For coherent M-ary FSK, the optimum
receiver consists of a bank of M correlators
or matched filters
At the sampling time t = kT, the receiver
makes decisions based on the largest
matched filter output
M-ary FSK
An upper bound for the probability of
symbol error
For fixed M, this bound becomes increasingly
tight as E/N
0
is increased
For M = 2, the bound becomes an equality
|
|
.
|
\
|
s
0
2
) 1 (
2
1
N
E
erfc M P
e
M-ary FSK
The probability of symbol error for
noncoherent of M-ary FSK is given
The upper bound on the probability of
symbol error for noncoherent detection of
M-ary FSK
( )
|
|
.
|
\
|
+
|
|
.
|
\
|
=
+
0
1
1
1
1
exp
1
1
) 1 (
N k
kE
k
M
k
P
M
k
k
e
|
|
.
|
\
|
s
0
2
exp
2
1
N
E M
P
e
Power spectra
The description of a band-pass signal s(t)
contains the definitions of ASK, PSK, and
FSK signals, depending on the way in
which the in-phase component s
I
(t) and the
quadrature component s
Q
(t) are defined
Power Spectra
We may express s(t) in the form
Where Re[.] is real part of the expression
contained inside the bracket
) 2 sin( ) ( ) 2 cos( ) ( ) ( t f t s t f t s t s
c Q c I
t t =
( ) | | t f j t s
c
t 2 exp ) (
~
Re =
Power Spectra
We also have
The signal is called the complex envelope of the
band-pass signal s(t)
The components s
I
(t) and s
Q
(t) and therefore
are all low-pass signal
) ( ) ( ) (
~
t js t s t s
Q I
+ =
( ) ( ) t f j t f t f j
c c c
t t t 2 sin 2 cos ) 2 exp( + =
) (
~
t s
) (
~
t s
Power Spectra
Let S
B
(f) denote the baseband power
spectral density of complex envelope
We refer to S
B
(f) as the baseband power
spectral density
The power spectral density, S
S
(f), of the
original band-pass signal s(t) is a
frequency-shifted version of S
B
(f), except
for a scaling factor
) (
~
t s
| | ) ( ) (
4
1
) (
c B c B S
f f S f f S f S + + =
Power Spectra of Binary PSK
Baseband power spectral density of binary
PSK wave equals
Power spectra of binary PSK
( )
) ( sin 2
) ( sin 2
) (
2
2
2
f T c E
f T
f T E
f S
b b
b
b b
B
= =
t
t
Power spectra of binary FSK
The power spectral densities of S
B
(f) is
given
The power spectral density of binary FSK
( )
2
2 2 2
2
1 4
) ( cos 8
2
1
2
1
2
) (
+
(
|
|
.
|
\
|
+ +
|
|
.
|
\
|
=
f T
f T E
T
f
T
f
T
E
f S
b
b b
b b b
b
B
t
t
o o
Power Spectra of QPSK
The baseband power spectral density of
QPSK signal
The power spectral density of QPSK signal
) 2 ( sin 4 ) ( sin 2 ) (
2 2
f T c E Tf c E f S
b b B
= =
Power spectra of MSK signal
The baseband power spectral density of
MSK signal
The power spectral density of MSK signal
( )
( )
2
2 2
2
1 16
2 cos 32
2
) (
2 ) (
(
(
=
(
+
=
f T
f T E
T
f
f s
b
b b
b
g
B
t
t
Power spectra of M-ary signal
Binary PSK and QPSK are special cases of
M-ary PSK signals
The symbol duration of M-ary PSK is
defined by
Where T
b
is the bit duration
M T T
b 2
log =
Power spectra of M-ary PSK
The baseband power spectral density of M-
ary PSK signal is given by
) ( sin 2 ) (
2
Tf c E f S
B
=
) log ( sin log 2
2
2
2
M f T c M E
b b
=
The spectral analysis of M-ary FSK signals is
much more complicated than that of M-ary
PSK
A case of particular interest occurs when the
frequencies assigned to the multilevels make
the frequency spacing uniform and the
frequency deviation k= 0.5
That is, the M signal frequencies are
separated by 1/2T, where T is symbol
duration
Power spectra of M-ary FSK
For k = 0.5, the baseband power spectral
density of M-ary FSK signals is defined by
( )
(
(
|
|
.
|
\
|
|
|
.
|
\
|
+ +
|
|
.
|
\
|
=

= = =
M
i
M
i
M
j
j
j
j i
i
i
b B
i
i
M M
E f S
1 1 1
2
2
2
sin
sin
cos
1 sin
2
1
4 ) (
) 1 ( 2
4
4
+ =
|
.
|
\
|
=
M i
b
fT
i
i
i
o
t
o
M i ,..., 2 , 1 =
Power spectra of M-ary FSK
Bandwidth efficiency
Bandwidth efficiency is defined as the ratio of data
rate to channel bandwidth; it is measured in units
of bits per second per hertz
Bandwidth efficiency is also referred to as spectral
efficiency
With the data rate denoted by R
b
and the channel
bandwidth by B, we may express the bandwidth
efficiency, , as
B
R
b
=

Bandwidth efficiency of M-ary PSK
The channel bandwidth required to pass M-
ary PSK signals (more precisely, the main
spectral lobe of M-ary PSK signals) is given
where T is the symbol duration
T
B
2
=
Since
Channel bandwidth
Channel efficiency of M-ary PSK signals is
M T T
b 2
log =
M
R
B
b
2
log
2
=
2
log
2
M
B
R
b
= =
Bandwidth efficiency of M-ary FSK
Channel bandwidth required to transmit M-ary FSK
signals as
Channel bandwidth of M-ary FSK signals is
Bandwidth efficiency of M-ary FSK signals is
T
M
B
2
=
M
M R
B
b
2
log 2
=
M
M
B
R
b 2
log 2
= =
Bandwidth efficiency of M-ary FSK
Bit versus symbol error probabilities
Thus far, the only figure of merit we have used to
assess the noise performance of digital
modulation schemes has been the average
probability of symbol error
When the requirement is to transmit binary data,
it is often more meaningful to use another figure
of merit called the probability of bit error or bit
error rate (BER)
Case 1:
The mapping from binary to M-ary symbols is performed in
such a way that the two binary M-tuples corresponding to any
pair of adjacent symbols in the M-ary modulation scheme differ
in only one bit position (Gray code)
When the probability of symbol error P
e
is acceptably small, we
find that the probability of mistaking one symbol for either of
the two nearest (in-phase) symbols is much greater than any
other kind of symbol error
Moreover, given a symbol error, the most probable number of
bit errors is one, subject to the aforementioned mapping
constraint
Case 1
Since there are log
2
M bits per symbol, it follows that the
bit error rate is related to the probability of symbol error
by a formula
M
p
BER
e
2
log
=
2 > M
Case 2:
We assume that all symbol errors are equally likely and
occur with probability
where P
e
is the average probability of symbol error
K = log
2
M
1 2 1
=
K
e e
P
M
P
Case 2:
There are ways in which k bits out of K may be in
error
The average number of bit errors per K-bit symbol is
given by
|
|
.
|
\
|
k
K
e
K
K
K
k
K
e
K
k
KP
P
k
1 2
2
1 2
) (
1
1

=

Case 2
The bit error rate is obtained by dividing the result by K
e
K
K
P BER
1 2
1
2
=

e
P
M
M
BER
|
|
|
|
.
|
\
|
=
1
2

Digital Modulation Techniques

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Digital Modulation Techniques

Hochgeladen von

Copyright:

Verfügbare Formate

DIGITAL MODULATION

M-Ary Modulation Techniques

M-Ary Modulation Techniques

M-Ary Modulation Techniques

M-Ary Modulation Techniques

Das könnte Ihnen auch gefallen