This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Worst and Best Irredundant Sum-of-Products Expressions
September 2001 (vol. 50 no. 9)
pp. 935-948

Abstract—In an irredundant sum-of-products expression (ISOP), each product is a prime implicant (PI) and no product can be deleted without changing the function. Among the ISOPs for some function $f$, a worst ISOP (WSOP) is an ISOP with the largest number of PIs and a minimum ISOP (MSOP) is one with the smallest number. We show a class of functions for which the Minato-Morreale ISOP algorithm produces WSOPs. Since the ratio of the size of the WSOP to the size of the MSOP is arbitrarily large when $n$, the number of variables, is unbounded, the Minato-Morreale algorithm can produce results that are very far from minimum. We present a class of multiple-output functions whose WSOP size is also much larger than its MSOP size. For a set of benchmark functions, we show the distribution of ISOPs to the number of PIs. Among this set are functions where the MSOPs have almost as many PIs as do the WSOPs. These functions are known to be easy to minimize. Also, there are benchmark functions where the fraction of ISOPs that are MSOPs is small and MSOPs have many fewer PIs than the WSOPs. Such functions are known to be hard to minimize. For one class of functions, we show that the fraction of ISOPs that are MSOPs approaches 0 as $n$ approaches infinity, suggesting that such functions are hard to minimize.

