Polynomial-time algorithms for generation of prime implicants

Abstract A notion of a neighborhood cube of a term of a Boolean function represented in the canonical disjunctive normal form is introduced. A relation between neighborhood cubes and prime implicants of a Boolean function is established. Various aspects of the problem of prime implicants generation are identified and neighborhood cube-based algorithms for their solution are developed. The correctness of algorithms is proven and their time complexity is analyzed. It is shown that all presented algorithms are polynomial in the number of minterms occurring in the canonical disjunctive normal form representation of a Boolean function. A summary of the known approaches to the solution of the problem of the generation of prime implicants is also included.

[1]  A. Scheinman.  A method for simplifying Boolean functions , 1962 .

[2]  Nripendra N. Biswas.  Computer Aided Minimization Procedure for Boolean Functions , 1984, 21st Design Automation Conference Proceedings.

[3]  Yue-Sun Kuo.  Generating Essential Primes for a Boolean Function with Multiple-Valued Inputs , 1987, IEEE Transactions on Computers.

[4]  Antonin Svoboda.  Ordering of Implicants , 1967, IEEE Trans. Electron. Comput..

[5]  Eugenio Morreale,et al.  Partitioned List Algorithms for Prime Implicant Determination from Canonical Forms , 1967, IEEE Trans. Electron. Comput..

[6]  S. R. Das,et al.  Maxterm Type Expressions of Switching Functions and Their Prime Implicants , 1965, IEEE Trans. Electron. Comput..

[7]  Sureshchander.  Minimization of Switching Functions—A Fast Technique , 1975, IEEE Transactions on Computers.

[8]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[9]  Frank B. Hall.  Boolean prime implicants by the binary sieve method , 1962, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[10]  J. Shearer,et al.  Prime Implicants, Minimum Covers, and the Complexity of Logic Simplification , 1986, IEEE Transactions on Computers.

[11]  Michel Dagenais,et al.  McBOOLE: A New Procedure for Exact Logic Minimization , 1986, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[12]  Chester C. Carroll,et al.  A FAST ALGORITHM FOR BOOLEAN FUNCTION MINIMIZATION. , 1968 .

[13]  William Keister,et al.  The design of switching circuits , 1951 .

[14]  J. Roth.  Algebraic topological methods for the synthesis of switching systems. I , 1958 .

[15]  Robert S. Ledley,et al.  Digital Computer and Control Engineering , 1960 .

[16]  Melvin A. Breuer,et al.  Heuristic switching expression simplification , 1968, ACM National Conference.

[17]  Richard C. T. Lee,et al.  A New Algorithm for Generating Prime Implicants , 1970, IEEE Transactions on Computers.

[18]  Bernd Reusch,et al.  Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering Problem , 1975, IEEE Transactions on Computers.

[19]  Tom Rhyne,et al.  An algorithm for identifying and selecting the primed implicants of a multiple-output Boolean function , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[20]  W. Quine.  On Cores and Prime Implicants of Truth Functions , 1959 .

[21]  E. McCluskey.  Minimization of Boolean functions , 1956 .

[22]  Harold Fleisher,et al.  Minimizability of Random Boolean Functions , 1989, IEEE Trans. Computers.

[23]  Edward J. McCluskey,et al.  Introduction to the theory of switching circuits , 1965 .

[24]  Pierre L. Tison,et al.  Generalization of Consensus Theory and Application to the Minimization of Boolean Functions , 1967, IEEE Trans. Electron. Comput..

[25]  C. Y. Lee.  Switching functions on an n-dimensional cube , 1954, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[26]  Thomas K. Gaylord,et al.  Residue Number System Truth-Table Look-Up Processing—Moduli Selection and Logical Minimization , 1984, IEEE Transactions on Computers.

[27]  Raymond J. Nelson,et al.  Simplest normal truth functions , 1955, Journal of Symbolic Logic.

[28]  Rocco H. Urbano,et al.  A Topological Method for the Determination of the Minimal Forms of a Boolean Function , 1956, IRE Trans. Electron. Comput..

[29]  Midhat J. Ghazala.  Irredundant Disjunctive and Conjunctive Forms of a Boolean Function , 1957, IBM J. Res. Dev..

[30]  S. R. Das.  Comments on "A New Algorithm for Generating Prime Implicants" , 1971, IEEE Trans. Computers.

[31]  T. Sasao.  A Fast Complementation Algorithm for Sum-of-Products Expressions of Multiple-Valued Input Binary Functions, , 1983 .

[32]  John P. Hayes,et al.  Computer Architecture and Organization , 1980 .

[33]  J. P. Roth.  Design of automata theory of cubical complexes with applications to diagnosis and algorithmic description , 1972 .

[34]  Nicolae N. Necula.  A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function , 1967, IEEE Trans. Electron. Comput..

[35]  George Markowsky,et al.  On the number of prime implicants , 1978, Discret. Math..

[36]  Eugenio Morreale,et al.  Recursive Operators for Prime Implicant and Irredundant Normal Form Determination , 1970, IEEE Transactions on Computers.

[37]  Robert K. Brayton,et al.  Logic Minimization Algorithms for VLSI Synthesis , 1984, The Kluwer International Series in Engineering and Computer Science.

[38]  Vladislav Bubenik.  Weighting Method for the Determination of the Irredundant Set of Prime Implicants , 1972, IEEE Transactions on Computers.

[39]  Paul T. Hulina,et al.  Generation of Prime Implicants by Direct Multiplication , 1971, IEEE Transactions on Computers.

[40]  Kurt Bing,et al.  On simplifying truth-functional formulas , 1956, Journal of Symbolic Logic.

[41]  Daniel L. Ostapko,et al.  MINI: A Heuristic Approach for Logic Minimization , 1974, IBM J. Res. Dev..

[42]  Eugenio Morreale.  Computational Complexity of Partitioned List Algorithms , 1970, IEEE Transactions on Computers.

[43]  N.N. Necula.  An Algorithm for the Automatic Approximate Minimization of Boolean Functions , 1968, IEEE Transactions on Computers.

[44]  Giuseppe Caruso.  A Local Selection Algorithm for Switching Function Minimization , 1984, IEEE Transactions on Computers.

[45]  Sunil R. Das,et al.  Clause-Column Table Approach for Generating All the Prime Implicants of Switching Functions , 1972, IEEE Transactions on Computers.

[46]  Raymond Reiter,et al.  Foundations of Assumption-based Truth Maintenance Systems: Preliminary Report , 1987, AAAI.

[47]  Daniel L. Ostapko,et al.  Generating Test Examples for Heuristic Boolean Minimization , 1974, IBM J. Res. Dev..

[48]  M. Karnaugh.  The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.

[49]  Archie Blake.  Canonical expressions in Boolean algebra , 1938 .

[50]  Willard Van Orman Quine,et al.  The Problem of Simplifying Truth Functions , 1952 .