By Topic

Binary-decision graphs for implementation of Boolean 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 $31
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)
Silva, M. ; Institut National Polytechnique de Grenoble, Laboratoire d' Automatique de Grenoble, Saint Martin d'M¿¿raes, France ; David, R.

Binary decision graphs provide the most efficient means for computing Boolean functions by program, and also relate to hardware implementation. In the present paper, formal properties of binary decision graphs are considered, and rules are provided for the anticipation of path lengths and vertex requirements, which indicate computation time and program length, respectively. Rules for the construction of efficient (but not truly optimal) binary decision graphs are provided, these rules are then applied in design examples.

Published in:

Computers and Digital Techniques, IEE Proceedings E  (Volume:132 ,  Issue: 3 )