DIGITAL SIGNAL PROCESSING

UNIT-I
Discrete Time Signals and Systems
Discrete Time Fourier Transform

1. Concept of Signal and Classification

➢ Continuous Time or Analog Signals
➢ Discrete Time and Digital Signals
2. Elementary or Standard Discrete Time Signals
➢ Digital Impulse Signal or Unit Sample Sequence
➢ Unit Step Signal
➢ Unit Ramp Signal
➢ Decaying Exponential Signal
➢ Raising Exponential Signal
➢ Double Exponential Signal
3. Representation of Discrete Time Signals
➢ Graphical Representation
➢ Functional Representation
➢ Tabular Representation
➢ Sequence Representation
4. Operations on Discrete Time Signals
➢ Time Shifting
➢ Time Scaling
➢ Time Reversal or Folding
➢ Amplitude Scaling
➢ Convolution
5. Classification or Properties of Discrete Time Signals
➢ Symmetric (Even) and Anti-symmetric (Odd) Signals
➢ Causal and Non-causal Signals
➢ Bounded and Unbounded Signals
➢ Periodic and Aperiodic Signals
➢ Energy and Power Signals
➢ Deterministic and Nondeterministic Signals

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 1

6. System Definition and Classification
➢ Continuous Time or Analog Systems
➢ Discrete Time and Digital Systems
7. Response of Discrete Time System
➢ Impulse or Unit Sample Response
➢ Response through Convolution
➢ Natural and Forced Response
8. Classification or Properties of Discrete Time Systems
➢ Linear and Non Linear Systems
➢ Shift Invariant and Variant Systems
➢ Static and Dynamic Systems
➢ Causal and Noncausal Systems
➢ Stable and Unstable Systems

9. Discrete Time Fourier Transform (DTFT)

10. Properties of DTFT
➢ Linear Property
➢ Periodicity or Periodic Property
➢ Time Shifting Property
➢ Frequency Shifting Property
➢ Time Reversal Property
➢ Conjugation or Conjugate Property
➢ Frequency Differentiation Property
➢ Time Convolution Theorem
➢ Frequency Convolution Theorem
➢ Parsevalls Theorem
11. Analysis of Discrete LSI System using DTFT
➢ Frequency Response of Discrete LSI System
➢ Impulse or Unit Sample Response
➢ Response of Discrete LSI System
12. Descriptive Questions
13. Quiz Questions

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 2

Concept of Signal and Classification:
Signal can be defined as a function or any physical phenomenon that conveys or carries some
information and its amplitude may vary with respect to one or more independent variables.
Examples:
➢ Music Signal
➢ Speech Signal
➢ Video Signal
➢ Electrocardiogram (ECG) Signal – It is used to predict heart diseases
➢ Electroencephalogram (EEG) Signal – Study the normal and abnormal behavior of the brain
➢ Electromyography (EMG) – It is used to study the condition of muscles
➢ Electromagnetic Waves
➢ Radar Signals
Based on variation in amplitude, signals are classified into mainly two types.
➢ Continuous Time or Analog Signals
➢ Discrete Time and Digital Signals

(A)Continuous Time or Analog Signals:

Continuous time signals are those for which the amplitude varies continuously in accordance with
continuous variation in time. All real time signals are analog in nature, hence the continuous time
signals are also known as analog signals. In general, continuous time signals are represented with
x(t), y(t), z(t), z(t), etc.

x(t)

0 t

y(t)

t
0

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 3

(B)Discrete Time and Digital Signals:
Discrete time signals are those for which the amplitude varies discreetly in accordance with discrete
variation in time. Any discrete time signal can be represented as the sequence of numbers, that’s
why discrete time signals are called sequences. Discrete time signals can be obtained from
continuous time signals by sampling process. In general, discrete time signals are represented with
x(n), y(n), z(n), etc.

x(n)

012 34 5 6 78 9………………………………………… n

y(n)

012 34 5 6 78 9………………………………………… n

Amplitude restricted version of discrete time signals are called digital signals, for which the
different number of amplitudes are restricted to finite number (Two). y(n) is a digital signal and all
digital signals are discrete time signals. Digital signals can be obtained from discrete time signals by
quantization mechanism.

Examples:
➢ x(t) = 2Cos(3t ) + 3Sin(2t )

➢ y(t) = 3e −2t Continuous time or analog signals

➢ z(t) = 3e−2t Cos(4t )

➢ x ( n) = 2 n
➢ y(n) = 2Cos(3n − 4) Discrete time signals
➢ z(n) = 2e jn / 3
➢ x(n) = {1,1,0,1,0,1,1,1,0,0,1}
➢ y(n) = {1,−1,1,−1,1,1,−1,−1,1} Discrete time or Digital signals
➢ z(n) = {1,1,2,1,2,1,1,1,2,2,1}

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 4

Elementary or Standard Discrete Time Signals:
Most commonly used signals are called elementary or standard discrete time signals, like digital
impulse signal or unit sample sequence, unit step signal, unit ramp signal, decaying exponential
signal, raising exponential signal, double exponential signal, etc.

(A)Digital Impulse Signal or Unit Sample Sequence:

Digital impulse or unit sample sequence is denoted with (n) and it can be defined as
1 ; n=0
δ(n) = 
0 ; n0

(n)

n
.…-3 -2 -1 0 1 2 3….

(B)Unit Step Signal:

Unit step signal is denoted with u(n) and it can be defined as
1 ; n0
u(n) = 
0 ; n0

u(n)

n
…..... -3 -2 -1 0 1 2 3 4 5 6 7…………

Unit step signal u(n) is the sum of a train of unit sample sequences
u(n) = (n) + (n – 1) + (n – 2) + (n – 3) + ……….+ (n – k)+ ……
 n
u(n) =  δ(n - k) or u(n) =  δ(k)
k=0 k = −
Unit sample sequence (n) is difference between u(n) and u(n-1)
(n) = u(n) – u(n – 1)
A sequence x(n) can be represented using unit sample sequence (n)

x(n) =  x(k) δ(n - k)
k = −

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 5

(C)Unit Ramp Signal:
Unit ramp signal is denoted with r(n) and it can be defined as

n ; n0
r(n) = nu(n) = 
0 ; n0

r(n)
7
6
5
4
3
2
1
n
……. -4 -3 -2-1 0 1 2 3 4 5 6 7…………

(D)Decaying Exponential Sequence:

A sequence x(n) is said to be decaying exponential only when the amplitude decays exponentially if
the time increases.

x(n) = a nu(n),0  a  1
x(n)

n
……… -4 -3 -2 -1 0 1 2 3 4 5 6 7…………

y(n) = a n ,0  a  1

y(n)

n
…… .. -9-8-7-6 -5 -4 -3 -2-1 0 1 2 3 4 5 6 7…………

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 6

(E)Raising Exponential Sequence:
A sequence x(n) is said to be raising exponential only when the amplitude raises exponentially if
the time increases.

x(n) = a nu (−n − 1), a  1

x(n)

n
……..-8 -7 -6 -5 -4 -3 -2 -1 0 1 2 3 ……….

y(n) = an , a  1

y(n)

n
…… .. -9-8-7-6 -5 -4 -3 -2-1 0 1 2 3 4 5 6 7 8…………

(F)Double Exponential Sequence:

A double exponential sequence x(n) is the combination of both raising and decaying exponential.
n
x(n) = a ,0  a  1
x(n)

n
… …. -7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7…………

n
y(n) = a , a  1
x(n)

n
… …. -7 -6 -5 -4 -3 -2 -1 0 1 2 3 4 5 6 7…………

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 7

Representation of Discrete Time Signals:
A discrete time signal can be represented in four different ways
➢ Graphical Representation – Signal in the form of graph
➢ Functional Representation – Mathematical Representation
➢ Tabular Representation – Signal in the form of table
➢ Sequence Representation – Signal in the form of sequence
Example-1:
Graphical representation of unit sample sequence x(n) = (n)
(n)

n
0
Functional representation of unit sample sequence x(n) = (n)
1 ; n=0
δ(n) = 
0 ; n0
Tabular representation of unit sample sequence x(n) = (n)
n … … -3 -2 -1 0 1 2 3 … …
(n) 0 0 0 0 0 1 0 0 0 0 0

Sequence representation of unit sample sequence x(n) = (n)

x(n) = (n) = {1}
Example-2:
Graphical representation of unit step sequence x(n) = u(n)
u(n)

n
0 1 2 3 4 5 6 7…………
Functional representation of unit step sequence x(n) = u(n)
1 ; n0
u(n) = 
0 ; n0

Tabular representation of unit step sequence x(n) = u(n)

n … … -3 -2 -1 0 1 2 3 … …
(n) 0 0 0 0 0 1 1 1 1 1 1

Sequence representation of unit step sequence x(n) = u(n)

 
x(n) = u(n) = 1 ,1,1,1,1,1,1,1.......... 
 

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 8

Operations on Discrete Time Signals:
Various operations used on discrete time signals are given below
➢ Time Shifting
➢ Time Scaling
➢ Time Reversal or Folding
➢ Amplitude Scaling
➢ Convolution
(A)Time Shifting Operation:
If the time shifting operation is applied on a discrete time signal x(n), then the signal is shifted to
left or right without changing its characteristics(width, amplitude and area). It is represented with
x(n  n0), where n0 is shift and it may be advance or delay.
Example-1:
 
Given discrete time signal, x(n) = 6,−2,3, 1 ,4,5,−1,7
  

 
x(n - 2) = 6,− 2,3,1,4,5,−1,7 , it is shifted to right by 2 units.
  

 
x(n + 3) = 6,−2,3,1,4,5,− 1 ,7  , it is shifted to left by 3 units.
  
Example-2:
Given discrete time signal, x(n) = u(n)

u(n)

n
0 1 2 3 4 5 6 7…………
u(n-2)

n
0 1 2 3 4 5 6 7 8 9……

u(n+2)
1

n
-2 -1 0 1 2 3 4 5 6
7…………
Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 9
(B)Time Scaling Operation:
If the time scaling operation is applied on a discrete time signal x(n), then the signal is compressed
or expanded in time axes without changing its amplitude. It is represented with x(an), where ‘a’ is
time scaling parameter. If a>1, then it is compressed and if 0<a<1, then it is expanded signal.
Example:
 
Given discrete time signal, x(n) = 1,2,3, 4,5,6,7,8,9
  

 
x(2n) = 2, 4,6,8 , it is compressed signal.
  

 
x(n/2) = 1,0,2,0,3,0, 4,0,5,0,6,0,7,0,8,0,9 , it is expanded signal.
  
(C)Time Reversal or Folding Operation:
Time reversal signal can be obtained by interchanging left hand side and right hand side samples
with respect to vertical axes or y-axes. If the given discrete time signal is x(n), then its time reversal
form is represented with x(-n) and the operation is called folding or mirror image or time reversal.
Example:
 
Given discrete time signal, x(n) = 1,2,3, 4,5,6,7,8,9
  

 
Then, time reversal signal x(-n) = 9,8,7,6,5, 4,3,2,1
  
(D)Amplitude Scaling Operation:
If the amplitude scaling operation is applied on a discrete time signal x(n), then the signal amplitude
may increase or decrease without changing its duration. It is represented with Ax(n), where ‘A’ is
amplitude scaling parameter.
Example:
 
Given discrete time signal, x(n) = 1,2,3, 4,5,6,7,8,9
  

 
y(n) = 2x(n) = 2,4,6, 8 ,10,12,14,16,18
  

1  
z(n) = x(n) = 0.5,1,1.5, 2,2.5,3,3.5,4,4.5
2   

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 10

Example:
 
Determine (a) y(n)=3x(2n-4) (b) z(n)=3x(-2n-4). (c) y(n)+z(n). Given x(n) = 1,2,3, 4,5,6,7,8,9 ,
  
Given x(0)=4, x(1)=5, x(2)=6, x(3)=6, x(4)=7, x(5)=8, x(6)=9,x(-1)=3, x(-2)=2 & x(-3)=1
(a)y(n) = 3x(2n - 4)
 
= 3x(−6), 3x(−4),3x(−2),3x(0),3x(2),3x(4),3x(6),3x(8)
  
 
=  0,6,12,18,21,27
 
(b)z(n) = 3x(-2n - 4)
 
= 3x(6),3x(4),3x(2),3x(0),3x(−2), 3x(−4),3x(−6)
  
 
= 27,21,18,12,6, 0 
 

 
(c)y(n)+ z(n) = 27,21,18,12,6, 0,6,12,18,21,27
  
(E)Convolution Operation:
Convolution is an operation, which is used in almost all signal processing applications to analyze
signals and systems in both the time and frequency domain. Convolution is a special operation,
which includes four different operations, namely
➢ Folding,
➢ Shifting,
➢ Multiplication and
➢ Summation in the case of discrete time signals or
Integration in the case of continues time signals.

Convolution in continuous time domain can be defined as


x1(t)  x 2 (t) =  x ( ) x (t -  )d
-
1 2

Where, x1(t) and x2(t) are two continuous time signals

Convolution in discrete time domain can be defined as


x1(n)  x2 (n) =  x (m) x (n − m)
m = −
1 2

Where, x1(n) and x2(n) are two discrete time signals

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 11

Example-1:
Compute the convoluted sequence x(n) = x1(n)  x2(n) using
(a)Graphical method
(b)Tabular method
(c)Matrix method
Given x1(n) = {1,2,3,4} and x2(n) ={5,6,7,8,9}

(a)Graphical method
➢ Draw the graphical representation of given sequences x1(m) and x2(m).
➢ Take the folding form of x2(m) to get x2(-m).
➢ Shift the folding sequence x2(-m) in different cases to get x2(n-m).
➢ Finally apply convolution formula to get the convoluted sequence.

