Jiang Wenbin. A METHOD OF SIMPLIFYING THREE-VALUED T-GATE COMBINATIONAL NETWORKSTHE TRUTH TABLE SPLITTING METHOD[J]. Journal of Electronics & Information Technology, 1997, 19(3): 361-366.
Citation:
Jiang Wenbin. A METHOD OF SIMPLIFYING THREE-VALUED T-GATE COMBINATIONAL NETWORKSTHE TRUTH TABLE SPLITTING METHOD[J]. Journal of Electronics & Information Technology, 1997, 19(3): 361-366.
Jiang Wenbin. A METHOD OF SIMPLIFYING THREE-VALUED T-GATE COMBINATIONAL NETWORKSTHE TRUTH TABLE SPLITTING METHOD[J]. Journal of Electronics & Information Technology, 1997, 19(3): 361-366.
Citation:
Jiang Wenbin. A METHOD OF SIMPLIFYING THREE-VALUED T-GATE COMBINATIONAL NETWORKSTHE TRUTH TABLE SPLITTING METHOD[J]. Journal of Electronics & Information Technology, 1997, 19(3): 361-366.
A method of simplifying three-valued T-gate combinational networks, known as a method of splitting the truth table, is given in this paper. By using the method, the three-valued T-gate combinational networks can be simplified to minimization or near minimization, the used operating time is less, and the programme can easily be programmed and operated on a computer.
Fang K Y, Wojcik A S. Modular decomposition of combinational multiple-valued circuits. IEEE Trans. on Comput., 1988, C-37(10): 1293-1301.[2]Jiang Wenbin. A method for minimization design of two-level logic networks using multiplexes universal logic modules[J].J. of Comput. Sci.Technol.1994, 9(1):92-96
DownLoad: