ABSTRACT
Decision trees, a graphical data structure for representing Boolean functions, were introduced in Chapter 2. In general, decision trees are redundant data structures, in which the redundancy of the representation of Boolean functions is expressed in graphical form. Reducing decision trees means removing redundancy in function representation. Hence, the optimization of decision trees relates to the optimization of Boolean functions. The resulting graphs are called decision diagrams. Besides the usage of decision diagrams as an abstract data structure at almost every stage of logic design, they are also suited for direct mapping into physical implementation for some technologies.
