By Topic

On the average path length in decision diagrams of multiple-valued 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
$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)
J. T. Butler ; Dept. of Electr. & Comput. Eng., US Naval Postgraduate Sch., Monterey, CA, USA ; T. Sasao

We consider the path length in decision diagrams for multiple-valued functions. This is an important measure of a decision diagram, since this models the time needed to evaluate the function. We focus on the average path length (APL), which is the sum of the path lengths over all assignments of values to the variables divided by the number of assignments. First, we show a multiple-valued function in which the APL is markedly affected by the order of variables. We show upper and lower bounds on the longest path length in a decision diagram of a multiple-valued function. Next, we derive the APL for individual functions, the MAX, ALL-MAX, and MODSUM functions. We show that the latter two functions achieve the lower and upper bound on the APL overall n-variable r-valued functions. Finally, we derive the average of the APL for two sets of functions, symmetric functions and all functions.

Published in:

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

Date of Conference:

16-19 May 2003