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-...

Full description

Saved in:
Bibliographic Details
Published in1988 IEEE International Symposium on Circuits and Systems (ISCAS) pp. 1687 - 1690 vol.2
Main Authors Cho, H.G., Kyung, C.M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 1988
Subjects
Online AccessGet full text

Cover

Loading…