DRK INSTITUTE OF SCIENCE AND TECHNOLOGY

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

DESIGN AND IMPLEMENTATION OF FFT FOR REAL TIME SIGNAL

BY: G.SANDEEP P.L.GANESH K.BHARADWAJ B.RAVINDER A.JAYANTH REDDY

WHY FFT???
y y y y

TO IMPLEMENT DFT TO MAKE CALCULATIONS FASTLY TO IMPROVE PERFORMANCE TO REDUCE COMPUTATION TIME

OBJECTIVES
y

WHAT IS FFT? VHDL FLOW CHART DESIGN FLOW FPGA TOOLS

WHAT IS FFT???
y

DEFINITION ALGORITHMS TWIDDLE FACTORS

Vhdl design flow

VHDL Source
Directives

Synthesis

Logic Optimization Technology Mapping Technology Implementation

Attributes

Timing

Place & Route

Timing, Pin, Placement

FFT radix-2 decomposition radix-

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

Bit reversal

Block diagram
Test Vector Sine wave AM (DSBSC) Voice Noise Input vector x[n] Bit reversal order (Decimati on-inTime) FPGA Computation Logic (complex Multiplication Accumulation ) Twiddle factors W Multiplex er MUX SEL

X[k] Magnitu de

UART Transmit ter Waveform Selection PC

Vhdl code modules

y

TOP MODULE CODE FFT MODULE FFT TEST ROM MODULE

UART TX MODULE

FFT MODULE
BUTTERFLY MODULE MAGNITUDE MODULE

FFT TEST ROM

SINE DSB-SC VOICE NOISE

Avnet kit

Outputs

Performance

APPLICATIONS
DIGITAL SPECTRAL ANALYSIS FILTER SIMULATION AUTO CORRELATION PATTERN RECOGNITION

FUTURE SCOPE
y

This project can be used as an IP core for any signal processing applications. Further, it is observed that the length 16 is not sufficient for the FFT analysis of speech signals. Hence, in future the length of the sequence can be changed to 256 or 512 by selecting higher grade FPGA.

CONCLUSION
y

The Cooley-Tukey algorithm , the most common Fast Fourier transform (FFT) algorithm is successfully implemented.

Any queries???

Thanking you