The development of a new strategy for obtaining prime implicants of a Boolean function

摘要

We present the CAMP DEUSTO computational method for obtaining the prime implicants of Boolean functions. In this method, we develop a searching strategy. With respect to a classical method - like Quine-McCluskey-, CAMP DEUSTO proves to be faster, uses less computational requirements and can process functions with a greater number of variables.