T. Sasao. Ternary Decision Diagrams | Survey. In Proceedings of the 27th International Symposium on Multi-valued Logic, pages 241-250. IEEE, 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... are based on the algebraic structure of an arbitrary field [6,7,8,9,10,11,13,14] In particular, they include S (OR can be replaced with EXOR in Shannon expansion) Positive and Negative Davio (pD and nD, respectively) general Linearly Independent (binary and MV) 10] and EXOR Ternary expansions [9,20]. Joining operations for these expansions are more complicated and are presented in [5,8,14] The lattice is created for each (multi output) block obtained from Curtis like functional decomposer [12] as follows. One level of function f is expanded to an assumed type of the Lattice for a selected ....

....well as arbitrary expansion based Post or GF(k) k 4 functions. Again, any binary or MV logic can be mapped, and more efficiently so. In other geometry variant, the neighborhoods are: NWW, NW, NE, NEE for inputs, SWW,SW SE, and SEE for outputs. Good results were found for new ternary diagrams [9,20] and Galois(4) expansions for multi output incompletely specified functions. Lattice Kronecker Decision Diagrams (LKDDNEs) with negated edges are based on three orthogonal expansions (Shannon, Positive Davio, Negative Davio) 16] Many other new families of functional decision diagrams were ....

[Article contains additional citation context not shown here]

T. Sasao, "Ternary Decision Diagrams: Survey," Proc. ISMVL '97, pp. 241 - 250.

....of arbitrary expansion based Post or GF(k) k 4 functions. Again, any binary or MV logic can be mapped, but more efficiently. In other variant, the neighborhoods are: NWW, NW, NE, NEE for inputs, SWW,SW SE, and SEE for outputs. Especially practical among our examples are new ternary diagrams [9, 19] and Galois(4) expansions for multi output incompletely specified functions. Our methods are very efficient for strongly unspecified functions. The introduced by us families of lattice diagrams are counterparts and generalizations of several diagrams known from the literature (BDDs, FDDs, KFDDs) ....

.... of functional decision diagrams were created, including: Pseudo Kronecker Lattice DDs, Free Kronecker Lattice KDDs, Boolean Ternary Lattice DDs, and other [13] The Boolean Ternary Lattice DDs introduce nodes with three edges and requires AND, OR and EXOR gates for expansion circuit realizations [14, 19]. Galois GF(3) and GF(4) diagrams require three and four neighbors on inputs, respectively. Expansions and Joinings Operations on nodes. There are two types of expansions: maximum type, and Linearly Independent (LI) type. Linearly Independent expansions are generalizations of Positive (pD) and ....

[Article contains additional citation context not shown here]

T. Sasao, "Ternary Decision Diagrams: Survey," Proc. ISMVL '97, pp. 241 - 250.

.... m 1 if x = i 0 otherwise (1) A similar generalization, de ned for the discrete functions of type P 1 P 2 : P n M , where P i = f0; 1; p i 1g are sets of values the variables x i assume, has been presented in [4] A survey of di erent multiple valued decision diagrams is given in [5]. In this paper we introduce a new type of Multiple valued Decision Diagrams, extending the concept of Parity OBDDs [6] to the multiple valued case and representing the functions of type f : M n M , with M = f0; 1; p 1g, p prime. We call them Mod p Decision Diagrams (Mod p DDs) Such ....

T. Sasao, Ternary decision diagrams - Survey, Proc. 27th Int. Symp. on Multiple-Valued Logic (1997), 241-250.

.... The model checking framework developed in this paper could be extended so it can be performed symbolically following the ideas of [BCM 90] This would require the use of data structures and algorithms for representing and manipulating 3 valued formulas, such as Ternary Decision Diagrams [Sas97] Acknowledgments We thank Michael Benedikt and the anonymous referees for helpful comments on this paper. ....

T. Sasao. Ternary Decision Diagrams -- A Survey. In Proc. IEEE International Symposium on Multiple-Valued Logic, pages 241--250, Nova Scotia, May 1997.

No context found.

T. Sasao, "Ternary decision diagrams survey," in Proc. 27th Int. Symp. Multiple-Valued Logic, Antigonish, NS, Canada, May 1997, pp. 241--250.

No context found.

T. Sasao, "Ternary decision diagrams: survey," (invited paper), IEEE International Symposium on MultipleValued Logic, Nova Scotia, Canada, May 28-30, 1997, pp. 241-250.

....The value of the terminal node is the function value for that assignment. f f 0 f 1 01 Fig. 1.1. BDD. In this paper, we assume that the orderings of the input variables are the same for all paths from the root node to a leaf node, i.e. we consider only ordered decision diagrams (DDs) In [20], we introduced various TDDs. Each TDD has interesting application in logic synthesis. Let B = f0; 1g and T = f0; 1; 2g. Let ff = ff 1 ;ff 2 ; ff n ) be a ternary vector such that ff i 2 T . Then, x ff 1 1 x ff 2 2 111x ff n n (1) f 0 f 1 f f 0 f 1 012 Fig. 1.2. AND TDD. ....

T. Sasao, "Ternary decision diagrams: Survey," Proc. International Symposium on Multiple-valuedLogic, pp. 241-250, Nova Scotia, May 1997.

No context found.

T. Sasao. Ternary Decision Diagrams | Survey. In Proceedings of the 27th International Symposium on Multi-valued Logic, pages 241-250. IEEE, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC