论文信息 - Optimal output assignment and the maximum number of implicants needed to cover the multiple-valued logic functions

Optimal output assignment and the maximum number of implicants needed to cover the multiple-valued logic functions

Optimal output assignment is proposed to reduce the number of implicants in a minimal sum-of-products expression, where sum refers to TSUM. Some bounds on the maximum number of implicants needed to cover an output permuted function are clarified. One-variable output permuted functions require at most p-1 implicants in their minimal sum-of-products expressions, where p is the radix. Two-variable functions with radix between three and six are analyzed. Some speculations on the minimum number of the implicants are confirmed for functions with a higher radix and more than two variables. Computer simulation shows that output-permuted functions require 15% fewer implicants on the average.<<ETX>>

Yutaka Hata | Kazuharu Yamato | Fujio Miyawaki

[1] Jon T. Butler,et al. On the Size of PLA's Required to Realize Binary and Multiple-Valued Functions , 1989, IEEE Trans. Computers.

[2] Gerhard W. Dueck,et al. On the maximum number of implicants needed to cover a multiple-valued logic function using window literals , 1991, [1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic.

[3] James R. Armstrong,et al. Representation of Multivalued Functions Using the Direct Cover Method , 1981, IEEE Transactions on Computers.

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

[5] Jon T. Butler,et al. HAMLET-an expression compiler/optimizer for the implementation of heuristics to minimize multiple-valued programmable logic arrays , 1990, Proceedings of the Twentieth International Symposium on Multiple-Valued Logic.

[6] Jon T. Butler,et al. Analysis of minimization algorithms for multiple-valued programmable logic arrays , 1988 .

[7] Tsutomu Sasao. On the Optimal Design of Multiple-Valued PLA's , 1989, IEEE Trans. Computers.

[8] Gw Dueck,et al. A direct cover MVL minimization using the truncated sum , 1987 .

[9] Tsutomu Sasao. Multiple-valued logic and optimization of programmable logic arrays , 1988, Computer.

[10] Tsutomu Sasao,et al. Multiple-Valued Decomposition of Generalized Boolean Functions and the Complexity of Programmable Logic Arrays , 1981, IEEE Transactions on Computers.