A Minimal Universal Test Set for Self-Test of EXOR-Sum-of-Products Circuits
IEEE Transactions on Computers
A fast and efficient heuristic ESOP minimization algorithm
Proceedings of the 14th ACM Great Lakes symposium on VLSI
A heuristic algorithm to minimize ESOPs for multiple-output incompletely specified functions
GLSVLSI '06 Proceedings of the 16th ACM Great Lakes symposium on VLSI
Scalable multigigabit pattern matching for packet inspection
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Minimization of OR-XNOR expressions using four new linking rules
AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Improving ESOP-based synthesis of reversible logic using evolutionary algorithms
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II
Secure computations in a minimal model using multiple-valued ESOP expressions
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Exact ESOP expressions for incompletely specified functions
Integration, the VLSI Journal
Hi-index | 0.04 |
This paper presents a new operation (exorlink) and an algorithm to minimize Exclusive-OR Sum-of-Products expressions (ESOPs) for multiple valued input, two valued output, incompletely specified functions. Exorlink is a more powerful operation than any other existing one for this problem. Evaluation on benchmark functions is given and it proves the superiority of the program to those known from the literature