This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Algebraic Method for Designing Multivalued Logic Circuits using Principally Binary Components
November 1975 (vol. 24 no. 11)
pp. 1101-1104
J.E. Birk, General Electric Company
Algebraic reduction procedures for multivalued logic functions based upon a principally binary circuit realization are presented. The procedures given are also applicable to literal gate realizations employing compound literals. The prime implicant generation and covering problems are treated in detail. It is shown that the selected cover must be iteratively examined for possible reduction at each decision point of the covering process. This reduction is achieved by the elimination of unnecessary nonadjacencies.
Index Terms:
Circuit realization of multivalued functions, combinational circuits, compound literals, consensus, literal functions, multivalued algebra, multivalued logic, nonbinary algebra, nonbinary logic.
Citation:
J.E. Birk, D.E. Farmer, "An Algebraic Method for Designing Multivalued Logic Circuits using Principally Binary Components," IEEE Transactions on Computers, vol. 24, no. 11, pp. 1101-1104, Nov. 1975, doi:10.1109/T-C.1975.224138
Usage of this product signifies your acceptance of the Terms of Use.