Minimization of SOPs for bi-decomposable functions and non-orthodox/orthodox functions
Approved for public release; distribution is unlimited. === A logical function f is AND bi-decomposable if it can be written as f x1, x2)= h1 (x1) h2(x2), where x1 and x2 are disjoint. Such functions are important because they can be efficiently implemented. Also many benchmark functions are AND bi-...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
Monterey, Calif. Naval Postgraduate School
2012
|
| Online Access: | http://hdl.handle.net/10945/6005 |