Briefly explain the camp-ii algorithm with one example
Answers
CAMP is an algorithm for two-level Boolean function minimization. It was developed by Biswas. It is called the Computer Aided Minimization Procedure. It selected all the essential prime cubes in the first phase and attempted to choose a minimum cover from the selective prime cubes in the second phase. It could not sense the presence of an uncovered distant minterm sometimes and would fail to do so.
In 1990, Biswas modified and improved it. He named it CAMP-II. In the normal mode it always obtains the minimum cover including all the minterms, both adjacent and distant ones.
It is a computer aided minimization technique for Boolean functions. No superfluous prime implicant is generated by the program. All the essential and selective prime implicants are chosen with no or minimum iteration.