BITS Pilani

Pilani Campus

DFT
FREQUENCY DOMAIN SAMPLING

sampling of the Fourier transform of an aperiodic discrete-

time sequence.
A aperiodic discrete-time signal x(n) with Fourier transform

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

we take N equidistant samples in the interval 02 with
spacing = 2/N,
at w = 2k/N, we obtain

Which is expanded to give

change the index in the inner summation from n to n IN

fork=0.1,2 ..... N- 1 . Fo for k=0,1,2 ..... N- 1 .

3
 -------------------------(A)

The signal is

The fourier series expansion of the signal is

with Fourier coefficients

By comparing this with eqn (A) we have

4
 -----------B
From B it is seen that we can construct the periodic signal
from the samples of the spectrum X(w) with conditions

Aperiodic sequence
x(n) of length L and its
periodic extension for
N >L (no aliasing)

and N < L (aliasing).

5
We observe that when N L. Then

It is possible to express the spectrum X(w) directly in

terms of its samples X(2k/N). k= 0, 1,2... . . ., N - 1.
Interpolation formula for X(w).
Since

And =
= ()

We have

..c

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

if we define

Then eqn C is

Plot of the function

[sin(N/2)]/[Nsin(/2)]
for N=5

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

 The Discrete Fourier Transform (DFT)

A finite-duration sequence x(n) of length L [i.e., x(n) = 0 for

n < 0 and n > L] has a Fourier transform

When we sample X(w) at equally spaced frequencies

wk = 2k/N. k = 0, 1. 2.. . . . N - 1. where N L.
the resultant samples are

sum has been increased from L 1 to N - I since x(n) = 0 for

N>L
BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956
Transform Pair Summary

DFT

IDFT

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

 Circular Symmetries of a Sequence
As

suppose that we shift the periodic sequence x(n) by k units

to the right Then

The finite-duration sequence = 0 1

0

is related to the original sequence x(n) by a circular shift

as shown in figure next

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

11
 Circular shift of a sequence.
In general, the circular shift of the sequence can be
represented as the index modulo N. Thus we can write
= , = (( ))N
If k = 2 and N = 4, we have = (( 2))4

which implies that 0 = ((2))4 = (2)

1 = ((1))4 = (3);
2 = ((0))4 = (0)
3 = ((1))4 = (1)

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

An N-point sequence is called circularly even if it is
symmetric about the point zero on the circle. That is

An N-point sequence is called circularly odd if it is

antisymmetric about the point zero on the circle

The time reversal of an N-point sequence is attained by

reversing its samples about the point zero on the circle.

This time reversal is equivalent to plotting x(n) in a

clockwise direction on a circle.
13
 Multiplication of Two DFTs and Circular
Convolution
Suppose that we have two finite-duration sequences of
length N, x1(n) and x2(n).
Their respective N-point DFTs are
&

Multiplying the DFTs, We have

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

Perform the circular convolution of the following two
sequences:

15
16
The IDFT of [X3(k)] is

Substituting X1(k) & X2(k) We have

BITS Pilani, Deemed to be University under Section 3 of UGC Act, 1956

 The inner sum in the
brackets has the form

where a is defined as
We observe that a = 1 when m - n - 1 is a multiple of N. On
the other hand aN = 1 for any value of a0.

Then
18
By means of the Dm and IDFT, determine the sequence
x3(n) corresponding to the circular convolution of the
sequences x1(n) and x2(n) given in

=1 + 2e-ik/2 + 3e-ik+ 4e -j3k/2

X2(0) = 10,X2(1) = -2 + j2, X2(2) = -2 , X2(3)= - 2-i2

19
20