Application of the constrained implicants set concept to the minimization of binary functions
Approved for public release; distribution in unlimited. === Several heuristics and algorithms have been developed to find minimal sum-of-products expressions in binary logic. Most of them use prime implicants during minimization process. An efficient search strategy has been developed for finding mi...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
Monterey, California. Naval Postgraduate School
2013
|
| Online Access: | http://hdl.handle.net/10945/37568 |