Technology mapping using Boolean matching and don't care sets
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 212-216
- https://doi.org/10.1109/edac.1990.136647
Abstract
The authors describe a new approach to technology mapping where matchings are recognized by means of Boolean operations. The matching algorithm uses tautology checking based on Shannon decompositions. They show how to use the symmetry and unateness properties to speed-up the Boolean matching algorithm. They examine how don't care information can be used during Boolean matching. The algorithms have been implemented in program Ceres and tested on the 1989 MCNC benchmark circuits.Keywords
This publication has 13 references indexed in Scilit:
- Algorithms for synchronous logic synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Consistency and observability invariance in multi-level logic synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Mapping properties of multi-level logic synthesis operationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- McMAP: a fast technology mapping procedure for multi-level logic synthesisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- MIS: A Multiple-Level Logic Optimization SystemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- DAGON: technology binding and local optimization by DAG matchingPublished by Association for Computing Machinery (ACM) ,1987
- SOCRATES: A System for Automatically Synthesizing and Optimizing Combinational LogicPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- LSS: A system for production logic synthesisIBM Journal of Research and Development, 1984
- Logic Minimization Algorithms for VLSI SynthesisPublished by Springer Nature ,1984
- Detection of Group Invariance or Total Symmetry of a Boolean Function*Bell System Technical Journal, 1956