Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site wjvax.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxl!ihnp4!zehntel!hplabs!pesnta!wjvax!alan
From: alan@wjvax.UUCP (Alan Wickstrom)
Newsgroups: net.sources
Subject: boolean reduction program, 'qm'
Message-ID: <176@wjvax.UUCP>
Date: Tue, 14-Aug-84 20:09:45 EDT
Article-I.D.: wjvax.176
Posted: Tue Aug 14 20:09:45 1984
Date-Received: Thu, 16-Aug-84 03:45:35 EDT
Organization: Watkins Johnson, San Jose, Calif.
Lines: 37

Does anyone remember a source which appeared on the net quite
some time ago called, 'qm' ?  Did anyone try using it?

(FOR THOSE WHO DIDN'T)	   qm would take a boolean specification in one of three
			   forms, truth table, expression, or kmap, and would
			   generate the minimal equations from same.

Did you notice that it took cpu *days* of time to turn out fairly simple
problems with as few as 6 variables ?

Is anyone interested in a heavily modified,
(hopefully an upgrade of several orders),
version which will be called 'superqm' ?

HIGHLIGHTS:

It runs in a very small fraction of the time 'qm' took.
It allows for maxterm specification as well as minterm.
It has provisions intended to make PALASM (tm MMI) work easier.
It can accept multi-output truth tables and produce equations
	for each output column in one swell foop.

If you have had any experiences with 'qm', or if you have any interest
in the new source, please respond by mail.   If enough queries come
in, I'll post the source for all.  Thanks.

	"A man's reach should exceed his grasp."	Alan Wickstrom
							Watkins-Johnson Co.
							San Jose, Calif.
							(...ios!wjvax!alan)

-- 

	"A man's reach should exceed his grasp."	Alan Wickstrom
							Watkins-Johnson Co.
							San Jose, Calif.
							(...ios!wjvax!alan)