Digital Signal Processing

Instructor Waseem Khan

waseem.khan@mail.au.edu.pk

Lecture 3 Department of Electrical Engineering

Air University

Basic Operations on Discrete-Time Signals

Time-shifting Time-reversal or flipping Time-scaling

Discrete-Time System

Classes of Discrete-Time Systems

Memoryless System Linear Systems Time-Invariant System Causal System Stable System

Memoryless System
If the system output for every value of n depends only on the input x[n] at the same value of n, it is a memory less system.

Examples

Linear System
A system that satisfies principle of superposition, is called linear system. If x1[n] and x2[n] are two inputs of a system and y1[n] and y2[n] are the respective outputs, then the system is linear if and only if T{ax1[n]+bx2[n]} = aT{x1[n]} + bT{x2[n]} = ay1[n] + by2[n]

Example
y[n] = (x[n])2 i.e. T{.} = (.)2 Lets check for linearity. y1[n] = (x1[n])2 y2[n] = (x2[n])2 Then T{x1[n] + x2[n]} = (x1[n] + x2[n])2 = (x1[n])2 + (x2[n])2 + 2x1[n] x2[n] (x1[n])2 + (x2[n])2 Hence, this system is not linear.

Time-Invariant System
A system is time-invariant if a delay or time-shift in the input sequence causes a corresponding shift in output sequence. i.e. if y[n] = T{x[n]}, then y[n-n0] = T{x[n-n0]} A system that is linear as well as time-invariant is called linear time-invariant or LTI system. This is a very important class of discrete systems and we will deal with LTI systems during a major part of this course.
Examples 2.8, 2.9

Causal and Stable System

Causal System If output of a system for any value of n=n0,depends only on x[n] for nn0, it is a causal system. In other words, the system output doesnt depend on future input samples. Stable System A system is stable iff every bounded input sequence produces a bounded output sequence. Input x[n] and output y[n] are bounded if for any Bx< and By< |x[n]| Bx and |y[n]| By

Example 2.8, 2.9, 2.10, 2.11

LTI Systems
Output of a LTI system in response to a unit impulse [n] at input is called, impulse response of the system usually represented as h[n].

If x[n] is the input to the system, the respective output is y[n] = T{x[n]} This is convolution process

Systems Examples
Ideal Delay: Moving Average: y[n] = x[n-nd]