0% found this document useful (0 votes)
97 views6 pages

Properties of DFT

Summarized concepts of Discrete Fourier Transform. Best handout to refer to for quick revision and a last-moment glance through before entering the exam hall.

Uploaded by

vishesh.arora
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
0% found this document useful (0 votes)
97 views6 pages

Properties of DFT

Summarized concepts of Discrete Fourier Transform. Best handout to refer to for quick revision and a last-moment glance through before entering the exam hall.

Uploaded by

vishesh.arora
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/ 6

Module 9 : Numerical Relaying II : DSP Perspective

Lecture 34 : Properties of Discrete Fourier Transform

Objectives

In this lecture, we will

Discuss properties of DFT like:

1) Linearity,

2) Periodicity,

3) DFT symmetry,

4) DFT phase-shifting etc.

34.1 Linearity:

Let and be two sets of discrete samples with corresponding DFT's

given by and . Then DFT of sample set is given by

Proof: ;

34.2 Periodicity :

We have evaluated DFT at . There after, it shows periodicity. For example

Where is an integer.

Proof:

(1)

Both and are integers. Hence ; Therefore from (1) we set


34.3 DFT symmetry :

If the samples are real, then extracting in frequency domain seems counter
intuitive; because, from N bits of information in one domain (time), we are deriving 2N bits of information
in frequency domain. This suggests that there is some redundancy in computation of
. As per DFT symmetry property, following relationship holds.

, where symbol indicates complex conjugate.


Proof:

Since

34.3 DFT symmetry : (contd..)

If the samples are real; then they


contain atmost bits of information. On
the otherhand, is a complex number
and hence contains 2 bits of information.
Thus, from sequence , if
we derive , it
implies that from N-bit of information, we
are deriving bits of information. This is
counter intuitive. We should expect some
relationship in the sequence
Thus, we conclude that
[Symmetry]

and [Anti-
symmetry]. DFT magnitude and phase plots
appear as shown in fig 34.1 and 34.2.

34.4 DFT phase shifting :

DFT shifting property states that, for a


periodic sequence with periodicity i.e.
, an integer, an offset
in sequence manifests itself as a phase shift
in the frequency domain. In other words, if
we decide to sample x(n) starting at n equal
to some integer K, as opposed to n = 0, the
DFT of those time shifted sequence,
is

Proof: By periodicity of samples, we have


34.4 DFT phase shifting :

DFT shifting property states that, for a


periodic sequence with periodicity i.e.
, an integer, an offset
in sequence manifests itself as a phase shift
in the frequency domain. In other words, if
we decide to sample x(n) starting at n equal
to some integer K, as opposed to n = 0, the
DFT of those time shifted samples.

Proof: By periodicity of samples, we have


34.4 DFT phase shifting: (contd..)

(2)

Now to compute , let us map the samples to .


Apply DFT to sequence .

(from (2))

Review Questions

1. Compute 8 - pt. DFT of the following sequence.

, , , , , , ,
. Hence, illustrate the various DFT properties discussed in this lecture.

2. By using inverse DFT, show that discrete samples can be recovered with knowledge of

Calculate the N pt. DFT of rectangular function given by, . Verify the various DFT
3.
properties

for this signal.

Recap

In this lecture we have learnt the following:

The properties of DFT like:

1) Linearity,

2) Symmetry,

3) DFT symmetry,
4) DFT phase-shifting etc.

You might also like