x(n) = x1(n)  x 2 (n) =  x (m) x (n − m)
m = −
1 2

7
n = 0  x(0) =  x (m) x (−m) = 1 5 = 5
m=0
1 2

7
n = 1  x(1) =  x (m) x (1− m) = 1 6 + 2  5 = 6 + 10 = 16
m=0
1 2

7
n = 2  x(2) =  x (m) x (2 − m) = 1 7 + 2  6 + 3  5 = 7 + 12 + 15 = 34
m=0
1 2

7
n = 3  x(3) =  x (m) x (3 − m) = 1 8 + 2  7 + 3  6 + 4  5 = 8 + 14 + 18 + 20 = 60
m=0
1 2

7
n = 4  x(4) =  x (m) x (4 − m) = 1 9 + 2  8 + 3  7 + 4  6 = 9 + 16 + 21 + 24 = 70
m=0
1 2

7
n = 5  x(5) =  x (m) x (5 − m) = 2  9 + 3  8 + 4  7 = 18 + 24 + 28 = 70
m=0
1 2

7
n = 6  x(6) =  x (m) x (6 − m) = 3  9 + 4  8 = 27 + 32 = 59
m=0
1 2

7
n = 7  x(7) =  x (m) x (7 − m) = 4  9 = 36
m=0
1 2

Convoluted Sequence x(n) = x1(n)  x2(n) = {5, 16, 34, 60, 70, 70, 59, 36}

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 12

 x1(m)
Given Sequences:

x2(m)

x2(-m)
Folding:

Shifting:
Case –1: x2(1-m)

Case –2: x2(2-m)

Case –3: x2(3-m)

Case –4: x2(4-m)

Case –5: x2(5-m)

Case –6: x2(6-m)

Case –7: x2(7-m)

-9-8-7-6-5-4-3-2-1 0 1 2 3 4 5 6 7 8 9 m

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 13

(b)Tabular method:
➢ Draw a table and represent the samples of x1(m) and x2(m) in a table.
➢ Take the folding form of x2(m) and represent the samples of x2(-m) in a table
➢ Shift the folding sequence x2(-m) in different cases and represent the samples in a table
➢ Apply multiplication operation to get the samples of x1(m) x2(n-m).
➢ Finally apply summation operation to get the convoluted sequence.

x(n) = x1(n)  x 2 (n) =  x (m) x (n − m)
m = −
1 2

m -4 -3 -2 -1 0 1 2 3 4

Given x1(m) 1 2 3 4
Sequences x2(m) 5 6 7 8 9
Folding x2(-m) 9 8 7 6 5 0 0 0
x2(1-m) 9 8 7 6 5 0 0
x2(2-m) 9 8 7 6 5 0
x2(3-m) 9 8 7 6 5
Shifting x2(4-m) 9 8 7 6
x2(5-m) 0 9 8 7
x2(6-m) 0 0 9 8
x2(7-m) 0 0 0 9 Sum
x1(m) x2(-m) 5 0 0 0 = 5
x1(m) x2(1-m) 6 10 0 0 = 16
x1(m) x2(2-m) 7 12 15 0 = 34
x1(m) x2(3-m) 8 14 18 20 = 60
Multiplication
x1(m) x2(4-m) 9 16 21 24 = 70
x1(m) x2(5-m) 0 18 24 28 = 70
x1(m) x2(6-m) 0 0 27 32 = 59
x1(m) x2(7-m) 0 0 0 36 = 36

Convoluted Sequence x(n) = x1(n)  x2(n) = {5, 16, 34, 60, 70, 70, 59, 36}

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 14

(c)Matrix method:
➢ Pad x1(m) ‘4’ number of zeros to get a length of 8 samples.
x1(n) = {1,2,3,4,0,0,0,0}
➢ Pad x2(m) with ‘3’ number of zeros to get a length of 8 samples.
x2(n) ={5,6,7,8,9,0,0,0}
➢ Now represent x1(m) and x2(n-m) in the form of matrices and finally compute the
convoluted sequence.
7
x(n) = x1(n)  x 2 (n) =  x (m) x (n − m)
m=0
1 2

5 6 7 8 9 0 0 0
0 5 6 7 8 9 0 0

0 0 5 6 7 8 9 0
 
0 0 0 5 6 7 8 9
= 1 2 3 4 0 0 0 0
9 0 0 0 5 6 7 8
 
8 9 0 0 0 5 6 7
7 8 9 0 0 0 5 6
 
6 7 8 9 0 0 0 5
= 1  5 1  6 + 2  5 1  7 + 2  6 + 3  5 1 8 + 2  7 + 3  6 + 4  5
1  9 + 2  8 + 3  7 + 4  6 2  9 + 3  8 + 4  7 3  9 + 4  8 4  9
= 5 6 + 10 7 + 12 + 15 8 + 14 + 18 + 20
9 + 16 + 21 + 24 18 + 24 + 28 27 + 32 36
= 5 16 34 60 70 70 59 36

Convoluted Sequence x(n) = x1(n)  x2(n) = {5, 16, 34, 60, 70, 70, 59, 36}

Example-2:
Compute the convoluted sequence x(n) = x1(n)  x2(n), if (i) b=a. (i) b≠a
Given x1(n)=anu(n) and x2(n)=bnu(n).
x(n) = x1(n)  x2(n)

=  x (m) x (n − m)
m = −
1 2


= a
m = −
m
u(m) b n-m u(n-m) u(m) = 1, m  0 and
n
u(n-m) = 1, n – m  0 or m  n
=  a mb n-m
m =0 u(m)u(n-m) = 1, 0  m n
m
a
n
= bn   
m =0  b 

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 15

Case-1: if b=a
x(n) = x1(n)  x2(n)
n
= a n
 (1)
m =0
m

= a (1 + 1 + 1 + ........ 1, Add , n + 1, times)

n

= (n + 1)a n , n  0

Case-2: if b≠a
x(n) = x1(n)  x2(n)
m
a n
= b  n

m =0 b 
n +1
a
1−  
= bn b
a
1−
b
n +1 n +1
b −a
= ,n  0
b−a

Classification or Properties of Discrete Time Signals:

Classification or various properties of discrete time signals are given below
➢ Symmetric (Even) and Anti-symmetric (Odd) Signals
➢ Causal and Non-causal Signals
➢ Bounded and Unbounded Signals
➢ Periodic and Non-periodic Signals
➢ Energy and Power Signals
➢ Deterministic and Nondeterministic Signals

(A)Symmetric (Even) and Anti-symmetric (Odd) Signals:

➢ Discrete time signal x(n) is said to be even only when x(–n) = x(n). Even signals are
symmetrical about y – axis, hence even signals are called symmetric signals.
➢ Discrete time signal x(n) is said to be odd only when x(–n) = -x(n). Odd signals are anti-
symmetrical about y – axis, hence odd signals are called anti-symmetric signals.
➢ If a discrete time signal fails to satisfy even and odd property, then the signal is neither even
nor odd and it can be expressed as a sum of even signal xe(n) and odd signal xo(n).
x(n) = xe(n) + xo(n) --------------- (1)
Replace n with –n
x(-n) = xe(-n) + xo(-n)

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 16

 x(-n) = xe(n) – xo(n) --------------- (2)
(1)+(2)  x(n) + x(-n) = xe(n) + xo(n) + xe(n) – xo(n)
x(n) + x( −n)
 x e (n) =
2
(1)-(2)  x(n) – x(-n) = xe(n) + xo(n) –( xe(n) – xo(n) )
x(n) − x( −n)
 x o (n) =
2

Examples:
➢ x(n) = Cos(0.125n) is an even signal.
➢ y(n) = Sin(0.125n) is an odd signal.
➢ z(n) = Cos(0.125n) + Sin(0.125n) is neither even nor odd signal.
➢ Determine the even and odd parts of following signals

j n  
(1)x(n)=2n (2) y(n) = 3e 5 (3) z(n) = 1,2,3, 4,5,6,7,8,9
  

Problem-1:
Given discrete time signal x(n)=2n
x(n) + x( −n) 3n + 3− n
Even part of the signal x e (n) = =
2 2
x(n) − x( −n) 3n − 3− n
Odd part of the signal x o (n) = =
2 2

Problem-2:

j n
   
Given discrete time signal y(n) = 3e 5 = 3Cos n  + j 3Sin n 
5  5 

−j n
5    
y(-n) = 3e = 3Cos n  − j3Sin n 
5  5 
y(n) + y( −n)  
Even part of the signal ye (n) = = 3Cos n 
2 5 
y(n) − y(−n)  
Odd part of the signal yo (n) = = j3Sin n 
2 5 

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 17

Problem-3:
 
Given discrete time signal z(n) = 1,2,3, 4,5,6,7,8,9
  

 
z(-n) = 9,8,7,6,5, 4,3,2,1
  
Even part of the signal

z(n) + z( −n) 1    
ze (n) = = 9,8,8,8,8, 8 ,8,8,8,8,9 = 4.5,4,4,4,4, 4,4,4,4,4,4.5
2 2     
Odd part of the signal

z(n) − z( −n) 1    
zo (n) = = − 9,−8,−6,−4,−2, 0,2,4,6,8,9 = − 4.5,−4,−3,−2,−1, 0,1,2,3,4,4.5
2 2     

(B)Causal and Non-causal Signals:

➢ A discrete time signal x(n) is said be causal only when x(n) = 0; for n < 0, that means
causal signals are right sided.
➢ A discrete time signal x(n) is said be anti-causal only when x(n) = 0; for n > 0, that means
anti-causal signals are left sided.
➢ A discrete time signal x(n) is said be non-causal only when x(n)  0; for n < 0, that means
non-causal signals may be left sided or both sided and all anti-causal signals are comes
under non-causal signals.
Examples:
➢ x(n) = u(n) is a causal signal.
➢ y(n) = u(-n) is anti-causal and non-causal signal.
➢ z(n) = u(-n-1) is anti-causal and non-causal signal.
➢ x(n) = u(n+1) is non-causal signal.

(C)Bounded and Unbounded Signals:

A discrete time signal x(n) is said be bounded only when the amplitude of x(n) is finite for all
values of n over the range –  n  . Condition for a bounded signal is  x(n) < , –  n  .
Examples:
➢ Bounded Signals : δ(n), u(n), 0.5nu(n), 2nu(–n –1 ), 0.5|n|
➢ Unbounded Signals : r(n), 2nu(n), 0.5nu(–n –1 ), 2|n|

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 18

(D)Periodic and Aperiodic Signals:
A discrete time signal x(n) is said be periodic if and only if x(n+N) = x(n), otherwise the signal is
aperiodic or non-periodic, where N is smallest positive integer and it is called fundamental period or
period of given signal x(n).

 2 
Example-1: x(n) = 9Cos n + 3
 9 
If x(n) is periodic with a period of N samples, then
 2   2 2   2 
x(n + N) = 9Cos (n + N ) + 3 = 9Cos n+ N + 3 = 9Cos n + 3 + 2k  = x(n)
 9   9 9   9 
2
 N = 2k  N = 9k
9
Possible integer values of N = 9,18,27,…. for integer values of k = 1,2,3….
Hence, given signal is periodic with a period N=9 samples.

 5 
Example-2: x(n) = 9Cos n + 3 
 9 
If x(n) is periodic with a period of N samples, then
 5   5 5   5 
x(n + N) = 9Cos (n + N ) + 3  = 9Cos n + N + 3  = 9Cos n + 3 + 2k  = x(n)
 9   9 9   9 
5 18
 N = 2k  N = k
9 5
Possible integer values of N = 18,36,54,…. for integer values of k = 5,10,15….
Hence, given signal is periodic with a period N=18 samples.

5 
Example-3: x(n) = Sin n +  
9 
If x(n) is periodic with a period of N samples, then
5  5 5  5 
x(n + N) = Sin (n + N ) +   = Sin n + N +   = Sin n +  + 2k  = x(n)
9  9 9  9 
5 18
 N = 2k  N = k , Integer value of N is not possible for integer values of k.
9 5
Hence, given signal is aperiodic or non-periodic.

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 19

  8   3 
Example-4: x(n) = x (n) + x (n) = 3Cos n + 4  + 2Sin n + 5 
1 2  3   2 
If x1(n), x2(n) and x(n) are periodic with a periods of N1, N2 and N samples, then x(n+N)=x(n)
 8   8 8   8 
 x (n + N ) = 3Cos (n + N ) + 4  = 3Cos n + N + 4  = 3Cos n + 4 + 2k  = x (n)
1 1  3   3 3   3  1
8 3
 N = 2k  N = k
3 4
Possible integer values of N1 = 3,6,9,12,… for integer values of k = 4,8,12,16…. and
 3   3 3   3 
 x (n + N ) = 2Sin (n + N ) + 5  = 2Sin n + N + 5  = 2Sin n + 5 + 2k  = x (n)
2 2  2   2 2   2  2
3 4
 N = 2k  N = k
2 3
Possible integer values of N2 = 4,8,12,16… for integer values of k = 3,6,9,12….
N=Common & Min (N1,N2)=12, hence, given signal is periodic with a period N=12 samples.

 
Example-5: x(n) = 3Sin n2 
8 
If x(n) is periodic with a period of N samples, then
       
x(n + N) = 3Sin (n + N )2  = 3Sin n2 + N 2 + Nn  = 9Cos n2 + 2k + 2k n  = x(n)
8  8 8 4  8 1 2 

 N 2 = 2k1  N 2 = 16k1  N = 4 k1
