Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!sdd.hp.com!hplabs!hpcc05!hpdmd48!ahill
From: ahill@hpdmd48.boi.hp.com (Andy Hill)
Newsgroups: sci.electronics
Subject: Re: Karnaugh Map Reduction.
Message-ID: <970026@hpdmd48.boi.hp.com>
Date: 31 Mar 91 22:35:05 GMT
References: <1991Mar31.004021.4460@maverick.ksu.ksu.edu>
Organization: Hewlett Packard - Boise, ID
Lines: 15

I don't know if you specifically need Karnaugh Map reduction or not, but I'll
assume that a generic boolean reduction program will meet your needs.

ESPRESSO is an excellent two-level (SOP) minimizer, while MIS does a good
job of multi-level minimization and optimization (although it's a lot harder
to use).  Both of these were developed at UC Berkeley, and they're usually
pretty easy to find (I'm not sure if they're public domain or not, but
Berkeley distributes them for academic use pretty darn cheaply).

If you can't find either of these, most decent advanced digital theory books
will have algorithms for boolean reduction that aren't particularly hard to
program (such as Cline-McCluskey).  For only six variables, you shouldn't
have to worry much about efficiency/speed.

              Andy