Abstract
Efficient algorithms are described for decomposition and factorization of Boolean expressions. The method uses only two-literal single-cube divisors and double-cube divisors considered concurrently with their complementary expressions. It is demonstrated that these objects, despite their simplicity, provide a very good framework to reason about common algebraic divisors and the duality relations between expressions. The algorithm was implemented and excellent results on several benchmark circuits illustrate its efficiency and effectiveness.
Cite
CITATION STYLE
Vasudevamurthy, J., & Rajski, J. (1990). A method for concurrent decomposition and factorization of Boolean expressions. In 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers (pp. 510–513). Publ by IEEE. https://doi.org/10.1007/978-1-4615-0292-0_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
