Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more ➡
Standard view
Full view
of .
×
0 of .
Results for:
P. 1
AbeViet DSP Lecture 21

# AbeViet DSP Lecture 21

Ratings: 0|Views: 91|Likes:

### Availability:

See More
See less

03/24/2011

pdf

text

original

Fast Fourier Transforms
Quote of the Day
On two occasions I have been asked, ³Pray, Mr.Babbage, if you put into the machine wrong figures,will the right answers come out?´ I am not ablerightly to apprehend the kind of confusion of ideasthat could provoke such a question.Charles Babbage
Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, ©1999-2000 Prentice HallInc.

351M Digital Signal Processing2
Discrete Fourier Transform The DFT pair was given as Baseline for computational complexity:
± Each DFT coefficient requires
 N complex multiplications N-1 complex additions
± All N DFT coefficients require
 N
2
 Complexity in terms of real operations
 4N
2
 Most fast methods are based on symmetry properties
± Conjugate symmetry± Periodicity in n and k
? A
§
!T
!
1N0kknN/2j
ekXN1]n[x
? A
§
!T
!
1N0nknN/2j
e]n[xkX
knN/2jnkN/2jkNN/2jnNkN/2j
eeee
TTTT
!!
nNkN/2jNnkN/2jknN/2j
eee
TTT
!!

351M Digital Signal Processing3
The Goertzel Algorithm Makes use of the periodicity Multiply DFT equation with this factor Define With this definition and using x[n]=0 for n<0 and n>N-1 X[k] can be viewed as the output of a filter to the input x[n]
± Impulse response of filter:± X[k] is the output of the filter at time n=N
1ee
k2jNkN/2j
  
? A
¡  ¢  ¡    ¡  ¢    ¡  
1N0rnNrN/2j 1N0rrnN/2jkNN/2j
e]r[xe]r[xekX
? A
 
? A
g
¡
g
¢  ¡  
rrnkN/2j k
rnue]r[xny
? A ? A
Nnk
nykX
¢
? A
nue
knN/2j


## Activity (0)

### Showing

AllMost RecentReviewsAll NotesLikes