NDLI: Node Mergers in the Presence of Don't Cares

Content Provider	IEEE Xplore Digital Library
Author	Plaza, S.M. Kai-hui Chang Markov, I.L. Bertacco, V.
Copyright Year	2007
Description	Author affiliation: Dept. of EECS, Michigan Univ., Ann Arbor, MI (Plaza, S.M.; Kai-hui Chang; Markov, I.L.; Bertacco, V.)
Abstract	SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This provides significant advantages in synthesis by reducing circuit size and provides additional flexibility in technology mapping, which could be crucial in post-synthesis optimizations. Furthermore, it is also critical in verification because it can reduce the complexity of the netlist to be analyzed in equivalence checking. Most algorithms available so far for this goal do not exploit observability don't cares (ODCs) for node merging since nodes equivalent up to ODCs do not form an equivalence relation. Although a few recently proposed solutions can exploit ODCs by overcoming this limitation, they constrain their analysis to just a few levels of surrounding logic to avoid prohibitive runtime. We develop an ODC-based node merging algorithm that performs efficient global ODC analysis (considering the entire netlist) through simulation and SAT. Our contributions which enable global ODC-based optimizations are: (1) a fast ODC-aware simulator and (2) an incremental verification strategy that limits computational complexity. In addition, our technique operates on arbitrarily mapped netlists, allowing for powerful post-synthesis optimizations. We show that global ODC analysis discovers on average 25% more (and up to 60%) node-merging opportunities than current state-of-the-art solutions based on local ODC analysis.
Starting Page	414
Ending Page	419
File Size	338261
Page Count	6
File Format	PDF
ISBN	1424406293
DOI	10.1109/ASPDAC.2007.358021
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-01-23
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Corporate acquisitions Merging Computational modeling Circuit synthesis Flexible printed circuits Observability Logic Runtime Performance analysis Algorithm design and analysis
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Fast detection of node mergers using logic implications

Fast Node Merging With Don't Cares Using Logic Implications

Node addition and removal in the presence of don't cares

Node addition and removal in the presence of don't cares

SAT sweeping with local observability don't-cares

Observability relations and observability don't cares

Polarized observability don't cares

Synthesis and verification of cyclic combinational circuits

Node mergers in the presence of don't cares

Node Mergers in the Presence of Don't Cares

Similar Documents

Fast detection of node mergers using logic implications

Fast Node Merging With Don't Cares Using Logic Implications

Node addition and removal in the presence of don't cares

Node addition and removal in the presence of don't cares

SAT sweeping with local observability don't-cares

Observability relations and observability don't cares

Polarized observability don't cares

Synthesis and verification of cyclic combinational circuits

Node mergers in the presence of don't cares

Node Mergers in the Presence of Don't Cares