Answers are grounded in this paper and cite their sources.
A program is described for exact minimization of three-level combinational functions from NAND (NOR) gates. This algorithm generalizes the well-known approaches of TANT synthesis in the following ways: the function is multioutput, it includes don't cares, and any subset of variables can be available in only complemented form, or in both affirmative and complemented forms. The number of PP-implicants that can be used for exact minimum solution is reduced as a result of proving some theorems.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
No takes yet. Share an insight, caveat, or question.
Perkowski et al. (2002) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: