By Topic

On covering distant minterms by the camp algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
N. N. Biswas ; Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA

The computer-aided minimization procedure (CAMP) algorithm is a minterm-based computer-aided procedure for the minimization of single Boolean functions. Major modifications of the algorithm are presented. They allow it always to obtain the minimum cover covering all the uncovered minterms, both adjacent and distant, in the normal mode. In the branch mode, the solution may not be minimum in many cases. However, a new theorem introduced in the algorithm allows it to switch to the branch mode only when it is inevitable. The improved algorithm also has a mechanism which ensures the largest possible dimension for each cube of the solution

Published in:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  (Volume:9 ,  Issue: 7 )