Professional Documents
Culture Documents
Digital Communication Systems (ECE4001) : Dr. Thomas Joseph
Digital Communication Systems (ECE4001) : Dr. Thomas Joseph
August 7, 2021
1 / 59
Contents
1 Module-1
Introduction
Sampling
Quantization
2 Module-II
Pulse Code Modulation
2 / 59
Module-1 Introduction
Communication Systems
Main purpose of communication is to transfer information from a
source to a recipient via a channel or medium
Basic block diagram of a communication system:
3 / 59
Module-1 Introduction
Brief Description
4 / 59
Module-1 Introduction
5 / 59
Module-1 Introduction
6 / 59
Module-1 Introduction
Types of information
Voice, data, video, music, email etc.
Types of information systems
Satellite systems
Radio,TV broadcasting
Cellular phones, Computer networks (LANs, WANs,WLANs)
8 / 59
Module-1 Introduction
Why Digital?
Primary adavantage is ease of regeneration as compared to analog
signals
Low cost
Good processing techniques are available for digital signals, such as
Data compression (or source coding)
Error Correction (or channel coding) (A/D conversion)
Equalization
Security
regenerative repeater avoids accumulation of noise
Digital circuits are less affected by distortion and interference - -
binary digit circuits operating at two points – fully on or fully off
Easy to mix signals and data using digital techniques
The objective in digital communication is to determine from a noise
perturbed signal which waveform from the finite set of waveform was
sent by the transmitter
9 / 59
Module-1 Introduction
10 / 59
Module-1 Introduction
Reference
11 / 59
Module-1 Sampling
Sampling
Sampling is the first step in analog to digital conversion
A CT signal is converted into DT signal by measuring the signal at
periodic instants of time
To convert an analog or continuous time signal into a discrete time
signal extract one sample every Ts second
Ts = sampling interval
1
Ts = fs → sampling frequency
In ideal sampling we multiply the input analog waveform with an
impulse train with period Ts
Impulse train means impulses at every Ts seconds ⇒ ...,-Ts , 0, Ts ,
2Ts , 3Ts ....
...δ(t + 2Ts ), δ(t + Ts ), δ(t), δ(t − Ts ), δ(t − 2Ts ),....
∞
X
gδ (t) = δ(t − nTs ) (1)
n=−∞
12 / 59
Module-1 Sampling
Ideal Sampling
17 / 59
Module-1 Sampling
∞
X
Mδ (F ) = Fs M(F − KFs ) (8)
k=−∞
18 / 59
Module-1 Sampling
19 / 59
Module-1 Sampling
20 / 59
Module-1 Sampling
21 / 59
Module-1 Sampling
The following figure shows how to get back the original message
spectra from the sampled spectra
22 / 59
Module-1 Sampling
Sampling Theorem
The sampling theorem, which is also called as Nyquist theorem,
delivers the theory of sufficient sample rate in terms of bandwidth for
the class of functions that are bandlimited
The sampling theorem states that,“a signal can be exactly reproduced
if it is sampled at the rate fs which is greater than twice the
maximum frequency fm of the message signal”
fs ≥ 2fm (9)
23 / 59
Module-1 Sampling
24 / 59
Module-1 Sampling
25 / 59
Module-1 Sampling
Figure: Spectrum of the sampled signal with sampling rate equal to the Nyquist rate
26 / 59
Module-1 Sampling
Figure: Spectrum of the sampled signal with sampling rate lower than the Nyquist rate
27 / 59
Module-1 Sampling
Aliasing
28 / 59
Module-1 Sampling
Aliasing
29 / 59
Module-1 Sampling
Exercise Problems
30 / 59
Module-1 Sampling
Exercise Problems
Consider a continuous time signal xc (t) = cos(4000πt). We sample
the signal with a sampling period T = 1/6000, we obtain the discrete
time signal x[n] = xc [nTs ] = cos(4000πnTs ) = cos(ω0 n), where
ω0 = 4000πTs = 2π/3. The sampling frequency
Ωs = 2π/Ts = 12000π. Highest frequency present in the signal is
Ω0 = 4000π
The Fourier transform the signal is πδ(Ω − 4000π) + πδ(Ω + 4000π)
31 / 59
Module-1 Sampling
Exercise Problems
In the above problem, the signal is changed to xc (t) = cos(16000πt),
sampling period T = 1/6000 remains the same. Find the spectrum of
the sampled signal?
The Fourier transform the sampled signal is
πδ(Ω − 16000π ± 12000πn) + πδ(Ω + 16000π ± 12000πn)
32 / 59
Module-1 Sampling
Interpolation
33 / 59
Module-1 Sampling
Interpolation
Interpolation
36 / 59
Module-1 Quantization
Quatization
37 / 59
Module-1 Quantization
Quantization
38 / 59
Module-1 Quantization
Uniform Quantization
39 / 59
Module-1 Quantization
42 / 59
Module-1 Quantization
43 / 59
Module-1 Quantization
Quantization Error
This is uniformly distributed and its mean value is zero. The variance
or noise power is given by
44 / 59
Module-1 Quantization
2
σQ = E [Q 2 ]
Z ∆/2
= q 2 fQ (q)dq
−∆/2
1
Z ∆/2 (19)
2
σQ = q 2 dq
∆ −∆/2
∆2
=
12
2mmax
Since L = 2n or equivalently n = log2 L, ∆ = 2n then
2
1 mmax
2
σQ = (20)
3 22n
45 / 59
Module-1 Quantization
46 / 59
Module-1 Quantization
Nonuniform Quantization
47 / 59
Module-1 Quantization
Nonuniform Quantization
The effect is to improve the overall SNR by reducing the noise for the
predominant weak signals at the expense of noise for the rarely
occuring strong signals
Nonuniform quantization can be obtained by two ways
Directly use a nonuniform quantizer
Indirect method – First compressing the signal, then taking uniform
qunatization
48 / 59
Module-1 Quantization
Nonuniform Quantization
49 / 59
Module-1 Quantization
Companding
50 / 59
Module-1 Quantization
51 / 59
Module-II Pulse Code Modulation
52 / 59
Module-II Pulse Code Modulation
53 / 59
Module-II Pulse Code Modulation
54 / 59
Module-II Pulse Code Modulation
Solution
55 / 59
Module-II Pulse Code Modulation
56 / 59
Module-II Pulse Code Modulation
57 / 59
Module-II Pulse Code Modulation
Additional Learning
∞
X
Xs (F ) = cn X (F − nFs ) (24)
n=−∞
58 / 59
Module-II Pulse Code Modulation