Timing Analysis of Cyclic Combinatorial Circuits

Riedel, M. and Bruck, J (2004) Timing Analysis of Cyclic Combinatorial Circuits. Technical Report. California Institute of Technology, Pasadena. [CaltechPARADISE:2004.ETR060]

Full text available as:

HTML

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.

EPrint Type:	Monograph (Technical Report)
Additional Information:	http://www.paradise.caltech.edu/~riedel/research/iwls04.html
Subjects:	All Records
ID Code:	84
Deposited By:	Jehoshua Bruck
Deposited On:	20 August 2004
Record Number:	CaltechPARADISE:2004.ETR060
Official Persistent URL:	http://resolver.caltech.edu/CaltechPARADISE:2004.ETR060
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format

Archive Staff Only: edit this record