Transistor Placement for Automatic Cell Synthesis Through Boolean Satisfiability

被引：0

作者：

Cardoso, Maicon ^{[1
]}

Bubolz, Andrei ^{[1
]}

Cortadella, Jordi ^{[2
]}

Rosa Jr, Leomar ^{[1
]}

Marques, Felipe ^{[1
]}

机构：

[1] Univ Fed Pelotas, Grad Program Comp, Pelotas, RS, Brazil

[2] Univ Politecn Cataluna, Dept Comp Sci, Barcelona, Spain

来源：

2020 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS) | 2020年

关键词：

transistor placement; transistor chaining; Boolean satisfiability; SAT; ASTRAN; EDA tool; LAYOUT;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This paper presents a new transistor placement method applied to the ASTRAN EDA tool, an open-source solution for the automatic design of complex digital gates. Although it currently reaches an optimized solution through a Threshold Accepting approach, ASTRAN does not guarantee a minimum-width placement. In this paper, a method based on Boolean satisfiability is proposed, ensuring an optimal solution for the transistor placement task through modeling the problem into a set of Boolean variables and clauses aware of four design rule constraints. Experiments comparing the proposed method and the current ASTRAN placement technique have shown reductions in the layout area. Furthermore, our method achieved a significant improvement regarding runtime, an essential feature for designing digital circuits and systems on-demand.

引用

页数：5

共 50 条

[21] Automatic synthesis of composable sequential quantum Boolean circuits
Chang, LK
Cheng, FC
2005 IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN: VLSI IN COMPUTERS & PROCESSORS, PROCEEDINGS, 2005, : 289 - 294
[22] CSyn-fp: Standard Cell Synthesis of Advanced Nodes With Simultaneous Transistor Folding and Placement
Baek, Kyeonghyeon
Kim, Taewhan
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2024, 43 (02) : 627 - 640
[23] A two-dimensional transistor placement algorithm for cell synthesis and its application to standard cells
Saika, S
Fukui, M
Shinomiya, N
Akino, T
Kuninobu, S
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (10) : 1883 - 1891
[24] Nano-meter CMOS circuit cell assignment based on pseudo-boolean satisfiability
Wang, Xian-Jian
Wang, Lun-Yao
Chu, Zhu-Fei
Xia, Yin-Shui
Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology, 2012, 34 (10): : 2508 - 2513
[25] Automatic Synthesis of Boolean Networks from Biological Knowledge and Data
Vaginay, Athenais
Boukhobza, Taha
Smail-Tabbone, Malika
OPTIMIZATION AND LEARNING, OLA 2021, 2021, 1443 : 156 - 170
[26] AUTOMATIC SYNTHESIS OF BOOLEAN EQUATIONS USING PROGRAMMABLE ARRAY LOGIC
GORE, RP
RAMAMOHANARAO, K
26TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, 1989, : 283 - 289
[27] Transistor level micro-placement and routing for two-dimensional digital VLSI cell synthesis
Riepe, Michael A.
Sakallah, Karem A.
Proceedings of the International Symposium on Physical Design, 1999, : 74 - 81
[28] iTPlace: Machine Learning-Based Delay-Aware Transistor Placement for Standard Cell Synthesis
Lee, Tai-Cheng
Yang, Cheng-Yen
Li, Yih-Lang
2020 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER AIDED-DESIGN (ICCAD), 2020,
[29] High speed layout synthesis for minimum-width CMOS logic cells via boolean satisfiability
Iizuka, T
Ikeda, M
Asada, K
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2004, E87A (12) : 3293 - 3300
[30] High speed layout synthesis for minimum-width CMOS logic cells via boolean satisfiability
Iizuka, T
Ikeda, M
Asada, K
ASP-DAC 2004: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, 2004, : 149 - 154

← 1 2 3 4 5 →