Quine-McCluskey Algorithm?

Scott Johnson sjohnson at texas.vlsi.sgi.com
Thu May 9 07:40:16 AEST 1991


In <1991May7.232640.12166 at milton.u.washington.edu> jinx at milton.u.washington.edu (Flying On A Canvas Wing) writes:

>s872607 at minyos.xx.rmit.oz.au (George Tzanatos) writes:

>>D.M.Johnson at newcastle.ac.uk (Dave Johnson) writes:

>>>TAINT021 at ysub.ysu.edu (David M. Onder) writes:


>>>>I am looking for an implementation of the Quinn-McClaskey Algorithm for
>>>>minimizing a logical function.  I need this as soon as possible so if
>>>>anyone has information or the source, please e-mail me!  Thank you.....

>>>I would like this as well, e-mail address below

>>Please add me to the list too.......s872607 at minyos.xx.rmit.oz

>>Thanks in advance.

>Add me, too. 

Aaah!  The *Quine*-*McCluskey* algorithm (professor McCluskey would turn
over in his lecturer chair if he saw all this) can be best found in any
book on logic design by (Edward) McCluskey himself, i.e. Logic Design
Principles Chapter 6 section 6 pages 215 on.  This isn't C source, but
it should be simple for anyone to create from this discussion.

sj



More information about the Comp.lang.c mailing list