8
Possible integer values of N = 4,8,12,16… for integer values of k1 = 1,4,9,16…. and

 N = 2k2  N = 8k2
4
Possible integer values of N = 8,16… for integer values of k 2 = 1,2….
N=Common & Min (N of k1,N of k2)=8, hence, given signal is periodic with a period N=8 samples.

Example-6: What is the time period of a signal x(n), which is the sum of 3 periodic signals with
periods N1=2, N2=3 and N3=5.
Possible integer values if k = 1,2,3,4,5,6,7,8,9,….
N1k=2,4,6,8,10,12,14,16,18,20,22,24,26,28,30,32,34……
N2k=3,6,9,12,15,18,21,24,27,30,33………
N3k=5,10,15,20,25,30,35,40,45…….
N=Common & Min (N1,N2,N3)=30, hence, given signal is periodic with a period N=30 samples.

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 20

(E)Energy and Power Signals:
➢ A discrete time signal x(n) is said be energy signal only when the total energy (E) under the
signal x(n) is finite and the average power (P) is zero.
0 < E < , and P =0
➢ A discrete time signal x(n) is said be power signal only when the average power (P) of the
signal x(n) is finite and the total energy is infinity.
0 < P < , and E = 
➢ If a discrete time signal fails to satisfy energy and power signal properties, then the signal is
called neither energy nor power.
➢ In general periodic signals are power signals and aperiodic signals are energy signals.
➢ Total energy and average power can be computed from the following formulas

 2 2
 1  N
E= 
n = −
x(n) & P = Lt 
N→ 2N + 1

  x(n)
n= −N

n
1
Example-1: x(n) = 3  u (n)
2
Total Energy:
 2 
 1
n 2

 1
n  1   4
E=  x(n) =  3  u (n) =  9  = 9  = 9  = 12 jouls
2 n=0  4 
 1− 
4  
n = − n = −
1 3

Average Power:
n 2 n
2
 1  N  1  N  1  1  N  1
P = Lt    x(n) = Lt    3  u (n) = Lt   9 
N→  2N + 1 N→  2N + 1 N→  2N + 1
 n = −N  n = −N  2   n = 0  4 

= Lt 

 9  1 − 4
1
N +1

 ( )
 12 
= Lt  ( ) N +1
 = 12 (1 − 0) = 12 = 0
  1 − 1 4
N→  2N + 1
  1 − 14  N→ 2N + 1   
 
Given x(n) is energy signal because the total energy is finite and average power is zero.

Example-2: x(n) = u (n)

 2  2 
Total Energy: E = 
n = −
x(n) =  u(n)
n = −
= 1 = 
n=0

Average Power:
2
 1  N  1  N  1 N  N+1  1
P = Lt    x(n) = Lt    u(n) = Lt  1 == Lt   = Watts
2

N→ 2N + 1 N→ 2N + 1 N→ 2N + 1 N→ 2N + 1 2

n = −N n = −N n=0

Given x(n) is power signal because the average power is finite and total energy is infinity.

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 21

  
Example-3: x(n) = 2Sin n 
3 
Total Energy:
2
    1  2  
 2   
E= 
n = −
x(n) = 
n = −
2Sin n  =  4Sin2  n  = 4  1 − Cos
3  n = −  3  n = − 2 
n   = 2( − 0) = 
 3 
Average Power:
2
  2  
2
 1  N  1  N  4  N
P = Lt    x(n) = Lt    2Sin n  = Lt    Sin  n 
N→  2N + 1 N→  2N + 1 N→  2N + 1
 n = −N  n = −N 3   n = − N 3 
 4  N 1  2    2 
= Lt    1 − Cos n   = Lt  (2 N + 1 − 0) = 2Watts
N→  2N + 1
 n = − N 2   3   N→ 2N + 1
Given x(n) is power signal because the average power is finite and total energy is infinity.


Example-4: Determine the energy and power of x(n) = n(− 1)n , n = 1,2,3 and y(n) =  x(n + 7k )
k = −

 
Given x(n) = n(− 1)n , n = 1,2,3 =  0,−1,2,−3 =
 
 2

Total Energy: Ex =  = − 1 + 2 + − 3 = 1 + 4 + 9 = 14 jouls

2 2 2
x(n)
n = −

Average Power:

( )
2
 1  N  1   14  14
Px = Lt    x(n) = Lt   − 1 + 2 + − 3 = Lt  = =0
2 2 2

N→ 2N + 1 N→ 2N + 1 N→ 2N + 1 

n = −N

Given x(n) is energy signal because the total energy is finite and average power is zero.

Given y(n) =  x(n + 7k ) = .. + x(n − 7) + x(n) + x(n + 7) + .. periodic with a period of 7 samples
k = −

 
y(n) = .......... ..., −1,2,−3,0,0,0, 0,−1,2,−3,0,0,0,0,−1,2,−3,0,0,0,0,−1,2,−3,....... 
  
 2

Total Energy: Ey =  y(n) = ...... + − 1 + 2 + − 3 + ...... = ...14 + 14 + 14... = 

2 2 2

n = −

Average Power:

 1  N
2  0 + − 1 2 + 2 2 + − 3 2 + 0 + 0 + 0  14
Py = Lt    y(n) =  = =2
N→ 2N + 1
 n= −N  7  7
 
Given y(n) is power signal because the average power is finite and total energy is infinity.

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 22

(F)Deterministic and Nondeterministic Signals:
Signals that are completely specified by a mathematical expression are called deterministic signals,
where the amplitude of the signal can be determined at any instant of time.

Examples:
1 ; n=0
➢ Digital Impulse Signal or Unit Sample Sequence, δ(n) = 
0 ; n0

1 ; n0
➢ Unit Step Signal, u(n) = 
0 ; n0

n ; n0
➢ Unit Ramp Signal, r(n) = nu(n) = 
0 ; n0

➢ Decaying Exponential Signals, x(n) = a nu(n),0  a  1 and y(n) = a n ,0  a  1

➢ Raising Exponential Signals, x(n) = a nu (−n − 1), a  1 and y(n) = an , a  1

n n
➢ Double Exponential Signals, x(n) = a ,0  a  1 and y(n) = a , a  1

Signals whose characteristics are random in nature are called nondeterministic signals or random
signals, where the mathematical representation is not possible, for example noise signal.

Example:
N(t)

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 23

System Definition and Classification:
System can be defined as the collection of objects or elements or components and all these things
should be interconnected in such a way to achieve an objective or predefined result or outcome.
Based on the type of input applied, components used in the design and type output, systems are
classified into two types.
➢ Continuous Time or Analog Systems
➢ Discrete Time and Digital Systems

Continuous Time or Analog Systems:

Continuous time or analog systems are those for which both input and output are continuous time
signals and are constructed by using analog components, like resistors, capacitors, inductors,
diodes, transistors, analog ICs, etc.

Continuous Time or
Input signal, x(t) Analog System output signal, y(t)

➢ Thermal stability of continuous time or analog systems is poor because of all analog
components are temperature sensitive.
➢ Continuous time or analog systems are non programmable and static in nature.
➢ Continuous time or analog systems are described by differential equation, which involves
only differentials.

Examples:
(a) A simple RC high pass filter acts as a differentiator, where the output y(t) is the
differentiation of input x(t)
d
y(t) = [ x(t) ]
dt
(b) A simple RC low pass filter acts as an integrator, where the output y(t) is the integration
of input x(t)
d
y(t) =  x(t)  x(t) = [y(t)]
dt

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 24

Discrete Time and Digital Systems:
Discrete time systems are those for which both input and output are discrete time signals and are
constructed by using discrete components, like adders, constant multipliers and delays (memories).
In the case of digital systems, both input and output are digital signals.

Discrete Time System or

Input signal, x(n) Digital System Output signal, y(n)

➢ Thermal stability of discrete time or digital system is high.

➢ Discrete time or digital systems are programmable and dynamic.
➢ Discrete time or digital systems are described by a difference equation, which does not
involve differentials, which involve only shifts.

Examples:
➢ y(n) = 2 x(n) + 3 x(n – 1) + 4 x(n – 2)
➢ y(n) = 2 x(n) + 3 x(n – 1) + 4 y(n – 2).
➢ y(n) = 2 x(n) + n x(n – 1) + 4 y(n – 2).
➢ y(n) = 2 x(n2) + 3 x(n + 1) + 4 y(n – 2).
➢ y(n) = 2 x(n/2) + 3 x(n – 1) + 4 y(n – 2).

Response of Discrete Time System:

Input , x(n) Discrete Time System Response or Output, y(n)

(A)Impulse or Unit Sample Response:

Output of discrete time system with an input of impulse or unit sample signal is called impulse
response or unit sample response and it is represented with h(n).

Input , x(n)=δ(n) Discrete Time System Output , y(n)=h(n)

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 25

Example-1:
Determine the impulse response of a discrete time system y(n) = 2 x(n) + 3 x(n – 1) + 4 x(n – 2).
Put, x(n) = δ(n) and y(n) = h(n)
h(n) = 2 δ(n) + 3 δ(n – 1) + 4δ(n – 2)
n =-1  h(-1) = 2 δ(-1) + 3 δ(–2) + 4δ(–3) = 0
n = 0  h(0) = 2 δ(0) + 3 δ(–1) + 4δ(–2) = 2
n = 1  h(1) = 2 δ(1) + 3 δ(0) + 4δ(–1) = 3
n = 2  h(2) = 2 δ(2) + 3 δ(1) + 4δ(0) = 4
n = 3  h(3) = 2 δ(3) + 3 δ(2) + 4δ(1) = 0

 
h(n) =  2,3,4
 

1
Example-2: Determine the impulse response of a discrete time system y(n) − y (n − 1) = x( n) by
2
assuming zero initial conditions.
Put, x(n) = δ(n) and y(n) = h(n)
1
h(n) = h(n − 1) +  (n)
2
1 1
n = −1  h( − 1 ) = h(−2) +  (−1) = (0) + 0 = 0
2 2
1 1
n = 0  h( 0 ) = h(−1) +  (0) = (0) + 1 = 1
2 2
1 1 1
n = 1  h(1 ) = h(0) +  (1) = (1) + 0 =
2 2 2

11 2
1 1
n = 2  h( 2 ) = h(1) +  (2) =   + 0 =  
2 2 2 2

1 1  1 2 1
3
n = 3  h( 3 ) = h(2) +  (3) =   + 0 =  
2 22 2
…..
…..
n n
1 1
h(n) =   , n  0 or h(n) =   u (n)
2 2

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 26

(B)Response through Convolution:
Response of the discrete time system is the convolution of input x(n) and impulse response h(n).

Discrete Time System

Input , x(n) Output or Response, y(n)=x(n)*h(n)
h(n)

Example-1: Determine the impulse response and response of the discrete time system
y(n) − ay(n − 1) = x(n) by assuming zero initial conditions with input x(n)=bnu(n).
Put, x(n) = δ(n) and y(n) = h(n) in h(n) = ah(n − 1) +  (n)
n = −1  h( − 1 ) = ah(−2) +  (−1) = a(0) + 0 = 0
n = 0  h( 0 ) = ah(−1) +  (0) = a (0) + 1 = 1
n = 1  h(1 ) = ah(0) +  (1) = a(1) + 0 = a

n = 2  h( 2 ) = ah(1) +  (2) = a(a ) + 0 = a2

n = 3  h( 3 ) = ah(2) +  (3) = a(a )2 + 0 = a3

…..
…..

h(n) = a n , n  0 or h(n) = a nu (n) ,

It is the impulse response of given system and Response of the system can be computed from
y(n) = x(n)  h(n)
 u(m) = 1, m  0 and
=  x(m) h(n − m)
m = −
u(n-m) = 1, n – m  0 or m  n

u(m)u(n-m) = 1, 0  m n
= b
m = −
m
u(m) a n-mu(n-m)
n
=  b m a n-m
m=0
m
n
b
= an   
m =0 a 

Case-1: if b=a
n
y(n) = x(n)  h(n) = a n  (1) = a n( 1 + 1 + 1 + ........1,Add,n + 1,times) = (n + 1 )a n ,n  0, or, (n + 1 )a nu(n)
m

m=0

Case-2: if b≠a
n +1
b
1−  
a n +1 − b n +1 a n +1 − b n +1
m
n
b a
y(n) = x(n)  h(n) = a n    = a n = , n  0, or, u ( n)
m=0 a  1−
a a−b a−b
b

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 27

(C)Natural and Forced Response:
Response of a discrete time system with zero input and for given initial conditions is called zero
input response or free response or natural response.

Discrete Time System

Input , x(n) = 0 Natural Response, yn(n)
with initial conditions

Step by step process to compute the natural response

Step-1: Obtain the polynomial in r by substituting x(n)=0 and y(n)=rn in given system.
Step-2: Determine the roots of polynomial. i.e., r1,r2,r3,……
Step-3: Write homogeneous solution yh(n)
(a)If all the roots are different, then yh(n) = A(r1)n + B(r2)n + C(r3)n.
(b)If roots are repeated (r1=r2=r), then yh(n) = (An+B)(r)n + C(r3)n.
(c)If roots are complex (r1=a+jb,r2=a-jb), then yh(n) = (ACosn+BSinn)(r)n + C(r3)n.
b
Where, r = a2 + b2 and  = tan − 1 
a
(c)Find constants A, B, C,… by using initial conditions.
(d)Obtain the natural response by substituting A,B,C,… in Step-3, i.e yn(n) = yh(n).

Response of a discrete time system by applying input with zero initial conditions is called zero state
response or forced response.

Discrete Time System

Input , x(n) Forced Response, yf(n)
with zero initial conditions

Step by step process to compute the forced response

