| Multi-level logic simplification using don't cares and filters |
| Full text |
Pdf
(717 KB)
|
| Source
|
Annual ACM IEEE Design Automation Conference
archive
Proceedings of the 26th ACM/IEEE Design Automation Conference
table of contents
Las Vegas, Nevada, United States
Pages: 277 - 282
Year of Publication: 1989
ISBN:0-89791-310-8
|
|
Authors
|
|
A. Saldanha
|
EECS Department, University of California, Berkeley, Berkeley, CA
|
|
A. R. Wang
|
EECS Department, University of California, Berkeley, Berkeley, CA
|
|
R. K. Brayton
|
EECS Department, University of California, Berkeley, Berkeley, CA
|
|
A. L. Sangiovanni-Vincentelli
|
EECS Department, University of California, Berkeley, Berkeley, CA
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 9, Downloads (12 Months): 19, Citation Count: 11
|
|
|
ABSTRACT
Simplication of a multi-level network is used to perform transformations on parts of the network to obtain an alternate structure that is optimal with respect to area. A technique for obtaining such an optimal structure involves the use of two-level logic minimization on the components of the multi-level logic network. At each component, the structure of the network is captured by intermediate and fan-out don't care sets, which are utilized in the two-level minimization. However, the generation of all the don't cares yield very large sets for most networks and consequently the complete minimization of the components of the circuits require a very large amount of computer time.
In this paper we describe algorithms to reduce the size of the don't care sets, so that only the portions that will be useful in minimization at each component of the circuit are retained. We develop both an exact filter and a heuristic filter that prove to be very effective for a large set of benchmark examples. Results show that our technique achieves the same quality as that obtained by doing complete minimizations at each component of the circuits but in much shorter time. This new approach to simplification of multi-level networks has been incorporated into the MIS (version 2.1) logic synthesis system.
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
|
K. Bartlett, R. Brayton, G. Hachtel, R. Jacoby, C. Morrison, R. Kudell, A. Sangiovanni-Vincentelli, and A. Wang. Multi-level logic minimization using implicit don't cares. IEEE Transaclions on Computer-aided design, 7(6):723-740, June 1988.
|
| |
2
|
|
| |
3
|
Ft. Brayton, R. Rudell, A. Sangiovanni-VincentelIi, and A.R. Wang. MIS: A multiple-level logic optimization system. IEEE Transactions on Compuler-aided design, CAD-6(6)'1062-1081, November 1987.
|
| |
4
|
A. Malik, R. Brayton, A. Newton, and A. Sangiovanni-Vincentelli. A modified approach to two-level minimization. In The Proceedings of the International Conference on Computer-Aided Design, I988.
|
CITED BY 12
|
|
R. A. Bergamaschi , D. Brand , L. Stok , M. Berkelaar , S. Prakash, Efficient use of large don't cares in high-level and logic synthesis, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.272-278, November 05-09, 1995, San Jose, California, United States
|
|
|
|
|
|
Hitomi Sato , Yoshihiro Yasue , Yusuke Matsunaga , Masahiro Fujita, Boolean resubstitution with permissible functions and binary decision diagrams, Proceedings of the 27th ACM/IEEE conference on Design automation, p.284-289, June 24-27, 1990, Orlando, Florida, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Rajeev Murgai , Robert K. Brayton , Alberto Sangiovanni-Vincentelli, Optimum functional decomposition using encoding, Proceedings of the 31st annual conference on Design automation, p.408-414, June 06-10, 1994, San Diego, California, United States
|
|
|
Qi Zhu , Nathan Kitchen , Andreas Kuehlmann , Alberto Sangiovanni-Vincentelli, SAT sweeping with local observability don't-cares, Proceedings of the 43rd annual conference on Design automation, July 24-28, 2006, San Francisco, CA, USA
|
|
|
|
|
|
|
|
|
L. Stok , D. S. Kung , D. Brand , A. D. Drumm , L. N. Reddy , N. Hieter , D. J. Geiger , H. H. Chao , P. J. Osler , A. J. Sullivan, BooleDozer: logic synthesis for ASICs, IBM Journal of Research and Development, v.40 n.4, p.407-430, July 1996
|
|