Class Lecture 07&08
Class Lecture 07&08
The various advantages that the transmission of digital information has over
analog.
Digital systems are less sensitive to noise than analog. For long
transmission lengths, the signal may be regenerated effectively error-free at
different points along the path, and the original signal transmitted over the
remaining length.
With digital systems, it is easier to integrate different services, for
example, video and accompanying soundtrack, into the same transmission
scheme.
The transmission scheme can be relatively independent of the source.
For example, a digital transmission scheme that transmit voice at 10 kbps
could be used to transmit data at 10 kbps.
Circuitry for handling digital signals is easier to repeat and digital
circuits are less sensitive to physical effects such as vibration and
temperature.
Digital signals are simpler to characterize and typically do not have the
same amplitude range and variability as analog signals. This makes the
associated hardware easier to design.
While most all media (e. g., cable, radio, waves, optical fiber) may be used for
either analog and digital transmission, digital techniques, are more efficient
use of those media.
can be reconstructed exactly from its discrete time samples taken uniformly at a
rate of R samples per second. The condition is that R > 2B. In other words, the
minimum sample frequency for perfect signal recovery is fs = 2B Hz.
The nth impulse, located at t = n Ts , has a strength g(nTs) which is the value of
g(t) at t=nTs. Thus the relationship between the sampled signal gʹ(t) and the
original analog signal g(t) is
Because the impulse train ∂Ts (t) is a periodic signal of period Ts, it can be
expressed as an exponential Fourier series,
= 1/Ts ∑ (6.3)
To find Gʹ(f), the Fourier transform of gʹ(t), we take the Fourier transform of the
summation in Eq. (6.3). Based on frequency-shifting property, the transform ofn the nth
term is shifted by nfs. Therefore,
This means that the spectrum Gʹ(f) consists of G(f), scaled by a constant 1/Ts, repeating
periodically with periods fs = 1/Ts Hz as shown in figure 6.1e.
Thus as long as the sampling frequency fs is greater than twice signal bandwidth B
(in Hertz), Gʹ(f) will consists of non-overlapping repetitions of G(f). When this is
true, figure 6.1e shows that g(t) can be recovered from its samples gʹ(t) by passing
the sampled signal gʹ(t) through an ideal low pass filter of bandwidth of B Hz.
The minimum sampling rate fs = 2B required to recover g(t) from its samples
gʹ(t) is called the Nyquist rate for g(t), and the corresponding sampling interval
Ts=1/2B is called the Nyquist interval for the low –pass signal g(t).
If the spectrum G(f) has no impulse (or its derivatives) at the highest frequency B,
then the overlap still zero as long as the sampling rate is greater than or equal to the
Nyquist rate, that is
Fs ≥ 2B
An example is a sinusoid g(t) =sin2ℼB(t – t0). This signal is band limited to B Hz,
but all its samples are zero when uniformly taken at the rate of fs =2B (starting at
t=t0) and g(t) cannot be recovered from its Nyquist samples. Thus for sinusoids,
the condition of fs > 2Bmust be satisfied.
The process of reconstructing a continuous time signal g(t) from its samples
is also known as interpolation. In figure 6.1, we used a constructive proof to
show that a signal g(t) band-limited to B Hz can be reconstructed
(interpolated) exactly from its samples. Nyquist rate preserves not only all the
signal information, but also that simply passing the sampled signal through an
ideal low-pass filter of bandwidth B Hz will reconstruct the original message.
From equation (6.3), the sampled signal contains a component (1/Ts)g(t) and to
recover g(t) [or G(f)], the sampled signal gʹ(t) = ∑ g(nTs) ∂(t – nTs)
Must be sent through an ideal low-pass filter of bandwidth B Hz and gain Ts. Such
an ideal filter response has the transfer function
Ideal Reconstruction
To recover the analog signal from its uniform samples, the ideal
interpolation filter transfer function found in Eq. (6.7) is shown in figure 6.2a.
The impulse response of this filter, the inverse Fourier transform of H(f) is
is applied at the input of this filter, the output is g(t). Each sample in gʹ(t), being an
impulse, generates a sinc pulse of height equal to the strength of the sample, shown
in figure 6.2c. The process is identical to that shown in figure 6.6, except that h(t)
is sinc pulse instead of a rectangular pulse.
The kth sample of the input gʹ(t) is the impulse g(kTs) ∂(t - kTs); the filter output of
this impulse is g(kTs) h(t - kTs).
Equation 6.10 is the interpolation formula, which yields values of g(t) between
samples as a weighted sum of all the samples values.
Example 6.1
Find the signal g(t) that is band-limited to B Hz and whose samples are
g(0) = 1 and g(±Ts) = g(±2Ts) = g(±3Ts) = …. = 0; where the sampling interval Ts
is the Nyquist interval for g(t), that is Ts = 1/2B.
Solution: We use the interpolation formula (6.10b) to construct g(t) from its
samples. Since all but one of the Nyquist samples are zero, only one term
(corresponding to k = 0) in the summation on the right-hand side of Eq. (6.10b)
survives. Thus
Observe that this is the only signal that has a bandwidth B Hz and sample values
g(t) = 1 and g (nTs) = 0 (n ≠ 0). No other signal satisfies these conditions.
The continuous time signal g(t) is sampled, and sample values are used to modify
certain parameters of a periodic pulse train. We may vary the amplitudes (figure
6.11b), widths (figure 6.11c), or positions (figure 6.11d) of the pulses in
proportion to the sample values of the signal g(t). Accordingly we have pulse
amplitude modulation (PAM), pulse width modulation (PWM), or pulse
position modulation (PPM). The most important form of pulse modulation today
is pulse code modulation (PCM).
PCM is the most useful and widely used of all the pulse modulations.
Figure 6.13 is shown, PCM basically is a tool for converting an analog signal into a
digital signal (A/D conversion). An analog signal is characterized by an
amplitude that can take on any value over a continuous range of infinite number
of values. On the other hand, digital signal amplitude can take on only finite
number of values. An analog signal can be converted into a digital signal by
means of sampling and quantizing, that is, rounding off its value to one of the
closest permissible numbers (or quantized levels), as shown in figure 6.14.
The amplitude of the analog signal m(t) lie in the range (-mp, mp), which
is partitioned into L subintervals, each of magnitude ∆v = 2mp/L. Figure 6.14
shows for L = 16. Thus the signal is digitized with quantized samples taking on
any one of the L values. Such a signal is known as an L-ary digital signal.
We can convert an L-ary signal into a binary signal by using pulse coding.
Such a coding for the case of L = 16. This code, formed by binary
representation of 16 decimal digits from 0 to 15, is known as the natural binary
code (NBC). The analog signal m(t) is now converted to a binary digital signal.
The audio signal bandwidth is about 15 kHz. However, for speech,
subjective tests show that signal articulation (intelligibility) is not affected if all the
components above 3400 Hz are suppressed. Since the objective in telephone
communication is intelligibility rather than high fidelity, the components above
3400 Hz are eliminated by a low pass filter. The resulting signal is then the
sampled at the rate of 8000 samples per second (8 kHz). This rate is
intentionally kept higher than the Nyquist sampling rate of 6.8 kHz so that
realizable filters can be applied for signal reconstruction. Each sample is
finally quantized into 256 levels (L = 256), which requires a group of eight binary
pulses to encode each sample (28 = 256). Thus a telephone signal requires 8x8000
= 64,000 binary pulses per second.
6.2.2 Quantizing
For quantization, we limit the amplitude of the message signal m(t) to
the range (-mp, mp), as shown in figure 16.4. Note that mp is not necessarily the
peak amplitude of m(t). The amplitude of m(t) beyond ±mp are simply chopped off.
The amplitude range (-mp, mp) is divided into L uniformly spaced intervals,
each of width ∆v = 2mp/L. The quantized samples are coded and transmitted as
binary pulses. At the receiver some pulses may be detected incorrectly. Hence,
there are two sources of error in these scheme: quantization error and pulse
detection error.
In almost all practical schemes, the pulse detection error is quite small compared to
the quantization error and can be ignored. In the present analysis, the error in the
received signal is caused exclusively by quantization.
If m(kTs) is the kth sample of the signal m(t), and if mˆ (kTs) is the corresponding
quantized sample, then the interpolation formula in Eqn. (6.10),
and mˆ(t) = ∑k mˆ(kTs) sinc (2ℼBt - kℼ) where mˆ(t) is the signal reconstructed
from quantized samples. The distortion component q(t) in the reconstructed signal
kℼℼi8s q(t) = mˆ(t) - m(t) . Thus ,
where q(kTs) is the quantization error in the kth sample. The signal q(t) is the
undesired signal and, hence, acts as noise, known as quantization noise.
We know that the signals sinc (2ℼBt - mt ) and sinc (2ℼBt - nt) are orthogonal,
that is ,
= limT ∞ 1/T∑
= (∆v)2/12 ………….(6.32)
= mp2/3L2 …………………(6.33)
Assuming that pulse detection error is negligible, the reconstructed signal mˆ(t) at
the receiver output is
The desired signal at the output is m(t), and the quantization noise is q(t).
S0 = m2(t)
N0 = Nq = m2p / 3L2
This means S0/N0, the SNR, is a linear function of the message signal power
m2(t) shown in figure 8.18 with = 0.
6.2.3 Principal of Progressive Taxation: Nonuniform Quantization
y= A/ 1+lnA(m/mp) 0 m/m
p 1
The output SNR for the cases of = 255 and = 0 (uniform quantization) as a
function of m2(t) (the message signal power) is shown in figure 6.18.
For a binary PCM, we assign a distinct group of n binary digits (bits) to each
of the L quantization levels. Because n- binary digits can be arranged in 2n
distinct patterns
L = 2n or n= log2L
Each quantized sample is, thus, encoded into n bits. Because a signal m(t)
band limited to B Hz requires a minimum of 2B samples per second, we require a
total of 2nB bit/s.We require a minimum channel of band width BT Hz, given
by
BT = nB Hz
We observe that the SNR increases exponentially with the transmission band width
BT..
= 10log10[c(2)2n]
= 10log10c + 2nlog10 2
Where = 10log10c. This shows that increasing n by 1 (increasing one bit in the
codeword) quadruples the output SNR (a 6 dB increase). Thus if we increase n
from 8 to 9, the SNR quadruples, but the transmission bandwidth increases only
from 32kHz to 36 kHz(an increase of only 12.5%). In this respect, PCM is
strikingly superior to FM or PM.
Solution: The Nyquist sampling rate RN= 2x3000 =6,000 Hz (samples per
second). The actual sampling rate is RA = 6000x (11/3) =8000 Hz.
The quantization step is ∆v, and the maximum quantization error is ±∆v/2.
Therefore from eqn. we get, ∆v/2 = mp/L = 0.5/100 mp L = 200
For binary coding, L must be a power of 2. Hence the next higher value of L that is
a power of 2 is L=256.
From Eqn. we need n=log2 256 = 8 bits per sample. We require to transmit a total
of C = 8 x 8000 = 64,000bit/sec. Because we can transmit 2 bit/s per hertz of
bandwidth, we require a minimum transmission bandwidth BT = C/2 = 32kHz. The
multiplexed signal has a total of CM = 24 x 64000 = 1.536Mbit/s, which requires a
minimum of 1.536/2 = 0.768 MHz of the transmission bandwidth.
S0/N0 = ( + 36) dB
= 10log3/[ln (101)]
The difference between the two SNRs is 12 dB, which is the ratio of 16. Thus, the
SNR for L=256 is 16 times the SNR for L = 64. The former requires just about 33%
more bandwidth compare to the later.