论文信息 - A simplification method for AND-EXOR expressions for multiple-output functions

A simplification method for AND-EXOR expressions for multiple-output functions

This paper presents properties of Exclusive-OR Sum-of-Products expressions (ESOPs) for multiple-output functions and a simplification algorithm for ESOPs. First, lower bounds on the number of products in minimum ESOPs for multiple output functions are derived. Then, algorithms to simplify ESOPs and to prove their minimality are presented. Experimental results for arithmetic functions and randomly generated functions for up to ten variables are shown.

Tsutomu Sasao | Norio Koda

[1] M. Perkowski,et al. An exact algorithm to minimize mixed-radix exclusive sums of products for incompletely specified Boolean functions , 1990, IEEE International Symposium on Circuits and Systems.

[2] Marek A. Perkowski,et al. A fast algorithm to minimize multi-output mixed-polarity generalized Reed-Muller forms , 1988, DAC '88.

[3] Tsutomu Sasao,et al. On the complexity of mod-2l sum PLA's , 1990 .

[4] Tsutomu Sasao,et al. Input Variable Assignment and Output Phase Optimization of PLA's , 1984, IEEE Transactions on Computers.

[5] Tsutomu Sasao. An Algorithm to Derive the Complement of a Binary Function with Multiple-Valued Inputs , 1985, IEEE Transactions on Computers.

[6] Tsutomu Sasao. EXMIN2: a simplification algorithm for exclusive-OR-sum-of-products expressions for multiple-valued-input two-valued-output functions , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..