Timing driven gate duplication
TL;DR: This paper addresses the problem of delay optimization by gate duplication by presenting an algorithm that traverses the network from primary outputs to primary inputs in topologically sorted order evaluating tuples at the input pins of gates.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A fully redundant decimal adder and its application in parallel decimal multipliers
Saeid Gorgin,Ghassem Jaberipur +1 more
TL;DR: A novel method for carry-free addition of decimal numbers, where each equally weighted decimal digit pair of the two operands is partitioned into two weighted bit-sets, which has lead to a VLSI-friendly recursive partial product reduction tree.
38
User Guided High Level Synthesis
Ivan Augé,Frédéric Pétrot +1 more
- 01 Jan 2008
TL;DR: The notion of Draft Data-Path Scheme (DDPS) is introduced which is considered an efficient way for the user to guide the HLS process and describes the general structure of the data-path, without detailed information like signal-widths or physical implementation of multiplexers.
Algorithms for simultaneous consideration of multiple physical synthesis transforms for timing closure
Huan Ren,Shantanu Dutt +1 more
- 10 Nov 2008
TL;DR: A post-placement physical synthesis algorithm that can apply multiple circuit synthesis and placement transforms on a placed circuit to improve the critical path delay under area constraints by simultaneously considering the benefits and costs of all transforms (as opposed to considering them sequentially after applying each transform).
Reliability-Driven Gate Replication for Nanometer-Scale Digital Logic
TL;DR: This paper discusses gate replication architecture towards increasing the reliability of individual logic gates, and provides more interpretation and extends it to the situation where N is an even integer by using threshold logic gate instead of majority voter.
10
Techniques for improved placement-coupled logic replication
Hosung (Leo) Kim,John Lillis,Miloš Hrkić +2 more
- 30 Apr 2006
TL;DR: This paper proposes techniques for fanout partitioning and cell relocation which are cognizant of both wirelength and timing impact for improved solution quality and reports the effect of other techniques including new replication cost computation, lower-bounding of achievable clock period, and wirelength estimation.
8
References
•Journal Article
SIS : A System for Sequential Circuit Synthesis
TL;DR: This paper provides an overview of SIS and contains descriptions of the input specification, STG (state transition graph) manipulation, new logic optimization and verification algorithms, ASTG (asynchronous signal transition graph] manipulation, and synthesis for PGA’s (programmable gate arrays).
Buffer placement in distributed RC-tree networks for minimal Elmore delay
L.P.P.P. van Ginneken
- 01 May 1990
TL;DR: An algorithm is presented for choosing the buffer positions for a wiring tree such that the Elmore delay is minimal, and an extension of the basic algorithm allows minimization of the number of buffers as a secondary objective.
543
Timing optimization of combinational logic
K.J. Singh,Angie Wang,Robert K. Brayton,Alberto Sangiovanni-Vincentelli +3 more
- 07 Nov 1988
TL;DR: An algorithm for speeding up combinational logic with minimal area increase is presented, using a static timing analyzer and a weighted min-cut algorithm to determine the subset of nodes to be resynthesized.
172
LSS: a system for production logic synthesis
TL;DR: The evolution of the Logic Synthesis System is described from an experimental tool to a production system for the synthesis of masterslice chip implementations and the primary reasons for this success are the use of local transformations to simplify logic representations at several levels of abstraction.
155
A cell-replicating approach to minicut-based circuit partitioning
C. Kring,A.R. Newton +1 more
- 11 Nov 1991
TL;DR: An extension to the Fiduccia and Mattheyses minicut algorithm (1982) allows cells to be replicated in both sides of the partition and can substantially reduce the number of cut nets in a partitioned network below what can be obtained without replication.
112
Related Papers (5)
Chun-Hong Chen,Chi-Ying Tsui +1 more
- 18 Jan 1999
David Baneres,Jordi Cortadella,Michael Kishinevsky +2 more
- 16 Apr 2007