Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published May 17, 2004 | public
Report Open

Timing Analysis of Cyclic Combinatorial Circuits

Abstract

The accepted wisdom is that combinational circuits must have acyclic (i.e., loop-free or feed-forward) topologies. And yet simple examples suggest that this need not be so. In previous work, we advocated the design of cyclic combinational circuits (i.e., circuits with loops or feedback paths). We proposed a methodology for analyzing and synthesizing such circuits, with an emphasis on the optimization of area. In this paper, we extend our methodology into the temporal realm. We characterize the true delay of cyclic circuits through symbolic event propagation in the floating mode of operation, according to the up-bounded inertial delay model. We present analysis results for circuits optimized with our program CYCLIFY. Some benchmark circuits were optimized significantly, with simultaneous improvements of up to 10% in the area and 25% in the delay.

Files

etr060.pdf
Files (2.7 MB)
Name Size Download all
md5:62fb6ae7320af3dc0064d2daf289b6da
294.9 kB Preview Download
md5:b6a8dfd5babc20533e619e6d01e14fc7
2.4 MB Download
md5:c5014dd1d56075f1f0648b4172b1afe2
1.2 kB Preview Download
md5:e646c22973e852c66df304fa81c85dd3
2.7 kB Download
md5:3a95bb0bc24fcb1144adc0e8f874c3a7
1.1 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023