Abstract
This chapter presents both exact and heuristic two-level logic minimization algorithms. For exact logic minimization, it shows various techniques to reduce the complexity of covering problems, discusses branching heuristics, and presents several methods to prune the recursions. For heuristic minimization, it presents the core procedures of the ESPRESSO minimizes Finally, the chapter surveys various works related to two-level logic minimization.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Z. Arevalo, J. G. Bredeson, “A method to simplify a Boolean function into a near minimal sum-of-products for programmable logic arrays,” IEEE Trans, on Comput., C-27, pp. 1028–1039, Nov. 1978.
M. Auguin, F. Boeri, and C. Andre, “An algorithm for designing multiple Boolean functions: Application to PLA’s,” Digital Process, Vol. 4, No. 3-4, pp. 215–230, 1978.
T.C. Bartee, “Computer design of multiple-output logical networks,” IRE Trans, on Elect. and Comp., pp. 21–30, March 1961.
T.C. Bartee, I.L. Lebow, I.S. Reed, Theory and Design of Digital Machines, McGraw-Hill, New York, 1962.
Ph. W. Besslich and P. Pichlbauer, “Fast transform procedure for the generation of near minimal covers of Boolean functions,” IEE Proc., Vol. 128, Part E, No. 6, pp. 250–254, Nov. 1981.
N.N. Biswas, Introduction to Logic and Switching Theory, Gordon & Breach Science, New York, 1975.
N. N. Biswas, “Computer aided minimization procedure for Boolean functions,” DAC84, pp. 699–702, June 1984.
R.K. Brayton, G.D. Hachtel, C.T. McMullen, and A.L. Sangiovanni-Vincentelli, Logic Minimization Algorithms for VLSI Synthesis, Kluwer Academic Publishers, Dordrecht, 1984.
R.K. Brayton, P.C. McGeer, J. Sanghavi, and A.L. Sangiovanni-Vincentelli, “A new exact minimizer for two-level logic synthesis,” Logic Synthesis and Optimization, pp. 1–31, T. Sasao Ed., Kluwer Academic Publishers, Dordrecht, 1993.
R.E. Bryant, “Graph-based algorithms for Boolean functions manipulation,” IEEE Trans, on Comp., C-35, No. 8, pp. 677–692, Aug. 1986.
R.E. Bryant, “Symbolic Boolean Manipulations with Ordered Binary Decision Diagrams,” ACM Computing Surveys, Vol. 24, No. 3, pp. 293–318, Sept. 1992.
G. Caruso, “A selection algorithm for switching function minimization,” IEEE Trans, on Comput., C-33, No. 1, pp. 91–97, Jan. 1984.
A.K. Chandra, G. Markowsky, “On the Number of Prime Implicants” Discrete Mathematics, Vol. 24, pp. 7–11, 1978.
O. Coudert and J.C. Madre, “Implicit and incremental computation of primes and essential primes of Boolean functions,” Proc. 29th DAC, CA, USA, pp. 36–39, June 1992.
O. Coudert and J.C. Madre, “A new graph based prime computation technique,” Logic Synthesis and Optimization, pp. 33–57, T. Sasao Ed., Kluwer Academic Publishers, Dordrecht, 1993.
O. Coudert and J.C. Madre, “Towards a symbolic logic minimization algorithm,” Proc. VLSI Design, Bombay, India, Jan. 1993.
O. Coudert and J.C. Madre, “Fault tree analysis: 1020 prime implicants and beyond,” Proc. Annual Reliability and Maintainability Symp., Atlanta, GA, USA, pp. 240–245, Jan. 1993.
O. Coudert, J.C. Madre, and H. Fraisse, “A new viewpoint on two-level logic minimization,” Proc. 30th DAC, Dallas, TX, USA, pp. 625–630, June 1993.
O. Coudert, J. C. Madre, H. Fraisse, and H. Touati, “Implicit prime cover computation: An overview” Proc. of SASIMI′93, Nara, Japan, Oct. 1993.
O. Coudert, “Two-level logic minimization: An overview,” Integration, Vol. 17, No. 2, pp. 97–140, Oct. 1994.
O. Coudert, “Doing two-level logic minimization 100 times faster,” Proc. of Symposium on Discrete Algorithms (SODA), pp. 112–121, CA, Jan. 1995.
O. Coudert and J. C. Madre, “New ideas for solving covering problems,” Proc. of 32nd DAC, pp. 641–646, CA, June 1995.
O. Coudert, “On Solving Covering Problems,” Proc. of 33rd DAC, pp. 197–202, Las Vegas NV, June 1996.
R.B. Cutler and S. Muroga, “Useless prime implicants of incompletely specified multiple-output switching functions,” Int’l Journal of Computer and Information Sciences, Vol. 9, No. 4, 1980.
M. R. Dagenais, V. K. Agarwal, and N. C. Rumin, “McBoole: A new procedure for exact logic minimization,” IEEE TCAD, Vol. CAD-5, No. 1, pp. 229–233, Jan. 1986.
S. R. Das, “A new algorithm for generating prime implicants,” IEEE Trans. on Comput., C-20, No. 12, pp. 1614–1615, 1971.
D. L. Dietmeyer, Logic Design of Digital Systems (2nd Edition), Allyn and Bacon Inc., Boston, 1978.
J. Doyle, “A truth maintenance system,” Artificial Intelligence, Vol. 12, pp. 231-271, 1979.
B. Dunham and R. Fridshal, “The problem of simplifying logical expressions,” Journal of Symbolic Logic, Vol. 24, pp. 17–19, 1959.
J.F. Gimpel, “A reduction technique for prime implicant tables,” IEEE Trans. on Elect. Comp., EC-14, pp. 535–541, 1965.
E.I. Goldberg, L.P. Carloni, T. Villa, R.K. Brayton, and A.L. Sangiovanni-Vincentelli, “Negative thinking by incremental problem solving: Application to unate covering,” Proc. of ICCAD′97, pp. 91–97, 1997.
G. D. Hachtel and F. Somenzi, Logic Synthesis and Verification Algorithms, Kluwer Academic Publishers, Boston, 1996.
D.F. Hasl, “Advanced concepts in fault tree analysis,” Proc. System Safety Symposium, Seattle, USA, June 1965.
F. J. Hill and G. R. Peterson, Computer Aided Logic Design with Emphases on VLSI, Wiley, 1993.
S.J. Hong, R.G. Cain, and D.L. Ostapko, “MINI: A heuristic approach for logic minimization,” IBM Journal R&D, pp. 443–458, 1974.
S.J. Hong and S. Muroga, “Absolute minimization of completely specified switching functions,” IEEE Trans. on Comp., Vol. 40, pp. 53–65, 1991.
H.R. Hwa, “A method for generating prime implicants of a Boolean expression,” IEEE Trans. on Comp., pp. 637–641, June 1974.
Y. Igarashi, “An improved lower bound on the maximum number of prime implicants,” IEICE Trans., E62-6, pp. 389–394, June 1979.
M. Karnaugh, “The map method for synthesis of combinational logic circuits,” AIEE Trans. on Comm. & Elect., Vol. 9, pp. 593–599, 1953.
J. De Kleer, “An assumption-based TMS,” Artificial Intelligence, Vol. 28, pp. 127-162, 1986.
J. De Kleer and B.C. Williams, “Diagnosing multiple faults,” Artificial Intelligence, Vol. 32, pp. 97–130, 1987.
Z. Kohavi, Switching and Finite Automata Theory, McGraw-Hill Book Co., 1970.
Y. S. Kuo, “Generating essential primes for a Boolean function with multiple-valued inputs,” IEEE Trans, on Comput., Vol. C-36, No. 3, March 1987.
S. Liao and S. Devadas, “Solving covering problems using LPR-based lower bounds,” Proc. 34th DAC Conference, Anaheim, CA, USA, pp. 117–120, June 1997.
B. Lin, O. Coudert, and J.C. Madre, “Symbolic prime generation for multiple-valued functions,” Proc. 29th DAC, pp. 40–44, June 1992.
E.L. Jr. McCluskey, “Minimization of Boolean functions,” Bell System Technical Journal, Vol. 35, pp. 1417–1444, April 1959.
E.L. Jr. McCluskey and H. Schorr, “Essential multiple output prime implicants,” Proc. Symp. on Math. Theory of Automata, Vol. 12, Polytech. Inst. of Brooklyn, New York, NY, pp. 437–457, April 1962.
E. J. McCluskey, Introduction to the Theory of Switching Circuits, McGraw-Hill, New York, 1965.
P.C. McGeer, J. Sanghavi, R.K. Brayton, and A.L. Sangiovanni-Vincentelli, “ESPRESSO-SIGNATURE: A new exact minimizer fo logic functions,” IEEE Trans. on VLSI, Vol. 1, No. 4, pp. 432–440, Dec. 1993.
C. McMullen and J. Shearer, “Prime implicants, minimum covers, and the complexity of logic simplification” IEEE Trans. on Comp., Vol. C-35, pp. 761–762, Aug. 1986.
G. De Micheli, Synthesis and Optimization of Digital Circuits, McGraw-Hill, 1994.
F. Mileto and G. Putzolu, “Average values of quantities appearing in Boolean function minimization,” IEEE TEC, Vol. EC-13, No. 4, pp. 87–92, April 1964.
S. Minato, “Fast generation of prime-irredundant covers from binary decision diagrams,” IEICE Trans. Fundamentals, Vol. E76-A, No. 6, pp. 967–973, June 1993.
E. Morreale, “Recursive operators for prime implicant and irredundant normal form determination,” IEEE Trans. on Comp., Vol. C-19, PP. 504–509, June 1970.
T. H. Mott Jr., “Determination of irredundant formal forms of a truth function by iterated consensus of the prime implicants,” IRE TEC, pp. 245–252, June 1960.
S. Muroga, Logic design and Switching Theory, Wiley-Interscience Publication, 1979.
D. L. Ostapko and S. J. Hong, “Generating test examples for heuristic Boolean minimization,” IBM J. Res. and Develop., Vol. 18, pp. 459–464, Sept. 1974.
W.V.O. Quine, “The problem of simplifying truth functions,” American Math. Monthly, Vol. 59, pp. 521–531, 1952.
W.V.O. Quine, “A way to simplify truth functions,” American Math. Monthly, Vol. 62, pp. 627–631, 1955.
W.VO. Quine, “On cores and prime implicants of truth functions,” American Math. Monthly, Vol. 66, pp. 755–760, 1959.
R. Reiter, “A theory of diagnosis from first principles,” Artificial Intelligence, Vol. 32, pp. 57–95, 1987.
R. Reiter and J. de Kleer, “Foundations for assumption-based truth maintenance systems,” Proc. AAAI National Conference′87, Seattle, pp. 183–188, July 1987.
V.T Rhyne, P.S. Noe, M.H. McKinney, and U.W. Pooch, “A new technique for the fast minimization of switching functions,” IEEE Trans, on Comp., Vol. C-26, No. 8, pp. 757–764, 1977.
J. A. Robinson, “A machine-oriented logic based on the resolution principle,” Journal of ACM, Vol. 12, pp. 23–41, 1965.
S. Robinson and R. House, “Gimpel’s reduction technique extended to the covering problem with costs,” IEEE Trans, on Elect. Comp., Vol. EC-16, pp. 509–514, Aug. 1967.
J.P. Roth, “Algebraic Topological Methods for the Synthesis of Switching Systems,” Trans, of American Math. Society, Vol. 88, No. 2, pp. 301–326, 1958.
R.L. Rudell, Multiple-Valued Logic Minimization for PLA Synthesis, Research Report, UCB M86/65, 1986.
R.L. Rudell and A.L. Sangiovanni-Vincentelli, “Multiple valued minimization for PLA optimization,” IEEE Trans, on CAD, Vol. 6, No. 5, pp. 727–750, Sept. 1987.
R.L. Rudell, “Logic Synthesis for VLSI Design”, PhD Thesis, UCB/ERL M89/49, 1989.
T. Sasao, “An application of multiple-valued logic to a design of programmable logic arrays,” Proc. Intl Symp. on Multiple-Valued Logic, pp. 65–72, May 1978.
T. Sasao, “Input variable assignment and output phase optimization of PLA’s,” IEEE TC, Vol. C-33, No. 10, pp. 879-894 Oct. 1984.
T. Sasao, “HART: A hardware for logic minimization and verification,” ICCD ′85, New York, pp. 713–718, Oct. 7–10, 1985.
T. Sasao, “Ternary decision diagrams and their applications,” Chap. 12 of Representations of Discrete Functions, Kluwer Academic Publishers, 1996.
T. Sasao and J. T. Butler, “On the minimization of SOPs for bi-decomposable functions,” ASP-DAC ′2001, Japan, Jan. 2001.
T. Sasao and J. T. Butler, “Worst and best irredundant sum-of-products expressions,” IEEE Trans, on Comp., Vol. 50, No. 9, Sept. 2001.
J.R. Slage, C.L. Chang, and R.C.T. Lee, “Completeness theorems for semantics resolution in consequence finding,” Proc. Int. Join Conference on Artificial Intelligence, pp. 281–285, 1969.
J.R. Slage, C.L. Chang, and R.C.T. Lee, “A new algorithm for generating prime implicants,” IEEE Trans, on Comp., Vol. C-19, No. 4, pp. 304–310, 1970.
A. Svoboda and D. E. White, Advanced Logical Circuit Design Techniques, Garland Press, New York, 1979.
G.M. Swamy, P. McGeer, and R.K. Brayton, “A fully Quine-McCluskey procedure using BDD’s,” Proc. IWLS′93, May 1993.
P. Tison, “Generalized consensus theory and application to the minimization of Boolean functions,” IEEE Trans, on Elect. Comp., Vol. EC-16, No. 4, pp. 446–456, 1967.
K-N. Wong, “New heuristic for the exact minimization of logic functions,” IEEE Int’l Symp. on Circuits and Systems, pp. 1865–1868, 1988.
S. Yang, Logic Synthesis and Optimization Benchmarks User Guide, Microelectronics Center of North Carolina, Jan. 1991.
M. H. Young and S. Muroga, “Symmetric minimal covering problem and minimal PLA’s with symmetric variables,” IEEE Trans, on Comput., Vol. C-34, No. 6, pp. 523–541, June 1985.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Coudert, O., Sasao, T. (2002). Two-Level Logic Minimization. In: Hassoun, S., Sasao, T. (eds) Logic Synthesis and Verification. The Springer International Series in Engineering and Computer Science, vol 654. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-0817-5_1
Download citation
DOI: https://doi.org/10.1007/978-1-4615-0817-5_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5253-2
Online ISBN: 978-1-4615-0817-5
eBook Packages: Springer Book Archive