Folded Combinational Circuits as an example of Sequential Circuits ...
Folded Combinational Circuits as an example of Sequential Circuits ...
Folded Combinational Circuits as an example of Sequential Circuits ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Circuit <strong>an</strong>alysis<br />
Number <strong>of</strong> add32 circuits h<strong>as</strong> been reduced<br />
from 31 to one, though some registers <strong>an</strong>d<br />
muxes have been added<br />
The longest combinational path h<strong>as</strong> been<br />
reduced from 31 serial add32’s to one add32<br />
plus a few muxes<br />
The sequential circuit will take 31 clock cycles<br />
to compute <strong>an</strong> <strong>an</strong>swer<br />
February 19, 2013 http://csg.csail.mit.edu/6.375 L04-19<br />
in0<br />
in1<br />
in2<br />
in3<br />
in4<br />
…<br />
in63<br />
<strong>Combinational</strong> IFFT<br />
Bfly4<br />
Bfly4<br />
x16<br />
Bfly4<br />
Permute<br />
Bfly4<br />
Bfly4<br />
…<br />
Bfly4<br />
Bfly4<br />
Bfly4<br />
…<br />
Bfly4<br />
Reuse the same circuit three times<br />
to reduce area<br />
Permute<br />
Permute<br />
out0<br />
out1<br />
out2<br />
out3<br />
out4<br />
…<br />
out63<br />
February 19, 2013 http://csg.csail.mit.edu/6.375 L04-20<br />
10
Change language