Step-1: Based on given input, write the particular solution yp(n).
(a)If x(n) = δ(n), then yp(n) = 0.
(b)If x(n) = u(n), then yp(n) = ku(n).
(c)If x(n) = anu(n), then yp(n) = kanu(n).
(d)If x(n) = anu(n) and any root r1,r2,r3 is equal to ‘a’, then yp(n) = knanu(n).
Step-2: Find the constant ‘k’ by substituting x(n) and y(n)=yp(n) in given system.
Step-3: Write the forced response yf(n)= yh(n) + yp(n).
Step-4: Find constants A, B, C,… with zero initial conditions.
Step-5: Obtain the forced response by substituting A,B,C,… in Step-3.
Note: Response of a discrete time system is the sum of natural response and forced response.
y(n) = yn (n) + yf (n).

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 28

Example-1: Determine (a)Natural Response (b)Forced Response (c)Response of the system
5 1
y(n) − y (n − 1) + y (n − 2) = x(n) + x(n − 1) with initial conditions y(-1)=y(-2)=1 and input
6 6
n
1
x(n) =   u (n).
4
(a)Natural Response: Response of the system with zero input and for given initial conditions
Substitute y(n)=rn and x(n)=0
 1  1
 r n − r n − 1 + r n − 2 = 0  r 2 − r + = 0   r −  r −  = 0  r1 = & r2 =
5 1 5 1 1 1
6 6 6 6  2  3 2 3
Homogeneous solution of given system

() ()
n n
1 1
 y (n) = A r n + B r n = A  + B 
h 1 2 2  3
Use initial conditions y(-1)=y(-2)=1 to evaluate constants A and B
n n
1 1 5 1
y (n) = y (n) = A  + B  = y (n − 1) − y (n − 2)
h 2  3 6 6
0 0
1 1 5 1
n = 0  y(0) = y (0) = A  + B  = y(−1) − y (−2)
h 2  3 6 6
5 1 4 2
 y (0) = A + B = − = =  3 A + 3B = 2 − − − − − −(1)
6 6 6 3
1 1
1 1 5 1
n = 1  y(1) = y (1) = A  + B  = y(0) − y(−1)
h 2  3 6 6
A B 5 2 1 10 − 3 7 7
 y (1) = + = − = =  3 A + 2 B = − − − − − (2)
2 3 63 6 18 18 3
7 1 2 2 1
Solve equations (1) and (2)  3B − 2 B = 2 −  B = − and A = − B = + = 1
3 3 3 3 3
n n
 1 11
Natural Response, yn (n) =   −   , n  −2
 2  3 3

(b)Forced Response: Response of the system by applying input with zero initial conditions
n
1
Particular solution of given system, y (n) = k   u (n).
p 4
n n
1 1
Find the constant ‘k’ by substituting x(n) =   u (n) & y(n) = y (n) = k   u (n) in given system
4 p 4

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 29

 1
n 5  1 n − 1 1  1 n − 2 1
n
1
n −1
k   u ( n) − k   u (n − 1) + k   u (n − 2) =   u (n) +   u (n − 1)
4 6 4 6 4 4 4
2 5  1 1 1  1 0 2 1
1 1 1
n = 2  k   u (2) − k   u (1) + k   u (0) =   u (2) +   u (1)
4 6 4 6 4 4 4
 1  5 1 1  1  1 1 5 1 5  16 5  16 16 
 k  − k  + k =   +    k − + =  k − + =5
 16  6  4  6  16   4   16 24 6  16  16 24 6

 10 8   3 − 10 + 8  1
 k 1 − +  = 5  k   = 5  k   = 5  k = 15
 3 3  3   3
n nn
1 1 1
Forced response of given system, y (n) = y (n) + y (n) = A  + B  + 15  , n  0
f h p 2  3 4
Find constants A & B with zero initial conditions
n nn 5 n n −1
1 1 1 1 1 1
 y(n) = A  + B  + 15  = y(n − 1) − y(n − 2) +   u (n) +   u (n − 1)
2  3 4 6 6 4 4
0 0 5
0 0 −1
1 1 1 1 1 1
n = 0  y(0) = A  + B  + 15  = y(−1) − y(−2) +   u (0) +   u (−1)
2  3 4 6 6 4 4
5 1
 y (0) = A + B + 15 = (0) − (0) + 1 + 0 = 1  A + B = −14 − − − − − − − (1)
6 6
1 1 1 1 0
1 1 1 5 1 1 1
n = 1  y(1) = A  + B  + 15  = y(0) − y(−1) +   u (1) +   u (0)
2  3 4 6 6 4 4
A B 15 5 1 1 A B 15 5 1
 y (1) = + + = (1) − (0) + + 1  + = − + + + 1
2 3 4 6 6 4 2 3 4 6 4
15  6 5  6 1  6 45 3 3 − 45
 3A + 2B = − + + + 6 = − + 5 + + 6 = 11 + = 11 − 21 = −10 − − − (2)
4 6 4 2 2 2
Solve equations (1) and (2)3A+2(-14-A)=-103A-2A=28-10A=18 & B=-14-A=-14-18=-32
n n n
1 1 1
Forced Response, y (n) = 18  − 32  + 15  , n  0
f 2  3 4
(c)Response of the System: Sum of natural and forced response
n n n n n
 1 11 1 1 1
y(n) = yn (n) + y (n) =   −   + 18  − 32  + 15  , n  0
f  2 3 3 2  3 4
n n n
1 1  1  1
 y(n) = 19  −  + 32  + 15  , n  0
2 3  3  4
n n n
 1  97  1  1
 y(n) = 19  −   + 15  , n  0
2 3  3 4

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 30

Example-2: Determine (a)Natural Response (b)Forced Response (c)Response of the system
5 1
y(n) − y (n − 1) + y (n − 2) = x(n) + x(n − 1) with initial conditions y(-1)=y(-2)=1 and input
6 6
n
1
x(n) =   u (n).
2
(a)Natural Response: Response of the system with zero input and for given initial conditions
Substitute y(n)=rn and x(n)=0
 1  1
 r n − r n − 1 + r n − 2 = 0  r 2 − r + = 0   r −  r −  = 0  r1 = & r2 =
5 1 5 1 1 1
6 6 6 6  2  3 2 3
Homogeneous solution of given system

() ()
n n
1 1
 y (n) = A r n + B r n = A  + B 
h 1 2 2  3
Use initial conditions y(-1)=y(-2)=1 to evaluate constants A and B
n n
1 1 5 1
y (n) = y (n) = A  + B  = y (n − 1) − y (n − 2)
h 2  3 6 6
0 0
1 1 5 1
n = 0  y(0) = y (0) = A  + B  = y(−1) − y (−2)
h 2  3 6 6
5 1 4 2
 y (0) = A + B = − = =  3 A + 3B = 2 − − − − − −(1)
6 6 6 3
1 1
1 1 5 1
n = 1  y(1) = y (1) = A  + B  = y(0) − y(−1)
h 2  3 6 6
A B 5 2 1 10 − 3 7 7
 y (1) = + = − = =  3 A + 2 B = − − − − − (2)
2 3 63 6 18 18 3
7 1 2 2 1
Solve equations (1) and (2)  3B − 2 B = 2 −  B = − and A = − B = + = 1
3 3 3 3 3
n n
 1 11
Natural Response, yn (n) =   −   , n  −2
 2  3 3

(b)Forced Response: Response of the system by applying input with zero initial conditions
n
1
Particular solution of given system, y (n) = kn  u (n).
p 2
n n
1 1
Find the constant ‘k’ by substituting x(n) =   u (n) & y(n) = y (n) = kn  u (n) in given
2 p 2
system

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 31

 n n −1 n−2 n n −1
1 5 1 1 1 1 1
kn  u (n) − k (n − 1)  u (n − 1) + k (n − 2)  u (n − 2) =   u (n) +   u (n − 1)
2 6 2 6 2 2 2
2 1 0 2 1
1 5 1 1 1 1 1
n = 2  k (2)  u (2) − k (1)  u (1) + k (0)  u (0) =   u (2) +   u (1)
2 6 2 6 2 2 2
1 5 1 1 1 1 5  3  6 −5 3
 k  − k  + 0 =   +    k −  =  k = k =9
 2 6  2 4 2  2 12  4  12  4
n n n
1 1 1
Forced response of given system, y (n) = y (n) + y (n) = A  + B  + 9n  , n  0
f h p 2  3  2
Find constants A & B with zero initial conditions
n nn 5 n n −1
1 1 1 1 1 1
 y(n) = A  + B  + 9n  = y(n − 1) − y(n − 2) +   u (n) +   u (n − 1)
2  3 2 6 6 2 2
0 0 0 5 0 −1
1 1 1 1 1 1
n = 0  y(0) = A  + B  + 9(0)  = y(−1) − y(−2) +   u (0) +   u (−1)
2  3 2 6 6 2 2
5 1
 y (0) = A + B + 0 = (0) − (0) + 1 + 0 = 1  A + B = 1 − − − − − − − (1)
6 6
1 1 1 1 0
1 1 1 5 1 1 1
n = 1  y(1) = A  + B  + 9(1)  = y(0) − y(−1) +   u (1) +   u (0)
2  3 2 6 6 2 2
A B 9 5 1 1 A B 9 5 1
 y (1) = + + = (1) − (0) + + 1  + = − + + + 1
2 3 2 6 6 2 2 3 2 6 2
9  6 5  6 1 6
 3 A + 2B = − + + + 6 = −27 + 5 + 3 + 6 = −13 − − − − − (2)
2 6 2
Solve equations (1) and (2)
3A+2(1-A)=-133A-2A=-2-13A=-15 & B=1-A=1+15=16
n n
n n n
1 1 1 1 1
Forced Response, y (n) = −15  + 16  + 9n  = (9n − 15)  + 16  , n  0
f 2  3 2  2  3

(c)Response of the System: Sum of natural and forced response

n n n n
 1 11 1 1
y(n) = yn (n) + y (n) =   −   + (9n − 15)  + 16  , n  0
f  2  3 3 2 3
n n
1  1  1 
 y(n) = (9n − 14)  + 16 −   , n  0
2  3  3 

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 32

Example-3:
2 1
Determine the Natural Response of the system y(n) − y (n − 1) + y (n − 2) = x(n) + x(n − 1) with
3 9
initial conditions y(-1)=y(-2)=1.
Natural Response: Response of the system with zero input and for given initial conditions
Substitute y(n)=rn and x(n)=0

 rn − rn −1 + rn − 2 = 0
2 1
3 9
2 1
 r2 − r + = 0
3 9
2
 1
 r −  = 0
 3
1
 r = r1 = r2 =
3
Homogeneous solution of given system
n
1
 y (n) = ( A + nB)(r )n = ( A + nB) 
h  3
Use initial conditions y(-1)=y(-2)=1 to evaluate constants A and B
n
1 2
y (n) = y (n) = ( A + nB)  = y (n − 1) − y (n − 2)
1
h  3 3 9
0
1 2 1
n = 0  y (0) = y (0) = ( A + (0) B)  = y (−1) − y (−2)
h  3 3 9

2 1 6 −1 5
 y (0) = A = − = = − − − − − −(1)
3 9 9 9
1
1 2 1
n = 1  y (1) = y (1) = ( A + B)  = y (0) − y (−1)
h  3 3 9
A + B 2  5  1 10 − 3 7 7
 y(1) = =  − = =  A + B = − − − − − ( 2)
3 39 9 27 27 9
7 5 2
Solve equations (1) and (2)  B = − =
9 9 9
n n n+2
 5 2  1  1 1
Natural Response, yn (n) =  + n   = (5 + 2n )  = (5 + 2n ) 
1
, n  −2
 9 9  3  9  3  3

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 33

Example-4:
Determine the Natural Response of the system y(n) − 2 y (n − 1) + 4 y (n − 2) = x(n) + x(n − 1) with
initial conditions y(-1)=y(-2)=1.
Natural Response: Response of the system with zero input and for given initial conditions
Substitute y(n)=rn and x(n)=0

 r n − 2r n − 1 + 4r n − 2 = 0  r 2 − 2r + 4 = 0
2  4 − 16 2  − 12 2  j 2 3
r = = = =1 j 3
2 2 2
 r1 = 1 + j 3 & r2 = 1 − j 3 Where
r = 1+ 3 = 4 = 2
Homogeneous solution of given system 
 = Tan−1 ( 3 ) =
y (n) = ( ACosn + BSinn )(r )n 3
h
 n n  n
 y (n) =  ACos + BSin (2)
h  3 3 
Use initial conditions y(-1)=y(-2)=1 to evaluate constants A and B
 n n  n
y(n) = y (n) =  ACos + BSin (2) = 2 y(n − 1) − 4 y(n − 2)
h  3 3 

n = 0  y(0) = ( ACos0 + BSin0)(2)0 = 2 y(−1) − 4 y(−2)

 y (0) = A = 2 − 4 = −2

  
n = 1  y(1) =  ACos + BSin (2)1 = 2 y(0) − 4 y(−1)
 3 3

 1  3 
  A  + B  2 = 2(−2) − 4

 2 2
  

( )
 − 2 + B 3 = −4 − 4 = −8

 B 3 = 2 − 8 = −6
6
B=− = −2 3
3
Natural Response,
 n n 
y (n) =  − 2Cos − 2 3Sin (2)n ; n  −2
n  3 3 

 n n 
y (n) = −2 Cos + 3Sin (2)n ; n  −2
n  3 3 

 n n 
y (n) = − Cos + 3Sin (2)n + 1; n  −2
n  3 3 

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 34

Classification or Properties of Discrete Time Systems:
General representation of discrete time system is given below

