Scribd
Upload
311 views2 pages

Lecture 14: Properties of Discrete Fourier Transform: DFT (X ( (N-) ) ) e X (K)

This document discusses 10 important properties of the discrete Fourier transform (DFT). The properties include linearity, periodicity, time shifting, frequency shifting, time reversal, correlation, convolution in time and frequency domains, complex conjugation, and Parseval's theorem. Understanding these properties helps simplify solutions involving the DFT.

Uploaded by

Sourav Banik
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
311 views2 pages

Lecture 14: Properties of Discrete Fourier Transform: DFT (X ( (N-) ) ) e X (K)

This document discusses 10 important properties of the discrete Fourier transform (DFT). The properties include linearity, periodicity, time shifting, frequency shifting, time reversal, correlation, convolution in time and frequency domains, complex conjugation, and Parseval's theorem. Understanding these properties helps simplify solutions involving the DFT.

Uploaded by

Sourav Banik
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/ 2

Lecture 14: Properties of Discrete Fourier Transform

 Introduction: Properties help us to simplify the solutions of discrete Fourier transform.


Some important properties of DFT have been discussed below.

1. Linearity Property: It states that DFT follows superposition principle, i.e.


If DFT [x1 (n)] = X1 (k) and DFT [x 2 (n)] = X2 (k)
Then, DFT[a1x1 (n) + a 2 x 2 (n)] = a1X1 (k) + a 2X2 (k)

2. Periodicity property: It states that if X[k] is a N-point DFT of a finite duration sequence
x[n] then X[k] is periodic with a period of N.
x(n+N) = x(n) ; for all n
X(k + N) = X(k) ; for all k

3. Circular Time shifting property: It states that if DFT [x[n]] = X[k] , then DFT of x[n]
circularly shifted in time by ‘ l ’ units is given by:
- j2 kl
DFT [x((n-l )) N ] = e N X(k)

4. Circular Frequency shifting property: It states that if DFT [x[n]] = X[k] then,
j 2 l n

DFT [x[n]e N ] = X((K- l )) N

5. Time Reversal property: It states that if DFT [x[n]] = X[k] then,

DFT [x((- n)) N ] = X((- k)) N i.e DFT [x (N - n) ] = X(N - k)

6. Circular Correlation Property: It states that if DFT [x1[n]] = X1[k] and


DFT [x2[n]] = X2[k],

DFT [r x1x2 (l )]  X1 (k) X2* (k)

7. Circular Convolution in time domain: It states that if DFT [x1[n]] = X1[k] and
DFT [x2[n]] = X2[k] then,

DFT [x1 (n)  x 2 (n)] = X1 (k) X2 (k)

Lecture Notes on Digital Signal Processing (EE1706): By Roshan Pradhan Page 1


8. Convolution in frequency domain: It states that if DFT [x1[n]] = X1[k] and
DFT [x2[n]] = X2[k] then,

1
DFT [x1 (n). x 2 (n)] = [ X1 (k)  X 2 (k)]
N

9. Complex Conjugate Property: It states that if DFT [x[n]] = X[k] then,

DFT[x*(n)] = X*((-K))N  X*(N-K)

10. Parseval’s Theorem: It states that if DFT [x[n]] = X[k] then,


N 1
1 N 1
E =  |x(n)|2 =  |X(k)|2
n= 0 N k= 0

Lecture Notes on Digital Signal Processing (EE1706): By Roshan Pradhan Page 2

You might also like