Empirical Comparison of Multi-Output Boolean Function Minimization Algorithms using Ternary-Indexed Prime Implicants
Prime implicant computation is a fundamental step in minimizing the two-level sum-of-products representation of Boolean function – the form used in programmable logic arrays and throughout classical digital system design. Ternary indexing offers an elegant algebraic framework for representing the prime implicants of bi...