Lecture - 2

DISCRETE TIME SIGNALS

Outline
❑ DISCRETE TIME SIGNALS

▪ Discrete time signals and classifications

▪ Analysis of discrete time LTI systems

▪ DE representation of Discrete time signals

▪ Implementation of discrete time systems

▪ Correlation of discrete time signals

Introduction to Discrete Time Signals

▪ Discrete-time signals x[n] is a function of an independent variable that

is an integer.

▪ Discrete-time signals are a fundamental concept in digital signal

processing.

▪ They represent signals that are sampled at regular intervals with

resulting in a sequence of discrete values.
Introduction to Discrete Time Signals

Discrete-time signals are represented mathematically as sequences of

numbers.
A sequence of numbers x in which the 𝑛𝑡ℎ number in the sequence is
denoted x[n] is formally written as x = {x[n]}, −∞ <n< ∞, where
n is an integer.
x[n] = 𝑥𝑎 (nT ), −∞ <n< ∞.
The quantity T is the sampling period, and its reciprocal is the
sampling frequency. x[n] as the “𝑛𝑡ℎ sample” of the sequence.
Introduction to Discrete Time Signals

Graphical representation of a Discrete-Time Signals

Introduction to Discrete Time Signals

Graphical representation of a Discrete-Time Signals

Introduction to Discrete Time Signals
▪ The discrete-time unit impulse and shifted unit impulse
functions are shown in the figure below.

Fig. Discrete-time unit impulse and shifted unit impulse functions

Introduction to Discrete Time Signals

▪ The discrete-time unit step and shifted unit step functions are
shown in the figure below.

Fig. Discrete-time unit step and shifted unit step functions

Introduction to Discrete Time Signals

▪ The discrete-time unit ramp and shifted unit ramp functions are
shown in the figure below.

Fig. Discrete-time unit ramp and shifted unit ramp functions

Exercise Discrete Time Signals

1. Consider a discrete-time signal x(n) shown in the figure below.

Sketch and label each of the

following signals derived
from x(n) carefully.

a. y (n) = x(n − 2) d . y (n) = x(− n + 2)

b. y (n) = x(2n) e. y (t ) = x(n)u (n − 3)

c. y (n) = x(−n) f . y (t ) = x(n − 2)u (4 − n)

Introduction to Discrete Time Signals

(a) Segment of a continuous-time speech signal 𝑥𝑎 𝑡 .

(b) Sequence of samples x[n] = xa(nT ) obtained from the signal in
part (a) with T = 125 μs.
Introduction to Discrete Time Signals

Basic parts of analog to digital (A/D) converter

Classifications of Discrete Time Signals: Even and Odd Signals

Discrete time signals can be classified as follows:

✓Even and odd signals
✓Periodic and non-periodic signals
✓Deterministic and random signals
✓Energy signals and power signals
✓Multichannel and multidimensional signals
Classifications of Discrete Time Signals: Even and Odd Signals

like Continuous time signals, Discrete time signals can be classified

according to the conditions or operations on the signals.

A signal is said to be even or symmetric if it satisfies the following

condition; x(-n) = x(n).

A signal is said to be odd if it satisfies the following condition;

x(-n) = -x(n)

A discrete time signal is periodic if and only if, it satisfies the following
condition: x(n+N)=x(n). Signals that repeat at regular intervals.
Classifications of Discrete Time Signals: Even and Odd Signals

Even signal Odd signal

Classifications of Discrete Time Signals: Even and Odd Signals

Examples include sine waves and square waves.

x(n) signal repeats itself after N period. You can refer signal and system

Aperiodic Signals that don't repeat. Examples: impulses and step functions.

Energy and Power Signals

Energy of a discrete time signal is denoted as E. Mathematically, it can be

written as;

+∞

𝐸= ෍𝑥 𝑛 2

−∞
Classifications of Discrete Time Signals: Power Signal

Average power of a discrete signal is represented as P.

power is finite i.e. 0<P<∞.

If the value of E is finite, then the signal x(n) is called energy signal.
If the value of the P is finite, then the signal x(n) is called Power signal.

Deterministic Signals: Signals whose values can be predicted with certainty.

Examples include sine waves with known frequency and amplitude.
Classifications of Discrete Time Signals
Analysis of Discrete Time LTI Systems

▪ Time invariant and time variant systems

✓ A system is said to be time invariant if the characteristics of the
systems do not change with time.
✓ A system is time-invariant, if
x(n) → y(n) and x(n − N ) → y(n − N )
▪ Linear and non linear systems
✓ A system is said to be linear if the response of the system to the
weighted sum of inputs should be equal to the corresponding
weighted sum of outputs of the systems.
✓ This principle is called superposition principle.
Analysis of Discrete Time LTI Systems