Input signal, x(n) Discrete Time System Output signal, y(n)

T[•]

Where T[•] is transform operator and the relation between input x(n) and output y(n) of a discrete
time system is represented with y(n) = T[ x(n)], it shows the output y(n) is the transformation of
input x(n).
Various properties or classification of discrete time systems are given below
➢ Linear and Nonlinear Systems
➢ Shift Invariant and Variant Systems
➢ Static and Dynamic Systems
➢ Causal and Noncausal Systems
➢ Stable and Unstable Systems

(A)Linear and Non Linear Systems:

General representation of discrete time system is given below

x(n) Discrete Time System y(n)=T[x(n)]

T[•]

Apply x1(n) as input to the system T[•] and observe the output, take it as y1(n)

x1(n) Discrete Time System y1(n)=T[x1(n)]

T[•]

Apply x2(n) as input to the system T[•] and observe the output, take it as y2(n)

x2(n) Discrete Time System y2(n)=T[x2(n)]

T[•]

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 35

Now apply the linear combination of previous inputs x1(n) and x2(n), i.e. ax1(n)+bx2(n) as input to
the system T[•] and observe the output. If the output is ay1(n)+by2(n), then the given system is
linear otherwise the system is nonlinear.

ax1(n)+bx2(n) Discrete Time System ay1(n)+by2(n)=T[ax1(n)+bx2(n)

T[•] ]

➢ Condition for a linear system is ay1(n)+by2(n)=T[ax1(n)+bx2(n)].

➢ Every linear system must satisfy the superposition principle.
➢ Linearity is the combination of Additivity and Homogenity.
➢ Additivity  T[x1(n)+x2(n)]= T[x1(n)]+T[x2(n)]=y1(n)+y2(n).
➢ Homogenity  T[kx(n)]=k T[x(n)]=ky(n).

Example-1: Test the discrete time system y(n) = T[ x(n)] = 2x(n)+3 for linearity.
Given discrete time system y(n) = T[ x(n)] = 2x(n)+3
Apply x1(n) as input to the system y(n) = T[ x(n)] = 2x(n)+3 and observe the output, take it as y1(n)
y1(n) = T[ x1(n)] = 2x1(n)+3
Apply x2(n) as input to the system y(n) = T[ x(n)] = 2x(n)+3 and observe the output, take it as y2(n)
y2(n) = T[ x2(n)] = 2x2(n)+3
ay1(n)+by2(n)=a(2x1(n)+3)+b(2x2(n)+3)= 2ax1(n)+3a+2bx2(n)+3b=2ax1(n)+2bx2(n)+3a+3b---(1)
Apply ax1(n)+bx2(n) as input to the system y(n) = T[ x(n)] = 2x(n)+3 and observe the output
T[ax1(n)+bx2(n)]=2(ax1(n)+bx2(n))+3=2ax1(n)+2bx2(n)+3---(2)
Compare equations (1) and (2)  ay1(n)+by2(n)≠T[ax1(n)+bx2(n)]  Given system is nonlinear.

Example-2: Test the discrete time system y(n) = T[ x(n)] = 2x(n)+3x(n-1) for linearity.
Given discrete time system y(n) = T[ x(n)] = 2x(n)+3x(n-1)
Apply x1(n) as input to the system y(n) = T[ x(n)] = 2x(n)+ 3x(n-1) and observe the output, take it
as y1(n)  y1(n) = T[ x1(n)] = 2x1(n)+3x1(n-1)
Apply x2(n) as input to the system y(n) = T[ x(n)] = 2x(n)+3x(n-1) and observe the output, take it as
y2(n)  y2(n) = T[ x2(n)] = 2x2(n)+3x2(n-1)
ay1(n)+by2(n)=a(2x1(n)+3x1(n-1))+b(2x2(n)+ 3x2(n-1))= 2ax1(n)+3ax1(n-1)+2bx2(n)+3bx2(n-1)
ay1(n)+by2(n) =2ax1(n)+2bx2(n)+3ax1(n-1)+3bx2(n-1)---(1)
Apply ax1(n)+bx2(n) as input to the system y(n) = T[ x(n)] = 2x(n)+3x(n-1) and observe the output
T[ax1(n)+bx2(n)]=2(ax1(n)+bx2(n))+3(ax1(n-1)+bx2(n-1))
T[ax1(n)+bx2(n)]=2ax1(n)+2bx2(n)+3ax1(n-1)+3b x2(n-1)---(2)
Compare equations (1) and (2)  ay1(n)+by2(n)=T[ax1(n)+bx2(n)]  Given system is linear.

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 36

(B)Shift Invariant and Variant Systems:
General representation of discrete time system is given below

x(n) Discrete Time System y(n)=T[x(n)]

T[•]

Apply delayed form x(n), i.e x(n-n0) as input to the system T[•] and observe the output, if the output
is y(n-n0), then the system is shift invariant otherwise the system is shift variant.

x(n-n0) Discrete Time System y(n-n0)=T[x(n-n0)]

T[•]

Condition for a shift invariant system is y(n-n0)=T[x(n-n0)] and it is also known as time invariant.

Example-1: Test the discrete time system y(n) = T[ x(n)] = 2x(n)+3 for time invariance.

Given discrete time system T[ x(n)] = 2x(n)+3

Apply delayed form x(n), i.e x(n-n0) as input to the system T[ x(n)] = 2x(n)+3 and observe the
output  T[x(n-n0)] = 2x(n-n0)+3-------(1)

Output of given discrete time system y(n) = 2x(n)+3

Replace the discrete time ‘n’ with ‘n-n0’ in the system y(n) = 2x(n)+3 and observe the output
 y(n-n0) = 2x(n-n0)+3-------(2)
Compare equations (1) and (2)  y(n-n0)=T[x(n-n0)]  Given system is time invariant.

Example-2: Test the discrete time system y(n) = T[ x(n)] = nx(n)+3 for time invariance.

Given discrete time system T[ x(n)] = nx(n)+3

Apply delayed form x(n), i.e x(n-n0) as input to the system T[ x(n)] = nx(n)+3 and observe the
output  T[x(n-n0)] = nx(n-n0)+3-------(1)

Output of given discrete time system y(n) = nx(n)+3

Replace the discrete time ‘n’ with ‘n-n0’ in the system y(n) = 2x(n)+3 and observe the output
 y(n-n0) = (n-n0)x(n-n0)+3-------(2)
Compare equations (1) and (2)  y(n-n0)≠T[x(n-n0)]  Given system is time variant.

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 37

Example-3: Test the following systems for linear shift invariance

➢ y(n) = T[ x(n)] = 2x(n)-3y(n-1)

➢ y(n) = T[ x(n)] = 2x(n)-3y(n+1)
Linear Shift Invariant (LSI) System
N M
➢ y(n) = T [ x(n)] = -  aK y(n − k) + bK x(n − k)
k =1 k =0

➢ y(n) = T[ x(n)] = nx(n)

➢ y(n) = T[ x(n)] = n2x(n)
➢ y(n) = T[ x(n)] = 2x(n2)
Linear Shift Variant (LSV) System
➢ y(n) = T[ x(n)] = 2x(2n)
➢ y(n) = T[ x(n)] = nx(n/2)
➢ y(n) = T[ x(n)] = 2x(3√n)

➢ y(n) = T[ x(n)] = 3x2(n)

➢ y(n) = T[ x(n)] = Constant
➢ y(n) = T[ x(n)] = 2x(n)
➢ y(n) = T[ x(n)] = ex(n)
Nonlinear Shift Invariant (NLSI) System
➢ y(n) = T[ x(n)] = ACos[x(n)]
➢ y(n) = T[ x(n)] = log |x(n)|
2
➢ y(n) = T[x(n)] = + 3x(n − 1 )
x(n)

➢ y(n) = T[ x(n)] = nx2(n)

➢ y(n) = T[ x(n)] = 2x2(n2)
➢ y(n) = T[ x(n)] = 2+nx(n)
➢ y(n) = T[ x(n)] = 2x(3n)
➢ y(n) = T[ x(n)] = ex(n/2)
➢ y(n) = T[ x(n)] = ACos[x(2n-3)] Nonlinear Shift Variant (NLSV) System
➢ y(n) = T[ x(n)] = nlog |x(n)|
2
➢ y(n) = T[x(n)] =
x( 2n)
n
➢ y(n) = T[x(n)] =
x(n)

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 38

(C)Static and Dynamic Systems:
General representation of discrete time system is given below

x(n) Discrete Time System y(n)=T[x(n)]

T[•]

Static systems are those for which the present output y(n) depends on only present input x(n). Static
systems are also known as memory less systems.

Examples:
➢ y(n) = T[ x(n)] = nx(n)
➢ y(n) = T[ x(n)] = 2x(n)+3x2(n)
➢ y(n) = T[ x(n)] = n2x(n)
n
➢ y(n) = T[x(n)] = +2x(n)
x(n)
➢ y(n) = T[ x(n)] = 2x(n)

Dynamic systems are those for which the present output y(n) depends on past inputs x(n-1), x(n-2),.
and/or past outputs y(n-1), y(n-2),… and/or future inputs x(n+1), x(n+2),…. and/or future outputs
y(n+1), y(n+2),….. Dynamic systems are also known as memory systems.

Examples:
➢ y(n) = T[ x(n)] = 2x(n)+3x(n-1)
➢ y(n) = T[ x(n)] = 2x(n)+3x2(n-2)
➢ y(n) = T[ x(n)] = n2x(n+1)
n
➢ y(n) = T[x(n)] = +2y(n-3)
x(n)
➢ y(n) = T[ x(n)] = 2x(n-5)
N M
➢ y(n) = T[x(n)] = -  aK y(n − k) + bK x(n − k)
k =1 k =0


➢ y(n) = T[x(n)] = b
k =0
K x(n − k)

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 39

(D)Causal and Noncausal Systems:
General representation of discrete time system is given below

x(n) Discrete Time System y(n)=T[x(n)]

T[•]

Causal systems are those for which the present output y(n) depends on only present input x(n)
and/or past inputs x(n-1), x(n-2),…. and/or past outputs y(n-1), y(n-2),… but does not depends on
future inputs x(n+1), x(n+2),…. and/or future outputs y(n+1), y(n+2),….. All static systems are
causal.
Non-causal systems are those for which the present output y(n) depends on future inputs x(n+1),
x(n+2),…. and/or future outputs y(n+1), y(n+2).

Examples:
➢ y(n) = T[ x(n)] = 2x(n)+3x2(n)
➢ y(n) = T[ x(n)] = n2x(n)+3 Causal and Static (memory less)

➢ y(n) = T[ x(n)] = 2x(n)

➢ y(n) = T[ x(n)] = 2x(n)-3y(n-1)
➢ y(n) = T[ x(n)] = n2x(n-6)
➢ y(n) = T[ x(n)] = 3+2x(n-2) Causal and Dynamic (memory)
N M
➢ y(n) = T[x(n)] = -  aK y(n − k) + bK x(n − k)
k =1 k =0

➢ y(n) = T[ x(n)] = 2x(n)+3x2(n+2)

➢ y(n) = T[ x(n)] = 2x(n/2)
➢ y(n) = T[ x(n)] = 2x(-n)
N M Noncausal and Dynamic (memory)
➢ y(n) = T[x(n)] = - 
k =1
aK y(n + k) + bK x(n − k)
k =0


➢ y(n) = T[x(n)] = b
k = −4
K x(n − k)

Note: Impulse response h(n) of a causal system is right sided.

Examples:
➢ h(n)=(1/2)n u(n)
Causal Systems
➢ h(n)=2n u(n)

➢ h(n)=2n u(-n)
Noncausal Systems
➢ h(n)=(1/2)n u(-n)

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 40

(E)Stable and Unstable Systems:
General representation of discrete time system is given below

x(n) Discrete Time System y(n)=T[x(n)]

T[•]

Apply bounded signal x(n) as input to the system T[•] and observe the output y(n), if the output is
bounded, then the system is stable otherwise the system is unstable. Stable systems are called
Bounded Input Bounded Output (BIBO) systems.
i.e., if x(n) < , then y(n) < , for all values of n.

Examples:
➢ y(n) = T[ x(n)] = 2x(n)+3
➢ y(n) = T[ x(n)] = 2x(-n-3)+3x2(n)
➢ y(n) = T[ x(n)] = 3Cos[x(n)]
N M Stable Systems
➢ y(n) = T[x(n)] = -  k =1
aK y(n + k) + bK x(n − k)
k =0


➢ y(n) = T[x(n)] = b
k = −4
K x(n − k)

➢ y(n) = T[ x(n)] = nx(n)

2 Untable Systems
➢ y(n) = T[x(n)] =
x(n)
➢ If n=, then y(n) = T[ x(n)] = nx(n) =  = unbounded, hence the system is unstable.
2
➢ If x(n)=0, then y(n) = T[x(n)] = =  = unbounded, hence the system is unstable.
x(n)

Note: Impulse response h(n) of stable system is absolutely summable, 
k = −4
h(n)  

Example-1: Test the discrete time system h(n)=(1/2)n u(n) for stability.
  n  n 2
 1  1 1 1 1

n = −
h(n) = 
n = −
  u (n) =    = 1 + +   + ....... =
2 n=0  2  2 2 1− 1
= 2 = Finite
2
Given causal system is stable, because the impulse response is absolutely summable.
Example-2: Test the discrete time system h(n)=2n u(n) for stability.
  


n = −
h(n) =  2n u(n) =  2n = 1 + 2 + 4 + 8 + ..... = Infinity
n = − n=0

Given causal system is unstable, because the impulse response is not absolutely summable.

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 41

