By Topic

Algorithm for Minimal Polarized Polynomial Form Determination

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Marinkovic, S.B. ; Elektronska Industrija ; Tosic, Z.

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-23 ,  Issue: 12 )