Scribd
Upload
34 views16 pages

The Discrete Fourier Transform

The document discusses the discrete Fourier transform (DFT). It begins by defining the discrete Fourier pair and periodic extension of finite sequences. It then describes how sampling the discrete-time Fourier transform (DTFT) of an aperiodic sequence results in the DFT coefficients of a periodic sequence. The DFT represents a finite-length sequence using samples of its DTFT. It concludes by providing an example of calculating the DFT of a rectangular pulse and discussing properties such as linearity, duality, and circular convolution.

Uploaded by

Alamgir Ahmad Khattak
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
34 views16 pages

The Discrete Fourier Transform

The document discusses the discrete Fourier transform (DFT). It begins by defining the discrete Fourier pair and periodic extension of finite sequences. It then describes how sampling the discrete-time Fourier transform (DTFT) of an aperiodic sequence results in the DFT coefficients of a periodic sequence. The DFT represents a finite-length sequence using samples of its DTFT. It concludes by providing an example of calculating the DFT of a rectangular pulse and discussing properties such as linearity, duality, and circular convolution.

Uploaded by

Alamgir Ahmad Khattak
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/ 16

The Discrete Fourier Transform

Review
Discrete Fourier Pair

1 N1
j 2 /N kn
x[n] = X [ k ] e ( )
N k=0
N1

j 2 /N kn
X [ k ] = x[n]e ( )
n=0

Any finite duration signal can be taken as periodic

~
x[n] = x[n] ~
p[n] = x[n]

DTFT

( )

x[n] X e

r =

r =

[n rN] = x[n rN]

~ j
Xe =

( ) 2N ~X[k ] 2Nk

k =

~
X[k ] = X e j

( )

= (2 / N)k

= X e j(2 / N)k

Sampling the Fourier Transform


Consider an aperiodic sequence with a Fourier transform

( )

x[n] DTFT
X e j
Assume that a sequence is obtained by sampling the DTFT
~
X[k ] = X e j
= X e j(2 / N)k

( )

= (2 / N)k

Since the DTFT is periodic resulting sequence is also periodic


We can also write it in terms of the z-transform
~
X[k ] = X(z ) z = e(2 / N )k = X e j(2 / N)k

The sampling points are shown in figure


~
X[k ] could be the DFS of a sequence
Write the corresponding sequence
1 N 1 ~
~
x[n] = X[k ]e j(2 / N)kn
N k =0

Sampling the Fourier Transform Contd


The only assumption made on the sequence is that DTFT exist

( ) = x[m]e

Xe

~
X[k ] = X e j(2 / N)k

jm

m =

1 N 1 ~
~
x[n] = X[k ]e j(2 / N)kn
N k =0

Combine equation to get

1 N1
~
x[n] = x[m]e j(2 / N)km e j(2 / N)kn
N k = 0 m =

1 N1 j(2 / N)k (n m)
~
[
]
= x[m] e
=
x
m
p [n m]

m =
N k = 0
m =
Term in the parenthesis is

So we get

1 N1 j(2 / N)k (n m)
~
p [n m] = e
=
N k =0
~
x[n] = x[n]

[n m rN]

r =

r =

r =

[n rN] = x[n rN]

Sampling the Fourier Transform Contd

Sampling the Fourier Transform Contd


Samples of the DTFT of an aperiodic sequence
can be thought of as DFS coefficients
of a periodic sequence
obtained through summing periodic replicas of original sequence

If the original sequence


is of finite length
and we take sufficient number of samples of its DTFT
the original sequence can be recovered by

~
x [n] 0 n N 1
x[n] =
else
0
It is not necessary to know the DTFT at all frequencies
To recover the discrete-time sequence in time domain

Discrete Fourier Transform


Representing a finite length sequence by samples of DTFT

The Discrete Fourier Transform


Consider a finite length sequence x[n] of length N

x[n] = 0 outside of 0 n N 1

For given length-N sequence associate a periodic sequence

~
x [n] =

x[n rN]

r =

The DFS coefficients of the periodic sequence are samples of


the DTFT of x[n]
Since x[n] is of length N there is no overlap between terms of
x[n-rN] and we can write the periodic sequence as

~
x [n] = x[(n mod N)] = x[((n))N ]
To maintain duality between time and frequency
~
We choose one period of X[k ]as the Fourier transform of x[n]

~
X[k ] 0 k N 1
X[k ] =
0
else

~
X[k ] = X[(k mod N)] = X[((k ))N ]

The Discrete Fourier Transform Contd


The DFS pair

~
X[k ] =

N 1

~
x[n]e j(2 / N)kn

n=0

1 N 1 ~
~
x[n] = X[k ]e j(2 / N)kn
N k =0

The equations involve only on period so we can write

N 1 ~
x[n]e j(2 / N)kn 0 k N 1
X[k ] = n = 0

0
else
1 N 1 ~
X[k ]e j(2 / N)kn 0 k N 1
x[n] = N k = 0

0
else
The Discrete Fourier Transform

1 N1
x[n] = X[k ]e j(2 / N)kn
X[k ] = x[n]e
N k =0
n=0
The DFT pair can also be written as
N 1

j(2 / N )kn

X[k ] DFT

x[n]

Example
The DFT of a rectangular pulse
x[n] is of length 5
We can consider x[n] of any
length greater than 5
Lets pick N=5
Calculate the DFS of the periodic
form of x[n]

~
X[k ] =

j(2 k / 5 )n
e

n=0

1 e j2 k
=
1 e j(2 k / 5 )
5 k = 0,5,10,...
=
else
0

Example Contd
If we consider x[n] of length 10
We get a different set of DFT
coefficients
Still samples of the DTFT but in
different places

Properties of DFT
Linearity

x1 [n]
DFT

X1 [k ]
x2 [n]
DFT

X2 [k ]
ax1 [n] + bx 2 [n] DFT

aX1 [k ] + bX 2 [k ]
Duality

x[n] DFT

X[k ]

X[n] DFT

Nx[(( k ))N ]

Circular Shift of a Sequence

x[n]

DFT

X[k ]

x[((n m))N ] 0 n N - 1 DFT

X[k ]e j(2k / N)m

Example: Duality

Symmetry Properties

Circular Convolution
Circular convolution of of two finite
length sequences

x3 [n] =
x3 [n] =

N 1

x [m]x [((n m)) ]

m=0

N 1

x [m]x [((n m)) ]

m=0

Example
Circular convolution of two rectangular pulses L=N=6

1 0 n L 1
x1 [n] = x2 [n] =
else
0
DFT of each sequence

X1 [k ] = X2 [k ] =

N 1

2
kn
N

n=0

N k = 0
=
0 else

Multiplication of DFTs

N2 k = 0
X3 [k ] = X1 [k ]X2 [k ] =
0 else
And the inverse DFT
N 0 n N 1
x3 [n] =
else
0

Example
We can augment zeros to
each sequence L=2N=12
The DFT of each sequence

X1 [k ] = X2 [k ] =

1e

1e

2 Lk
N

2 k
N

Multiplication of DFTs
2 Lk
j

1 e N
X3 [k ] =
2 k
j
1 e N

You might also like