Ternary decision diagrams

TDD graph-based representation is actually a natural extension of the binary decision diagram (BDD) to the three-valued case. This paper describes a method of defining, analyzing, and implementing the Boolean function by ternary decision diagram (TDD). This diagram representation enables us to evaluate a Boolean function. We investigate the characteristics of different types of TDDs in order to develop an efficient general software package associated with efficient manipulation algorithms that leads to simpler Boolean functions. We define and discuss the data structure and the reduction algorithms of the developed package. The performance of this software package is finally demonstrated by subjecting the practical circuits, LGSynth93 standard benchmarks, to it.