Subject: Communications 2

Code: EEC 223

Presented By:

Dr. Mohamed Youssef

E-mail:
[email protected]
Agenda

• Challenges.

• Delta Modulation.
• DM Block Diagram.
• Practical Implementation of DM.
• Delta Modulation waveform.

• Comparison between PCM, DPCM, and DM.

• Line Coding.
Challenges:
➢ PCM ➔ All samples are encoding.
The higher the number of quantization levels, the higher the number of bits per level which increase
the required bandwidth.
➢ DPCM ➔ The difference between samples are encoding which minimize the required bandwidth.

➢ Delta Modulation ➔ Encoding the error signal.

෡ 𝒕 ➔ The decision will be ∆.
➢ If 𝑿 𝒕 > 𝑿
෡ 𝒕 ➔ The decision will be -∆.
➢ If 𝑿 𝒕 < 𝑿
Where, ∆ is the step size.
Which means that the signal for each stage will be represented by only
one bit.
So, DM will effectively save the bandwidth more than DPCM and PCM.
Delta Modulation (DM):
Sample correlation used in DPCM is further exploited in delta modulation (DM) by oversampling
(typically, four times the Nyquist rate) the baseband signal. This increases the correlation
between adjacent samples, which results in a small prediction error that can be encoded using
only one bit (L = 2).

So, we have a quantization using only one bit ➔ thus we have only two levels ➔ However to
have only two levels that means that the signal that will be quantized should be very small in
amplitude.

Signal to be very small (of course we talking about the difference signal) ➔ the difference
between successive samples should be very small which means we might need
oversampling ➔ samples is close to each other ➔ smaller sampling interval ➔ that is why it
is called oversampling

Thus, DM is basically a 1-bit DPCM, that is, a DPCM that uses only two levels (L = 2) for
quantization of m[k] - 𝑚ෞ𝑞 [𝑘]. In comparison to PCM (and DPCM), it is a very simple and
inexpensive method of AID conversion. This strategy allows us to use fewer bits per sample for
encoding a baseband signal.
 In DM, we use a first-order predictor, which, as seen earlier in DPCM, is just a time delay of
T,(the sampling interval). Thus, the DM transmitter (modulator) and receiver

DM Block (demodulator) are identical to those of the DPCM, with a time delay for the predictor,
from which we can write

Diagram: (1)

(2)

Substituting this equation into Eq. 1

(3)
Proceeding iteratively in this manner, and assuming zero initial condition, that is,𝑚𝑞 [0] = 0,
we write
(4)
Practical
Implementation
of DM : This shows that the receiver (demodulator) is just an accumulator (adder). If the output
𝑑𝑞 [𝑘]is represented by impulses, then the accumulator (receiver) may be realized by an
integrator because its output is the sum of the strengths of the input impulses ( sum of the
areas under the impulses). We may also replace with an integrator the feedback portion of
the modulator (which is identical to the demodulator).

The demodulator output is 𝑚𝑞 [𝑘], which when passed through a low-pass filter yields the
desired signal reconstructed from the quantized samples.
Practical
Implementation
of DM (Cont.) :
The analog signal m(t) is compared with the feedback signal (which serves as a predicted
signal) 𝑚
ෞ𝑞 [𝑘]. The error signal d(t) = m(t) - 𝑚
ෞ𝑞 𝑘 is applied to a comparator.

If d (t) is positive, the comparator output is a constant signal of amplitude E, and if d (t) is
negative, the comparator output is -E. Thus, the difference is a binary signal (L = 2) that is
needed to generate a 1 –bit DPCM.

The comparator output is sampled by a sampler at a rate of fs samples per second, where fs is
typically much higher than the Nyquist rate. The sampler thus produces a train of narrow
pulses 𝑑𝑞 [𝑘] (to simulate impulses) with a positive pulse when m(t) > 𝑚
ෞ𝑞 𝑘 and a negative
pulse when m(t) < 𝑚 ෞ𝑞 𝑘 .

Note that each sample is coded by a single binary pulse ( 1 -bit DPCM), as required. The pulse
train 𝑑𝑞 [𝑘] is the delta-modulated pulse train. The modulated signal 𝑑𝑞 [𝑘] is amplified and
integrated in the feedback path to generate 𝑚ෞ𝑞 𝑡 , which tries to follow m(t).
Practical
Implementation
of DM (Cont.) :
 Analog DM
Signal X(nTs) Signal
e(nTs) XDM(t)
Delta X(t) One-bit eq(nTs)
Sampler
+
+ Quantizer x
Modulation -
෡ (nTs)
+
Waveform 𝑿
෡ (nTs)
e(nTs) = X(nTs) - 𝑿 Impulse
Train
+∆ , ෡ (t)
X(t) > 𝑿
eq(nTs) = ൝
−∆ , ෡ (t)
X(t) < 𝑿 Integrator

XDM(t) = eq(nTs) . σ∞
−∞ 𝜹(𝒕 − 𝒏𝑻𝒔)
Prediction Filter
Example:
Solution:

m[k] 0 0.15 0.37 0.5 0.41 0.23 0.1

d[k] 0 0.05 0.17 0.2 0.01 -0.27 -0.3

dq[k] 0.1 0.1 0.1 0.1 0.1 -0.1 -0.1

mq[k] 0.1 0.2 0.3 0.4 0.5 0.4 0.3

ෝ q[k]
𝒎 0 0.1 0.2 0.3 0.4 0.5 0.4
Solution (Cont.):
dq[k] 0.1 0.1 0.1 0.1 0.1 -0.1 -0.1

mq[k] 0.1 0.2 0.3 0.4 0.5 0.4 0.3

ෝ q[k]
𝒎 0 0.1 0.2 0.3 0.4 0.5 0.4

➢ Compare between m[k] and mq[k] to calculate instant error q[k]

m[k] 0 0.15 0.37 0.5 0.41 0.23 0.1

mq[k] 0.1 0.2 0.3 0.4 0.5 0.4 0.3

q[k] -0.1 -0.05 0.07 0.1 -0.09 -0.17 -0.2

Comparison:
Parameter of PCM DPCM DM
Comparison
Number of bits It can use 4,8, or Bits can be more It uses only one
16 bits per than one bit but bit for one
sample. are less than PCM sample.
Levels Depends on Depends on Fixed
number of bits. number of bits.
Step size Fixed Fixed Fixed
Bandwidth Highest Less than PCM. Lowest
Bandwidth. Bandwidth.
Feedback No feedback in Feedback exists Feedback in
transmitter or in transmitter and transmitter.
receiver. receiver.
Complexity of Complex Simple Simple
implementation
Line Coding:
➢ Definition: The digital output of a source encoder is converted (or coded) into
electrical pulses (waveforms) for the purpose of transmission over the channel.

➢ Categories:

❑ Non-Return-to-Zero (NRZ).
❑ Return-to-Zero (RZ). ➔ the waveform returns to zero-volt level for a portion
(usually one-half) of bit interval.

➢ The waveforms for line coding may further classified according to the voltage levels
that used to represent the binary data, Unipolar, Polar, Bipolar, Manchester,…
Waveforms:
Thank you
Dr / Mohamed Youssef
01005150491
[email protected]