ACCESS IC LAB
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU
FFT Review
N 1
X (k ) (n)W
n 0
nk
N for k 0,1,..., N - 1
with WN e j ( 2 / N )
[0] X [0]
W N0
[4] X [1]
1
W N0
[2] X [2]
1
W N0 W N2
[6] X [ 3]
1 1
W N0
[1] X [4]
1
W N0 W N1
[ 5] X [ 5]
1 1
W N0 W N2
[ 3] X [6]
1 1
W N0 W N2 W N3
[ 7] X [7]
1 1 1
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU
Implementation
--- Two Extreme Method
Fully Spread
Reuse Single Butterfly [0] X [0]
W N0
[4] X [1]
1
W N0
[2] X [2]
1
W N0 W N2
[6] X [ 3]
1 1
W N0
[1] X [4]
1
W N0 W N1
[ 5] X [ 5]
1 1
W N0 W N2
[ 3] X [6]
1 1
W N0 W N2 W N3
[ 7] X [ 7]
1 1 1
Design Consideration
System Requirement
e.g., speed, area,power …
Trade-off in these two cases, we need
More Processing Elements (PE’s)
Better Processing Element Utilization
Rate
Better Control Scheme
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU
FFT Processor
--- Block Diagram
COEF
ROM
CONTROL
SIGNAL
CONTROL
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU
8 4 2 1
Comparison
Radix / Speed
Low ----------------------------------- High
Control Theme
Simple ----------------------------------- Complex
Reuse 4
times
A radix-4 PE
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU
Summation of n1
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU
Trivial multiplication
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU
Control Control
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU
Circuit of BF2I
First N/2 cycles
Xr(n) Zr(n+N/2)
Xi(n) Zi(n+N/2)
Xr(n+N/2) Zr(n)
Xi(n+N/2) Zi(n)
Circuit of BF2II
Xr(n) Zr(n+N/2)
Xi(n) Zi(n+N/2)
Xr(n+N/2) Zr(n)
Xi(n+N/2) Zi(n)
x(n) BF2i BF2ii BF2i BF2ii BF2i BF2ii BF2i BF2ii X(k)
X X X
Structural advantage
Radix-22 has the same complexity as
radix-4,but still retain radix-2 BF
structure
The stage has non-trivial multiplication
Control is simple;
synchronization controller
n
address counter for W
ACCESS IC LAB Graduate Institute of Electronics Engineering, NTU
Conclusions
1. FFT Applications: Radar Signal Processing, Fast
convolution, Spectrum Estimation, OFDM-based
Modulation/demodulations
2. Efficient VLSI architectures (parallel processing) are
required for real-time processing.
3. However, most systems still employ DSP processors (e.g.,
TI C3x/C5x) for computations (fast algorithms like DIT and
DIF FFT).
4. VLIW (Very Long-length Instruction Word)-based processors
(TI C6x) need new programming skills to utilize the two
parallel MAC units.