Multiple-Valued Logic Minimization for PLA Synthesis

Abstract : Multiple-valued logic minimization is an important technique for reducing the area required by a Programmable Logic Array (PLA). This report describes both heuristic and exact algorithms for solving the multiple-valued logic minimization problem. These algorithms have been implemented in a C program called Espresso-MV.

[1]  Leon I. Maissel,et al.  An Introduction to Array Logic , 1975, IBM J. Res. Dev..

[2]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[3]  Paul S. Rosenbloom,et al.  The Soar Architecture , 1986 .

[4]  T. Sasao.  A Fast Complementation Algorithm for Sum-of-Products Expressions of Multiple-Valued Input Binary Functions, , 1983 .

[5]  Tsutomu Sasao.  An application of multiple-valued logic to a design of programmable logic arrays , 1978, MVL '78.

[6]  Nripendra N. Biswas,et al.  Minimization of Boolean Functions , 1971, IEEE Transactions on Computers.

[7]  George S. Taylor.  Compatible hardware for division and square root , 1981, 1981 IEEE 5th Symposium on Computer Arithmetic (ARITH).

[8]  Michel Dagenais,et al.  McBOOLE: A New Procedure for Exact Logic Minimization , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[9]  Pierre L. Tison,et al.  Generalization of Consensus Theory and Application to the Minimization of Boolean Functions , 1967, IEEE Trans. Electron. Comput..

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

[11]  Alberto L. Sangiovanni-Vincentelli,et al.  An Algorithm for Optimal PLA Folding , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Giovanni De Micheli.  OP11MAL ENCODING OF CONTROL LOGIC , 1984 .