Prathima Agrawal
ABSTRACT
This paper describes two logic minimization algorithms. CAMP (Computer Aided Minimization Procedure) minimizes single functions. The minterms are covered either by essential prime implicants or by selective prime implicants. The two types of prime implicants are determined one at a time thus completely avoiding the computationally expensive covering problem. The adjacency of a minterm, that depends upon the proximity of this minterm with respect to other minterms on the Karnaugh map, guides the determination of prime implicants. This procedure is nonheuristic and has proved to be very efficient for large number of input variables. The multiple output minimization (MOM) algorithm generates the product terms with maximum sharing between the output functions. In addition to using adjacency, this procedure is also guided by the frequency with which a minterm is used by the functions. Examples show the performance of this algorithm to be equal or better than many other minimization procedures.
- 1.R. K. Brayton, G. D. Hachtel, C. T. McMullen, and A. L. Sangiovanni-Vincente!!i, Logic Minimization Algorithms for VLSI Synthesis, Boston, MA: Kluwer Academic Publishers, 1984. Google Scholar
Digital Library
- 2.P. Agrawal and M. J. Meyer, 'Automation in the Design of Finite-State Machines,' VLSI Design, Vol. V, pp. 74-84, September 1984.Google Scholar
- 3.E. J. McCiuskcy, Introduction to the Theory of Switching Circuits, New York: McGraw-Hill, 1965.Google Scholar
- 4.N. N. Biswas, 'Minimization of Boolean Functions,' IEEE Trans. on Computers, Vol. C-20, pp. 925-929, August 1971.Google Scholar
- 5.Surcshchandcr, "Minimization of Switching Functions - A Fast Technique,' IEEE Trans. on Computer, Vol. C-24, pp. 753-756, July 1975.Google Scholar
- 6.V. T. Rhync, P. S. Noc, M. H. McKinncy, and U. W. Pooch, 'A New Technique for the Fast Minimization of Switching Functions," IEEE Trans. on Computers, Vol. C-26, pp. 757-764, August 1977.Google Scholar
- 7.H. A. Curtis, 'Adjacency Table Method of Deriving Minimal Sums,' IEEE Trans. on Computers, Vol. C-26, pp. 1136-1141, November 1977.Google Scholar
- 8.Z. Arevalo and J. G. Bredeson, 'A Method to Simplify a Boolean Function into a Near Minimal Sum-of-Products for Programmablc Logic Arrays,' IEEE Trans. on Computers, Vol. C-27, pp. 1028-1039, Novcml~r 1978.Google Scholar
- 9.G. Caruso, 'A Local Selection Algorithm for Switching Function Minimization,' IEEE Trans. on Computers, Vol. C-33, pp. 91- 97, January 1984.Google Scholar
- 10.N. N. Biswas, 'Computer Aided Minimization Procedure for Boolean Functions,' Proc. 21st Design Automation Conference, Albuqurque, NM, June 1984, pp. 669-702. Google ScholarDigital Library
- 11.N. N. Biswas, Introduction to Logic and Switching Theory, New York: Gordon and Breach, 1975. Google ScholarDigital Library
- 12.S. J. Hong, R. G. Cain, and D. L. Ostapko, "MINI: A Hcuristic Approach for Logic Minimization,' IBM Journal of Res. and Dev., Vol. 18, pp. 443-458, September 1974.Google ScholarDigital Library
Index Terms
- Multiple output minimization
Recommendations
On multiple output bent functions
In this article we investigate the possibilities of obtaining multiple output bent functions from certain power polynomials over finite fields. So far multiple output bent functions F:GF(2)^n->GF(2)^m (where n is even and m= GF(2)^m, is a multiple ...
Cubical CAMP for minimization of Boolean functions
VLSID '96: Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile CommunicationThe paper presents QCAMP, a cube-based algorithm for minimization of single Boolean functions. The algorithm does not generate all the prime cubes, nor does it require the Off-set of the function. Two significant contributions of QCAMP are the UNATE ...
Minimization of Boolean Functions
The Quine-McCluskey method of minimizing a Boolean function gives all the prime implicants, from which the essential terms are selected by one or more cover tables known as the prime implicant tables. This note describes a tabular method where the ...
Comments