Escolar Documentos
Profissional Documentos
Cultura Documentos
Data rate R
Bandwidth efficiency
Error Probability Plane
C Eb C
log 2 1
W N 0 W
C Eb C
2 W
1
N0 W
Eb W C W
2 1
N0 C
Shannon Limit
Minimum value for Eb/N0: - No error
free communication at any
information rate.
It not possible in practice to reach
Shannon limit, because as k increase
without bound, k∞, the BW
requirement and implementation
complexity also
Eb increase
C without
Let x
bound.
N0 W
C
x log 2 1 x x
1
W
E
1 b log 2 1 x x
1
N0
using the identity : lim 1 x
1
x e
x 0
when C 0, we get
W
Eb 1
0.693 1.6dB
N 0 log 2 e
Entropy
The average amount of
information per source output
H i 1 pi log 2 pi
n
bits/ source output
Solution:
Equivocation & Effective
Transmission Rate
Equivocationis defined as the conditional
entropy of message X being sent, having
received Y.
2 Es
PE ( M ) 2Q sin
Step 5: Find the probability N 0 of symbol
M error PE(M) 1 x2
Q( x ) exp
2Q ( 4.2843) x 2 2
2 9.6 10 6
1.924 10 5
Step 6: find the probability of bit error
PE
PB ( for PE 1)
log 2 M
1.924 10 5
3
6.4143 10 6
M=16 is selected.
From Table 9.1, the required Eb/N0 (8.1dB) in
PB=10-5 is less than the calculated system Eb/N0
(8.2 dB).
Solution…. manual calculation
Step 1: Guess the possible modulation type based given
parameters (either bandwidth limited or power limited).
Since R > W, it is bandwidth limited system. Choose MFSK.
R
Step 2: Choose the largest MR M
possible of M;
s W
log 2 M
; M = 16
Step 3: Find the received bit energy to noise power
spectral density (Eb/N0) from the received power to noise
spectral density (Pr/N0). = 6.61 = 8.2 dB
Step 4: Find
Es the symbol E energy to noise power spectral
log 2 M b 4 6.61 26.44 14.22dB
density N 0 N0
M 1 1 Es
PE ( M ) exp
Step 5: Find the probability
2 of0 symbol
2 N error PE(M)
7.5 exp(13.22)
1.36 10 5
Step 6: find the probability of bit error
2 k 1
Pb k PE
2 1
23
4 1.36 10 5
2 1
7.25 10 6
0.838 1.19
31 26 1 1.8 2.0
7 2
0.904 1.10
63 57 1 1.8 2.2
8 52
0.809 1.23
51 2 2.6 3.2
5 53
0.944 1.05
127 120 1 1.7 2.2
9 83
0..834 1.12
113 2 2.6 3.4
6 39
0.834 1.19
106 3 3.1 4.0
6 81
Solution… (4)
Figure 9.9 shows the digital
system,
modulator/demodulator
(MODEM) and coding.
It shows the relationship when
transforming from R bit/s to Rc
channel-bit/s to Rs symbol/s.
We assumed that it is a real-
time system and cannot
tolerate message delay.
Therefore, Rc must exceed R
by factor of n/k and Rs is less
than Rc by factor of log2 M.
The channel bit energy to
noise spectral density Ec/N0 is
less than Eb/N0 by factor of k/n
Solution… (5)
Code selection: Choose the code with smallest
possible of code rate (k/n) and the smallest
value of n (choose (63,51)).
n j
Step 4: Find 1 the
n
decoded
n j bit error probability
Pb
n
j
j pc 1 p c
j t 1
(PB)
3 63
63
3
4
10 5 3
1 4 10 5 60
4 63
63
4
4
10 5 4
1 4 10 5 59
.......
1.2 10 10
L M
Where Q(x) is the complementary error
function, is the
number of amplitude levels in one dimension.
QAM is more bandwidth efficient (in
exchange for Eb/N0) compared to M-PSK. (see
figure 9.6 – bandwidth efficiency plane).
Example 9.5… QAM Waveform Design
Trellis Coded
Modulation (TCM)
Trellis Coded Modulation (TCM)
TCM achieved error-performance improvements
without expansion of signal bandwidth (trade-off
with decoder complexity).
TCM combines multilevel/phase modulation &
coding schemes.
Used the concept of finite state machine (at
encoder) for encoding process of the modulated
waveforms.
Finite state machine refers to a device which has
memory of past signals using finite number of
unique states that the machine can encounter.
The state consists of smallest amount of
information that together with current input to
the machine can predict the possible output. A
future state is restricted by the past state. State
Trellis Coded Modulation (TCM)
TCM is bandwidth efficient modulation
which accomplishes this by the use of
convolutional coding.
TCM achieved error-performance improvements
without expansion of signal bandwidth (trade-
off with decoder complexity).
Conserve bandwidth by doubling the number
of constellation points of signal. This will
increase bit rate but symbol rate stays the
same.
Convolutional coding constraints allowed
symbol transitions, creating sequence coding
(concept of finite state machine).
Unlike a true Convolutional coding, not all
Increasing the constellation size reduces
Euclidean distances between the
constellation points but sequence coding offers
a coding gain that overcomes the power
disadvantage of going to the higher
constellation.
Performance is measured by coding gain over
an uncoded signal.
The decoding metric is Euclidean distance
and not hamming distance.
Ungerboeck proposed TCM which used set-
partitioning and small number of states with
code rates that varied with the input signal
type.
The constellation mapping in set partitioning
Increasing Signal
Redundancy
TCM may be implemented with a convolutional
encoder, where k current bits and K-1 prior bits
are used to produce n=k+1 code bit (K =
encoder constraint length)
Coding gain can be accomplished by encoding
with a rate k/(k+1) convolutional code and
then mapping groups of (k+1) into the set of
2k+1 waveforms.
In an uncoded systems, such a reduced
distance in constellation set waveforms
degrades error performance.
However in TCM, the free distance, which is
the minimum distance between members of the
set of allowed code sequences, determines the
TCM Block Diagram
TCM Encoding
In order, to maximize the free Euclidean
Distance (ED), the code-to-signal mapping is
done by partitioning the modulation-signal
constellation into subsets with increasing
minimum distance d0<d1<d2 … between the
element of the subset.
Figure 9.22 – 8-PSK signal set constellation.
Individual signals are numbered sequentially
from 0 to 7. The distance between any two
adjacent signals, d0 is 2 sin (π/8)=0.765.
The 1st level partitioning results in subsets B0
and B1, where the distance between adjacent
signals is d1=√2. The next level of partitioning
results in subsets C0 to C3 with distance
between adjacent signals is d2=2.
Thechoice of a unit circle for both coded and
uncoded systems meant that the average
signal power was the same for both sets.
Mapping of waveforms to Trellis Transition
0 0 0 0 0 0 0 0 0 0 0
0 1 1 0 0 1 0 0 1 1 2
0 0
1 0 0 0 0 0 0 1 0 0 4
1 1 1 0 0 1 0 1 1 1 6
0 0 0 1 0 0 1 0 1 0 1
0 1 1 1 0 1 1 0 0 1 3
1 0
1 0 0 1 0 0 1 1 1 0 5
1 1 1 1 0 1 1 1 0 1 7
0 0 0 0 1 0 0 0 1 1 2
0 1 1 0 1 1 0 0 0 0 0
0 1
1 0 0 0 1 0 0 1 1 1 6
1 1 1 0 1 1 0 1 0 0 4
0 0 0 1 1 0 1 0 0 1 3
0 1 1 1 1 1 1 0 1 0 1
1 1
1 0 0 1 1 0 1 1 0 1 7
1 1 1 1 1 1 1 1 1 0 5
Solutions…continued
Therefore,
the asymptotic coding gain for 8-PAM
coded system with a 4-state trellis is
Conclusion
Basic system design goals: To maximize data rate while
simultaneously minimizing error probability, bandwidth,
Eb/N0 and complexity.
System trade off parameters could be examined based
on 2 performance planes: error probability plane (PB
vs Eb/N0) and bandwidth efficiency plane (R/W vs
Eb/N0).
Nyquist criterion: in order to transmit Rs symbol/s without
intersymbol interference, the minimum required
bandwidth is Rs/2.
Shannon-Hartley theorem relates to the power-bandwidth
trade-off (Shannon Limit). The Shannon limit of -1.6dB is
the theoretical minimum amount of Eb/N0 that is
necessary (together with channel coding) to achieve an
arbitrarily low error probability over AWGN channel.
The channel capacity limitation (R=C) is the limit above
which there cannot be error-free signaling.
M-PSK and M-QAM modulations schemes normally used