1 2 3

Frequency Response
Impulse Response Convolution
Describes how the
The system's output Mathematical operation used
system affects different
when the input is an to determine the output of an
frequencies in the input
impulse. Describes the LTI system for any given
signal. A crucial tool for
system's fundamental input. It combines the
analyzing and designing
impulse response and the
behavior.
filters.
input signal.
Analysis of Discrete Time LTI Systems
▪ Stable and unstable systems
✓ A system is said to be stable if bounded input produces
bounded output only.
✓ A necessary and sufficient condition for stability is given by
the inequality:
Analysis of Discrete Time LTI Systems
▪ Consider and LTI system

The output is given by

▪ The system function is very useful in the description and

analysis of LTI systems.
Analysis of Discrete Time LTI Systems
Operations on Sequences:

A single-input, single-output discrete-time system operates on a

sequence, called the input sequence, according some prescribed rules
and develops another sequence, called the output sequence.
Sinusoidal Response of LTI Systems
▪ Let us consider a sinusoidal input
Difference Equation Representation of Discrete Time Signals

Difference Equation Z-Transform

A mathematical equation that A powerful tool for analyzing
relates the current value of a
and solving difference
signal to past values. Provides
equations. It transforms a time-
a way to represent and model
domain signal into a frequency-
the behavior of discrete-time
signals. domain representation.
Differential Equation Representation of Discrete Time Signals

We have linear and time invariant system that are characterized by their
unit sample response h(n).
H(n) determine the output y(n) of the system for any given input
sequence x(n) by means of convolution summation.

y(n) = ෍ ℎ 𝑘 𝑥(𝑛 − 𝑘)
−∞
In general linear time invariant is characterized by the input output
relationship.
Differential Equation Representation of Discrete Time Signals

Recursive and non-recursive discrete time system

The cumulative average of the signal x(n) in the interval 0<=K<=n,
defined as
1
1
y n = ෍ℎ 𝑘 𝑛 = 0, , 1, 2, …
𝑛+1
𝑘=0

Y(n) requires the storage of all the input sample x(k) for 0<=k<=n ,
since n is increasing.
Differential Equation Representation of Discrete Time Signals
Our memory requirement grow linearly with time.
Then y(n) can be computed more efficiently utilizing the previous
output value y(n-1).

n n + 1 y n = ෍ ℎ 𝑘 + 𝑥(𝑛)
𝑘=0
= n n − 1 y n +x(n)
𝑛 𝑛
𝑌 𝑛 = 𝑦 𝑛−1 + 𝑥 𝑛
𝑛+1 𝑛+1
Differential Equation Representation of Discrete Time Signals

We begin the process with

n = 0 and proceed forward in
time.
𝑌 0 = x(0)

𝑌 1 =
1
𝑦 0 +
1
𝑥 1 Realization of a recursive
2 2
cumulative average system
2 1
𝑌 2 = 𝑦 1 + 𝑥 2
3 3
Differential Equation Representation of Discrete Time Signals

Say n = 𝑛0 , the successor is the past value of

Y(𝑛0 − 1) and the new input
Samples x(n), x(n+1)……

𝒏𝟎 𝟏
𝒚(𝒏𝟎 ) = 𝒚 𝒏𝟎 − 𝟏 + 𝒙 𝒏𝟎
𝒏𝟎 +𝟏 𝒏𝟎 +𝟏
Implementation of Discrete Time Systems

Hardware Implementation
Utilizing dedicated hardware components, such as digital
signal processors (DSPs) and field-programmable gate arrays
(FPGAs), to realize the system.
Software Implementation
Implementing the system using software algorithms, such as
those written in programming languages like C or MATLAB,
running on general-purpose computers.
Implementation of Discrete Time Systems

Consider the first order system

Non-recursive system is described in the equation

recursive system is described in the equation

Implementation of Discrete Time Systems

The general linear time invariant recursive system described by the

difference equation

Cascaded of recursive system

Cascaded of non recursive system
Correlation of Discrete Time Signals

1 Autocorrelation 2 Cross-correlation

Measures the similarity of Measures the similarity between

a signal with itself at two different signals at different
different time lags. Useful time lags. Useful for detecting
for identifying periodicities time delays, identifying similar
and patterns within a patterns, and determining if
signal. signals are related.
Representation of Discrete-Time Systems

Constant multiplier:

Adder :

Signal multiplier :

Unit delay :
Applications of Discrete Time Signal Processing

1 Audio Processing 2 Image Processing

Sound effects, noise reduction,
Image enhancement, noise reduction,
audio compression, and music
image compression, and medical
synthesis.
imaging.

3 Communication Systems 4 Control Systems

Digital control algorithms, process
Digital modulation, demodulation,
automation, and robotics.
and channel equalization.