An O(n)-time standard cell placement algorithm using constrained multi-stage graph model
The authors present an O(n)-time algorithm for standard cell placement on the constrained multistage graph (CMSG) model. The first step of this algorithm performs the row assignment of each cell by converting the circuit connectivity into the CMSG, where each stage of the CMSG corresponds to a cell-...
Saved in:
Published in | 1988 IEEE International Symposium on Circuits and Systems (ISCAS) pp. 1687 - 1690 vol.2 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
1988
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!