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
Fft

# Fft

Ratings:

5.0

(1)
|Views: 77 |Likes:
FFT Algorithms
FFT Algorithms

### Availability:

See more
See less

03/18/2014

pdf

text

original

n=0
x(n) cos2\u03c0kn
N
XI(k) =\u2212
N\u22121
\ue006
EE4008 Digital Signal Processing
\u2022Direct Computation ofN Point DFT of real datax(n)
XR(k) =
N\u22121
\ue006
n=0
x(n) sin2\u03c0kn
N
\u2022Resulting in:
1. 2N2 evaluation of trigonometric functions
2. 2N2real multiplications
3. 2N (N\u2212 1) real additions
FFT.
1
Dr Liam Marnane
email: liam@rennes.ucc.ie
EE4008 Digital Signal Processing
Fast Fourier Transform
\u2022Collection of algorithms to compute DFT e\ufb03ciently
\u2022Radixr is the smallest DFT performed:
\u2022Decimation
\u2013In Time :- inputx(n) is decimated by factorr.
\u2013In Frequency :- outputX (k) is decimated by a factor
rat each stage.
FFT.
2
Dr Liam Marnane
email: liam@rennes.ucc.ie
EE4008 Digital Signal Processing
De\ufb01ne
WN= e(
\u2212j2\u03c0
N)
Following Properties:
Periodicwith periodN
Wk+N
N
=e(
\u2212j2\u03c0(k+N)
N
)
=e(
\u2212j2\u03c0k
N
)e(
\u2212j2\u03c0N
N
)
=e(
\u2212j2\u03c0k
N
)
=Wk
N
FFT.
3
Dr Liam Marnane
email: liam@rennes.ucc.ie