The Fanout Structure of Switching Functions
Journal of the ACM (JACM)
Analysis and Design of Fanout-Free Networks of Positive Symmetric Gates
Journal of the ACM (JACM)
On the minimization of SOPs for bi-decomposition functions
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Switching Theory for Logic Synthesis
Switching Theory for Logic Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
A Remark on Minimal Polynomials of Boolean Functions
CSL '88 Proceedings of the 2nd Workshop on Computer Science Logic
Large-scale SOP minimization using decomposition and functional properties
Proceedings of the 40th annual Design Automation Conference
Elements of discrete mathematics (McGraw-Hill computer science series)
Elements of discrete mathematics (McGraw-Hill computer science series)
| Hi-index | 0.00 |
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 sub-functions is orthodox. This extends a previous result showing that divide-and-conquer derives the MSOP of the AND bi-decomposition of two orthodox functions. We show that divide-and-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.