Digital Signal Processing

Soma Biswas

2017
 Last Class

• Examples of signals
• Why do we use DSP?
• Continuous vs. Discrete-time signals

• Applications

Digital Signal Processing - Lecture 2 2

Uniform or Periodic Sampling

𝒕 = 𝒏𝑻 = 𝒏/𝑭𝒔
Digital Signal Processing - Lecture 2 3
 Sampling…

𝟏
𝒙𝒂 𝒕 = 𝑨𝒄𝒐𝒔 𝟐𝝅𝑭𝒕 + 𝜽 is sampled periodically at a rate 𝑭𝒔 =
𝑻

𝟐𝝅𝑭𝒏
𝒙𝒂 𝒏𝑻 = 𝒙 𝒏 = 𝑨𝒄𝒐𝒔 𝟐𝝅𝑭𝒏𝑻 + 𝜽 = 𝑨𝒄𝒐𝒔 +𝜽
𝑭𝒔
𝑭
𝒇= 𝒐𝒓 𝝎 = 𝛀𝑻
𝑭𝒔
1 1
−𝜋 ≤ 𝜔 ≤ 𝜋 or − ≤𝑓≤
2 2

Digital Signal Processing - Lecture 2 4

 Sampling…

Digital Signal Processing - Lecture 2 5

 Sampling…

• Ambiguity - The highest frequency in a continuous-time signal that can be

1
uniquely distinguished when such a signal is sampled at a rate 𝐹𝑠 = 𝑇 is 𝐹𝑚𝑎𝑥 = 𝐹2𝑠 ,
𝐹𝑠
• Higher frequencies will be aliased. The frequency (𝜔 = 𝜋) is called the folding
2
frequency.

Digital Signal Processing - Lecture 2 6

 Sampling Theorem

• Q ) How do we select sampling rate Fs?

• Required: information about maximum frequency content of the signal Fmax
• Sometimes signal passed through a filter that severely attenuates frequency components
above Fmax
- To avoid aliasing, Fs is selected so that

Digital Signal Processing - Lecture 2 7

 Quantization

• The process of converting a discrete-time continuous-amplitude

signal into a digital signal by expressing each sample value as a
finite number of digits is called quantization.
• The error introduced in this process is called quantization error or
quantization noise.

𝑥𝑞 𝑛 = 𝑄 𝑥(𝑛)

𝑒𝑞 𝑛 = 𝑥𝑞 𝑛 − 𝑥(𝑛)

Digital Signal Processing - Lecture 2 8

Levels increase ->Step size decrease
->quantization error decrease

Digital Signal Processing - Lecture 2 9

Digital Signal Processing - Lecture 2 10
Quantization of sinusoid

Digital Signal Processing - Lecture 2 11

 Coding of quantized samples

• With a word length of 𝒃 bits one can create 𝟐𝒃 different binary

numbers.
• The number of bits required in the coder is the smallest integer
greater than or equal to 𝒍𝒐𝒈𝟐 𝑳 where we have 𝑳 levels.
• The task of a D/A converter is to interpolate between samples

Digital Signal Processing - Lecture 2 12

 Discrete-time Signals

𝒙 = 𝒙(𝒏) , −∞ < 𝒏 < ∞

1, 𝑓𝑜𝑟 𝑛 = 1,3
• Functional representation: 𝑥 𝑛 = 4, 𝑓𝑜𝑟 𝑛 = 2
0, 𝑒𝑙𝑠𝑒𝑤ℎ𝑒𝑟𝑒

• Tabular representation:

• Sequence representation: 𝑥 𝑛 = … 0, 0, 0, 1, 4, 1, 0, 0, …

n=0
Digital Signal Processing - Lecture 3 13
 Basic Sequences
• Unit sample (unit impulse/ discrete-time impulse/ impulse) sequence:

1, 𝑓𝑜𝑟 𝑛 = 0
𝛿 𝑛 =
0, 𝑓𝑜𝑟 𝑛 ≠ 0

• Unit step signal:

1, 𝑓𝑜𝑟 𝑛 ≥ 0
𝑢 𝑛 =
0, 𝑓𝑜𝑟 𝑛 < 0

𝛿 𝑛 = 𝑢 𝑛 − 𝑢(𝑛 − 1)

Digital Signal Processing - Lecture 3 14

 Basic Sequences…
• Unit ramp signal:

𝑛, 𝑓𝑜𝑟 𝑛 ≥ 0
𝑢𝑟 𝑛 = 0,
𝑓𝑜𝑟 𝑛 < 0

• Exponential signal:

𝑥 𝑛 = 𝑎𝑛 , 𝑓𝑜𝑟 𝑎𝑙𝑙 𝑛

Digital Signal Processing - Lecture 3 15

 Classification of Signals

• Energy and Power Signals

• Periodic and Aperiodic Signals
• Symmetric and Asymmetric Signals

Digital Signal Processing - Lecture 2 16

 Manipulation of discrete-time signals

• Time Shift
• Folding or Reflection
• Time scaling / Downsampling
• Amplitude Modifications

Digital Signal Processing - Lecture 2 17

 Folding or reflection

• If you replace 𝑛 by −𝑛, the result of this operation is a folding or a reflection of the
signal about the origin 𝑛 = 0.

• Operations of folding and time delay/advance are not commutative

Digital Signal Processing - Lecture 3 18

 Discrete-time System
• A discrete-time system is a device or algorithm that operates on a
discrete-time signal, called the input or excitation, according to some
well-defined rule, to produce another discrete-time signal called output
or response of the system.
• In general, we view a system as an operation or set of operations
performed on the input signal 𝑥 𝑛 to produce the output signal 𝑦 𝑛 .
• We say that input signal 𝑥 𝑛 is transformed by the system into a signal
𝑦 𝑛 .
𝑦 𝑛 = 𝑇 𝑥(𝑛)
• Where 𝑇 denotes the transformation (also called an operator).

Digital Signal Processing - Lecture 3 19