Combined spectral techniques for Boolean matching

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Combined spectral techniques for Boolean matching

Full text

Pdf (244 KB)

Source

International Symposium on Field Programmable Gate Arrays archive
Proceedings of the 1996 ACM fourth international symposium on Field-programmable gate arrays table of contents

Monterey, California, United States

Pages: 38 - 43

Year of Publication: 1996

ISBN:0-89791-773-1

Authors

E. Schubert	Universität Tübingen, WSI-TI, Sand 13, 72076 Tübingen, Germany
W. Rosenstiel	Universität Tübingen, WSI-TI, Sand 13, 72076 Tübingen, Germany

Sponsor

SIGDA: ACM Special Interest Group on Design Automation

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 6, Citation Count: 2

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/228370.228376 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	Randal E. Bryant, Graph-based algorithms for Boolean function manipulation, IEEE Transactions on Computers, v.35 n.8, p.677-691, Aug. 1986 [doi>10.1109/TC.1986.1676819]
	2	D.H. Green. Dual Forms of Reed-Muller expansions. IEE Proceedings, 141(3), May 1994.
	3	U. Kebschull. Verhaltensbasierte und spektrale Legiksynthese mehrstufiger Schaltnetze unter Verwendung yen Biniirbiiumen, volume Reihe 10 Nr. 335 of Infermatik/Kemmunikatienstechnik. Fortschr.-ber. VDE, 1995.
	4	U. Kebschull and W. Rosenstiel. Efficient Graph-Based Computation and Manipulation of Functional Decision Diagrams . In Prec. EDAC 93, 1993.
	5	U. Kebschull, E. Schubert, and W. Rosenstiel. Multilevel Logic Synthesis Based on Functional Decision Diagrams. In Prec. EDA C, 1992.
	6	Yung-Te Lai , Sarma Sastry , Massoud Pedram, Boolean Matching Using Binary Decision Diagrams with Applications to Logic Synthesis and Verification, Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors, p.452-458, October 11-14, 1992
	7	Frédéric Mailhot , Giovanni De Micheli, Technology mapping using boolean matching and don't care sets, Proceedings of the conference on European design automation, March 12-15, 1990, Glasgow, Scotland
	8	J. Mohnke and S. Malik. Permutation and Phase Independent Boolean Matching. In Prec. EDAC, EURO ASIC 93, Feb. 1993.
	9	U. Schlichtmann , F. Brglez , M. Hermann, Characterization of Boolean functions for rapid matching in FPGA technology mapping, Proceedings of the 29th ACM/IEEE conference on Design automation, p.374-379, June 08-12, 1992, Anaheim, California, United States
	10	E. Schubert, U. Kebschull, and W. Rosenstiel. Some Optimizations for Functional Decision Diagrams. In U. Kebschull, E. Schubert, and W. Rosenstiel, editors, IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, Internal Report WSI-93-2, Universitiit Tiibingen, 1993.
	11	Chien-Chung Tsai , Malgorzata Marek-Sadowska, Boolean matching using generalized Reed-Muller forms, Proceedings of the 31st annual conference on Design automation, p.339-344, June 06-10, 1994, San Diego, California, United States [doi>10.1145/196244.196404]

CITED BY 2

	J. Bullmann , W. Rosenstiel , E. Schubert , U. Kebschull, Library based technology mapping using multiple domain representations, Proceedings of the conference on European design automation, p.146-150, September 1996, Geneva, Switzerland
	Debatosh Debnath , Tsutomu Sasao, Efficient computation of canonical form for Boolean matching in large libraries, Proceedings of the 2004 conference on Asia South Pacific design automation: electronic design and solution fair, p.591-596, January 27-30, 2004, Yokohama, Japan