Binary-decision graphs for implementation of Boolean functions

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.