9/14/2022

Sampling Process
Consider a continuous-time signal
𝑥 𝑡 = 𝐴 cos 2𝜋 𝑓 𝑡 + 𝜙
= 𝐴 cos Ω 𝑡 + 𝜙
Where, 𝑓 - is frequency in Hz
Ω - is analog angular freq – Radians/sec
DIGITAL SIGNAL PROCESSING
Let us sample this signal at discrete-time instants tn -
SEM-1, 2022-23
tn =nT = =
ECE/EEE F434 Lecture 5
Dr. Sarang C. Dhongdi, Dept of EEE, BITS Goa

Sampling Process Sampling Process

 Corresponding discrete-time signal is 2𝜋 Ω
𝑥[𝑛] = 𝐴 cos Ω 𝑛𝑇 + 𝜙 𝑥[𝑛] = 𝐴 cos 𝑛+𝜙
Ω

2𝜋 𝑥[𝑛] = 𝐴 cos 𝜔 𝑛 + 𝜙
𝑥[𝑛] = 𝐴 cos Ω 𝑛 +𝜙
Ω
Re-arranging – 2𝜋Ω
𝜔 = =Ω T
2𝜋Ω Ω
𝑥[𝑛] = 𝐴 cos 𝑛+𝜙 𝜔 = Normalized angular freq of discrete time signal
Ω
(Expressed in rad/samples)

Example of sampling and aliasing

x1 (t )  c o s ( 6  t ) Signal of 3 Hz
x 2 ( t )  c o s (1 4  t ) Signal of 7 Hz
x3 (t )  co s(2 6 t ) Signal of 13 Hz

Sampling rate is 10 Hz for all the signals

x1 ( n )  c o s ( 0 .6  n )  c o s ( 0 .6  n )
x 2 ( n )  c o s (1 . 4  n )  c o s ( 0 .6  n )
x 3 ( n )  c o s ( 2 .6  n )  c o s ( 0 .6  n )

1
 9/14/2022

Systems - Revisiting
 Description of discrete-time system

 Block diagram representation of DT systems

 Classification of systems

 Convolution sum and it’s properties

Discrete-time systems Discrete-time systems

x[n]
 A device/algorithm performing some prescribed Discrete-time y[n]

operation (or set of operations). system

Input signal Output signal
or Excitation or Response

 Operates on input signal (or excitation) and 𝒯

produces output signal (or response). 𝑦 𝑛 ≡ 𝒯 [𝑥 𝑛 ] 𝑥 𝑛 → 𝑦[𝑛] Transformation Operator

 Description of system is a mathematical expression  Most often –

or a rule defining input-output relationship.  Output sequence is generated sequentially.
 DT systems are usually called as digital filters.

System Representations blocks System Representations blocks

x1 (n) x(n) y (n)  Ax(n)

y (n)  x1 (n) x2 (n) A
Scalar Multiplication

Product / Modulation
x2 ( n) y (n)  x(n  1)
x(n)
Z 1 Unit Delay

x1 (n)
y (n)  x1 (n)  x2 (n) x(n)
x(n)
Summation Pick-off node
x2 ( n )

2
 9/14/2022

Schematic Diagram Classification of DT systems

y (n)  b0 x( n)  b1 x (n  1)  b2 x( n  2)  a0 y (n  1)  a1 y (n  2)
 Linear and Non linear system
x(n) y (n)
b0  Time variant and Time Invariant Sys

Z 1 Z 1  Static and Dynamic systems

x (n  1) y ( n  1)
b1 a0
 Causal and Non-causal system
1
Z 1 Z  Stable and Unstable system
b2 a1 y ( n  2)
x(n  2)

Linear Systems Time invariant systems

 A system is linear iff  System is said to be time-invariant iff
𝒯 𝑎 𝑥 𝑛 +𝑎 𝑥 𝑛 = 𝑎 𝒯 𝑥 𝑛 +𝑎 𝒯 𝑥 𝑛 𝒯
𝑥 𝑛 → 𝑦[𝑛]
implies that
𝒯
𝑥 𝑛 − 𝑘 → 𝑦[𝑛 − 𝑘]

 In general, 𝑦 𝑛, 𝑘 = 𝒯[𝑥 𝑛 − 𝑘 ]

Classification of DT systems Classification of DT systems

 Linear Vs Non-linear Systems
y (n)  nx (n)
y ( n )  x ( n)   1
 x (n  1) 
 Time-Variant Vs Time in-variant systems
y (n)  nx (n)
y (n)  nx (n)
 Static Vs Dynamic systems
y (n)  y (n  1)  x( n)
 Causal Vs Non-causal system

y (n)  nx (n)  x( n  1)
y (n)  x( n  1)  x (n)
Stable Vs unstable systems
y (n)  x( n  nd )

n

y (n)  x 2 (n  1) y (n )   x[k ]
k 

3
 9/14/2022

Passive systems and lossless systems

𝑦[𝑛] ≤ 𝑥[𝑛] <∞

𝑦[𝑛] = 𝑥[𝑛] <∞