Scribd
Upload
139 views

DFT (Discrete-Fourier Transform)

Uploaded by

Mariam Ayman
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
139 views

DFT (Discrete-Fourier Transform)

Uploaded by

Mariam Ayman
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/ 40

DFT (discrete-fourier transform)

1
Reminder: Eigenvalue (DTFT)

2
Discrete Fourier Series

3
Discrete Fourier Series

4
Example:

5
Discrete Fourier Transform

6
Discrete Fourier Transform

7
DFS vs. DFT

8
Example

9
10
11
Example

12
13
14
DFT vs. DTFT

15
DFT vs. DTFT

16
DFT vs DTFT

17
DFT as Matrix Operator

N2 complex multiples

18
Properties of the DFT

19
Circular Shift

20
Circular Shift

21
Example 7.5 Computing circular convolution in the
time-domain

◆ Determine the 4-point circular convolution of the following 4-point


sequences:

◆ h[n]={h[0] h[1] h[2] h[3]} = {1 0 1 1},


◆ x[n]={x[0] x[1] x[2] x[3]} = {0 1 2 3}.

22
Solution
◆ The first step is to change the time index from n to m.For n = 0 we need the
samples of sequences h[m] and x[−m4], which we arrange on two concentric
circles as shown in Figure 7.17. As expected, the samples of the time-reversed
sequence are placed counterclockwise. The sum of pairwise products gives the
value of circular convolution for n =0,that is

y[0]=h[0]x[0]+h[1]x[3]+h[2]x[2]+h[3]x[1]=3.
y[1]=h[0]x[1]+h[1]x[0]+h[2]x[3]+h[3]x[2]=6.

23
y[2]=h[0]x[2]+h[1]x[1]+h[2]x[0]+h[3]x[3]=5,

y[3]=h[0]x[3]+h[1]x[2]+h[2]x[1]+h[3]x[0]=4.

24
Compute Circular Convolution Sum

25
26
27
28
29
30
31
32
y[3]=4

33
34
Example 7.6 Computation of circular convolution using the DFT

◆ Compute the 4-point circular convolution of the sequences in Example


7.5 using the DFT:
◆ h[n]={h[0] h[1] h[2] h[3]} = {1 0 1 1},
◆ x[n]={x[0] x[1] x[2] x[3]} = {0 1 2 3}.

35
Solution
◆ The first step is to compute the 4-point DFTs of the two sequences.
◆ This is done using the matrix-by-vector multiplication formulas . The
4-point DFT of x[n] is obtained by

◆ Similarly, the 4-point DFT of h[n] is given by

• In the second step we compute the product Y[k]=H[k]X[k],


k=0,1,2,3 of the two DFTs .The result is the 4-point DFT

Y[0]=18, Y[1]=−2−j2,
Y[2]=−2, Y[3]=−2+j2.
36
◆ The circular convolution is obtained by computing the inverse DFT of
Y[k] using the formula
◆ y=(1/4)W∗ 4Y
◆ The result is

◆ In practice , we use the following MATLAB implementation


y=ifft(fft(h).∗fft(x)),
◆ Although circular convolution is the natural operation when working
with DFTs, the operation required by signal processing applications is
linear convolution. A logical question is, can we use circular
convolution to obtain linear convolution? The answer to this question,
is yes,

37
Properties of the DFS/DFT

38
39
DFT and Inverse DFT

40

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy