This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Z.G. Vranesic, Department of Electrical Engineering, University of Toronto
A concept of functional transformation of multivalued switching functions, used to obtain simplified implementations is presented. Given some function f, a transformed function g is generated from f by permuting some or all of the truth values. Then, implementing g and performing a reverse permutation, a simpler implementation for f is obtained. A P matrix technique is given to facilitate determination of the required permutation.
Index Terms:
Combinational circuits, functional transformation, many-valued logic, simplification, switching algebra.
Citation:
Z.G. Vranesic, K.M. Waliuzzaman, "Functional Transformation in Simplification of Multivalued Switching Functions," IEEE Transactions on Computers, vol. 21, no. 1, pp. 102-105, Jan. 1972, doi:10.1109/T-C.1972.223440
Usage of this product signifies your acceptance of the Terms of Use.