The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (1974 vol.23)
pp: 1313-1315
S.B. Marinkovic , Elektronska Industrija
ABSTRACT
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, December 1974, doi:10.1109/T-C.1974.223854
15 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool