## Optimal wire and transistor sizing for circuits with non-tree topology (1997)

### Cached

### Download Links

- [www.stanford.edu]
- [stanford.edu]
- [www.stanford.edu]
- [www.sigda.org]
- DBLP

### Other Repositories/Bibliography

Venue: | in Proc. Int. Conf. on Computer Aided Design |

Citations: | 28 - 11 self |

### BibTeX

@INPROCEEDINGS{Vandenberghe97optimalwire,

author = {Lieven Vandenberghe},

title = {Optimal wire and transistor sizing for circuits with non-tree topology},

booktitle = {in Proc. Int. Conf. on Computer Aided Design},

year = {1997},

pages = {252--259}

}

### Years of Citing Articles

### OpenURL

### Abstract

Conventional methods for optimal sizing of wires and transistors use linear RC circuit models and the Elmore delay as a measure of signal delay. If the RC circuit has a tree topology the sizing problem reduces to a convex optimization problem which can be solved using geometric programming. The tree topology restriction precludes the use of these methods in several sizing problems of signi cant importance to highperformance deep submicron design including, for example, circuits with loops of resistors, e.g., clock distribution meshes, and circuits with coupling capacitors, e.g., buses with crosstalk between the lines. The paper proposes a new optimization method which can be used to address these problems. The method uses the dominant time constant as a measure of signal propagation delay inanRC circuit, instead of Elmore delay. Using this measure, sizing of any RC circuit can be cast as a convex optimization problem which can be solved using the recently developed e cient interior-point methods for semide nite programming. The method is applied to two important sizing problems | sizing of clock meshes, and sizing of buses in the presence of crosstalk. 1