An exact algorithm to minimize mixed-radix exclusive sums of products for incompletely specified Boolean functions

作者: M. Perkowski , M. Chrzanowska-Jeske

DOI: 10.1109/ISCAS.1990.112455

关键词:

摘要: An exact algorithm for the synthesis of mixed polarity exclusive sum product (ESOP) expressions arbitrary size incompletely specified Boolean functions is presented. For more than four input variables, this problem has not been solved yet. A decision function H constructed a f that describes all possible ESOP solutions to f. The plays minimization role analogous Petrick inclusive expression classical logic. Each literals satisfies corresponds one solution algorithms create and solve are >

参考文章(7)
Jean-Pierre Deschamps, Marc Davio, André Thayse, Discrete and switching functions ,(1978)
D. E. Muller, Application of Boolean algebra to switching circuit design and to error detection Transactions of the I.R.E. Professional Group on Electronic Computers. ,vol. 3, pp. 6- 12 ,(1954) , 10.1109/IREPGELC.1954.6499441
Marek Perkowski, Martin Helliwell, A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms design automation conference. pp. 427- 432 ,(1988) , 10.5555/285730.285799
A. Mukhopadhyay, G. Schmitz, Minimization of Exclusive or and Logical Equivalence Switching Circuits IEEE Transactions on Computers. ,vol. C-19, pp. 132- 140 ,(1970) , 10.1109/T-C.1970.222878
Francis T. S. Yu, Suganda Jutamulia, Don A. Gregory, Real-time liquid crystal TV XOR- and XNOR-gate binary image subtraction technique. Applied Optics. ,vol. 26, pp. 2738- 2742 ,(1987) , 10.1364/AO.26.002738
E.B. Pitty, J.V. Salmon, Input irredundancy of mixed-polarity Reed-Muller equations Electronics Letters. ,vol. 24, pp. 258- 260 ,(1988) , 10.1049/EL:19880173
Besslich, Efficient computer method for ExOR logic design IEE Proceedings E - Computers and Digital Techniques. ,vol. 130, pp. 203- 206 ,(1983) , 10.1049/IP-E:19830045