Scribd
Upload
27 views22 pages

Discrete Time Sequence

This document discusses different types of operations that can be performed on discrete time signals, including time reversal, time scaling, scalar multiplication, and addition. It also defines various classifications of discrete time systems, such as static vs. dynamic, time variant vs. invariant, causal vs. non-causal, linear vs. nonlinear, FIR vs. IIR, and stable vs. unstable. Finally, it explains the convolution sum formula used to calculate the output of a discrete time system from the input and impulse response.

Uploaded by

Jinturaj Talukdar Jinturaj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
27 views22 pages

Discrete Time Sequence

This document discusses different types of operations that can be performed on discrete time signals, including time reversal, time scaling, scalar multiplication, and addition. It also defines various classifications of discrete time systems, such as static vs. dynamic, time variant vs. invariant, causal vs. non-causal, linear vs. nonlinear, FIR vs. IIR, and stable vs. unstable. Finally, it explains the convolution sum formula used to calculate the output of a discrete time system from the input and impulse response.

Uploaded by

Jinturaj Talukdar Jinturaj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

OPERATIONS, DIFFERENT TYPES, CONVOLUTION SUM

DISCRETE TIME SIGNALS


We have a DTS

y(n)=Some OPERATION DONE ON x(n)


=F{x(n)}
Simple Operation on Sequence

 Time Reversal: y(n)=x(-n)


 Time Scaling: y(n)=x(2n)
 Scalar Multiplication: y(n)=2x(n)
 Addition Operation: y(n)=x1(n)+x2(n)
Time Scaling: y(n)=x(2n)
Time Reversal: y(n)=x(-n)
Scalar Multiplication:
y(n)=2x(n)
Classification of Discrete
Time Systems
 Static and Dynamic
 Time variant and Invariant
 Causal and Non causal
 Linear and non Linear
 FIR and IIR
 Stable and Unstable
Static and Dynamic System
If the system Output y(n) is dependent only on
The present input x(n). (STATIC)
y(n)=n x(n)

If it depends on the past input as well then


It is a system with memory (DYNAMIC)
y(n)=n x(n-1)
Type of System: Time Invariant

If the system is time invariant and y1(n) is


the system output due to input x1(n), then
the shifted system input x1(n-n0) will produce
a shifted system output Y1(n-n0) by the
same amount no.

To test: y(n.k)=T[x(n-k)]
Response to delayed input=delayed output
Types of systems: causality

A causal system is the one in which the


output y(n) at time n depends on only
the current input x(n) at time n, and its past
input x(n-1), x(n-2)……..

If the system output depends on the future


input x(n+1), x(n+2) then It is non causal.
Types of systems: Linear

x1(n) DTS y1(n)

DTS
x2(n) y2(n)

ax1(n)+bx2(n) DTS a y2(n)+by2(n)


Impulse Response of DTS

δ(n) DTS h(n)

h(n) is called the impulse response

If we know the impulse response of a system then we will be able to calculate


The output to any input sequence x(n)
FIR, IIR :Impulse Response

δ(n) DTS h(n)

h(n) is called the impulse response


If the impulse response is finite duration then FIR otherwise IIR
Stable and Unstable Systems

 If for a bounded input, there is a bounded out


put
i.e for all n, |x(n)| <=M
then |y(n)|<=N

 M and N are finite positive then it is called a


 Bounded Input, Bounded Output Stable
 (BIBO)
Example of BIBO stable

|x(n)| <=M
|y(n)|<=N
BIBO Unstable
Difference equation

The input –output relationship of a LTI system


is called the difference Equation

y(n)+a1y(n-1)+…………+a N y(n-N)=
b0x(n)+b1x(n-1)+………..b M x(n-M)
yn   a1 yn  1  ....  aN yn  N   b0 xn   b1 xn  1  .....  bM xn  M 
The output of a DTS

Y(n)=x(n)*h(n)

The output of a DTS is the


Convolution of the input sequence
And Impulse Response
Convolution Sum (Formula)

Y(n)=x(n)*h(n)

Y(n)=h(n)*x(n)

Convolution Sum
Is Commutative
Short method of calculating
convolution Sum

Step 1: Calculate the starting of y(n), at n=n1+n2=-1

Step 2: Make the convolution table


Multiply the h(n) and x(n)

Add diagonals , the resulting sequence is y(n)

Y(n)={1, 4 , 6, 8, 5, -4}

Put the initial arrow in y(n)


Thus

Y(n)={1, 4 , 6, 8, 5, -4}

You might also like