comp.lang.ada
 help / color / mirror / Atom feed
* Quinn-McClaskey Algorithm?
@ 1991-05-03  0:33 David M. Onder
  1991-05-03 11:41 ` Dave Johnson
  0 siblings, 1 reply; 8+ messages in thread
From: David M. Onder @ 1991-05-03  0:33 UTC (permalink / raw)



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.....
:):):):):):):):):):):):):):):):):):):):):):):):):):):):):):):):):):):):)
                            David M. Onder
                YSU Computer Information Center Analyst
                  BITNET   : taint021 @ ysub.bitnet
      INTERNET : taint021 @ ysub.ysu.edu or sronder  @ macs.ysu.edu

           /--------------------------------------------\
           |  "Assume a virtue though you have it not"  |
           |           {William Shakespeare}            |
           \--------------------------------------------/

^ permalink raw reply	[flat|nested] 8+ messages in thread

* Re: Quinn-McClaskey Algorithm?
  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
  0 siblings, 1 reply; 8+ messages in thread
From: Dave Johnson @ 1991-05-03 11:41 UTC (permalink / raw)


TAINT021@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



+-------------------------------------+---------------------------------------+
| David M. Johnson                    | If the radiance of a thousand suns    |
| c/o Electrical and Electronic Eng.  |   were to burst at once in the sky,   |
|     Merz Court                      | That would be like the splendor       |
|     Newcastle University            |   of the Mighty One...                |
|     Newcastle upon Tyne             | I am become Death                     |
|     NE1 7RU                         |   The destroyer of worlds.            |
+-------------------------------------+                                       |
|Janet : D.M.Johnson@uk.ac.newcastle  |                                       |
|ARPA  : D.M.Johnson@newcastle.ac.uk  |                The Mahbharata.        |
|UUCP  : ...ukc!newcastle!D.M.Johnson |                                       |
+-------------------------------------+---------------------------------------+

^ permalink raw reply	[flat|nested] 8+ messages in thread

* Re: Quinn-McClaskey Algorithm?
  1991-05-03 11:41 ` Dave Johnson
@ 1991-05-07 10:14   ` George Tzanatos
  1991-05-07 15:48     ` Steve Masticola
                       ` (2 more replies)
  0 siblings, 3 replies; 8+ messages in thread
From: George Tzanatos @ 1991-05-07 10:14 UTC (permalink / raw)


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

>TAINT021@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@minyos.xx.rmit.oz

Thanks in advance.

^ permalink raw reply	[flat|nested] 8+ messages in thread

* Re: Quinn-McClaskey Algorithm?
  1991-05-07 10:14   ` George Tzanatos
@ 1991-05-07 15:48     ` Steve Masticola
  1991-05-07 22:53     ` Robert Davies
  1991-05-07 23:26     ` Flying On A Canvas Wing
  2 siblings, 0 replies; 8+ messages in thread
From: Steve Masticola @ 1991-05-07 15:48 UTC (permalink / raw)


I remember from my darkest undergrad days that this book had the
Quine-McCluskey algorithm. There may be more recent references.

- Steve (masticol@cs.rutgers.edu).

   AUTHOR Hill, Fredrick J.
    TITLE Introduction to switching theory and logical design [by] Fredrick J.
          Hill [and] Gerald R. Peterson.
PUBLISHER New York, Wiley [1968]
  DESCRIP xiii, 449 p. illus. 23 cm.
    NOTES Includes bibliographies.
OTHER AUT Peterson, Gerald R., joint author.
OTHER TIL Switching theory and logical design.
 SUBJECTS Switching theory.
     ISBN 047139880X

^ permalink raw reply	[flat|nested] 8+ messages in thread

* Re: Quinn-McClaskey Algorithm?
  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
  1991-05-07 23:26     ` Flying On A Canvas Wing
  2 siblings, 1 reply; 8+ messages in thread
From: Robert Davies @ 1991-05-07 22:53 UTC (permalink / raw)


What is the Quinn-McClaskey Algorithm for minimising a logical function?

^ permalink raw reply	[flat|nested] 8+ messages in thread

* Re: Quinn-McClaskey Algorithm?
  1991-05-07 10:14   ` George Tzanatos
  1991-05-07 15:48     ` Steve Masticola
  1991-05-07 22:53     ` Robert Davies
@ 1991-05-07 23:26     ` Flying On A Canvas Wing
  1991-05-08 21:40       ` Quine-McCluskey Algorithm? Scott Johnson
  2 siblings, 1 reply; 8+ messages in thread
From: Flying On A Canvas Wing @ 1991-05-07 23:26 UTC (permalink / raw)


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

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

>>TAINT021@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@minyos.xx.rmit.oz

>Thanks in advance.

Add me, too. 

-- 
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
!jinx@milton.u.washington.edu!!Disclaimer: OFS.*           !
!                            !!*Obligatory Fucking Smiley  !
!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

^ permalink raw reply	[flat|nested] 8+ messages in thread

* Re: Quine-McCluskey Algorithm?
  1991-05-07 23:26     ` Flying On A Canvas Wing
@ 1991-05-08 21:40       ` Scott Johnson
  0 siblings, 0 replies; 8+ messages in thread
From: Scott Johnson @ 1991-05-08 21:40 UTC (permalink / raw)


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

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

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

>>>TAINT021@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@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

^ permalink raw reply	[flat|nested] 8+ messages in thread

* Re: Quinn-McClaskey Algorithm?
  1991-05-07 22:53     ` Robert Davies
@ 1991-05-10 18:48       ` Luciano Lavagno
  0 siblings, 0 replies; 8+ messages in thread
From: Luciano Lavagno @ 1991-05-10 18:48 UTC (permalink / raw)


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) |                                    |
+--------------------------+------------------------------------+

^ permalink raw reply	[flat|nested] 8+ messages in thread

end of thread, other threads:[~1991-05-10 18:48 UTC | newest]

Thread overview: 8+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
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
1991-05-07 23:26     ` Flying On A Canvas Wing
1991-05-08 21:40       ` Quine-McCluskey Algorithm? Scott Johnson

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox