Topological Properties of Hypercubes
IEEE Transactions on Computers
Minimization Algorithms for Multiple-Valued Programmable Logic Arrays
IEEE Transactions on Computers
Efficient use of large don't cares in high-level and logic synthesis
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
A fault tolerant routing algorithm based on cube algebra for hypercube systems
Journal of Systems Architecture: the EUROMICRO Journal
Worst and Best Irredundant Sum-of-Products Expressions
IEEE Transactions on Computers
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
A chart method for simplifying truth functions
ACM '52 Proceedings of the 1952 ACM national meeting (Pittsburgh)
Large-scale SOP minimization using decomposition and functional properties
Proceedings of the 40th annual Design Automation Conference
Multi-level logic minimization using implicit don't cares
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
McBOOLE: A New Procedure for Exact Logic Minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Multiple-Valued Minimization for PLA Optimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
In this study, a novel OFF-set based direct-cover Exact Minimization Algorithm (EMA) is proposed for single-output Boolean functions represented in a sum-of-products form. To obtain the complete set of prime implicants covering the given Target Minterm (ON-minterm), the proposed method uses OFF-cubes (OFF-minterms) expanded by this Target Minterm. The amount of temporary results produced by this method does not exceed the size of the OFF-set. In order to achieve the goal of this study, which is to make faster computations, logic operations were used instead of the standard operations. Expansion OFF-cubes, commutative absorption operations and intersection operations are realized by logic operations for fast computation. The proposed minimization method is tested on several classes of benchmarks and then compared with the ESPRESSO algorithm. The results show that the proposed algorithm obtains more accurate and faster results than ESPRESSO does.