set@phobos.cis.ksu.edu (Steve E Tietze ) (03/31/91)
I'm just starting out in Computer eng. And I have a project due very soon. I was wondering if their was a Karnaugh Map Reduction program for unix that I could use. Im doing 6 var maps. ... ANY Help?? Please Email set@phobos.cis.ksu.edu
ahill@hpdmd48.boi.hp.com (Andy Hill) (04/01/91)
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.
Andyseningen@oakhill.sps.mot.com (Michael Seningen) (04/03/91)
Here's an interesting problem w/ Karnaugh Maps that isn't usually taught in undergrad digi design supppose I have 3 variable x, y, and z and they yield a function that generates a table as such x/y 00 01 11 10 --------------------- z 0 1 1 0 0 z 1 1 1 0 1 For what reason would I not want to use the equation X'+Y'Z by wrapping my loops around the 4 1's and then the 101 and 100 "1". ???? Hint: Think DFT cheers, Mike Seningen