Abstract
A new algorithm, called the Frontiers algorithm, for optimizing the number of product terms required for the implementation of monotonic and permuted monotonic MVL functions is proposed. An experimental system restricted to the case of 2-variable 4-valued set of logic functions has been programmed using the C language and was interfaced to the HAMLET CAD tool to implement the proposed algorithm. The system was tested using 2231 randomly generated monotonic and permuted monotonic functions. The results obtained indicate that the frontiers-based algorithm compares favorably to existing heuristic minimization techniques with the added advantage that it requires less number of implicants to represent the target functions.