Week9a, Digital Modulation
Week9a, Digital Modulation
n = log 2 m bits/symbol
Representation of modulating
signal: example
Number of log2m n bits/symbol
states, m
Transmit m symbols/sec
1 0 0 Results in n bits/sec
2 1 1
4 2 2
8 3 3
16 4 4
Choosing a modulation technique:
desirable features
• Power efficiency
• Bandwidth efficiency
Power efficiency
C S
η B max = = log 2 (1 + )
B N
C = channel capacity, bps
B = RF bandwidth
S / N = signal to noise ratio
Shannon limit, examples
• AMPS channel, B = 30kHz. Assume SNR=20dB.
What is maximum channel capacity C?
S
C = B log 2 (1 + ) = 30,000 log 2 (1 + 100)
N
C = 199.7 kbps
Tp Time
Definitions of signal bandwidth
1 1 0 1
Line coding II
• Non-return to zero (NRZ): pulse does NOT return
to zero within each symbol period
• Manchester coding: special case of NRZ
– “1” represented by a positive pulse followed by
a negative pulse (within a symbol period)
– “0” represented by a negative pulse followed by
a positive pulse (within a signal period
• Line codes can be
– unipolar (0 or +V)
– Bipolar(-V or +V)
Line coding examples
Unipolar NRZ
Bipolar NRZ
Unipolar RZ
Bipolar RZ.
Manchester code
Line coding trade offs
frequency is normalized with respect to the bit rate 1/Tb, and the
average power is normalized to unity
Power spectra of bipolar NRZ
frequency is normalized with respect to the bit rate 1/Tb, and the
average power is normalized to unity.
Power spectra of unipolar RZ
frequency is normalized with respect to the bit rate 1/Tb, and the
average power is normalized to unity.
Power spectra of Bipolar RZ
frequency is normalized with respect to the bit rate 1/Tb, and the
average power is normalized to unity.
Comparison of line coding spectra
Unipolar NRZ
Bipolar RZ
Manchester NRZ
Effects of bandwidth limiting a
digital signal
time
frequency
Graphical “proof” of ISI due to
band limiting II
Pass transmitted pulse through a band pass filter
frequency
frequency
Graphical “proof” of ISI due to
band limiting III
time
1⎡ ⎡ π ( f 2Ts − 1 + α ) ⎤ ⎤
H RC ( f ) = ⎢1 + COS ⎢ ⎥⎥
2 ⎢⎣ ⎣ 2α ⎦ ⎥⎦
(1 − α ) (1 + α )
≤ f ≤
2Ts 2Ts
1 B
Rs = =
Ts 1+α
As the noise increases, the symbol smears out, and can overlap
with another symbol, causing a symbol error