By Topic

On the minimization of average path lengths for heterogeneous MDDs [multi-valued decision diagrams]

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
$33 $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)
S. Nagayama ; Dept. of Comput. Sci. & Electron., Kyushu Inst. of Technol., Iizuka, Japan ; T. Sasao

In this paper, we propose both exact and heuristic minimization algorithms for the average path length (APL) of heterogeneous multi-valued decision diagrams (MDDs). In a heterogeneous MDD, each variable can take on a different number of values. To represent a binary logic function using a heterogeneous MDD, we partition the binary variables into groups, and treat them as multi-valued variables. By considering partitions of binary variables, we can obtain heterogeneous MDDs that represent logic functions more compactly and have smaller APLs than reduced ordered binary decision diagrams (ROBDDs). Experimental results using 21 benchmark functions show that the APLs of the heterogeneous MDDs can be reduced to a half that of corresponding ROBDDs, on average, without increasing memory size.

Published in:

Multiple-Valued Logic, 2004. Proceedings. 34th International Symposium on

Date of Conference:

19-22 May 2004