ACM Home Page
Please provide us with feedback. Feedback
DAG-aware AIG rewriting a fresh look at combinational logic synthesis
Full text PdfPdf (642 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 43rd annual Design Automation Conference table of contents
San Francisco, CA, USA
SESSION: Session 32: logic synthesis I table of contents
Pages: 532 - 535  
Year of Publication: 2006
ISBN:1-59593-381-6
Authors
Alan Mishchenko  University of California, Berkeley, Berkeley, CA
Satrajit Chatterjee  University of California, Berkeley, Berkeley, CA
Robert Brayton  University of California, Berkeley, Berkeley, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 81,   Citation Count: 19
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1146909.1147048
What is a DOI?

ABSTRACT

This paper presents a technique for preprocessing combinational logic before technology mapping. The technique is based on the representation of combinational logic using And-Inverter Graphs (AIGs), a networks of two-input ANDs and inverters. The optimization works by alternating DAG-aware AIG rewriting, which reduces area by sharing common logic without increasing delay, and algebraic AIG balancing, which minimizes delay without increasing area. The new technology-independent flow is implemented in a public-domain tool ABC. Experiments on large industrial benchmarks show that the proposed methodology scales to very large designs and is several orders of magnitude faster than SIS and MVSIS while offering comparable or better quality when measured by the quality of the network after mapping.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Berkeley Logic Synthesis and Verification Group. ABC: A System for Sequential Synthesis and Verification. December 2005 Release. http://www-cad.eecs.berkeley.edu/~alanmi/abc
 
2
 
3
 
4
R. Brayton and C. McMullen, "The decomposition and factorization of Boolean expressions," Proc. ISCAS '82, pp. 29--54.
 
5
R. Brayton, G. Hachtel, A. Sangiovanni-Vincentelli, "Multilevel logic synthesis", Proc. IEEE, Vol. 78, Feb.1990.
 
6
 
7
J. Cong and Y. Ding, "FlowMap: An optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs", IEEE Trans. CAD, vol. 13(1), January 1994, pp. 1--12.
 
8
J. Cortadella, "Timing-driven logic bi-decomposition", IEEE TCAD, vol. 22(6), June 2003, pp. 675--685.
 
9
IWLS 2005 Benchmarks. http://iwls.org/iwls2005/benchmarks.html
10
 
11
 
12
A. Mishchenko and R. Brayton, "Scalable logic synthesis using a simple circuit structure", Proc. IWLS '06. http://www.eecs. berkeley.edu/~alanmi/publications/2006/iwls06_sls.pdf.
 
13
A. Mishchenko, S. Chatterjee, R. Brayton, and N. Eén, "Improvements to combinational equivalence checking", IWLS '06. http://www.eecs.berkeley.edu/~alanmi/publications/2006/iwls06 _cec.pdf
14
 
15
 
16
MVSIS Group. MVSIS: Multi-Valued Logic Synthesis System. UC Berkeley. http://www?cad.eecs.berkeley.edu/mvsis/
17
 
18
E. Sentovich et al. "SIS: A system for sequential circuit synthesis". Technical Report, UCB/ERI, M92/41, ERL, Dept. of EECS, UC Berkeley, 1992.
 
19
S. Yang. Logic synthesis and optimization benchmarks. Version 3.0. Tech. Report. Microelectronics Center of North Carolina, 1991.

CITED BY  19
 
 
 
 
 
 

Collaborative Colleagues:
Alan Mishchenko: colleagues
Satrajit Chatterjee: colleagues
Robert Brayton: colleagues