作者: 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 >