On covering distant minterms by the camp algorithm

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 adja...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on computer-aided design of integrated circuits and systems Vol. 9; no. 7; pp. 786 - 789
Main Author Biswas, N.N.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.07.1990
Institute of Electrical and Electronics Engineers
Subjects
Algorithm design and analysis
Applied sciences
Boolean functions
Design automation
Design. Technologies. Operation analysis. Testing
Electronics
Exact sciences and technology
Integrated circuits
Minimization methods
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Switches
Improvement
Integrated circuit
Theoretical study
Boolean function
Minimization
Algorithm
Computer aided design
Online AccessGet full text
ISSN0278-0070
DOI10.1109/43.55215

Cover

More Information
Summary: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.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0278-0070
DOI:10.1109/43.55215