A fast method to derive minimum SOPs for decomposable functions

- This paper shows that divide-and-conquer derives a minimum sum-of-products expression (MSOP) of functions that have an AND bi-decomposition when at least one of the subfunctions is orthodox. This extends a previous result showing that divide-and-conquer derives the MSOP of the AND bidecomposition of two orthodox functions. We show that divideand-conquer does not always produce an MSOP when neither function is orthodox. However, our experimental results show that, in this case, it derives a near minimal SOP. At the same time, our approach significantly reduces the time needed to find an MSOP or near minimal SOP. Also, we extend our results to functions that have a tri-decomposition.

• Type: Conference
• Year: 2004
• Where: ASPDAC
• Authors: Tsutomu Sasao, Jon T. Butler
• Keywords: ASPDAC 2004, Minimal Sop, Minimum Sum-of-products Expression, Show