ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Computer Aided Minimization Procedure for Boolean Functions

Biswas, Nripendra N (1984) Computer Aided Minimization Procedure for Boolean Functions. In: 21st Conference on Design Automation, 1984, 25-27 June, Albuqerque,New Mexico, pp. 699-702.


Download (409kB)


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

Item Type: Conference Paper
Publisher: IEEE
Additional Information: Copyright 1984 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 31 May 2006
Last Modified: 27 Feb 2019 08:57
URI: http://eprints.iisc.ac.in/id/eprint/6891

Actions (login required)

View Item View Item