This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Algorithm for Minimal Polarized Polynomial Form Determination
December 1974 (vol. 23 no. 12)
pp. 1313-1315
S.B. Marinkovic, Elektronska Industrija
Boolean difference when considering the polarized polynomial forms (AND?EXCLUSIVE OR forms in which each variable in all terms is complemented or uncomplemented) is used in this correspondence. Algorithms for determining quasi-minimnal and minimal polarized forms of the given functions are described.
Index Terms:
Switching function minmization, switching function representation.
Citation:
S.B. Marinkovic, Z. Tosic, "Algorithm for Minimal Polarized Polynomial Form Determination," IEEE Transactions on Computers, vol. 23, no. 12, pp. 1313-1315, Dec. 1974, doi:10.1109/T-C.1974.223854
Usage of this product signifies your acceptance of the Terms of Use.