By Topic

Representations of multiple-output switching functions using multiple-valued pseudo-Kronecker 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)
H. M. Hasan Babu ; Dept. of Comput. Sci. & Electron., Kyushu Inst. of Technol., Iizuka, Japan ; T. Sasao

In this paper, we propose a method to construct smaller multiple-valued pseudo-Kronecker decision diagrams (MVPKDDs). Our method first generates a 4-valued input 2-valued multiple-output function from a given 2-valued input 2-valued output functions. Then, it constructs a 4-valued decision diagram (4-valued DD) to represent the generated 4-valued input function. Finally, it selects a good expansion among 27 different expansions for each 4-valued node of the 4-valued DD and derive a 4-valued PKDD. We present heuristics to produce compact 4-valued PKDDs. Experimental results using benchmark functions show the efficiency of our method. From experiments, we also conjecture that, for n>1, to represent an n-bit adder (adr n), a 4-valued PKDD, a 4-valued DD (MDD), a 2-valued PKDD, and a shared binary decision diagram (SBDD) require 2n+1, 3n-1, 4n-1, and 9n-7 non-terminal nodes, respectively

Published in:

Multiple-Valued Logic, 2000. (ISMVL 2000) Proceedings. 30th IEEE International Symposium on

Date of Conference: