Performance Analysis of

Optimum Receiver
Average Probability of Error
BPSK
cont
cont
cont
cont
cont
Binary Coherent FSK
cont
cont
cont
FSK is approximately 3dB worse than BPSK
Binary Coherent ASK
P 4
cont
cont
QPSK
cont
Decision regions
cont
45 degree rotation
cont
cont
cont
cont
Conclusions
Union Bound
cont
cont
Illustrating the Union Bound
Pairwise Error Probability
cont
cont
Union Bound
For example: QPSK
cont
M-ary PSK
T
sin
cont
cont
Contd.
( )
2
0 0
2 2 log
2 sin 2 sin
s b
s
E E M
P e Q Q
N M N M
t t
| | | |
| | | |
~ =
| |
| |
| |
\ . \ .
\ . \ .
cont
M-ary Orthogonal Signaling
cont
3-ary orthogonal signal space
cont assume equally likely M-ary
symbols a priori
1 2 1 2
{1,2,..., )
( , ,..., ) ( , ,..., )
Optimal decision rule
argmax
M M
m M m
r r r s w w w
r
e
= +
cont assume equally likely
symbols a priori
( ) ( ) ( ) ( )
( ) ( )
( )
( )
1 1
1 1
1 1
1 2 1 3 1 1 1 1 1
2
2 3 1 1
0
0
2
1
2
0
1 1
(symmetry)
1 , ,..., ,
1
, ,..., exp
1
exp
M M
s m
m m
M r s
s
M
M
s
i
i
P e P e s P e s P e s
M M
P e s P n r n r n r r x s f x s dx
x E
P n x n x n x r x dx
N
N
x E
P n x r x
N
t
t
= =

= = =
= < < < = (

(

(
= < < < = (

(
(

= < = (


}
}
[
}
( )
0
2
1
0
0 0
1
1 exp
/ 2
M
s
dx
N
x E
x
Q dx
N
N N t

(
(
(
(

(
(
| |
(
= ( |
( |
(
\ .

(

}
cont union bound
( ) ( )
( )
( )
2
0 0
2
2 2
2
log
1 ( 1)
1
Also, let us learn exp , 0
2 2
1 1 1
1 exp exp , 0 (Gallager Problem 10.4)
2 2
2 2
s b
s
E E M
P e M Q M Q
N N
x
Q x x
x x
Q x x
x
x x t t
| | | |
s =
| |
| |
\ . \ .
(
s >
(

( (
| |
s s >
| ( (
\ .

cont
cont
Performance improves as M increases (??)
In the limit (M), error probability can be
made arbitrarily small as long as E
b
/N
0
> ln2
(-1.59 dB).
Information Theory also proves that we cannot
achieve error probability arbitrarily small if E
b
/N
0

< ln2.
Most practical systems use non-coherent FSK
rather than coherent FSK.
Biorthogonal Signaling
cont
6-ary biorthogonal signal constellation
Simplex Signaling
The centroid of an orthogonal constellation is located at:
, ,...,
More enegy-efficient signal contellation can be achieved by moving
the centroid to the origin.
, 1, 2
s s s
m m
E E E
c
M M M
s s c m
| |
=
|
|
\ .
'
= = ,...,
Identical probability of error,
M
M
P
cont
3-ary simplex signal constellation
cont
M-ary QAM
16-ary QAM
cont
cont
Symbol Error Rate (SER)
Bit Error Rate (BER) or BEP
(SEP, symbol error probability)
| |
| |
| |
| |
2
,
1 1,
2
,
#bit errors per symbol
( ) #bit errors per bit
#bits per symbol
#bit errors per symbol

log
1

log
where is the number of bits that differ betwee
b
M M
i i j j i
i j j i
i j
E
P e E
E
M
P s n P s s
M
n
= = =
= =
=
( =


,
1 1,
2
,
,
1 1,
2
0
n symbols and .
For equally likely symbols a priori,
1 1
( )
log
1 1
(union bound)
log
2
i j
M M
b i j j i
i j j i
M M
i j
i j
i j j i
s s
P e n P s s
M M
d
n Q
M M
N
= = =
= = =
( =

| |
s |
|
\ .


Orthogonal signaling BEP
k bits, M=2
k
,

each bit error pattern corresponds to a unique symbol,
which is not the transmitted.

e e e
( )
1
In orthogoanl siganling, 1 kinds of symbol error are equally likely, so
Probability of a particular bit error pattern is .
1 2 1
# of bit errors per symbol
1 1

2 1
M M
k
k
M
k
n
M
P P
M
E
BEP
k
k
P
n
n k k
=

=

=
| |
= =
|

\ .

( )
1
1
2
2
2 1 2 1 2
k
k
M M M
k k
P P P
k

=

8-ary PSK
Gray Coding
Gray-coded MPSK
,
1 1,
2
1
2 2
The most probable errorr result in
the erroneous selection of an adjacent phase.
1 1

( )
log
1 1
1 1
log 2 2 log
M M
b i j j i
i j j i
M
M M M
i
P e n P s s
M M
P P P
M M M
= = =
=
( =

(
~ + =
(

cont
cont
Gray code (Reflected binary code)
generation
Can be generated recursively by reflecting the bits (i.e.
listing them in reverse order and concatenating the
reverse list onto the original list), prefixing the original
bits with a binary 0 and then prefixing the reflected bits
with a binary 1.