From: luciano@canuck.Berkeley.EDU (Luciano Lavagno)
Subject: Re: Quinn-McClaskey Algorithm?
Date: 10 May 91 18:48:47 GMT [thread overview]
Message-ID: <42105@ucbvax.BERKELEY.EDU> (raw)
In-Reply-To: 1991May7.225307.28404@am.dsir.govt.nz
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) | |
+--------------------------+------------------------------------+
next prev parent reply other threads:[~1991-05-10 18:48 UTC|newest]
Thread overview: 8+ messages / expand[flat|nested] mbox.gz Atom feed top
1991-05-03 0:33 Quinn-McClaskey Algorithm? David M. Onder
1991-05-03 11:41 ` Dave Johnson
1991-05-07 10:14 ` George Tzanatos
1991-05-07 15:48 ` Steve Masticola
1991-05-07 22:53 ` Robert Davies
1991-05-10 18:48 ` Luciano Lavagno [this message]
1991-05-07 23:26 ` Flying On A Canvas Wing
1991-05-08 21:40 ` Quine-McCluskey Algorithm? Scott Johnson
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox