Minimum-Buffered Routing of Non-Critical Nets forSlew Rate and Reliability Control \Lambda (2008)
Charles Alpert, Andrew B. Kahng, Bao Liu, Ion M, Er Zelikovsky
ffl We give linear-time algorithms for optimal buffering of a givenrouting tree with a single (inverting or non-inverting) buffer type. ffl For simultaneous routing and buffering with a single...
A semi-persistent clustering technique for vlsi circuit placement (2005)
Charles Alpert, Andrew Kahng, Gi-joon Nam, Sherief Reda, Paul Villarrubia
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial...
Simultaneous Driver Sizing and Buffer Insertion Using a Delay Penalty Estimation Technique (2004)
Charles Alpert, Chris Chu, Gopal G, Milos Hrkic, Jiang Hu, Ramouli Kashyap, ...
To achieve timing closure in a placed design, buffer insertion and driver sizing are two of the most effective transforms that can be applied. Since the driver sizing solution and the buffer...
Minimum-buffered routing of non-critical nets for slew rate and reliability control (2001)
Charles Alpert, Andrew B. Kahng, Bao Liu, Ion Măndoiu, Er Zelikovsky
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal transition edges, and...
Wire Segmenting for Improved Buffer Insertion (1997)
Charles Alpert, Anirudh Devgan
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions proposed by [7] [8] [9]...
Spectral Partitioning: The More Eigenvectors, The Better (1994)
A spectral partitioning method uses the eigenvectors of a graph's adjacency or Laplacian matrix to construct a geometric representation (e.g., a linear ordering) which is then heuristically...