Example-3: Test the discrete time system h(n)=2n u(-n) for stability.
  2
0
1 1 1

n = −
h(n) =  2 u (−n) =  2 = 1 + +   + ....... =
n = −
n

n = −
n

2 2 1− 1
= 2 = Finite
2
Given noncausal system is stable, because the impulse response is absolutely summable.

Example-4: Test the discrete time system h(n)=(1/2)n u(-n) for stability.
  0

 h(n)
n = −
=  (1/ 2) u(−n) =  (1/ 2)
n = −
n

n = −
n
= 1 + 2 + 4 + 8 + ..... = Infinity

Given noncausal system is unstable, because the impulse response is not absolutely summable.

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 42

Discrete Time Fourier Transform (DTFT):
Fourier Transform (FT) is a mathematical tool, which is used to compute the frequency domain
signal form the time domain signal and vice versa. Fourier Transform is used for both the
continuous time and discrete time signals. Fourier Transform of continuous time signal is called
Continuous Time Fourier Transform (CTFT) or simply Fourier Transform

Fourier Transform of a discrete time signal is called Discrete Time Fourier Transform. The DTFT
of a signal x(n) is represented with X(ej) and it can be computed from the formula.

DTFT[ x(n) ] = X(e jω ) =  x(n) e
n= −
- jω n

In general, the frequency domain X(ej) is in complex form and it can be expressed as
X(e jω ) = XR (e jω ) + j XI (e jω )
Where,
XR (e jω ) : Real part of X (e jω )

XI (e jω ) : Imaginary part of X (e jω )

Magnitude of X(ej) is called the magnitude spectrum and it can be computed from the formula

X(e jω ) = [ XR (e jω ) ] 2 + [ XI (e jω ) ] 2

Phase of X(ej) is called the phase spectrum and it can be computed from the formula
 XI (e jω ) 
X (e ) = Tan 
jω −1
jω 

 R
X (e ) 

Discrete time signal x(n) can be computed from the frequency domain X (e jω ) is called Inverse
Discrete Time Fourier Transform (IDTFT).
π
1
x(n) = IDTFT[X(e j )] = 
2π − π
X(ej ) e jω n dω

Discrete time signal x(n) and the frequency domain X (e jω ) are Discrete Time Fourier
Transformable pairs.
⎯DT
⎯⎯FT
→
x(n) X(ej )
⎯ ⎯⎯
IDT FT

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 43

Example-1: Determine the DTFT of a sequence x(n)=an u(n), hence obtain the magnitude and
phase spectrum.

DTFT[ x(n) ] = X(e jω ) =  x(n) e
n= −
- jω n

( )
 
X(ejω ) =  an u(n)e- jω n =  ae - jω
n
( ) 2
= 1 + ae - jω + ae - jω + .......... . =
1
1 − ae - jω
n = − n=0

1 1
X(e jω ) = =
1 − a(Cos − jSin ) 1 − aCos + jaSin

Magnitude spectrum X(e jω ) = [ XR (e jω ) ] 2 + [ XI (e jω ) ] 2

1 1 1
X(e jω ) = = =
1 − aCos + jaSin (1 − aCos ) + (aSin )
2 2
1 + a Cos  − 2aCos + a 2 Sin2
2 2

1
X(e jω ) =
1 + a − 2aCos
2

 X (e jω ) 
Phase spectrum X (e jω ) = Tan −1  I jω 

 R
X (e ) 
0  aSin  −1  aSin 
X(e jω ) = (1 + j 0) − (1 − aCos + jaSin ) = Tan−1   − Tan−1   = −Tan  
1  1 − aCos   1 − aCos 

Example-2: Determine the DTFT of a sequence x(n)=(1/2)n u(n), hence obtain the magnitude and
phase spectrum.

DTFT[ x(n) ] = X(e jω ) =  x(n) e
n= −
- jω n

 n  n 2
 1  1 - jω  1 - jω  1 - jω 
X(e ) =
jω

n = −
  u(n)e
2
- jω n
=
n=0
 e  = 1 + e +  e  + .......... .
2  2 2 
1 2 2 2
X(e jω ) = = = =
1 − e-jω 2 − e
1 -jω
2 − (Cos − jSin ) 2 − Cos + jSin
2

Magnitude spectrum X(e jω ) = [ XR (e jω ) ] 2 + [ XI (e jω ) ] 2

2 2 2 2
X(e jω ) = = = =
2 − Cos + jSin (2 − Cos ) + (Sin )
2 2
4 + Cos  − 4Cos + Sin 
2 2
5 − 4Cos
 X (e jω ) 
Phase spectrum X (e jω ) = Tan −1  I jω 

 X R (e ) 
0  Sin  −1  Sin 
X(e jω ) = (2 + j 0) − (2 − Cos + jSin ) = Tan−1   − Tan−1   = −Tan  
2  2 − Cos   2 − Cos 

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 44

Example-3: Determine the DTFT of a sequence x(n)=an u(-n), hence obtain the magnitude and
phase spectrum.

DTFT[ x(n) ] = X(e jω ) =  x(n) e
n= −
- jω n

 -n 2
0 0
 1 jω  1 jω  1 jω 
X(e ) =
jω
a
n = −
n
u(-n)e - jω n
= ae
n = −
n - jω n
= 
n = −
 e  = 1 + e +  e  + .......... .
a  a a 
1 a a a
X(e jω ) = = = =
1 − e jω a − e
1 jω
a − (Cos + jSin ) a − Cos − jSin
a

Magnitude spectrum X(e jω ) = [ XR (e jω ) ] 2 + [ XI (e jω ) ] 2

a a a
X(e jω ) = = =
a − Cos − jSin (a − Cos ) + (− Sin )
2 2
a + Cos  − 2aCos + Sin2
2 2

a
X(e jω ) =
1 + a − 2aCos
2

 X (e jω ) 
Phase spectrum X (e jω ) = Tan −1  I jω 

 X R (e ) 
0  − Sin  −1  Sin 
X(e jω ) = (a + j 0) − (a − Cos − jSin ) = Tan−1  − Tan−1  = Tan  
a  a − Cos   a − Cos 
Example-4: Determine the DTFT of a sequence x(n)=2n u(-n), hence obtain the magnitude and
phase spectrum.

DTFT[ x(n) ] = X(e jω ) =  x(n) e
n= −
- jω n

 -n 2
0 0
 1 jω  1 jω  1 jω 
X(e ) =
jω
2
n = −
n
u(-n)e - jω n
= 2e
n = −
n - jω n
= 
n = −
 e  = 1 + e +  e  + .......... .
2  2 2 
1 2 2 2
X(e jω ) = = = =
1 − e jω 2 − e
1 jω
2 − (Cos + jSin ) 2 − Cos − jSin
2

Magnitude spectrum X(e jω ) = [ XR (e jω ) ] 2 + [ XI (e jω ) ] 2

2 2 2 2
X(e jω ) = = = =
2 − Cos − jSin (2 − Cos ) + (− Sin )
2 2
4 + Cos  − 4Cos + Sin 
2 2
5 − 4Cos
 X (e )  jω
Phase spectrum X (e jω ) = Tan −1  I jω 

 R
X (e ) 
0  − Sin  −1  Sin 
X(e jω ) = (2 + j 0) − (2 − Cos − jSin ) = Tan−1   − Tan−1   = Tan  
 2  2 − Cos   2 − Cos 

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 45

Example-5: Determine the DTFT of a sequence x(n) = a n , hence obtain the magnitude and phase
spectrum.

DTFT[ x(n) ] = X(ejω ) =  x(n) e
n = −
- jω n

 (ae ) +  (ae-jω )
 −1  − 

  a − ne-jωn +  a ne-jωn = jω − n n
X(e jω ) = a e-jωn =
n

n = − n = − n =0 n = −1 n =0

X (e ) = ae + (ae
jω jω jω 2
) + .......... . + 1 + ae -jω
+ (ae
-jω 2
) + .......... .
2

X (e ) = −1 + 1 + ae + ae
jω jω
( jω 2
) + .......... . + 1 + ae -jω 1 
+  e-jω  + .......... .
2 
1 1 (1 − ae-jω + 1 − ae jω ) 2 − a(e jω + e− jω )
X(e ) = −1 +
jω
+ = −1 + = −1 +
1 − ae jω 1 − ae-jω (1 − ae jω )(1 − ae-jω ) 1 + a 2 − a(e jω + e − jω )
2 − 2aCos − (1 + a 2 − 2aCos ) + 2 − 2aCos 1− a2
X(e jω ) = −1 + = =
1 + a − 2aCos
2
1 + a − 2aCos
2
1 + a − 2aCos
2

n
1
Example-6: Determine the DTFT of a sequence x(n) =   , hence obtain the magnitude and
2
phase spectrum.

DTFT[ x(n) ] = X(ejω ) =  x(n) e
n = −
- jω n

 n −1 −n n −n n
 1  -jωj  1  -jωj   1  -jωj −   1 jω  
 1 -jω 
X(e jω ) = 
n = −
  e =    e +   e =   e  +  e 
2 n = −  2  n =0  2  n = −1  2  n =0  2 
2 2
1 1  1 1 
X (e jω ) = e jω +  e jω  + .......... . + 1 + e-jω +  e-jω  + .......... .
2 2  2 2 
2 2
1 1  1 1 
X (e jω ) = −1 + 1 + e jω +  e jω  + .......... . + 1 + e-jω +  e-jω  + .......... .
2 2  2 2 
1 1 2 2 2(2 − e-jω + 2 − e jω )
X(e jω ) = −1 + + = −1 + + = −1 +
1 1
1 − e jω 1 − e-jω 2 − e jω 2 − e-jω (2 − e jω )(2 − e-jω )
2 2
2( 4 − 2Cos ) 8 − 4Cos − 5 + 4Cos + 8 − 4Cos 3
X(e jω ) = −1 + = −1 + = =
(4 − 4Cos + 1) 5 − 4Cos 5 − 4Cos 5 − 4Cos

Example-7: Determine DTFT of a sequence x(n)=δ(n).


DTFT[ x(n) ] = X(ejω ) =  x(n) e
n = −
- jω n


DTFT[  (n) ] = X(e ) = jω
  (n) e
n = −
- jω n
= ..... +  (0)e- j0 + ..... = 1 1 = 1

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 46

Example-8: Determine the sequence x(n), given X(ej) = 1, -π/N    π/N.
π
1

j
x(n) = IDTFT[X(e )] = X(ej ) e jω n dω
2π − π
/N
1 e j n/N − e- j n/N
π π/N
1 1 1 e jω n
2π −π 
j
x(n) = X(e ) e jω n
dω = e jω n
dω = =
2π − π/N 2π jn − / N
2π jn

1 2 jSin(n / N ) Sin(n / N )
x(n) = =
2π jn n

Example-9: Determine the sequence x(n), given X(ej) = 1+Cos+2Cos2+3Cos3.

j e jw + e − jw e j 2 w + e− j 2 w e j 3w + e− j 3w
X(e ) = 1 + +2 +3
2 2 2
1 1 3 3
X(ej ) = 1 + e jw + e − jw + e j 2 w + e − j 2 w + e j 3 w + e − j 3 w
2 2 2 2
3 j 3w 1 1 3
X(ej ) = e + e j 2 w + e jw + 1 + e − jw + e − j 2 w + e − j 3w
2 2 2 2


 x(n) e
n = −
-jwn
= x(−3)e j 3w + x(−2)e j 2 w + x(−1)e jw + x(0) + x(1)e− jw + x(2)e− j 2 w + x(3)e− j 3w

3 1 1 3
 x(n) =  ,1, , 1 , ,1, 
2 2  2 2
Example-10: Determine the DTFT of a periodic sequence x(n) = 1 .

x(n)

n
……. -7 -6 -5 -4 -3-2 -1 0 1 2 3 4 5 6 7…………


DTFT[ x(n) ] = X(e jω ) = 2π  (ω − 2πm)
m = −

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 47

Properties of DTFT:
Various properties used in the Discrete Time Fourier Transform (DTFT) are given below
➢ Linear Property
➢ Periodicity or Periodic Property
➢ Time Shifting Property
➢ Frequency Shifting Property
➢ Time Reversal Property
➢ Conjugation or Conjugate Property
➢ Frequency Differentiation Property
➢ Time Convolution Theorem
➢ Frequency Convolution Theorem
➢ Parsevalls Theorem

(A)Linear Property:
If x1(n), x2(n) are two discrete time signals and DTFT[x1(n) ] = X1(ej), DTFT[x2(n) ] = X2(ej),
then DTFT[a x1(n) + b x2(n) ] = a X1(ej) + b X2(ej) is called linear property of DTFT.
Proof:
From the basic definition of DTFT

DTFT[ x(n) ] =  x(n) e
n = −
- jω n

Replace x(n) by a x1 (n) + b x 2 (n)


DTFT[a x1 (n) + b x 2 (n)] = 
n = −
[a x1 (n) + b x 2 (n)] e - jω n

= 
n = −
[a x1 (n)e - jω n + b x 2 (n) e - jω n ]
 
= 
n = −
[a x1 (n)e - jω n ] +  [b x
n = −
2 (n) e - jω n ]
 
=a 
n = −
[ x1 (n)e - jω n ] + b [ x
n = −
2 (n) e - jω n ]

= a X1 (e ) + b X 2 (e )
jω jω

Example :Determine the DTFT of a sequence x(n)= a.bnu(n)+b.anu(n).

DTFT[x(n)] = DTFT [a.b nu (n) + b.a nu (n)] = aDTFT [b nu (n)] + bDTFT [a nu (n)]

