
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Tsutomu Sasao, Jon T. Butler, "Worst and Best Irredundant SumofProducts Expressions," IEEE Transactions on Computers, vol. 50, no. 9, pp. 935948, September, 2001.  
BibTex  x  
@article{ 10.1109/12.954508, author = {Tsutomu Sasao and Jon T. Butler}, title = {Worst and Best Irredundant SumofProducts Expressions}, journal ={IEEE Transactions on Computers}, volume = {50}, number = {9}, issn = {00189340}, year = {2001}, pages = {935948}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.954508}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Worst and Best Irredundant SumofProducts Expressions IS  9 SN  00189340 SP935 EP948 EPD  935948 A1  Tsutomu Sasao, A1  Jon T. Butler, PY  2001 KW  Logic minimization KW  complete sumofproducts expressions KW  irredundant sumofproducts KW  multipleoutput functions KW  heuristic minimization KW  prime implicants KW  symmetric functions KW  minimum sumofproducts expressions KW  worst sumofproducts expressions KW  graph enumeration KW  minimally strongly connected digraphs. VL  50 JA  IEEE Transactions on Computers ER   
Abstract—In an irredundant sumofproducts 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
[1] N.N. Biswas, “ComputerAided Minimization Procedure for Boolean Functions,” IEEE Trans. ComputerAided Design of Integrated Circuits and Systems, vol. 5, no. 2, pp. 303304, 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. SangiovanniVincintelli, Logic Minimization Algorithms for VLSI Synthesis.Boston: Kluwer Academic, 1984.
[4] D.W. Brown, “A StateMachine Synthesizer—SMS,” Proc. 18th Design Automation Conf., June l981.
[5] A. Cayley, “A Theorem on Trees,” Quarterly J. Math., vol. 23, pp. 376378, 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. 335342, June 1965.
[7] O. Coudert, “TwoLevel Logic Minimization: An Overview,” Integrated VLSI J., vol. 17, pp. 97140, Oct. 1994.
[8] M. Dagenais, V. Agrawal, and N. Rumin, “McBOOLE: A New Procedure for Exact Logic Minimization,” IEEE Trans. ComputerAided Design of Integrated Circuits and Systems, vol. 5, no. 1, pp. 229223, Jan. 1986.
[9] G. De, M. Hofmann, R. Newton, and A. SangiovanniVincentelli, “A Design System for the PLABased Digital Circuits,” Advances in ComputerAided Eng. Design, vol. 1, pp. 285364, 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. 1719, 1959.
[12] M.J. Ghazala, “Irredundant Disjunctive and Conjunctive Forms of a Boolean Function,” IBM J. Research and Development, pp. 171176, Apr. 1957.
[13] M.A. Harrison, Introduction to Switching and Automata Theory. McGrawHill, 1965.
[14] F. Harary, Graph Theory. AddisonWesley, 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. 443458, 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. 164204, Apr. 1966.
[17] R. McNaughton, “Unate Truth Functions,” IRE Trans. Electronic Computers, vol. 10, no. 1, pp. 16, 1961.
[18] A.R. Meo, “On the Synthesis of ManyVariable Switching Functions,” Networks and Switching Theory, G. Biorci, ed., chapter VI, pp. 470482, New York: Academic Press, 1968.
[19] S. Minato, “Fast Generation of PrimeIrredundant Covers from Binary Decision Diagrams,” IEICE Trans. Fundamentals, vol. E76A, no. 6, pp. 976973, June 1993.
[20] E. Morreale, “Recursive Operators for Prime Implicant and Irredundant Normal Form Determination,” IEEE Trans. Computers, vol. 19, no. 6, pp. 504509, 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. 245252, 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. 105108, 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. 615621.
[25] B. Reusch, “Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering Problem,” IEEE Trans. Computers, pp. 924930, Sept. 1975.
[26] R. Rudell and A. SangiovanniVincentelli, “MultipleValued Minimization for PLA Optimization,” IEEE Trans. ComputerAided Design of Integrated Circuits and Systems, vol. 6, no. 5, pp. 727750, Sept. 1987.
[27] T. Sasao, “An Application of MultipleValued Logic to a Design of Programmable Logic Arrays,” Proc. 18th Int'l Symp. MultipleValued Logic, pp. 6572, May 1978.
[28] T. Sasao, “MultipleValued Decomposition of Generalized Boolean Functions and the Complexity of Programmable Logic Arrays,” IEEE Trans. Computers, vol. 30, no. 9, pp. 635643, Sept. 1981.
[29] T. Sasao, “Input Variable Assignment and Output Phase Optimization of PLA's,” IEEE Trans. Computers, vol. 33, no. 10, pp. 879894, 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. 269270. 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. 308311. Texas Instruments, 1973.
[35] P. Tison, “Generalization of Consensus Theory and Application to the Minimization of Boolean Functions,” IEEE Trans. Electronic Computers, pp. 446456, 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. 372383, 1989.
[37] S.V. Yablonski, “The Problem of Bounding the Length of Reduced Disjunctive Normal forms,” Prob. Kiber., vol. 7, pp. 229230, in Russian, 1962.