Scribd
Upload
140 views

Discrete Fourier Transform (DFT)

The document discusses the discrete Fourier transform (DFT) and its properties. The DFT provides uniformly spaced samples of the discrete-time Fourier transform (DTFT) and transforms a discrete-time signal from the time domain to the frequency domain. The DFT of a discrete-time signal x[n] with finite extent N is defined by a summation formula. Key properties of the DFT include periodicity, symmetry, linearity, how it is affected by circular shifts of the input signal, and its relationships to energy, power, and circular convolution.

Uploaded by

Maheshwaran Mahi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
140 views

Discrete Fourier Transform (DFT)

The document discusses the discrete Fourier transform (DFT) and its properties. The DFT provides uniformly spaced samples of the discrete-time Fourier transform (DTFT) and transforms a discrete-time signal from the time domain to the frequency domain. The DFT of a discrete-time signal x[n] with finite extent N is defined by a summation formula. Key properties of the DFT include periodicity, symmetry, linearity, how it is affected by circular shifts of the input signal, and its relationships to energy, power, and circular convolution.

Uploaded by

Maheshwaran Mahi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 22

Discrete Fourier Transform

(DFT)

Time

Frequency

Continuous time continuous


Fourier transform
(FT)

Continuous,
Aperiodic

Fourier series
(FS)

Discrete,
Aperiodic

continuous
periodic

Discrete-time
discrete
Fourier transform
(DTFT)

continuous
periodic

Discrete Fourier
series (DFS)

Discrete,
Aperiodic

discrete
periodic
2

Discrete Fourier Transform


(DFT)
The DFT provides uniformly spaced
samples of the Discrete-Time Fourier
Transform (DTFT).
Discrete Fourier transform (DFT) of a
discrete-time signal x[n] with finite extent
2nk
2nk
N 1
N 1
j
j
1
n [0, N-1]
N
N
X [k ] x[n]e
n 0

Twiddle factor:

x[n]

X [k ]e

N
n 0

Example
xx(n
(n))
~
x~
x((nn))
~
x~
x((nn))

N=9
n

N=12
0

12

N=7
0

12

Discrete Fourier Transform


(DFT)
Let N-point vector xN of the signal
sequence x(n) , n = 0, 1, 2, .(N-1) and Npoint vector XN of frequency samples and
NxN matrix WN as

Discrete Fourier Transform


(DFT)
With these definitions,
the N-point DFT may be
expressed in matrix
forminverse
as,
The
DFT
Or

IN is an NxN identity matrix.

Discrete Fourier Transform pairs


Analysis equation
N 1

X k x nW
n 0

Synthesis equation

1
x n
N
x n

N 1

kn
N

kn

X
k
W

N
k 0

DFT

X k

Example:
Compute the DFT of the 4-point sequence

then

DFT Properties
1. Periodicity:
If x(n) and X(k) are N-point DFT pairs

2. Symmetry:
X(k) = X*(-k)N = X*(N-k)
3. Linearity:

DFT Properties
3. Circular Shift of a sequence:
The desired shift, called the circular shift,
is defined using a modulo operation:

xc [n] x[ n n0 N ]

For n0 >0 (right circular shift), the above


equation implies
x[n n ] , for n n N 1

xc [n]

x[ N n0 n] , for 0 n n0

Illustration of the concept of a circular

x[n]

x[n]

x[ n1 6 ]
x[ n 5 6 ]

x[ n4 6 ]
x[ n 2 6 ]

DFT Properties
4.

Multiplication:DFT [ x1 (n) x2 (n)]

1
X 1 (k ) X 2 (k )
N

5. Parsevals relation:
N 1

1
E x | x( n) |
N
n 0
2

| X ( k ) |2
N

Energy spectrum

X (k )
N

Power spectrum

N 1

2
|
X
(
k
)
|

k 0

DFT Properties
6. Circular Convolution:

DFT Properties
Suppose we have 2 finite-duration
sequences of length N, x1(n) and x2(n)

Convolution Sum
called Circular Convol

Example:

Exampl
e: Perform the circular convolution of the
following 2 sequence:

m=0

m=2

= 14

= 14
m=3

m=1

= 16

= 16

Cont
d.

Cont
d.

Cont
d.

You might also like