✦ LIBER ✦

A fast transistor-chaining algorithm for CMOS cell layout

✍ Scribed by Hwang, C.-Y.; Hsieh, Y.-C.; Lin, Y.-L.; Hsu, Y.-C.

Book ID: 111968072
Publisher: IEEE
Year: 1990
Tongue: English
Weight: 607 KB
Volume: 9
Category: Article
ISSN: 0278-0070
DOI: 10.1109/43.55207

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear algorithms for optimizing the lay

Linear algorithms for optimizing the layout of dynamic CMOS cells

✍ Lengauer, T.; Muller, R. 📂 Article 📅 1988 🏛 IEEE ⚖ 745 KB

A deterministic algorithm for automatic

A deterministic algorithm for automatic CMOS transistor sizing

✍ Richman, B.A.; Hansen, J.E.; Cameron, K. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 453 KB

A new hierarchical algorithm for transis

A new hierarchical algorithm for transistor placement in CMOS macro cell design

✍ Toshiyuki Sadakane; Hiroomi Nakao; Masayuki Terai; Kaoru Okazaki; Isao Ohkura 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 494 KB 👁 1 views

We have proposed a new algorithm of transistor placement in the layout generation of CMOS macro cell design. In this algorithm, logic gates are extracted from the given net list at the transistor level and hierarchical placement is performed using it as a unit. First, for each logic gate, several ca

A transistor-island growing algorithm in

A transistor-island growing algorithm in a CMOS cell pattern generation

✍ Yoichi Shiraishi; Jun'Ya Sakemi; Makoto Kutsuwada; Akira Tsukizoe 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 935 KB

A fast algorithm for bottom-up document

A fast algorithm for bottom-up document layout analysis

✍ Simon, A.; Pret, J.-C.; Johnson, A.P. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 79 KB

A variable neighborhood binary particle

A variable neighborhood binary particle swarm algorithm for cell layout problem

✍ Fariborz Jolai; Mohammad Taghipour; Babak Javadi 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 593 KB