Scribd
Upload
28 views48 pages

Discrete Fourier Transform Part 1

This document discusses the discrete Fourier transform (DFT). It defines DFT as a finite discrete frequency sequence obtained by sampling one period of the Fourier transform. The DFT of a discrete sequence x(n) is denoted as X(k). Equations for the DFT and inverse DFT are provided. A twiddle factor W is introduced to make DFT computations easier. Standard signals like impulse, exponential are analyzed in the DFT domain. The cyclic property of the twiddle factor is explained through an 8-point DFT table example. Finally, examples are provided to calculate the 2-point, 4-point and 8-point DFT of given sequences.

Uploaded by

eloira1214
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
28 views48 pages

Discrete Fourier Transform Part 1

This document discusses the discrete Fourier transform (DFT). It defines DFT as a finite discrete frequency sequence obtained by sampling one period of the Fourier transform. The DFT of a discrete sequence x(n) is denoted as X(k). Equations for the DFT and inverse DFT are provided. A twiddle factor W is introduced to make DFT computations easier. Standard signals like impulse, exponential are analyzed in the DFT domain. The cyclic property of the twiddle factor is explained through an 8-point DFT table example. Finally, examples are provided to calculate the 2-point, 4-point and 8-point DFT of given sequences.

Uploaded by

eloira1214
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/ 48

Discrete Fourier

Transform
Discrete Fourier Transform
• It is a finite duration discrete frequency sequence
which is obtained by sampling one period of fourier
transform.
• Sampling is done at ‘N’ equally spaced points over
the period extending from ω = 0 to ω = 2π.
Discrete Fourier Transform
• Mathematical Equations:
• The DFT of discrete sequence x(n) is denoted by
X(k). It is given by,

• Here k = 0,1,2,..,N-1
Discrete Fourier Transform
• Since this summation is taken for 'N' point DFT.
• Discrete sequence x(n)can be obtain from its DFT.
It is called inverse discrete fourier transform (IDFT).
It is given by,

• Here n = 0,1,2,...,N – 1
• This is called as 'N' point IDFT
Discrete Fourier Transform
• The new term 'W' as,

• This is called as twiddle factor. Twiddle factor


makes the computation of DFT a bit easy and fast.
• Using twiddle factor we can write the equations of
DFT and IDFT as follows

• Here n = 0,1,2,...,N - 1
Discrete Fourier Transform
• And

• Here n = 0,1,2,...,N – 1
Relationship between DTFT and
DFT
• The DTFT is discrete time fourier transform and is
given by,

• The range of ω is from -π to π or 0 to 2π.


Relationship between DTFT and
DFT
• Discrete fourier transform (DFT) is obtained by
sampling one cycle of fourier transform.
• And DFT of x(n) is given by,

• Comparing the two equations, DFT can be obtained


from DTFT by putting
Relationship between DTFT and
DFT
• Comparing DFT with DTFT
1. The continuous frequency spectrum X(ω) is
replaced by discrete fourier spectrum X(k).
2. Infinite summation in DFTFT is replaced by finite
summation in DFT.
3. The continuous frequency variable is replaced by
finite number of frequencies located at ; where Ts
is sampling time.
DFT of Standard Signals
• DFT of unit impulse δ(n), x(n) = δ(n)
DFT of Standard Signals
• DFT of delayed unit impulse δ(n – n0)
DFT of Standard Signals
• N-point DFT of exponential sequence, x(n) = anu(n)
for 0≤n≤N-1
DFT of Standard Signals
• Standard summation formula

• Let and
DFT of Standard Signals
• Using Euler's identities

• But k is an integer
DFT of Standard Signals
• DFT of a window function, w(n) = u(n) - u(n-N)
• Based from the definition of DFT,
DFT of Standard Signals
DFT of Standard Signals
DFT of Standard Signals

X(k) = {4,0,0,0}
Cyclic Property of Twiddle Factor
• The twiddle factor is denoted by WN and is given
by,

• The discrete time sequence x(n) can be denoted by


xN. Here 'N' stands for 'N' point DFT. While in case
of 'N' point DFT; the range of 'n' is from 0 to N-1.
Now the sequence xN is represented in the matrix
form as follows:
Cyclic Property of Twiddle Factor
• This is a "Nx1" matrix and 'n' varies from 0 to N-1.
Now the DFT of x(n) is denoted by X(k). It is
denoted x(n) by xN; similarly denote X(k) by xN. In
the matrix form Xk can be represented as follows,
Cyclic Property of Twiddle Factor
• This is also "Nx1" matrix and 'k' varies from 0 to N-
1. Recalling the definition of DFT.

• It can also represent in the matrix form.


Remember that 'k' varies from 0 to N-1 and 'n' also
varies from 0 to N-1.
Cyclic Property of Twiddle Factor

• Note that each value is obtained by taking


multiplication of k and n.
• Thus DFT can be represented in the matrix form as,
XN = [WN]xN
Cyclic Property of Twiddle Factor
• IDFT can be represented in the matrix form as,

• is complex conjugate of WN
• WN possess the periodicity property. That means,
after some period the value of WN repeats.
Cyclic Property of Twiddle Factor
8-point DFT Table
Cyclic Property of Twiddle Factor
• 8-point DFT Table
Cyclic Property of Twiddle Factor
• 8-point DFT:
Cyclic Property of Twiddle Factor
• Cyclic property of twiddle factor
Example:
• Determine 2 point and 4-point DFT of a sequence,
x(n) = u(n) - u(n-2)
• Sketch the magnitude of DFT in both the cases.
Solution:
• x(n) = u(n) - u(n-2)
• x(n) = {1, 1}
Solution:
• 2-point DFT, N =2
Solution:

• 2-point DFT is, X(k) = {2, 0}


Solution:
• Magnitude plot:
Solution:
• 4-point DFT, N=4.
Solution:
Solution:
• Cyclic property of DFT
Solution:

• x(n) = {1,1}, to make the length of this sequence


equal to 4. It is obtained by adding zeros at the end
of sequence. This is called as zero padding.
Solution:
• the DFT is given by, XN = [WN]xN

x4 = {2, 1-j, 0, 1+j}


Solution:
• The DFT sequence can also be written as
Solution:
• Magnitude plot: The magnitude at different values
is obtained as follows,
Example:
Calculate 8 point DFT of x(n) = {1,2,1,2}
Solution:
Solution:
Solution:
Solution:
Solution:
Solution:
END of PART 1
Reference
Digital Signal Processing
Principles, Algorithms and Applications
by Manolakis and Proakis

You might also like