No self-introduction
Loading
Profile
Follow
codes (1)
32 point inverse fast fourier transform
no vote
We have used three state machines for theentire 32 point inverse fast fourier transform. One state machine is for collectingthe inputs and giving them to the butterfly module. Second state machine is for collecting theoutput values from the butterfly structure and storing in memory. Third state machine is for giving the finalanswers to the output ports by using a pushout signal. The design passes the RTL level simulations,design is synthezised with 4ns clock period and also passes the gate levelsimulations without any timing violations.
harikarenduchintala 0 0
1
No more~
Follows0
Fans0