Algorithms for Taylor Expansion Diagrams

I
ISMVL
2004
34th International Symposium on Multiple-Valued Logic (ISMVL'04)
Abstract - Algorithms for Taylor Expansion Diagrams

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Goerschwin Fey Articles by Rolf Drechsler Articles by Maciej Ciesielski

34th International Symposium on Multiple-Valued Logic (ISMVL'04)

University of Toronto, Toronto, Canada

May 19-May 22

ISBN: 0-7695-2130-4

	ASCII Text	x
	Goerschwin Fey, Rolf Drechsler, Maciej Ciesielski, "Algorithms for Taylor Expansion Diagrams," Multiple-Valued Logic, IEEE International Symposium on, pp. 235-240, 34th International Symposium on Multiple-Valued Logic (ISMVL'04), 2004.

	BibTex	x
	@article{ 10.1109/ISMVL.2004.1319947, author = {Goerschwin Fey and Rolf Drechsler and Maciej Ciesielski}, title = {Algorithms for Taylor Expansion Diagrams}, journal ={Multiple-Valued Logic, IEEE International Symposium on}, volume = {0}, year = {2004}, issn = {0195-623X}, pages = {235-240}, doi = {http://doi.ieeecomputersociety.org/10.1109/ISMVL.2004.1319947}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Multiple-Valued Logic, IEEE International Symposium on TI - Algorithms for Taylor Expansion Diagrams SN - 0195-623X SP235 EP240 A1 - Goerschwin Fey, A1 - Rolf Drechsler, A1 - Maciej Ciesielski, PY - 2004 KW - null VL - 0 JA - Multiple-Valued Logic, IEEE International Symposium on ER -

Goerschwin Fey, University of Bremen

Rolf Drechsler, University of Bremen

Maciej Ciesielski, University of Massachusetts at Amherst

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISMVL.2004.1319947

The ever increasing size of integrated circuits results in large problem sizes during synthesis and verification of such designs. Recently Taylor Expansion Diagrams (TEDs) were introduced as a data structure to cope with large problem instances. TEDs allow to exploit high level information in the representation of functions.

In this paper the basic TED operations are analyzed from a complexity point of view. Suggestions for optimizations of the originally proposed algorithms are made.

Citation:

Goerschwin Fey, Rolf Drechsler, Maciej Ciesielski, "Algorithms for Taylor Expansion Diagrams," ismvl, pp.235-240, 34th International Symposium on Multiple-Valued Logic (ISMVL'04), 2004

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.