Chinese Journal of Computers   Full Text
Title	Algebra Theory of RDSOP Forms of Ternary Logic Functions and Its Implementation with T-Gates
Authors	JIANG En-Hua JIANG Wen-Bin
Address	(Department of Physics, Huaibei Coal Industry Teachers College, Huaibei, Anhui 235000)
Year	2007
Issue	No.7(1132—1137)
Abstract &   Background	Abstract Reduced disjoint SOP (RDSOP) forms of ternary logic functions are one type of very useful algebraic forms. The study in the paper shows that it has important applications in the field of designing and simplifying T-gate networks. This paper discusses algebra theory and algorithm of RDSOP forms of ternary logic functions by using fundamental operations and main properties of ternary lattice algebra, and gives the example using the algorithm. By using principle realizing any ternary logic function with ternary T-gate network, this paper presents a minimization design method of ternary T-gate networks based on the RDSOP forms, and gives the example using the method. From the examples given in the paper, it is seen that the methods are effective and realizable. keywords multiple-valued logic; T-gate networks; RDSOP forms; minimization; logic design; computer aided design (CAD) background In recent years, great progresses have been made in the research fields of multiple-valued logic theory and its applications. The algebra theory for minimization sun-of-products (MISOP) forms of ternary logic functions is fundamental theory of designing and simplifying ternary logic circuits and systems, which has been all through received widespread attentions in the field of science in the world, and some achievements have been obtained in the field. However, the research for minimization disjoint sun-of-products (MIDSOP) forms of ternary logic functions is less. The study in the paper shows that it has important applications in the field of designing and simplifying ternary T-gate networks. A T-gate is a multi-function general logic component (module). As early as 1985, three valued logic T-gate integrated circuit has been made. By using ternary T-gate network, any ternary logic function can be realized. In the design of the ternary T-gate logic network, different ways of assignment for control variable of every T-gate at each level network of the network being designed will result in different structural T-gate network. If the number of T-gates by which a T-gate network is constituted is the smallest, then the network is called minimization T-gate network. The simplify (minimization) of ternary T-gate networks and its computer algorithm are an important research subject in the field of ternary logic circuits and systems. This paper studies algebra theory and algorithm for reduced (minimization or near minimization) disjoint sun-of-products (RDSOP) forms of ternary logic functions. The algorithm is easily accomplished on a computer. The study in the paper finds that in general, a ternary logic function RDSOP form corresponds to a minimization ternary T-gate network. Based on the thought, the paper presents a minimization design (simplify) method of ternary T-gate networks based on the RDSOP forms. The method is suitable for computer aided design of ternary T-gate networks.