PCM in The Bell System Multiplexing PCM Asynchronous PCM Extensions To PCM
PCM in The Bell System Multiplexing PCM Asynchronous PCM Extensions To PCM
PCM in The Bell System Multiplexing PCM Asynchronous PCM Extensions To PCM
◮ Multiplexing PCM
◮ Asynchronous PCM
◮ Extensions to PCM
◮ Differential PCM (DPCM)
◮ Adaptive DPCM (ADPCM)
◮ Delta-Sigma Modulation (DM)
◮ Vocoders
PCM in the Bell System
Starting in the 1920s, long distance telephone links used frequency division
multiplexing. (FDM requires amplifiers, built using vacuum tubes.)
A cable with bandwidth 3 MHz can support (in principle) 1000 3 kHz voice
channels. But 1000 filters, modulators, and demodulators are needed.
Local exchanges communicated by trunk lines. Each copper pair carried one
voice conversation.
Using PCM, multiple connections could be time division multiplexed.
The Bell System settled on 1.544 Mbit/s (by experimentation).
8000 · (24 · 8 + 1) = 8000 · 193 = 1544000
This TDM signal is called digital signal level 1 (DS1).
This T-1 carrier system uses the same copper that was used for voice!
PCM is credited to Bernard Oliver and Claude Shannon (patent 2,801,281, 1946)
Telephone Exchange Using Strowger Switches
Electromechanical Crossbar Switch
Western Electric 1ESS (1965)
T-1 Carrier System
The input to the 13-bit ADC comes from an analog multiplexer.
The digital processor compresses the digital value according to µ-law.
T-1 Carrier System (cont.)
The 8-bit compressed voice values are sent consecutively, msb first.
The samples of all 24 inputs comprise a frame.
Early T-1 used every lsb for signaling, hence only 128 quantization levels. In the same way,
information can be hidden in the lsb of CD audio or images.
T-Carrier (T-CXR)
T-1 links can be multiplexed over high-speed links (wire, microwave,
optical). Multiplexing is by bits, not octets.
T-2: 4 T-1 channels (96 voice), 6.312 Mbs (copper)
T-3: 7 T-2 channels (672 voice), 44.736 Mbs (copper)
T-4: 6 T-3 channels (4032 voice), 274.176 Mbs
Customers could buy a T-1 link or part of a link (fractional T-1).
A common digital link in the 1990s was 56000 bps. This was one T-1
channel with 7 bits/sample at 8 kHz.
The European hierarchy is similar but was designed after T-carrier.
E1 has 32 8-bit channels but uses two for frame synchronization and
signaling.
E1–E5 have 32, 128, 512, 2048, 8192 channels. The channels are not
combined by bitwise multiplexing.
North American Digital Hierarchy
Different World Standards
Multiplexing PCM
A major motivation for PCM is the ability to multiplex many low bit rate
channels on a single hit bit rate channel. There are many ways to do this:
◮ Bit interleaving
◮ Word interleaving
Greek “plesos” meaning almost. (The plesiosaur is not a dinosaur but a large swimming reptile.)
Multiplexing PCM (cont.)
Asynchronous PCM
It is difficult to ensure that bits arrive and leave at synchronous rates.
Example:
◮ 100 km cable carrying 200 Mbits/s.
◮ If temperature increases by 1◦ F, propagation velocity increases by 0.01%.
◮ This results in a temporary increase of 20 kbits/s in the bit arrival rate.
The result is that samples are highly correlated, so the previous sample is a
good prediction of the next.
d
We can improve PCM by transmitting samples of dt m(t) and integrating to
reconstruct m(t) at the other end by integration
Differential PCM (cont.)
In general, we want to use previous samples to predict the signal.
We don’t need to transmit the prediction—the receiver can compute that.
We transmit the error between the prediction and the actual signal.
The receiver uses the same model and adds received data as a correction.
Differential PCM (cont.)
In the simplest case, the predictor is just the previous value of the signal:
m̂[k] = m[k − 1]
This works pretty well, and can greatly improve the dynamic range.
The next version uses a locally linear approximation. The first difference is
an approximation to the derivative:
m̂[k] = m[k − 1] + (m[k − 1] − m[k − 2]) = 2m[k − 1] − m[k − 2]
In general, for any expected signal spectrum, we can solve for FIR filter
X
N
m̂[k] = an m[k − n]
n=1
The combination of DPCM and ADPCM can reduce the number of bits
required by a factor of two,