Polynomial methods for allocating complex components

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Polynomial methods for allocating complex components

Full text

Pdf (48 KB)

Source

Design, Automation, and Test in Europe archive
Proceedings of the conference on Design, automation and test in Europe table of contents

Munich, Germany

Article No. 45

Year of Publication: 1999

ISBN:1-58113-121-6

Authors

James Smith	Computer Systems Laboratory, Stanford University, Stanford, CA
Giovanni De Micheli	Computer Systems Laboratory, Stanford University, Stanford, CA

Sponsor

SIGDA: ACM Special Interest Group on Design Automation

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/307418.307492 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	James Smith , Giovanni De Micheli, Polynomial methods for component matching and verification, Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, p.678-685, November 08-12, 1998, San Jose, California, United States [doi>10.1145/288548.289115]
	2	Randal E. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, v.35 n.8, p.677-691, August 1986 [doi>10.1109/TC.1986.1676819]
	3	Randal E. Bryant , Yirng-An Chen, Verification of arithmetic circuits with binary moment diagrams, Proceedings of the 32nd ACM/IEEE conference on Design automation, p.535-541, June 12-16, 1995, San Francisco, California, United States [doi>10.1145/217474.217583]
	4	Yirng-An Chen , Randal E. Bryant, ACV: an arithmetic circuit verifier, Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design, p.361-365, November 10-14, 1996, San Jose, California, United States
	5	E. M. Clarke , M. Fujita , X. Zhao, Hybrid decision diagrams, Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design, p.159-163, November 05-09, 1995, San Jose, California, United States
	6	E. M. Clarke , K. L. McMillan , X Zhao , M. Fujita , J. Yang, Spectral transforms for large boolean functions with applications to technology mapping, Proceedings of the 30th international conference on Design automation, p.54-60, June 14-18, 1993, Dallas, Texas, United States [doi>10.1145/157485.164569]
	7	Yirng-An Chen , Randal E. Bryant, PHDD: an efficient graph representation for floating point circuit verification, Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design, p.2-7, November 09-13, 1997, San Jose, California, United States
	8	[Mi96] S. Minato, "Implicit manipulation of Polynomials Using Zero-Suppressed BDDs", 1996.
	9	Kavita Ravi , Kenneth L. McMillan , Thomas R. Shiple , Fabio Somenzi, Approximation and decomposition of binary decision diagrams, Proceedings of the 35th annual conference on Design automation, p.445-450, June 15-19, 1998, San Francisco, California, United States [doi>10.1145/277044.277168]

CITED BY 5

	Armita Peymandoust , Giovanni De Micheli, Using symbolic algebra in algorithmic level DSP synthesis, Proceedings of the 38th conference on Design automation, p.277-282, June 2001, Las Vegas, Nevada, United States
	Armita Peymandoust , Giovanni De Micheli, Symbolic algebra and timing driven data-flow synthesis, Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design, November 04-08, 2001, San Jose, California
	Iñigo Ugarte , Pablo Sanchez, Verification of embedded systems based on interval analysis, International Journal of Parallel Programming, v.33 n.6, p.697-720, December 2005
	Sivaram Gopalakrishnan , Priyank Kalla , M. Brandon Meredith , Florian Enescu, Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors, Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design, November 05-08, 2007, San Jose, California
	Sivaram Gopalakrishnan , Priyank Kalla, Optimization of polynomial datapaths using finite ring algebra, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.12 n.4, p.49-es, September 2007