Espresso-signature

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback
Take a look at the new version of this page: [ beta version ]. Tell us what you think.

Espresso-signature: a new exact minimizer for logic functions

Full text

Pdf (730 KB)

Source

Annual ACM IEEE Design Automation Conference archive
Proceedings of the 30th international Design Automation Conference table of contents

Dallas, Texas, United States

Pages: 618 - 624

Year of Publication: 1993

ISBN:0-89791-577-1

Authors

Patrick McGeer
Jagesh Sanghavi
Robert Brayton
Alberto Sangiovanni Vincentelli

Sponsors

EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 26, Citation Count: 9

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/157485.165069 What is a DOI?

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	Robert King Brayton , Alberto L. Sangiovanni-Vincentelli , Curtis T. McMullen , Gary D. Hachtel, Logic Minimization Algorithms for VLSI Synthesis, Kluwer Academic Publishers, Norwell, MA, 1984
	2	O. Coudert and J.-C. Madre. A new implicit graph-based prime and essential prime computation technique. In T. Sasao, editor, New Trends in Logic Synthesis and Optimization. Kluwer Academic Publishers, 1992.
	3	E. J. McCluskey. Minimization of boolean functions. Bell System Technical Journal, 1956.
	4	P. McGeer, J. Sanghavi, R. Brayton, and A. Sangiovanni-Vincentelli. A new exact minimizer for two-level logic synthesis. In T. Sasao, editor, New Trends in Logic Synthesis and Optimization. Kluwer Academic Publishers, 1992.
	5	L. B. Nguyen , M. A. Perkowdki , N. B. Goldstein, PALMINI—fast Boolean minimizer for personal computers, Proceedings of the 24th ACM/IEEE conference on Design automation, p.615-621, June 28-July 01, 1987, Miami Beach, Florida, United States [doi>10.1145/37888.37985]
	6	W. Quine. The problem of simplifying truth functions. American Mathematical Monthly, 1952.
	7	Richard L. Rudell , Alberto Sangiovanni-Vincentelli, Logic synthesis for vlsi design, 1989
	8	R. L. Rudell and A. L. Sangiovanni-Vincentelli. Multiple-valued minimization for PLA optimization. IEEE Transactions on Computer-Aided Design, September 1987.

CITED BY 9

	C.-J. Shi , J. A. Brzozowski, Cluster-cover: a theoretical framework for a class of VLSI-CAD optimization problems, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.3 n.1, p.76-107, Jan. 1998
	Jan Hlavička , Petr Fišer, BOOM: a heuristic boolean minimizer, Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, November 04-08, 2001, San Jose, California
	Rajeev Murgai , Robert K. Brayton , Alberto Sangiovanni-Vincentelli, Cube-packing and two-level minimization, Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design, p.115-122, November 07-11, 1993, Santa Clara, California, United States
	Alan Mishchenko , Tsutomu Sasao, Large-scale SOP minimization using decomposition and functional properties, Proceedings of the 40th conference on Design automation, June 02-06, 2003, Anaheim, CA, USA
	Xiao Yu Li , Matthias F. Stallmann , Franc Brglez, Effective bounding techniques for solving unate and binate covering problems, Proceedings of the 42nd annual conference on Design automation, June 13-17, 2005, San Diego, California, USA
	S. L. Kryvyj , A. N. Chebotarev, Checking the satisfiability of formulas represented in disjunctive normal form in the language L. II, Cybernetics and Systems Analysis, v.41 n.6, p.800-807, November 2005
	S. Minato, Implicit manipulation of polynomials using zero-suppressed BDDs, Proceedings of the 1995 European conference on Design and Test, p.449, March 06-09, 1995
	Maik Friedel , Swetlana Nikolajewa , Thomas Wilhelm, The decomposition tree for analyses of boolean functions, Mathematical Structures in Computer Science, v.18 n.2, p.411-426, April 2008
	Jörg Hoffmann , Piergiorgio Bertoli , Malte Helmert , Marco Pistore, Message-based web service composition, integrity constraints, and planning under uncertainty: a new connection, Journal of Artificial Intelligence Research, v.35 n.1, p.49-117, May 2009