In this paper, we study the interconnect layout optimization problem under a higher-order RLC model to optimize not just delay, but also waveform for RLC circuits with non-monotone signal response. We propose a unified approach that considers topology optimization, wire-sizing optimization, and waveform optimization simultaneously. Our algorithm considers a large class of routing topologies, ranging from shortest-path Steiner trees to bounded-radius Steiner trees and Steiner routings. We construct a set of required-arrival-time Steiner trees or RATS-trees, providing a smooth trade-off among signal delay, wave-form, and routing area. Using a new incremental moment computation algorithm, we interleave topology construction with moment compu-t...
To improve the performance of critical nets where both timing and wire resources are stringent, we i...
Abstract | Deep sub-micron e ects, along with increasing interconnect densities, have increased the ...
This thesis proposes a graph-based maze routing and buffer insertion algorithm for nanometer Very La...
In this paper, we study the interconnect layout optimization problem under a higher-order RLC model ...
In this paper, we study the interconnect layout optimization problem under a higher order resistance...
Buffer insertion and wire sizing have been proven effective in solving the timing optimization probl...
This paper presents a sensitivity-based wiresizing algorithm for interconnect delay optimization of ...
In this paper, we study the optimal wiresizing problem under the distributed Elmore delay model. We ...
This paper presents an overview of recent advances on modeling and layout optimization of devices an...
Conventional methods for optimal sizing of wires and transistors use linear RC circuit models and th...
The optimum wire shape to produce the minimum signal propagation delay across an RLC line is shown t...
In this paper, we develop a set of delay estimation models with consideration of various interconnec...
This book covers layout design and layout migration methodologies for optimizing multi-net wire stru...
The advent of the nanotechnology has introduced new challenges and non-conventional problems to high...
In this paper, we study the optimal wiresizing problem for nets with multiple sources under the RC t...
To improve the performance of critical nets where both timing and wire resources are stringent, we i...
Abstract | Deep sub-micron e ects, along with increasing interconnect densities, have increased the ...
This thesis proposes a graph-based maze routing and buffer insertion algorithm for nanometer Very La...
In this paper, we study the interconnect layout optimization problem under a higher-order RLC model ...
In this paper, we study the interconnect layout optimization problem under a higher order resistance...
Buffer insertion and wire sizing have been proven effective in solving the timing optimization probl...
This paper presents a sensitivity-based wiresizing algorithm for interconnect delay optimization of ...
In this paper, we study the optimal wiresizing problem under the distributed Elmore delay model. We ...
This paper presents an overview of recent advances on modeling and layout optimization of devices an...
Conventional methods for optimal sizing of wires and transistors use linear RC circuit models and th...
The optimum wire shape to produce the minimum signal propagation delay across an RLC line is shown t...
In this paper, we develop a set of delay estimation models with consideration of various interconnec...
This book covers layout design and layout migration methodologies for optimizing multi-net wire stru...
The advent of the nanotechnology has introduced new challenges and non-conventional problems to high...
In this paper, we study the optimal wiresizing problem for nets with multiple sources under the RC t...
To improve the performance of critical nets where both timing and wire resources are stringent, we i...
Abstract | Deep sub-micron e ects, along with increasing interconnect densities, have increased the ...
This thesis proposes a graph-based maze routing and buffer insertion algorithm for nanometer Very La...