S), such that for any h E Sk there is a unique 10 E So to satisfy h = Fd/o). 5 In this section, we describe the implementation of a BDD package and present the results of experiments evaluating the performance of the BDD package and the effect of attributed edges. 0). The program consists of about 800 lines of C code, and this package supports the following basic and the essential operations of Boolean functions: for • Giving the trivial functions, such as 1 (tautology), 0 (inconsistency), and a given index k.
3(d) fd is computed from f~' and J{'. fd represents the minterrns to be covered by the cubes excluding 11 and v. We thereby generate its prime-irredundant cube set iSOPd. Finally. the result of i80P can be obtained as the union set of v . isopo. 11 • i80P1 and iSOPd. Note that although here we use Kamaugh maps for purpose of illustration. in practice the functions are represented and manipulated using BDDs. 54 CHAPTER ro' fO (v=o) 1fl (v=l) ro" fl' 1 1 0 0 1 1 0 1 I I 0 d 1 1 1 1 ,..... (d 1) i\!