By Topic

Efficient minimization of multiple-valued decision diagrams for incompletely specified functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Popel, D.V. ; Comput. Sci. Dept., Baker Univ., Baldwin City, KS, USA ; Drechsler, R.

This paper addresses the problem of finding a small size Multiple-Valued Decision Diagram (MDD) representation of an incompletely specified multiple-valued function. Optimal MDD representation improves performance and flexibility of many applications in logic design and multiple-valued circuit synthesis. We introduce an algorithm which incorporates a new operation on incompletely specified MDDs, called fusion. The diagram is optimized by dynamic variable ordering, graph compaction and minimization. During the optimization the structure of the underlying MDD is modified in a way that only specified values are represented while don't cares are ignored. The results on multiple-valued as well as binary benchmarks with don't cares are given to demonstrate the efficiency and robustness of the algorithm.

Published in:

Multiple-Valued Logic, 2003. Proceedings. 33rd International Symposium on

Date of Conference:

16-19 May 2003