luciano@canuck.Berkeley.EDU (Luciano Lavagno) (05/21/91)
Archive-name: math/logic/espresso/1991-05-10 Archive: shambhala.berkeley.edu:/pub/misII.tar.Z [128.32.132.54] Original-posting-by: luciano@canuck.Berkeley.EDU (Luciano Lavagno) Original-subject: Re: Quinn-McClaskey Algorithm? Reposted-by: emv@msen.com (Edward Vielmetti, MSEN) I know this does NOT strictly belong to any of the groups I am posting it to, but many people are asking information, so I will try to settle the question. 1) the Quine-McCluskey algorithm is a well known algorithm to obtain a minimum sum-of-products (e.g. f = a b' c + a' b + c') representation of a logic function (that is a function with domain {0,1}^n and range {0,1}) from an initial non-optimal sum-of-products representation of it. This finds applications mainly in combinational logic circuit synthesis (but not only there...). 2) the best implementation of this algorithm that I am aware of, is part of the "espresso" logic minimization program. It is available from this university for a nominal fee (there is also anonymous ftp, but that's a bit trickier...). Just send e-mail to erl@janus.berkeley.edu and ask them. Let me know if you have any problem... Luciano -- +--------------------------+------------------------------------+ |Luciano Lavagno | E-mail: luciano@ic.Berkeley.EDU | |Dept of EECS, Rm. 550B2-69| | |UC Berkeley | Phone: (415) 642-5012 | |Berkeley, CA 94720 (USA) | | +--------------------------+------------------------------------+ -- comp.archives file verification shambhala.berkeley.edu -rw-r--r-- 1 11 10 1567952 Oct 11 1990 /pub/misII.tar.Z found espresso ok shambhala.berkeley.edu:/pub/misII.tar.Z