a b a(1 − ae-jω ) + b(1 − be-jω ) a + b − (a 2 + b 2 )e-jω

X(e jω ) = + = =
1 − be-jω 1 − ae-jω (
1 − be-jω 1 − ae-jω )( )
1 − (a + b)e-jω + abe-j 2ω

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 48

(B)Periodicity or Periodic Property:
If x(n) is a discrete time signal and DTFT[ x(n) ] = X(ej), then X(e j(+2)
)= X(e j
), i.e the
frequency domain X(ej) is periodic with a period of ‘2π’ irrespective of x(n).
Proof:
From the basic definition of DTFT

DTFT[ x(n) ] =  x(n) e
n = −
- jω n


X(e jω ) =  x(n) e
n = −
- jω n

Replace ω by ω + 2π

X(e j(ω+ 2 ) ) =  x(n) e
n = −
- j(ω + 2 ) n


=  x(n) e
n = −
- jω n
e - j 2 n

=  x(n) e
n = −
- jω n
(1)

=  x(n) e
n = −
- jω n

= X(e j ω )
 
Example: Determine the DTFT of a real and even sequence x(n) = 3,2, 1 ,2,3 , hence obtain the
  
period of X(e j ).
 2
DTFT[ x(n) ] =  x(n) e
n = −
- jω n
=  x(n) e
n = −2
- jω n
= x(-2) e j2ω x(-1) e jω + x(0) e- j0 + x(1) e- jω + x(2) e- j2ω

X(e jω ) = 3e j 2ω + 2e jω + 1 + 2e-jω + 3e-j 2ω

X(e jω ) = 1 + 2(e jω + e-jω ) + 3(e j 2ω + e-j 2ω )

X(e jω ) = 1 + 2(2Cos ) + 3(2Cos2 )

X(e jω ) = 1 + 4Cos + 6Cos2

 X(e j ( ω + 2 ) ) = 1 + 4Cos( + 2 ) + 6Cos2( + 2 )

 X(e j ( ω + 2 ) ) = 1 + 4Cos(2 +  ) + 6Cos(4 + 2 )

 X(e j ( ω + 2 ) ) = 1 + 4Cos( ) + 6Cos(2 )

 X(e j ( ω + 2 ) ) = X(e jω )

Period of X(e j ) is 2π.

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 49

(C)Time Shifting Property:
If x(n) is a discrete time signal and DTFT[x(n) ] = X(ej), then DTFT[ x(n – n0) ] = e-jn0 X(ej) is
called time shifting property of DTFT.
Proof:
From basic definition of DTFT

DTFT[ x(n) ] =  x(n) e
n = −
- jω n

Replace x(n) by x(n − n 0 )


DTFT[ x(n - n 0 ) ] =  x(n - n
n = −
0 ) e - jω n

Let n – n0 = m
=  x(m) e
m = −
- jω (no+m)
Then n = n0 + m

=  x(m) e - jω no
e - jω m Range of summation
m = −
LL (m) = –  – n0 = – 

UL (m) =  – n0 = 
= e - jω no  x(m) e
m = −
- jω m

=e - jω no
X(e jω )

Example : Determine the DTFT of a sequence y(n)=x(n-1), given x(n)= a.bnu(n)+b.anu(n).

DTFT[x(n)] = DTFT [a.b nu (n) + b.a nu (n)] = aDTFT [b nu (n)] + bDTFT [a nu (n)]

a b a(1 − ae-jω ) + b(1 − be-jω ) a + b − (a 2 + b 2 )e-jω

X(e jω ) = + = =
1 − be-jω 1 − ae-jω (
1 − be-jω 1 − ae-jω )( )
1 − (a + b)e-jω + abe-j 2ω

Apply time shifting property DTFT[ x(n – n0) ] = e-jn0 X(ej)

DTFT[ x(n – 1) ] = DTFT[y(n)]=e-j X(ej)

a + b − (a 2 + b 2 )e-jω
 Y(e jω ) = e-jω
1 − (a + b)e-jω + abe-j 2ω

 Y(e jω
)=
(a + b)e-jω − (a 2 + b2 )e-j 2ω
1 − (a + b)e-jω + abe-j 2ω

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 50

(D)Frequency Shifting Property:
If x(n) is a discrete time signal and DTFT[ x(n) ] = X(ej), then DTFT[ e j0 n x(n) ] = X(e j( - 0) ) is
called frequency shifting property of DTFT.
Proof:
From the basic definition of DTFT

DTFT[ x(n) ] =  x(n) e
n = −
- jω n

jωon
Replace x(n) by e x(n)

DTFT[ e jω o n x(n) ] = e
n = −
jω o n
x(n) e - jω n

=  x(n) e
n = −
jω o n
e - jω n

=  x(n) e
n = −
- j(ω - ω o) n

= X(e j(ω - ω o) )

(E)Time Reversal Property:

If x(n) is a discrete time signal and DTFT[ x(n) ] = X(ej), then DTFT[ x(–n) ] = X(e – j ) is called
time reversal property of DTFT.
Proof:
From the basic definition of DTFT

DTFT[ x(n) ] =  x(n) e
n = −
- jω n

Replace x(n) by x( −n)


DTFT[ x(-n) ] =  x(-n) e
n = −
- jω n


Let – n = m
=  x(m) e
m = −
- jω (-n)
Then n = - m
−
=  x(m) e jω n Range of summation
m=
LL (m) = –(–  ) = 

UL (m) = –( ) = – 
=  x(m) e
m = −
- j (-ω ) n

= X (e - jω )

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 51

(F)Conjugation or Conjugate Property:
– j
If x(n) is a discrete time signal and DTFT[ x(n) ] = X(ej), then DTFT[ x*(n) ] = X*(e ) or
j
DTFT[ x*(–n) ] = X*(e ) is called conjugate property of DTFT.
Proof:
From the basic definition of DTFT

DTFT[ x(n) ] =  x(n) e
n = −
- jω n

Replace x(n) by x * (n)


DTFT[ x * (n) ] =  x * (n) e
n = −
- jω n


=  x * (n) [e
n = −
jω n
]*

=  [ x(n)
n = −
e jω n ]*
*
  
=   x(n) e jω n 
n = − 
*
  
=   x(n) e- j(-ω ) n 
n = − 
*
  
=   X( e- jω )
n = − 
= [X(e )] *
- jω

= X * (e- jω )
Note : Apply time reversal property on DTFT[ x*(n) ] = X*(e – j )DTFT[ x*(–n) ] = X*(e j
)

 
Example-1: Determine the DTFT of a real sequence x(n) = 1, 2,3,4
  
 2
DTFT[ x(n) ] =  x(n) e
n = −
- jω n
=  x(n) e
n = −1
- jω n
= x(-1) e jω + x(0) e- j0 + x(1) e- jω + x(2) e- j2ω

X(e jω ) = e jω + 2 + 3 e-jω + 4e-j 2ω

X(e jω ) = Cos + jSin + 2 + 3(Cos − jSin ) + 4(Cos2 − jSin2 )

X(e jω ) = 2 + Cos + 3Cos + 4Cos2 + jSin − j3Sin − j 4Sin2

X(e jω ) = 2 + 4(Cos + Cos2 ) − j 2( Sin + 2Sin2 )

Note:
➢ If x(n) is real, then X*(e – j ) = X(e j
), i.e. X(ej) and X(e-j) are complex conjugate pairs.
X(e − jω ) = 2 + 4Cos + 4Cos2 + j 2( Sin + 2Sin2 )

X * (e − jω ) = 2 + 4Cos + 4Cos2 − j 2( Sin + 2Sin2 ) = X(e jω )

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 52

 ➢ If x(n) is real and X(e j
) = XR(e j
)+jXI(ej), then XR(e j
) is even and XI(ej) is odd.
X(e jω ) = 2 + 4Cos + 4Cos2 − j 2( Sin + 2Sin2 ) = X R(e jω ) + X I (e jω )

X R(e jω ) = 2 + 4(Cos + Cos2 ) = EvenFunction

X I (e jω ) = − 2( Sin + 2Sin2 ) = OddFunction

