Heuristic Minimization of AND-Exclusive OR Realization of Switching Functions.
IOWA UNIV IOWA CITY DEPT OF MATHEMATICS
Pagination or Media Count:
Based on certain heuristics, a computer algorithm has been developed to minimize the AND-EOR realization of a given switching function using both complemented and uncomplemented literals. Though no proof could be arrived at about the optimality or suboptimality of the procedure, computer results for the four variable case have been very encouraging, suggesting that similar procedures might lead to an optimim solution of this long standing problem. Author
- Computer Hardware