[1] N.N. Biswas, “Computer-Aided Minimization Procedure for Boolean Functions,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 5, no. 2, pp. 303-304, Apr. 1986.
[2] A. Blake, “Canonical Expressions in Boolean Algebra,” dissertation, Dept. of Math., Univ. of Chicago, 1937.
[3] R.K. Brayton, G.D. Hachtel, C.T. McMullen, and A.L. Sangiovanni-Vincintelli, Logic Minimization Algorithms for VLSI Synthesis.Boston: Kluwer Academic, 1984.
[4] D.W. Brown, “A State-Machine Synthesizer—SMS,” Proc. 18th Design Automation Conf., June l981.
[5] A. Cayley, “A Theorem on Trees,” Quarterly J. Math., vol. 23, pp. 376-378, 1889.
[6] D.M.Y. Chang and T.H. Mott Jr., “Computing Irredundant Normal Forms Abbreviated Presence Functions,” IEEE Trans. Electronic Computers, vol. 14, pp. 335-342, June 1965.
[7] O. Coudert, “Two-Level Logic Minimization: An Overview,” Integrated VLSI J., vol. 17, pp. 97-140, Oct. 1994.
[8] M. Dagenais, V. Agrawal, and N. Rumin, “McBOOLE: A New Procedure for Exact Logic Minimization,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 5, no. 1, pp. 229-223, Jan. 1986.
[9] G. De, M. Hofmann, R. Newton, and A. Sangiovanni-Vincentelli, “A Design System for the PLA-Based Digital Circuits,” Advances in Computer-Aided Eng. Design, vol. 1, pp. 285-364, Jay Press, 1985.
[10] D.L. Dietmeyer, Logic Design of Digital Systems, Allyn and Bacon, Boston, 1971.
[11] B. Dunham and R. Fridshal, “The Problem of Simplifying Logical Expressions,” J. Symbolic Logic, vol. 24, pp. 17-19, 1959.
[12] M.J. Ghazala, “Irredundant Disjunctive and Conjunctive Forms of a Boolean Function,” IBM J. Research and Development, pp. 171-176, Apr. 1957.
[13] M.A. Harrison, Introduction to Switching and Automata Theory. McGraw-Hill, 1965.
[14] F. Harary, Graph Theory. Addison-Wesley, 1969.
[15] S.J. Hong, R.G. Cain, and D.L. Ostapko, “MINI: A Heuristic Approach for Logic Minimization,” IBM J. Research and Development, pp. 443-458, Sept. 1974.
[16] W.H. Kautz, “A Survey and Assessment of Progress in Switching Theory and Logical Design in the Soviet Union,” IEEE Trans. Electronic Computers, vol. 15, no. 2, pp. 164-204, Apr. 1966.
[17] R. McNaughton, “Unate Truth Functions,” IRE Trans. Electronic Computers, vol. 10, no. 1, pp. 1-6, 1961.
[18] A.R. Meo, “On the Synthesis of Many-Variable Switching Functions,” Networks and Switching Theory, G. Biorci, ed., chapter VI, pp. 470-482, New York: Academic Press, 1968.
[19] S. Minato, “Fast Generation of Prime-Irredundant Covers from Binary Decision Diagrams,” IEICE Trans. Fundamentals, vol. E76-A, no. 6, pp. 976-973, June 1993.
[20] E. Morreale, “Recursive Operators for Prime Implicant and Irredundant Normal Form Determination,” IEEE Trans. Computers, vol. 19, no. 6, pp. 504-509, June 1970.
[21] T.H. Mott Jr., “Determination of Irredundant Normal Forms of a Truth Function by Iterated Consensus of the Prime Implicants,” IEEE Trans. Electronic Computers, vol. 9, pp. 245-252, June 1960.
[22] S. Muroga,Logic Design and Switching Theory. New York: Wiley, 1979.
[23] R.J. Nelson, “Simplest Normal Truth Functions,” J. Symbolic Logic, pp. 105-108, June 1954.
[24] L. Nguyen, M. Perkowski, and N. Goldstein, "PALMINI—Fast Boolean Minimizer for Personal Computers," Proc. IEEE/ACM 24th Design Automation Conf., ACM Press, New York, 1987, pp. 615-621.
[25] B. Reusch, “Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering Problem,” IEEE Trans. Computers, pp. 924-930, Sept. 1975.
[26] R. Rudell and A. Sangiovanni-Vincentelli, “Multiple-Valued Minimization for PLA Optimization,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 6, no. 5, pp. 727-750, Sept. 1987.
[27] T. Sasao, “An Application of Multiple-Valued Logic to a Design of Programmable Logic Arrays,” Proc. 18th Int'l Symp. Multiple-Valued Logic, pp. 65-72, May 1978.
[28] T. Sasao, “Multiple-Valued Decomposition of Generalized Boolean Functions and the Complexity of Programmable Logic Arrays,” IEEE Trans. Computers, vol. 30, no. 9, pp. 635-643, Sept. 1981.
[29] T. Sasao, “Input Variable Assignment and Output Phase Optimization of PLA's,” IEEE Trans. Computers, vol. 33, no. 10, pp. 879-894, Oct. 1984.
[30] Representation of Discrete Functions, T. Sasao and M. Fujita, eds. Kluwer Academic, 1996.
[31] T. Sasao, “Ternary Decision Diagrams and Their Applications,” Representation of Discrete Functions, T. Sasao and M. Fujita, eds., chapter 12, Kluwer Academic, 1996.
[32] T. Sasao, Switching Theory for Logic Synthesis, pp. 269-270. Kluwer Academic, 1999..
[33] A. Svoboda and D.E. White, Advanced Logical Circuit Design Techniques. New York: Garland Press, 1979.
[34] Texas Instruments, The TTL Data Book for Design Engineers, pp. 308-311. Texas Instruments, 1973.
[35] P. Tison, “Generalization of Consensus Theory and Application to the Minimization of Boolean Functions,” IEEE Trans. Electronic Computers, pp. 446-456, Aug. 1967.
[36] B. Voight and I. Wegener, “A Remark on Minimal Polynomials of Boolean Functions,” CSL '88, Second Workshop Computer Science Logic Proc., pp. 372-383, 1989.
[37] S.V. Yablonski, “The Problem of Bounding the Length of Reduced Disjunctive Normal forms,” Prob. Kiber., vol. 7, pp. 229-230, in Russian, 1962.

Index Terms:
Logic minimization, complete sum-of-products expressions, irredundant sum-of-products, multiple-output functions, heuristic minimization, prime implicants, symmetric functions, minimum sum-of-products expressions, worst sum-of-products expressions, graph enumeration, minimally strongly connected digraphs.
Citation:
Tsutomu Sasao, Jon T. Butler, "Worst and Best Irredundant Sum-of-Products Expressions," IEEE Transactions on Computers, vol. 50, no. 9, pp. 935-948, Sept. 2001, doi:10.1109/12.954508
Usage of this product signifies your acceptance of the Terms of Use.