Polynomial methods for component matching and verification

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Polynomial methods for component matching and verification

Full text

Pdf (829 KB)

Source

International Conference on Computer Aided Design archive
Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design table of contents

San Jose, California, United States

Pages: 678 - 685

Year of Publication: 1998

ISBN:1-58113-008-2

Authors

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

Sponsors

SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
IEEE-EDS : Electronic Devices Society
IEEE-CAS : Circuits & Systems

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 18, Citation Count: 9

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/288548.289115 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.

	Br86	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]
	BrCh95	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]
	ChBr96	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
	ClFu95	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
	ClFu93	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]
	ChBr96	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
	Mi96	S. Minato, "Implicit manipulation of Polynomials Using Zero-Suppressed BDDs", 1996

CITED BY 9

	P. Dasgupta , P. Chakrabarti , A. Nandi , S. Krishna , A. Chakrabarti, Abstraction of word-level linear arithmetic functions from bit-level component descriptions, Proceedings of the conference on Design, automation and test in Europe, p.4-8, March 2001, Munich, Germany
	Partha S. Roop , A. Sowmya , S. Ramesh, Forced simulation: A technique for automating component reuse in embedded systems, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.6 n.4, p.602-628, October 2001
	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
	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
	T. Raudvere , A. K. Singh , I. Sander , A. Jantsch, System level verification of digital signal processing applications based on the polynomial abstraction technique, Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design, p.285-290, November 06-10, 2005, San Jose, CA
	James Smith , Giovanni De Micheli, Polynomial methods for allocating complex components, Proceedings of the conference on Design, automation and test in Europe, p.45-es, January 1999, Munich, Germany
	Namrata Shekhar , Priyank Kalla , M. Brandon Meredith , Florian Enescu, Simulation bounds for equivalence verification of polynomial datapaths using finite ring algebra, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, v.16 n.4, p.376-387, April 2008