➢ If x(n) is real, then |X(e j
)| =|X(e -j )|, i.e Magnitude spectrum is even and
∟X(e j
= -∟X(e -j
, i.e Phase spectrum is odd
X(e jω ) = 2 + 4Cos + 4Cos2 − j 2( Sin + 2Sin2 ) = X R(e jω ) + X I (e jω )

X(e − jω ) = 2 + 4Cos + 4Cos2 + j 2( Sin + 2Sin2 ) = X R(e jω ) − X I (e jω )

 
Example-2: Determine the DTFT of a real and even sequence x(n) = 3,2, 1 ,2,3
  
 2
DTFT[ x(n) ] =  x(n) e
n = −
- jω n
=  x(n) e
n = −2
- jω n
= x(-2) e j2ω x(-1) e jω + x(0) e- j0 + x(1) e- jω + x(2) e- j2ω

X(e jω ) = 3e j 2ω + 2e jω + 1 + 2e-jω + 3e-j 2ω

X(e jω ) = 1 + 2(e jω + e-jω ) + 3(e j 2ω + e-j 2ω )

X(e jω ) = 1 + 2(2Cos ) + 3(2Cos2 )

X(e jω ) = 1 + 4Cos + 6Cos2

j
Note: If x(n) is real and even, then X(e ) is real and even.

 
Example-3: Determine the DTFT of a real and odd sequence x(n) = 3,2, 0 ,−2,−3
  
 2
DTFT[ x(n) ] = 
n = −
x(n) e- jω n =  x(n) e
n = −2
- jω n
= x(-2) e j2ω x(-1) e jω + x(0) e- j0 + x(1) e- jω + x(2) e- j2ω

X(e jω ) = 3e j 2ω + 2e jω + 0 − 2e-jω − 3e-j 2ω

X(e jω ) = 2(e jω − e -jω ) + 3(e j 2ω − e -j 2ω )

X(e jω ) = 2(2 jSin ) + 3(2 jSin2 )

X(e jω ) = j 2(2Sin + 3Sin2 )

j
Note: If x(n) is real and odd, then X(e ) is imaginary and odd.

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 53

(G)Frequency Differentiation Property:

If x(n) is a discrete time signal and DTFT[ x(n) ] = X(ej), then DTFT[nx(n)] = j
d
dω
 
X(e j ω ) is

called frequency differentiation property of DTFT.

Proof:
From the basic definition of DTFT


DTFT[ x(n) ] =  x(n) e
n = −
- jω n


X(ejω ) =  x(n) e
n = −
- jω n

Differenti ate w.r.t. ω

 

d d - jω n
X(ejω ) =  x(n) e
d n = − d

=  x(n) (-jn)e
n = −
- jω n


= − j  nx(n) e- jω n
n = −

= − jDTFT [nx(n)]

DTFT [nx(n)] = j
d
d
X(ej ω )  

Example: Determine the DTFT of a sequence x(n) = nanu(n)

1
We know that DTFT[ a nu (n)] =
− j
1 − ae

Apply the frequency differentiation property DTFT [nx(n)] = j

d
d

X(e j ω ) 
d 1 −1  0 − a ( − j ) e − j 
DTFT[na nu (n)] = j = j  
d 1 − ae− 
1 − ae− j   
j 2
 
 
−j jae− j 
DTFT[na nu (n)] =  
1 − ae− j   
2
 
 
− j
ae
=
2
1 − ae− j 
 
 

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 54

(H)Time Convolution Theorem:
If x1(n), x2(n) are two discrete time signals and DTFT[x1(n) ] = X1(ej), DTFT[x2(n) ] = X2(ej),
then DTFT[ x1(n) * x2(n) ] = X1(ej) X2(ej) is called time convolution theorem of DTFT.
i.e, convolution in time domain leads to multiplication in frequency domain.
Proof:
From the basic definition of DTFT


DTFT[ x(n) ] =  x(n) e
n = −
-jω n

Replace x(n) with x1(n) * x2(n)


DTFT[ x1(n)*x2(n) ] =  x (n)*x (n) e
n = −
1 2
-jω n


Apply convolution formula x1(n)*x2(n) =  x (m)x (n-m)
m = -
1 2

 
=   x (m)x (n-m) e
n = − m = -
1 2
-jω n

Change the order of summation

  
= 
m = −
x1(m)  x2(n-m) e-jω n =
n = -
 x (m) DTFT[x (n-m)]
m = −
1 2

 
=  x1(m) e -jω m X 2(e jω ) = X 2(e jω )  x1(m) e -jω m
m = − m = −

= X 2(e jω )X 1(e jω ) = X 1(e jω )X 2(e jω )

Example: Determine the DTFT of a sequence x(n) = a nu (n) * nanu (n)

− j
1 ae
We know that DTFT[ a nu (n)] = and DTFT[na nu (n)] =
− j 2
1 − ae 1 − ae− j 
 
 

DTFT[a nu(n) * nanu(n)] = DTFT[a nu(n)]DTFT[na nu(n)]

− j − j
1 ae ae
= =
1 − ae− j   2 3
  1 − ae− j  1 − ae− j 
 
    
(I)Frequency Convolution Theorem:
If x1(n), x2(n) are two discrete time signals and DTFT[x1(n) ] = X1(ej), DTFT[x2(n) ] = X2(ej),
then 2π DTFT[ x1(n) x2(n) ] = X1(ej) * X2(ej) is called frequency convolution theorem of DTFT.
i.e, convolution in frequency domain leads to multiplication in time domain.

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 55

(J)Parsevalls Theorem:
If x(n) is a discrete time signal and DTFT[ x(n) ] = X(ej), then the total energy under the signal
x(n) can be computed from x(n) as well as X(e j ) through the Parsevalls theorem
2 π 2

1
E= 
n = −
x(n) = 
2π − π
X(e jω ) dω

Proof:
 2   *


n = −
x(n) =  x(n)
n = −
x * (n) =  x(n)
n = −
[ x(n) ]

*
  1 π    1 π 
=  x(n)   X(e jω ) e jω n
dω =  x(n)   X * (e jω ) e - jω n dω
n = −  2π − π  n = −  2π − π 
π π
jω  
( )

1 1
=
2π −π
X * (e )  
 n = −
x(n) e -jωn
 dω =


2π − π
X * (e jω ) X(e jω ) dω

 2
1
= 
2π −
X(ejω ) dω

Example:
π  2

Evaluate (i) X(e ) at  = 0 (ii)  X(e 

j jω jω
) dω (iii) X(e ) dω
−π −

Given that DTFT[x(n) ] = X(ej) and x(n) = {1,4, 3,2,5,6,7,0,9} .




(i) DTFT[ x(n) ] = X (e- jω ) =  x(n) e
n = −
- jω n


X(e jω ) w−0 =  x(n) = 1 + 4 + 3 + 2 + 5 + 6 + 7 + 0 + 9 = 37
n = −

π
1
(ii) x(n) = IDTFT[X(e )] =  X(e
jω jω
) e jωn dω
2 −π

π π
1
Put n = 0 x( 0 ) =  X(e jω )dω   X(e )dω = 2x(0) = 2 (3) = 6
jω

2 −π −π

(ii)From Parsevalls theorem

2 π 2

1
E= 
n = −
x(n) =
2π −π
X(e jω ) dω

π 2 2

= 2 (12 + 42 + 32 + 22 + 52 + 62 + 7 2 + 02 + 92 ) = 442

  X(e ) jω
dω = 2 
n = −
x(n)
−π

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 56

Analysis of Discrete LSI Systems Using DTFT:

Frequency Response of Discrete LSI System:

Input, x(n) Discrete LSI System Output, y(n)

The ratio between output y(n) to input x(n) in frequency domain representation is called Transfer
function or System function or Frequency response of discrete LSI System and it is represented
with H(ej).
DTFT [ y (n)] Y(e jω )
H(e jω ) = =
DTFT [ x(n)] X(e jω )
In general, the frequency response H(ej) is in complex form and it can be expressed as
H(e jω ) = HR (e jω ) + j HI (e jω )
Where,
HR (e jω ) : Real part of H (e jω )

HI (e jω ) : Imaginary part of H (e jω )

Magnitude of H(ej) is called the magnitude response and it can be computed from the formula

H(e jω ) = [ HR (ejω ) ]2 + [ HI (ejω ) ]2

Phase of H(ej) is called the phase response and it can be computed from the formula
 H (e jω ) 
H (e jω ) = Tan −1  I jω 
 HR (e ) 
Impulse or Unit Sample Response:
Response of a discrete LSI system with an input of impulse or unit sample sequence is called is
called impulse response or unit sample response and it is represented with h(n).

Input, x(n)=δ(n) Discrete LSI System Output, y(n)=h(n)

Unit sample response h(n) can be obtained from the frequency response H(ej) by using Inverse
Discrete Time Fourier Transform (IDTFT).

h(n) = IDTFT [ H(ej) ]

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 57

Response of Discrete LSI System:

Input, x(n) Discrete LSI System Response, y(n)

Response of discrete LSI system y(n) can be obtained from the frequency domain by using Inverse
Discrete Time Fourier Transform (IDTFT).

y(n) = IDTFT [ Y(ej) ] = IDTFT [X(ej) H(ej) ]

Example-1: Evaluate (a) Frequency Response (b) Magnitude Response and (c) Phase Response
1 1
(d)Unit Sample Response of a discrete LSI system y(n) − y (n − 2) = x(n) + x(n − 1) .
4 2
(a)Frequency Response
1 1
Given discrete LSI system y(n) − y (n − 2) = x(n) + x(n − 1)
4 2
Apply DTFT
 1   1 
 DTFT  y(n) − y(n − 2) = DTFT  x(n) + x(n − 1)
 4   2 
1 1
 Y ( e j  ) − e − j 2  Y ( e j ) = X ( e j  ) + e − j  X ( e j  )
4 2
 1   1 
 Y (e j )1 − e− j 2  = X (e j )1 + e− j 
 4   2 
1 − j 1
Y ( e j ) 1 + 2 e 1 + e − j 1
 = = 2 =
j
X (e ) 1 − 1 e − j 2  1 − j  1 − j  1 − 1 e − j
1 + e 1 − e 
4  2  2  2

1 2 2 2
H(e jω ) = = = =
1 − e-jω 2 − e
1 -jω
2 − (Cos − jSin ) 2 − Cos + jSin
2
(b)Magnitude Response

H(e jω ) = [ HR (ejω ) ]2 + [ HI (ejω ) ]2

2 2 2 2
H(e jω ) = = = =
2 − Cos + jSin (2 − Cos ) + (Sin )
2 2
4 + Cos  − 4Cos + Sin 
2 2
5 − 4Cos
2
H(e jω ) =
5 − 4Cos

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 58

(c)Phase Response
 H (e jω )  0  Sin 
H (e jω ) = Tan −1  I jω 
 = (2 + j 0) − (2 − Cos + jSin ) = Tan−1  − Tan−1 
 H R (e )  2  2 − Cos 

 Sin 
H(e jω ) = −Tan−1  
 2 − Cos 
(d)Unit Sample Response
 
 1   1 n
h(n) = IDTFT [ H(e )] = IDTFT 
jω
 =   u ( n)
 1 − 1 e-jω   2 
 2 

1 1
Example-2: Evaluate the response of a discrete LSI system y(n) − y (n − 2) = x(n) + x(n − 1) with
4 2
n
1
an input of x(n) =   u (n)
 3
1 1
Given discrete LSI system y(n) − y (n − 2) = x(n) + x(n − 1)
4 2
Apply DTFT
 1   1 
 DTFT  y(n) − y(n − 2) = DTFT  x(n) + x(n − 1)
 4   2 
1 1
 Y ( e j  ) − e − j 2  Y ( e j ) = X ( e j  ) + e − j  X ( e j  )
4 2
 1   1 
 Y (e j )1 − e− j 2  = X (e j )1 + e− j 
 4   2 
1 1
j 1 + e − j 1 + e − j
Y (e ) 1
 j
= H ( e j ) = 2 = 2 =
1 − e − j 2 1 + e − j 1 − e − j  1 − e − j
X (e ) 1 1 1 1
4  2  2  2

  1 n  1
 Y (e ) = X (e ) H (e ), X (e ) = DTFT [ x(n)] = DTFT    u (n)  =
j j j j
 3   1
  1 − e− j
3
  
 1  1  −2 3
Y (e ) = 
j
 = +
 1 − 1 e − j  1 − 1 e − j  1 − 1 e − j 1 − 1 e − j
  
 3  2  3 2
n n

 y (n) = IDTFT (Y (e ) )  y(n) = 3  u (n) − 2  u (n)

j 1 1
2  3

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 59

Descriptive Questions:
1. Draw the graphical representation and sequence form of a discrete time signal

x(n)=r(n+2)-r(n-3)-5u(n-4) and also Evaluate the summation  x(n) ,where
n =0
r(n) is unit

ramp sequence.

2. Draw the graphical representation of sequences (i) x(2n)+x(0.5n) (ii) 2x(3n-1)-3x(-2n+1),

given that x(n) = {1,4, 3,2,5,6,7,8,9} .


3. Determine the convoluted signal y(n)=x(n)*h(n), given that x(n)=anu(n) and h(n)=bnu(n),
if (i) a≠b (ii) a=b.

4. Determine the convoluted sequence y(n) = x1 (n) * x2 (n) , where x1 (n) = {1,2, 3,4} and


x2 (n) = {5, 6,7,8,9} .



5. Apply convolution operation and obtain the functional representation of a sequence

y(n)=x(n)*h(n), where, h(n)= [1+h1(n)]*h2(n). Given that h1(n)=αδ(n-2) and h2(n)=αnδ(n-3).

6. Analyze the following signals for causal, non-causal, bounded, un-bounded (i) x1(n)=(1/2)n
(ii) x2(n)=(2)n (iii) x3(n)=(1/2)nu(n) (iv) x4(n)=(2)nu(n) (v) x5(n)=(1/2)nu(-n-1)
(v) x6(n)=(2)nu(-n-1).

7. Analyze the following discrete time signals for periodic and aperiodic. If periodic, then
compute the period.(i)x(n)=4Cos(nπ/4)+6Sin(nπ/6) (ii) y(n)=4Cos(n/4)+6Sin(n/6).

8. Analyze the following discrete time signals for even and odd. If fails to satisfy even and odd
properties, then evaluate even and odd parts.(i) x1 (n) = {1,2, 3,1,2} (ii) x2 (n) = {−1,−2, 3,1,2} .
 

9. Analyze the following signals for energy and power(i)x(n)=(1/2)nu(n) (ii)y(n)=u(n).

10. Solve the difference equation y(n)-ay(n-1)=x(n) to obtain the impulse response, hence obtain
the system response for an input x(n)=bnu(n), where 0<a<1 and 0<b<1.

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 60

11. Analyze the following systems for linearity, shift invariance, causality and stability
n
(i)y(n)=T{x(n)}=x(n2) (ii) y(n)=T{x(n)}=x2(n) (iii) y(n) = T {x(n)} =  x( k )
k = −

12. Determine (a) DTFT of x(n) (b) Magnitude spectrum and (c)Phase spectrum.

Given x(n) = {−1,0,1, 2,1,0,1,2,1,0,−1} .



13. Determine the DTFT of x(n), Magnitude spectrum and Phase spectrum for the signals
n
1
(i)x(n)=(1/2)nu(n) (ii)x(n)=(2)nu(-n-1) (iii) x(n) =   .
2
π
jω
14. Apply properties of DTFT and Evaluate (i) X(ej) at  = 0 (ii) 
−π
X(e ) dω (iii)

 2

 dω Given that DTFT[x(n) ] = X(ej) and x(n) = {1,4, 3,2,5,6,7,0,9} .

jω
X(e )

−

15. Apply properties and Evaluate (a)Frequency response (b)Magnitude response and (c)Phase
response of a system having LCCDE y(n)-0.5y(n-1)=x(n)+0.5x(n-1).

16. Determine (a)Unit sample response (b)Unit step response and (c)Response of a causal
system for an input x(n)=(1/2)nu(n).Given LCCDE y(n)-0.25y(n-1)=x(n).

17. Find the response of the system for an input x(n)=(1/4)nu(n) having LCCDE y(n)-5/6 y(n-
1)+1/6 y(n-2)=x(n)+x(n-1). Given initial conditions y(-1)=y(-2)=1.

18. For the system y(n)-5/6 y(n-1)+1/6 y(n-2)=x(n)+x(n-1), find(a)Natural response for given
initial conditions y(-1)=y(-2)=1 (b)Forced response for given input x(n)=(1/2)nu(n) and
(c)Response of the system for an input x(n)=(1/2)nu(n) and initial conditions y(-1)=y(-2)=1.

19. Find the natural response of the system having LCCDE y(n)-2 y(n-1)+4 y(n-2)=x(n)+x(n-1)
for given initial conditions y(-1)=y(-2)=1.

20. Analyze the following systems for causality and stability(a)y(n)-0.5y(n-1)=x(n) with zero
initial conditions(b)y(n)-0.5y(n-1)=x(n) with initial condition y(-1)=1(c)y(n)-2y(n-1)=x(n)
with zero initial conditions(d)y(n)-2y(n-1)=x(n) with initial condition y(-1)=1

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 61

Quiz Questions:

1. Which of the following signal is even

1,4
(1)u(t+3)-u(t-3) (2)u(n+3)-u(n-3) (3)u(t+3)-u(t-4) (4)u(n+3)-u(n-4)

2. Relation between unit sample and unit stem signal is

(1)δ(n)=u(n)-u(n-1) (2)δ(n)=u(n+1)-u(n-1)
1,3,4
n 
(3) u (n) =  (k ) (4) u (n) =  (n − k )
k = − k =0

3. Convoluted sequence u(n)*u(n) is

3
(1) u(n) (2) nu(n) (3) (n+1)u(n) (4) δ(n)

4. Impulse response of the system having LCCDE y(n)-y(n-1)=x(n)

4
(1) δ(n) (2) u(n+1) (3) u(n-1) (4) u(n)

5. Total Energy under the signal x(n)=u(n) is

2
(1) 0 (2)  (3) 1 (4) 0.5

6. Find the magnitude response of y(n) – ½ y(n – 1) = x(n) – ½ x(n – 1) 1

7. Find the sequence x(2n), given x(n)={1,2,3} {1,3}

8. If x(n) = {1, 2, 3, 4, 6, 7, 8, 9} and DTFT[x(n) ] = X(ej),then find X(ej) at  = 0 40

9. Match the following signals and operations 1-b,d

(1) 2x(2n) (2) x(-n/2) (3) 2x(-n) (4) x(2n+3) 2-b,c

a.Time shifting b.Time scaling c.Folding d.Amplitude scaling e.Time shifting 3-c,d

4-a,b

10. Match the following systems and properties 1-c,d

(1) y(n)=5 (2) y(n)=2x(n) (3) y(n)=x(2n) (4) y(n)=x(n2) 2-a,b

a.Linear b.Shift Invariant c.Non-Linear d.Shift Variant 3-a,d

4-a,d

Prof.B.Ramesh Reddy, Dept. of ECE, Coordinator-IQAC, LBRCE, Mylavaram. Page No. 62