Abstract
Rewriting is a widely used logic optimization approach incorporated in most commercial logic synthesis tools. In this paper, we present a new rewriting method based on AndInverted Graph (AIG). Rather than focusing on cut rewriting, it considers a novel sub-structure called Maximum Fanout-Free Window (MFFW) and rewrites with a more compact implementation. Both exact synthesis and heuristic methods can be adopted to optimize MFFWs. A database dependent framework is proposed to store the optimal sub-structures to accelerate the processing. We further propose the semi-canonicalization to reduce the scale of the database, which could reduce more than 98% of the 4-input MFFW database. Extensive experiments on benchmark datasets demonstrate both the effectiveness and efficiency of our proposed framework.
Original language | English |
---|---|
Title of host publication | 60th ACM/IEEE Design Automation Conference - Proceedings 2023 |
Publisher | IEEE |
Pages | 1-6 |
Number of pages | 6 |
ISBN (Electronic) | 9798350323481 |
ISBN (Print) | 9798350323498 |
DOIs | |
Publication status | Published - Jul 2023 |
Event | 60th ACM/IEEE Design Automation Conference, DAC 2023 - Moscone West, San Francisco, United States Duration: 9 Jul 2023 → 13 Jul 2023 https://www.dac.com/ https://60dac.conference-program.com/ https://ieeexplore.ieee.org/xpl/conhome/10247654/proceeding |
Publication series
Name | ACM/IEEE Design Automation Conference - Proceedings |
---|---|
Volume | 2023-July |
ISSN (Print) | 0738-100X |
Conference
Conference | 60th ACM/IEEE Design Automation Conference, DAC 2023 |
---|---|
Country/Territory | United States |
City | San Francisco |
Period | 9/07/23 → 13/07/23 |
Internet address |
Scopus Subject Areas
- Electrical and Electronic Engineering
- Control and Systems Engineering
- Computer Science Applications
- Modelling and Simulation