BDD Decomposition for Efficient Logic Synthesis

I
ICCD
1999
1999 IEEE International Conference on Computer Design (ICCD'99)
Abstract - BDD Decomposition for Efficient Logic Synthesis

	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 Congguang Yang Articles by Maciej Ciesielski Articles by Vigyan Singhal

1999 IEEE International Conference on Computer Design (ICCD'99)

Austin, Texas

October 10-October 13

ISBN: 0-7695-0406-X

	ASCII Text	x
	Congguang Yang, Maciej Ciesielski, Vigyan Singhal, "BDD Decomposition for Efficient Logic Synthesis," Computer Design, International Conference on, pp. 626, 1999 IEEE International Conference on Computer Design (ICCD'99), 1999.

	BibTex	x
	@article{ 10.1109/ICCD.1999.808607, author = {Congguang Yang and Maciej Ciesielski and Vigyan Singhal}, title = {BDD Decomposition for Efficient Logic Synthesis}, journal ={Computer Design, International Conference on}, volume = {0}, year = {1999}, issn = {1063-6404}, pages = {626}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICCD.1999.808607}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Computer Design, International Conference on TI - BDD Decomposition for Efficient Logic Synthesis SN - 1063-6404 SP EP A1 - Congguang Yang, A1 - Maciej Ciesielski, A1 - Vigyan Singhal, PY - 1999 KW - BDD KW - Logic Synthesis KW - Decomposition KW - Dominators VL - 0 JA - Computer Design, International Conference on ER -

Congguang Yang, University of Massachusetts at Amherst

Maciej Ciesielski, University of Massachusetts at Amherst

Vigyan Singhal, Cadence Berkeley Laboratory

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICCD.1999.808607

A unified logic optimization method efficient at handling both AND/OR-intensive and XOR-intensive functions is proposed. The method is based on iterative BDD decomposition using various dominators. Detail analysis of decomposable BDD structures leading to AND/OR, XOR and MUX decompositions are presented. Experiment shows that our synthesis results for AND/OR-intensive functions are comparable to those of SIS, and results for XOR-intensive functions are comparable to those of techniques targeting specifically XOR decomposition.

Index Terms:

BDD, Logic Synthesis, Decomposition, Dominators

Citation:

Congguang Yang, Maciej Ciesielski, Vigyan Singhal, "BDD Decomposition for Efficient Logic Synthesis," iccd, pp.626, 1999 IEEE International Conference on Computer Design (ICCD'99), 1999

Peer Review Notice | Give Us Feedback

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