Ternary decision diagrams
Student Conference on Research and Development - Trang 76-79
Tóm tắt
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 using a 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 reduction algorithms of the developed package. The performance of this software package is finally demonstrated by subjecting practical circuits, LGSynth93 standard benchmarks, to it.
Từ khóa
#Boolean functions #Data structures #Binary decision diagrams #Input variables #Software packages #Packaging #Decision trees #Software algorithms #Circuits #Software standardsTài liệu tham khảo
jennings, 1995, Symbolic Incompletely Specified Functions for Correct Evaluation in the Presence of Indetermine Input Values, 28th Hawaii International conference on System Science (vol I Architecture), 23
sasao, 1997, 1997. Ternary Decision Diagrams Survey, Proc 27th Int Symp Multiple-Valued Logic, 241
sim, 2002, 2002. Manipulation of Boolean Functions Based on Decision Diagrams, proceedings of The Annual Workshop National Science Fellowship (NSF), 163
iguchi, 1998, On Properties of Kleene TDDs, IEICE Trans Inf Systems, e 81 d, 716
10.1109/ISMVL.1996.508365
jennings, 1994, 1994. A State Machine Language Supporting Integer Inequalities Implemented with Ordered Ternary Decision Diagrams, Proceedings 1994 Int'l Conference on Simulation and Hardware Description Languages (ICSHDL), 23
10.1109/TC.1986.1676819
yang, 1991, Logic Synthesis and Optimization Benchmark User Guide, Version 3.0, MCNC
10.1109/TC.1978.1675141