DocumentCode :
1768246
Title :
Enhancing the Unified Logical Effort algorithm for branching and load distribution
Author :
Sarwar, Mehedi ; Stine, James E.
Author_Institution :
VLSI Comput. Archit. Res. Group, Oklahoma State Univ., Stillwater, OK, USA
fYear :
2014
fDate :
1-5 June 2014
Firstpage :
173
Lastpage :
176
Abstract :
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.
Keywords :
delay estimation; load distribution; logic circuits; ULE methodology; arbitrary loading; branching effort; capacitance distribution; complex circuit tree; delay estimation; equal propagation delay; load distribution; logic path; multiple fan-out logic path; precision index; transistor sizing; unified logical effort algorithm enhancement; wire segments; Capacitance; Delays; Indexes; Integrated circuit interconnections; Logic gates; Runtime; Wires;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems (ISCAS), 2014 IEEE International Symposium on
Conference_Location :
Melbourne VIC
Print_ISBN :
978-1-4799-3431-7
Type :
conf
DOI :
10.1109/ISCAS.2014.6865093
Filename :
6865093
Link To Document :
بازگشت