Scribd
Upload
6 views11 pages

Digital Signal Processing Week 4.1

The document covers Discrete Fourier Analysis, focusing on the Discrete Fourier Transform (DFT) and its properties, including the inverse DFT. It provides examples of calculating the DFT and IDFT for specific sequences and discusses the use of twiddle factors in solving DFT problems. Additionally, it includes tutorial questions for further practice on deriving twiddle factors and computing DFTs for different sequences.

Uploaded by

emmanuella.etop-essien
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
6 views11 pages

Digital Signal Processing Week 4.1

The document covers Discrete Fourier Analysis, focusing on the Discrete Fourier Transform (DFT) and its properties, including the inverse DFT. It provides examples of calculating the DFT and IDFT for specific sequences and discusses the use of twiddle factors in solving DFT problems. Additionally, it includes tutorial questions for further practice on deriving twiddle factors and computing DFTs for different sequences.

Uploaded by

emmanuella.etop-essien
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/ 11

DIGITAL SIGNAL PROCESSING

EIE 527
MODULE 4
(ANALYTICAL TOOLS)
DISCRETE FOURIER ANALYSIS
Lecturer(s): Dr. A.A Adewale, Engr. Akua Collins
Learning Outcomes

Discrete Fourier Analysis

 Discrete Fourier Transform


 4-Point DFT & 8-point DFT

 inverse DFT
Discrete Fourier Transform (DFT)
DFT is used for analyzing discrete-time finite duration signals in the frequency
domain.
Let 𝑥 𝑛 = 𝑏𝑒 𝑎 𝑓𝑖𝑛𝑖𝑡𝑒 𝑑𝑢𝑟𝑎𝑡𝑖𝑜𝑛 𝑠𝑒𝑞𝑢𝑒𝑛𝑐𝑒 𝑜𝑓 𝑙𝑒𝑛𝑔𝑡ℎ 𝑁 𝑠𝑢𝑐ℎ 𝑡ℎ𝑎𝑡 𝑥 𝑛 = 0
Outside 0 ≤ 𝑛 ≤ 𝑁 − 1
The DFT pair of 𝑥 𝑛 is
𝑁−1

෍ 𝑥 𝑛 𝑊𝑁𝑘𝑛 , 0≤𝑘 ≤𝑁−1


𝑋 𝑘 =
𝑛=0
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
𝑁−1
1
෍ 𝑋 𝑘 𝑊𝑁−𝑘𝑛 , 0≤𝑛 ≤𝑁−1
𝑥 𝑛 = 𝑁
𝑘=0
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
Discrete Fourier Transform (DFT) Cont’d
The DFT X(k) & IDFT x(n) of a finite-length sequence x(n) are given as follows

𝑊𝑁 is known as the TWIDDLE FACTOR,


It is a Fast Fourier Transform algorithm
& a constant coefficient that can be
multiplied by the data in the course of the
algorithm −𝑗2𝜋/𝑁
𝑊𝑁 = 𝑒
For example, if N = 4
K= 0,1,2,3
Where K and n are in the range of 0 ,1,2……N-1 N= 0,1,2,3

Alternative Formula:
Properties of Discrete Fourier Transform (DFT)

Problem 1:
Find the DFT of a sequence x(n)= {1,1,0,0} and find the
IDFT of Y(K)= {1,0,1,0}

𝑗2𝜋𝑘𝑛
−
X 𝐾 = σ𝑁−1
𝑛=0 𝑥(𝑛)𝑒 𝑁 K = 0, 1, . . . , N − 1. NOTE N = L = 4

X 0 = σ3𝑛=0 𝑥(𝑛) = 𝑥 0 + 𝑥 1 + 𝑥 2 + 𝑥 3 = 1 + 1 + 0 + 0 = 2
Discrete Fourier Transform (DFT)
𝑗𝜋𝑛 𝑗𝜋 𝑗3𝜋
X 1 = σ3𝑛=0 𝑥(𝑛)𝑒 − 2 =𝑥 0 +𝑥 1 𝑒 −2
+ x 2 𝑒 −𝑗𝜋 + x 3 𝑒− 2
𝜋 𝜋
= 1 + cos − 𝑗𝑠𝑖𝑛 = 1 − 𝑗
2 2

X 2 = σ3𝑛=0 𝑥(𝑛)𝑒 −𝑗𝜋𝑛 = 𝑥 0 + 𝑥 1 𝑒 −𝑗𝜋 + x 2 𝑒 −𝑗2𝜋 + x 3 𝑒 −𝑗3𝜋


