The complexity of VLSI power-delay optimization by interconnect resizing
نویسندگان
چکیده
The lithography used for 32 nanometers and smaller VLSI process technologies restricts the interconnect widths and spaces to a very small set of admissible values. Until recently the sizes of interconnects were allowed to change continuously and the implied powerdelay optimal tradeoff could be formulated as a convex programming problem, for which classical search algorithms are applicable. Once the admissible geometries become discrete, continuous search techniques are inappropriate and new combinatorial optimization solutions are in order. A first step towards such solutions is to study the complexity of the problem, which this paper is aiming at. Though dynamic programming has been shown lately to solve the problem, we show that it is NP-complete. Two typical VLSI design scenarios are considered. The first trades off power and sum of delays ( 1 L ), and is shown to be NP-complete by reduction of PARTITION. The second considers power and max delays ( L∞ ), and is shown to be NP-complete by reduction of SUBSET_SUM.
منابع مشابه
Comprehensive Evaluation of Crosstalk and Delay Profiles in VLSI Interconnect Structures with Partially Coupled Lines
In this paper, we present a methodology to explore and evaluate the crosstalk noise and the profile of its variations, and the delay of interconnects through investigation of two groups of interconnect structures in nano scale VLSI circuits. The interconnect structures in the first group are considered to be partially coupled identical lines. In this case, by choosing proper values for differen...
متن کاملComplexity Of Minimum-Delay Gate Resizing
Gate resizing for minimum circuit delay is a fundamental problem in the performance optimization of gate-level circuits. In this paper , we study the complexity of two diierent minimum-delay gate resizing problems for combinational circuits composed of single-output gates. The rst problem is that of gate resizing for minimum circuit delay under the load-dependent delay model. The second problem...
متن کاملAn optimized buffer insertion algorithm with delay-power constraints for VLSI layouts
We propose a grid-graph algorithm for interconnect routing and buffer insertion in nanometer VLSI layout designs. The algorithm is designed to handle multiconstraint optimizations, namely timing performance and power dissipation. The proposed algorithm is called HRTB-LA, which stands for hybrid routing tree and buffer insertion with look-ahead. In recent VLSI designs, interconnect delay has bec...
متن کاملPerformance Optimization of Nonlinear VLSI Interconnect Circuit using Schmitt Trigger
Chip Interconnect delay and power is a primary criterion in the design of an Integrated Circuit because of its close connection to the speed of IC. Interconnect Buffers in VLSI circuits is the most widespread procedure used to decrease power and delay but they outcome in high Delay and power dissipation, thereby degrading the performance (i.e.) operating speed of an integrated circuit. Use of b...
متن کاملTiming-constrained power minimization in VLSI circuits by simultaneous multilayer wire spacing
Reduction of interconnect delay and interconnect power has become a primary design challenge in recent CMOS technology generations. Spacing between wires can be modified so that line-to-line capacitances will be optimized for minimal power under timing constraints. In this paper, we present a novel algorithm for simultaneous multilayer interconnect spacing that minimizes the total dynamic power...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Optim.
دوره 23 شماره
صفحات -
تاریخ انتشار 2012