Radix 2 FFT

DIMES/N&S

15-9-03

Radix 2 FFT

Method 1: split even/odd

N even!
X N [k ] =

N 1

x[n]W kn

n=0

N
1
2

x[ 2n]W 2 kn + W k

n= 0

N
1:
2

for

for

N
k = + k ':
2

N
1
2

x[ 2n + 1]W 2 kn

n= 0
]
k [ odd ]
X N [ k ] = X [Neven
X N / 2 [k ]
/ 2 [k ] + W

X N [k ] =

]
X [Neven
/ 2 [k ' ] + W

N
+ k ')
]
2
X [Nodd
/ 2 [k ' ]

k ' [ odd ]
]
= X [Neven

[
'
]
k
W
X N / 2 [k ' ]
/2

since W-N=1 and W-N/2=1

15-9-03

Radix 2 FFT

Method 1 (2)
and this produces the scheme:

N/2 FFT

1
1

N/2+k

N/2 FFT

15-9-03

W-k

Radix 2 FFT

1
-1

Method 1 (3)
or with explicitation of the 2x2 FFTs:

W-1

N/2 FFT

N/2 FFT
W-N/2+1

15-9-03

Radix 2 FFT

perfect shuffle!

Method 2 [dual and equivalent!]

Split the sum in equal parts:
X N [k ] =

N / 2 1

x[n]W kn +

n=0

N / 21

n '= 0

and hence: for k=2p:

N / 2 1

N
+ n]}(W 2 ) np

2
n=0
N / 2 1
N
X N [2 p + 1] = {( x[ n] x[ + n])W n }(W 2 ) np
2
n=0
X N [ 2 p] =

and for k=2p+1:

( + n') k
N
x[ + n' ]W 2
2

{ x[ n] + x[

etcetera like before!

15-9-03

Radix 2 FFT

Operation count in flops

Additions and multiplications count as floating point ops!
approx. (3/2)N log2 N !

15-9-03

Radix 2 FFT