Professional Documents
Culture Documents
Analog signal
2
Advantages of Digital Over Analog For Communications
Reading: Lathi & Ding; Section 6.2.1 on pages 321 and 322.
3
Next Topic – Pulse Code Modulation
Pulse-code modulation (PCM) is used to digitally represent
sampled analog signals. It is the standard form of digital audio
in computers, CDs, digital telephony and other digital audio
applications. The amplitude of the analog signal is sampled at
uniform intervals and each sample is quantized to its nearest
value within a predetermined range of digital levels.
Four-bit coding
(16 discrete levels)
4
Analog to Digital Conversion Process (ADC)
Three Step Process
amplitude
amplitude
amplitude
0100101101011001
time time 1110101010101000
time
0100011000100011
0101001111010101
1110110111010001
Sample Quantize Encode
Analog Digital
Signal Captured Quantized
Sampled Data Sampled Signal
Sampling Values Quantizing Data Encoding
selects the chooses the assigns binary
data points amplitude numbers to
we use to Discrete values used Now have those
Now have the
Analog signal create the time values: to encode discrete amplitude
digital
is continuous digital data few amplitudes Values in values
data which
in time & from analog both time & is the final
amplitude signal amplitude result
5
Second Step – Quantization I
The process of assigning quantization levels
=
16 levels – 4 bits
6
Natural Binary Pulse Code (Example)
To communicate sampled
values, we send a sequence of
bits that represents the
quantized value.
For 16 quantization levels, 4 bits
are required.
PCM can use a binary
representation of value.
The PSTN uses PCM
7
Second Step – Quantization II
We start with a sampled signal {call it m(t)} and now we want to quantize it.
Divide the range (-mp, mp) into L uniformly spaced intervals. The number
intervals is L and the separation between quantized levels is
2mp
L
The kth sample point of m(t) is designated as m(kTS) and is assigned a value
equal to the midpoint between two adjacent levels. Define:
Read Section 6.2.2 of Lathi & Ding: Quantizing evaluation of parameter q(t).
pp. 322-324
8
Error Generated by Quantization
9
Second Step – Quantization III
It is shown in Lathi and Ding that the “time average” mean square error
from quantization is
2p
q 2 m 2
2
3L
12
Let Nq equal q2. Nq is proportional to the fluctuation of the error signal.
This is sometimes quantization noise.
S0 m2
(t)
10
Second Step – Quantization IV
We want a measure of the quality of received signal (that is, the ratio of
the strength of the received signal S0 relative to the strength of the error
Nq due to quantization).
S0 m2 (t) 2
2 m (t)
This is given by the ratio 2 3L m 2
Nq m
p p
3L2
Conclusion:
To keep the quantization error small relative to the message signal level,
use smaller quantization steps .
11
The Dilemma of Strong Signals versus Weak Signals
12
Use Compression and Expansion → Companding
Compression Restoratio
(m) n
m(t)
m(t) m(t)
http://www.slideshare.net/91pratham/unit-ipcmvsh 12
Companding Laws
Output (y/ymax)
Input (m/mp) Input (m/mp)
A m for m 1
y 1 log A m
0 m 1 m 0 m
e p p A y log e 1 for
log e(1 ) mp 1 p
A Am 1 m m
y 1
1 loge A 1 log e
A mp
mp
for Lathi & Ding
Section 6.2.3
pp. 325-328
14
Flattening of the S/N Ratio Using the -Law
15
Transmission Bandwidth
BT = nB Hz
16
Example 6.2 (Lathi & Ding, page 329)
Solution:
The Nyquist rate is RN = 2 x 3000 Hz = 6000 Hz (samples/second), but the
actual
rate is 33⅓ % higher, so that is 6000 Hz + (⅓ x 6000) = 8000 Hz.
17
Example 6.2 Continued (Lathi & Ding, page 329)
Solution (continued):
Having chosen n = 8 to guarantee 0.5% error, to find the bandwidth required
we note that
¶
A maximum of 2B independent elements of information per second can be
transmitted, error-free, over a noiseless channel of bandwidth B Hz.
18
Exponential Increase of the Output SNR (S/N ratio)
We start with the SNR (signal-to-noise ratio) equation from slide 10 above:
S0 m2 (t) 2
N q 3 mp2
L
The number of levels L can be expressed as L2 = 22n where n = log2(L) and is
The number of bits to generate L levels. The SNR can now be expressed as
S0 m2 (t) 2n
N q 3 mp2
2
Using the expression for bandwidth, BT = nB, then we arrive at
m2 (t) 2BT /B
N q 3 mp2 2
S0
Taking the logarithm gives
S m 2 (t)
S 10 log
0 0
10 log 10 2 6n
Nq 10 N q 3 2
mp 2n log 10 dB
dB
19
SNR Example
S0 m2 (t) 2n 3P 2n
3 2n
N q 3 m 2p (2) m 2max (2) (2)
ave
2
L n SNR
32 5 31.8 dB
10 S0 64 6 37.8 dB
N q
10 1.76 6n dB
log
128 7 43.8 dB
256 8 49.8 dB
20
6.3 Bell System’s T1 Carrier System
(1962)
The T-carrier is a member of the group of carrier systems developed by AT&T
Bell Laboratories for digital transmission of multiplexed telephone calls using
Pulse Code Modulation and Time Division Multiplexing.
The first version, the Transmission System 1 (T1), was introduced in 1962 in
the Bell System, and could transmit up to 24 telephone calls simultaneously
over a single transmission line consisting of copper wire.
21
T1 Carrier – Time Division Multiplexing
22
T1 Carrier System TDM Fig 6.20(b)
T1 system signalling format Fig 6.21
Time Division Multiplexing
Digit interleaving
Word interleaving
Asynchronous channels and bit stuffing Fig 6.24
Plesiochronous Digital Hierarchy AT & T system
PDH according to ITU-T (G.704) Fig 6.26
Comparison of T-Carrier (North America) and E-Carrier (Europe)
29
Worked PCM Example
30
Worked Example for PCM (continued)
2m 4
L p 0.0317
31.5
The lowest integer number of bits n that will give at least 31.5 levels is n = 5
because 25 = 32 levels. So the answer is 5 bits.
31
Differential Pulse Code Modulation (DPCM)
PCM is not really efficient because it generates so many bits taking up a lot
of bandwidth. Can we improve on this? YES.
32
Differential Pulse Code Modulation (continued)
At the receiver knowing d[k] and the previous value of m[k-1] allows us to
construct the value of m[k].
Suppose m[k] is the estimate of the kth sample, then the difference
d[k]
is given by
d[k] = m[k] – m[k]
Receiver Concept:
At the receiver we determine the estimate m[k] from previous sample
values, and then generate m[k] by adding the received d[k] values to the
estimate m[k]. Thus the reconstruction of the samples is done iteratively.
34
Digression on Signal Prediction
TS
S dm(t) for small TS
m[t TS ] m(t) T dt
We denote the kth sample of m(t) by m[k], that is, m[kTS] = m[k], and
m[kTS TS] = m[k 1], and so on. This is a first-order predictor.
d m(kTS ) m(kTS TS )
In handling the derivatives, we write m(kTS)
dt TS
Thus,
m[k] m[k 1]
m[k 1] m[k] T
S TS
m[k 1] 2m[k] m[k 1]
35
Signal Prediction (continued)
Note that the input consists of the weighted previous samples m[k-1],
m[k-2],etc. We say that input m[k] gives output m[k].
36
Linear Predictor Implemented With Transversal Filter
Output m[k]
37
DPCM Transmitter
Input Output
m[k] d[k] dq[k]
+
Quantizer
Input Output
dq[k] + mq[k]
Lathi & Ding +
Figure 6.28(a)
p. 293 mq[k]
Predictor
The receiver’s output (which is the predictor’s input) is also the same,
mq[k] = m[k] + q[k].
Hence, we are able to receive the desired signal m[k] plus the quantization
noise, q[k]. It is important to note that from the difference signal d[k] is
much smaller that the noise associated with m[k].
39
DPCM SNR Improvement
40
Adaptive Differential PCM
41
Adaptive Differential PCM Output Example
time
42
Next Topic is Delta Modulation
43
The process of delta modulation
Delta modulation components
Delta demodulation components
Adaptive DM