Proceedings Article10.1109/VLSID.2006.11
A linear time algorithm for wire sizing with simultaneous optimization of interconnect delay and crosstalk noise
N. Hanchate,Nagarajan Ranganathan +1 more
- 03 Jan 2006
- pp 283-290
TL;DR: A mathematical proof of existence for Nash equilibrium solution for the proposed wire sizing formulation is provided and the algorithm performs significantly better than simulated annealing and genetic search as established through experimental results.
read more
Abstract: In this paper, we propose a new methodology for wire sizing with simultaneous optimization of interconnect delay and crosstalk noise in deep submicron VLSI circuits The wire sizing problem is modeled as an optimization problem formulated as a normal form game and solved using the Nash equilibrium Game theory allows the optimization of multiple metrics with conflicting objectives This property is exploited in modeling the wire sizing problem while simultaneously optimizing interconnect delay and crosstalk noise, which are conflicting in nature The nets connecting the driving cell and the driven cell are divided into net segments The net segments within a channel are modeled as players, the range of possible wire sizes forms the set of strategies and the payoff function is derived as the geometric mean of interconnect delay and crosstalk noise The net segments are optimized from the ones closest to the driven cell towards the ones at the driving cell The complete information about the coupling effects among the nets is extracted after the detailed routing phase The resulting algorithm for wire sizing is linear in terms of the number of wire segments in the given circuit Experimental results on several medium and large open core designs indicate that the proposed algorithm yields an average reduction of 2148% in interconnect delay and 2625% in crosstalk noise over and above the optimization from the Cadence place and route tools without any area overhead The algorithm performs significantly better than simulated annealing and genetic search as established through experimental results A mathematical proof of existence for Nash equilibrium solution for the proposed wire sizing formulation is provided
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
Patent
Generation of engineering change order (ECO) constraints for use in selecting ECO repair techniques
Nahmsuk Oh,Peivand Fallah-Tehrani,Alireza Kasnavi +2 more
- 22 Sep 2006
TL;DR: In this paper, the effect of engineering change order (ECO) to correct the violation are automatically analyzed, based on the layout, the parasitics, the timing and/or noise behavior, and the violation.
98
Simultaneous Shield and Buffer Insertion for Crosstalk Noise Reduction in Global Routing
TL;DR: This work presents a method for incorporating crosstalk reduction criteria into global routing under an innovative power supply architecture, while considering the constraints imposed by limited routing and buffering resources.
Simultaneous shield and buffer insertion for crosstalk noise reduction in global routing
Tianpei Zhang,Sachin S. Sapatnekar +1 more
- 11 Oct 2004
TL;DR: This paper presents a method for incorporating crosstalk reduction criteria into global routing under a broad power supply network paradigm and achieves noise reduction improvements of up to 53% and 28%, respectively, compared to methods considering only buffer insertion or only shield insertion after buffer planning.
Patent
Determining a design attribute by estimation and by calibration of estimated value
Nahmsuk Oh,Peivand Fallah-Tehrani,Alireza Kasnavi,Subramanyam Sripada +3 more
- 17 Jan 2011
TL;DR: In this paper, a computer-implemented method of determining an attribute of a circuit includes using a computationally expensive technique to simulate the attribute (such as timing delay or slew) of a portion of the circuit, at predetermined values of various parameters (eg nominal values of channel length or metal width), to obtain at least a first value of the attribute.
19
Simultaneous Scheduling, Allocation, Binding, Re-Ordering, and Encoding for Crosstalk Pattern Minimization During High–Level Synthesis
TL;DR: This work proposes a simulated annealing (SA)-based high-level synthesis algorithm for crosstalk activity minimization for a given data environment and targets bus-based architectures as the bus-lines have well-defined neighborhood (aggressors).
12
References
Equilibrium points in n-person games
TL;DR: A concept of an n -person game in which each player has a finite set of pure strategies and in which a definite set of payments to the n players corresponds to each n -tuple ofpure strategies, one strategy being taken for each player.
Algorithms, games, and the internet
Christos H. Papadimitriou
- 06 Jul 2001
TL;DR: If the Internet is the next great subject for Theoretical Computer Science to model and illuminate mathematically, then Game Theory, and Mathematical Economics more generally, are likely to prove useful tools.
On the complexity of the parity argument and other inefficient proofs of existence
Christos H. Papadimitriou
- 01 Jun 1994
TL;DR: Several new complexity classes of search problems, ''between'' the classes FP and FNP, are defined, based on lemmata such as ''every graph has an even number of odd-degree nodes.''