00000cab a22000003a 4500 UP-99796217609624614 Buklod 20231007234421.0 m |o d | ta 110119s xx d | ||r ||||| || DENGII eng Srivastava, A. Timing driven gate duplication. pp. 42-51 In the past few years, gate duplication has been studied as a strategy for cutset minimization in partitioning problems. This paper addresses the problem of delay optimization by gate duplication. We present an algorithm to solve the gate duplication problem. It traverses the network from primary outputs(PO) to primary inputs(PI) in topologically sorted order evaluating tuples at the input pins of gates. The tuple's first component corresponds to the input pin required time if that gate is not duplicated. The second component corresponds to the input pin required time if that gate were duplicated. After tuple evaluation the algorithm traverses the network from PI to PO in topologically sorted order, deciding the gates to be duplicated. The last and final traversal is again from PO to PI, in which the gates are physically duplicated. Our algorithm uses the dynamic programming structure. We report delay improvements over other optimization methodologies. Gate duplication, along with other optimization strategies, can be used for meeting the stringent delay constraints in today's ultra complex designs. Cutset minimization. Delay constraints. Delay optimization. Dynamic programming structure. Logic gates. Logic synthesis. Partitioning problems. Primary inputs. Primary outputs. Timing driven gate duplication. Topologically sorted order. Tuple evaluation. Ultra complex designs. IEEE Transactions on VLSI systems 12, 1 (2004). FO UPD DENG-II Article