= 1 + cos𝜋 − 𝑗𝑠𝑖𝑛𝜋 = 1 − 1 = 0
𝑗3𝜋𝑛 𝑗3𝜋 𝑗9𝜋
− − −
X 3 = σ3𝑛=0 𝑥(𝑛)𝑒 2 =𝑥 0 +𝑥 1 𝑒 + x 2 𝑒 −𝑗3𝜋 + x 3 𝑒
2 2
3𝜋 3𝜋
= 1 + cos − 𝑗𝑠𝑖𝑛 =1+𝑗
2 2

X 𝐾 = 2, 1 − 𝑗, 0, 1 + 𝑗
Inverse Discrete Fourier Transform (IDFT)
𝑗2𝜋𝑘𝑛
1 𝑁−1
y 𝑛 = σ𝑘=0 𝑌 𝑘 𝑒 𝑁 𝑛 = 0, 1, … 𝑁 − 1
𝑁
1 3
y 0 = σ𝑘=0 𝑌 𝑘 𝑛 = 0, 1, 2, 3
4
1 1
y 0 = 𝑦 0 +𝑦 1 +𝑦 2 +𝑦 3 = 1 + 0 + 1 + 0 = 0.5
4 4

𝑗𝜋 𝑗3𝜋
1
y 1 = 𝑌 0 + 𝑌 1 𝑒 + 𝑌 2 𝑒 𝑗𝜋 + 𝑌(3)𝑒
2 2
4
1
1 + 0 + 𝑐𝑜𝑠𝜋 + 𝑗𝑠𝑖𝑛𝜋 + 0
4
1
1+0−1+0 =0
4
Inverse Discrete Fourier Transform (IDFT)
1
y 2 = 𝑌 0 + 𝑌 1 𝑒 𝑗𝜋 + 𝑌 2 𝑒 𝑗2𝜋 + 𝑌(3)𝑒 𝑗3𝜋
4
1
1 + 0 + 𝑐𝑜𝑠2𝜋 + 𝑗𝑠𝑖𝑛2𝜋 + 0
4
1
1 + 0 + 1 + 0 = 0.5
4
𝑗3𝜋 𝑗9𝜋
1
y 3 = 𝑌 0 + 𝑌 1 𝑒 + 𝑌 2 𝑒 𝑗3𝜋 + 𝑌(3)𝑒
2 2
4
1
1 + 0 + 𝑐𝑜𝑠3𝜋 + 𝑗𝑠𝑖𝑛3𝜋 + 0
4
1
1 + 0 + −1 + 0 = 0
4
y 𝑛 = 0.5, 0, 0.5, 0
Using Twiddle factors to solve DFT Problems
Problem 2:
Find the 4-point DFT of this sequence x(n)= {1,1,0,0} using the Twiddle factors

4 − 𝑝𝑜𝑖𝑛𝑡 𝑇𝑤𝑖𝑑𝑑𝑙𝑒 𝑓𝑎𝑐𝑡𝑜𝑟𝑠 𝑎𝑟𝑒: 𝑊40 = 1, 𝑊41 = −J, 𝑊42 = −1, 𝑊43 = +J
𝑁−1

෍ 𝑥 𝑛 𝑊𝑁𝑘𝑛 , 0≤𝑘 ≤𝑁−1


𝑋 𝑘 =
𝑛=0
0, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒

𝑋 𝑘 = ෍ 𝑥 𝑛 𝑊𝑁𝑘𝑛 = 𝑥 0 𝑊40 + 𝑥 1 𝑊4𝑘 + 𝑥 2 𝑊42𝑘 + 𝑥(3)𝑊43𝑘


𝑛=0

1 × 𝑊40 + 1 × 𝑊4𝑘 + 0 × 𝑊42𝑘 + 0 × 𝑊43𝑘 = 1 + 𝑊4𝑘


Using Twiddle factors to solve DFT Problems

𝑤ℎ𝑒𝑛 𝑘 = 0, 𝑋 0 =1+1=2

𝑤ℎ𝑒𝑛 𝑘 = 1, 𝑋 1 =1−𝑗

𝑤ℎ𝑒𝑛 𝑘 = 2, 𝑋 2 =1−1=0

𝑤ℎ𝑒𝑛 𝑘 = 3, 𝑋 3 =1+𝑗

X 𝐾 = 2, 1 − 𝑗, 0, 1 + 𝑗
TUTORIAL QUESTIONS
Derive the twiddle factors of a 4-point DFT

 Find the 4-point DFT of x n = 1, −2, 3, 2

 Derive the twiddle factors of an 8-point DFT

 Compute the 8-point DFT of the discrete time signal x n = ሼ1, −1,

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