Boolean matching using generalized Reed-Muller forms

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Boolean matching using generalized Reed-Muller forms

Full text

Pdf (64 KB)

Source

Annual ACM IEEE Design Automation Conference archive
Proceedings of the 31st annual Design Automation Conference table of contents

San Diego, California, United States

Pages: 339 - 344

Year of Publication: 1994

ISBN:0-89791-653-0

Authors

Chien-Chung Tsai	Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA
Malgorzata Marek-Sadowska	Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA

Sponsors

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

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 11, Citation Count: 19

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/196244.196404 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	Jerry R. Burch , David E. Long, Efficient Boolean function matching, Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design, p.408-411, November 1992, Santa Clara, California, United States
	3	D. I. Cheng and M. Marek-Sadowska, "Verifying Equivalence of Functions with Unknown Input Correspondence", Proc. European Design Automation Conference '93, pp. 81-85, Feb. 1993.
	4	L. Csanky, M. Perkowski and I. Schaefer, "Canonical Restricted Mixed-Polarity Exclusive Sums of Products", Proc. IEEE International Symposium on Circuits and Systems '92, pp. 17-20, May 1992.
	5	U. Kebschull and W. Rosenstiel, "Efficient Graph-Based Computation and Manipulation of Functional Decision Diagrams", Proc. European Design Automation Conf. '93, pp. 278-282, Feb. 1993.
	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	J. Mohnke and S. Malik, "Permutation and Phase Independent Boolean Comparison", Proc. European Design Automation Conf. '93, pp. 86-92, Feb. 1993.
	8	A. Mukhopadhyay, "Detection of Total or Partial Symmetry of a Switching Function with the Use of Decomposition Charts", IEEE Trans. Elec. Computers, vol. EC-16, pp. 553-557, Oct. 1963.
	9	Hamid Savoj , Mário J. Silva , Robert K. Brayton , Alberto Sangiovanni-Vincentelli, Boolean matching in logic synthesis, Proceedings of the conference on European design automation, p.168-174, November 1992, Congress Centrum Hamburg, Hamburg, Germany
	10	U. S chlichtmann and E Brglez, "Efficient Boolean Matching in Technology Mapping with Very Large Cell Library", Proc. Custom Integrated Circuits Conf. '93, pp. 3.6.1-3.6.6, May. 1993.
	11	C. Tsai and M. Marek-Sadowska, "Efficient minimization algorithms for fixed polarity AND/XOR canonical networks", Proc. 3rd Great Lake Symp. VLSI 1993, pp. 76-79.
	12	C. Tsai and M. Marek-Sadowska, "Detecting Symmetric Variables in Boolean Functions using Generalized Reed-Muller Forms", accepted to IEEE International Symposium on Circuits and Systems, '94.

CITED BY 19

	Rolf Drechsler , Bernd Becker , Michael Theobald, Fast OFDD based minimization of fixed polarity Reed-Muller expressions, Proceedings of the conference on European design automation, p.2-7, September 19-23, 1994, Grenoble, France
	Chien-Chung Tsai , Malgorzata Marek-Sadowska, Boolean Functions Classification via Fixed Polarity Reed-Muller Forms, IEEE Transactions on Computers, v.46 n.2, p.173-186, February 1997
	Kuo-Hua Wang , Ting-Ting Hwang, Boolean matching for incompletely specified functions, Proceedings of the 32nd ACM/IEEE conference on Design automation, p.48-53, June 12-16, 1995, San Francisco, California, United States
	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
	E. Schubert , W. Rosenstiel, Combined spectral techniques for Boolean matching, Proceedings of the 1996 ACM fourth international symposium on Field-programmable gate arrays, p.38-43, February 11-13, 1996, Monterey, California, United States
	Luca Benini , Giovanni De Micheli, A survey of Boolean matching techniques for library binding, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.2 n.3, p.193-226, July 1997
	Victor N. Kravets , Karem A. Sakallah, Generalized symmetries in boolean functions, Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design, November 05-09, 2000, San Jose, California
	Zeljko Zilic , Zvonko G. Vranesic, Using BDDs to design ULMs for FPGAs, Proceedings of the 1996 ACM fourth international symposium on Field-programmable gate arrays, p.24-30, February 11-13, 1996, Monterey, California, United States
	Zeljko Zilic , Zvonko G. Vranesic, Using Decision Diagrams to Design ULMs for FPGAs, IEEE Transactions on Computers, v.47 n.9, p.971-982, September 1998
	Chien-Chung Tsai , Malgorzata Marek-Sadowska, Generalized Reed-Muller Forms as a Tool to Detect Symmetries, IEEE Transactions on Computers, v.45 n.1, p.33-40, January 1996
	Bernd Becker , Rolf Drechsler , Michael Theobald, On the Expressive Power of OKFDDs, Formal Methods in System Design, v.11 n.1, p.5-21, July 1997
	Rolf Drechsler , Michael Theobald , Bernd Becker, Fast OFDD-Based Minimization of Fixed Polarity Reed-Muller Expressions, IEEE Transactions on Computers, v.45 n.11, p.1294-1299, November 1996
	Daiji Fukagawa , Tatsuya Akutsu, Performance analysis of a greedy algorithm for inferring boolean functions, Information Processing Letters, v.93 n.1, p.7-12, 16 January 2005
	Kuo-Hua Wang , Jia-Hung Chen, Symmetry detection for incompletely specified functions, Proceedings of the 41st annual conference on Design automation, June 07-11, 2004, San Diego, CA, USA
	Kuo-Hua Wang , Jia-Hung Chen, K-disjointness paradigm with application to symmetry detection for incompletely specified functions, Proceedings of the 2005 conference on Asia South Pacific design automation, January 18-21, 2005, Shanghai, China
	Rolf Drechsler , Bernd Becker , Andrea Jahnke, On Variable Ordering and Decomposition Type Choice in OKFDDs, IEEE Transactions on Computers, v.47 n.12, p.1398-1403, December 1998
	R. Drechsler , B. Becker, Sympathy: fast exact minimization of fixed polarity Reed-Muller expressions for symmetric functions, Proceedings of the 1995 European conference on Design and Test, p.91, March 06-09, 1995
	B. Becker , R. Drechsler, How many decomposition types do we need? [decision diagrams], Proceedings of the 1995 European conference on Design and Test, p.438, March 06-09, 1995
	Abusaleh M. Jabir , Dhiraj K. Pradhan, A Graph-Based Unified Technique for Computing and Representing Coefficients over Finite Fields, IEEE Transactions on Computers, v.56 n.8, p.1119-1132, August 2007