Enhancing the Unified Logical Effort algorithm for branching and load distribution

In this paper, the authors proposed a novel technique to calculate the capacitance distribution and branching effort of a multiple fan-out logic path for equal propagation delay in each path regardless of number of gates and lengths of the wire segments in those logic path. The authors utilize the prior methods for the Unified Logical Effort (ULE) methodology as the basis of delay estimation and transistor sizing for the work of this paper. The runtime for fan-out of 2 is logarithmic in n or O(log2(n)), where n is the precision index. Several examples are also analyzed and detailed using the proposed algorithm showing how the branching effort can easily be calculated in the presence of a complex circuit tree with arbitrary loading.

[1]  Ivan E. Sutherland,et al.  Logical effort: designing for speed on the back of an envelope , 1991 .

[2]  W. C. Elmore The Transient Response of Damped Linear Networks with Particular Regard to Wideband Amplifiers , 1948 .

[3]  John P. Hayes,et al.  Unveiling the ISCAS-85 Benchmarks: A Case Study in Reverse Engineering , 1999, IEEE Des. Test Comput..

[4]  Terence Parr,et al.  The Definitive ANTLR 4 Reference , 2013 .

[5]  Sachin S. Sapatnekar,et al.  Technology Mapping Using Logical Effort for Solving the Load-Distribution Problem , 2008, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  R. Mangaser,et al.  BEOL yield predictions for SIA roadmap , 1997, 1997 IEEE/SEMI Advanced Semiconductor Manufacturing Conference and Workshop ASMC 97 Proceedings.

[7]  Ran Ginosar,et al.  Unified Logical Effort—A Method for Delay Evaluation and Minimization in Logic Paths With $RC$ Interconnect , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Sachin S. Sapatnekar,et al.  Logical effort based technology mapping , 2004, ICCAD 2004.