Introduction to Logic and Switching Theory
Introduction to Logic and Switching Theory
PRONTO: Quick PLA product reduction
DAC '83 Proceedings of the 20th Design Automation Conference
PALMINI—fast Boolean minimizer for personal computers
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Absolute Minimization of Completely Specified Switching Functions
IEEE Transactions on Computers
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
DAC '85 Proceedings of the 22nd ACM/IEEE Design Automation Conference
CSC '85 Proceedings of the 1985 ACM thirteenth annual conference on Computer Science
Logic Synthesis and Verification
Cubical CAMP for minimization of Boolean functions
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
A fast computerized method for automatic simplification of boolean functions
ISTASC'09 Proceedings of the 9th WSEAS International Conference on Systems Theory and Scientific Computation
A new technique for realization of Boolean functions
AIKED'10 Proceedings of the 9th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases
Fast Karnough map for simplification of complex Boolean functions
ACS'10 Proceedings of the 10th WSEAS international conference on Applied computer science
| Hi-index | 0.00 |
The paper describes CAMP, a Computer Aided Minimization Procedure for Boolean functions. The procedure is based on theorems of switching theory and fully exploits the power of degree of adjacency. The program does not generate any superfluous prime implicant and all the essential and selective prime implicants are chosen with no or minimum iteration. For shallow functions consisting mainly of essential prime implicants (EPIs) and a few selective prime implicants (SPIs), CAMP produces the exact minimal sum of product form. For dense functions consisting of a large number of inter-connected cyclic SPI chains, the solution may not be exactly minimal, but near minimal.