Main Project Ppt

DRK INSTITUTE OF SCIENCE AND TECHNOLOGY

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

DESIGN AND IMPLEMENTATION OF FFT FOR REAL TIME SIGNAL

BY:G.SANDEEPP.L.GANESHK.BHARADWAJB.RAVINDERA.JAYANTH REDDY

WHY FFT??? TO IMPLEMENT DFT TO MAKE CALCULATIONS FASTLY TO IMPROVE PERFORMANCE TO REDUCE COMPUTATION TIME

OBJECTIVES

WHAT IS FFT?

VHDL FLOW CHART

DESIGN FLOW

FPGA

TOOLS

WHAT IS FFT???

DEFINITION

ALGORITHMS

TWIDDLE FACTORS

Vhdl design flow

VHDLSource

Directives

LogicOptimization

TechnologyMapping

TechnologyImplementation

Syn

the

sis

Pla

ce &

Rou

te

Attributes

Timing

Timing, Pin,Placement

FFT radix-2 decomposition

0 1110987654321 1512 1413

0 1110987654321 1512 1413

Bit reversal

Block diagram

Waveform Selection PC

Sine wave

AM (DSB-SC)

Voice

Noise

Test Vector FPGA

Input vectorx[n]

Bit reversal order(Decimation-in-Time)

Computation Logic(complex Multiplication Accumulation)

X[k]Magnitude

Twiddle factors W

MUX SEL

UARTTransmitter

Multiplexer

Vhdl code modulesTOP 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

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

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

Any queries???

Thanking you