[A83] Re: simplifying boolean functions (non-programming)
[Prev][Next][Index][Thread]
[A83] Re: simplifying boolean functions (non-programming)
Hmm, it's really no that hard.
A 2 var looks like this:
OO
OOY
X
A 3 var like this. Notice how it's copied and pasted And the middle part
is the new var
ZZ
OOOO
OOOOY
X X
Now let's extend it...
O = old possibilities, N = new possibilities
ZZ
OOOO
WOOOOY
WNNNN
NNNNY
X X
Thus a five var would look like this:
UUUU
ZZ ZZ
OOOONNNN
WOOOONNNNY
WOOOONNNN
OOOONNNNY
X X X X
You can extend it in this way, to whatever you like, even 75 vars (if you would
want to ;-)
Problem is legibility, since you'll have to write Var designations on top of
each other (like the U's and the Z's in the previous example
Send word if you get it (or not :-)
--Peter-Martijn
> It is indeed must easier when you do it with a Karnough diagram ;)
>
> Here's another question, Is it possible to calculate the 'lay-out' of a
> Karnough diagram. I already know how an 2, 3 and 4 variable karnough diagram
> looks like but don't know how an 5 variable karnough diagram looks like,
> despite trying a couple of times...
>
>
> I even made an ASM program which makes a truthtable on your calculator!!!
> (Perhaps not great news, but keep in mind that I have only started ASM
> programming last summer (including stupid things like loops) , and made this
> program all by myself :) )
>
> thanks
>
>
> >From: Peter-Martijn Kuipers <hyper@hysoft-automation.com>
> >Reply-To: assembly-83@lists.ticalc.org
> >To: assembly-83@lists.ticalc.org
> >Subject: [A83] Re: simplifying boolean functions (non-programming)
> >Date: Wed, 12 Sep 2001 21:16:14 +0200 (CEST)
> >
> >
> > > Can somebody help me with my homework, it's about boolean logic and
> >stuff
> > > and there is this question about simplyfying boolean functions
> >
> >Ahh, a challenge...
> >
> >(I've just got this stuff too...)
> >
> > > The function which must be simplified is, for example, like this,
> > > _ _ _ _ _
> > > abc + a.b.c.de + a.b + d
> > _ _
> > abc + de + a.b + d
> > _ _
> > abc + a.b + de + d
> > _ _
> > a.b + abc + d(e + 1)
> > _ _
> > a.b + abc + d
> >
> >Let's check it with a Karnough diagram....
> >
> >...with me, it turns out fine...
> >
> >Check it yourself...
> >
> >
> > > Easy ?? Wait a second !!! There is one catch (well 2 actually:))
> > > 1- You may not use a truthtable
> > > 2- You may not use a Karnough diagram
> >Ehm, that's not exactly right,
> >it means:
> >
> >You may not do it JUST by usinga Karnough diagram or truthtable,
> >but you must show the algebraic route...
> >
> >No one's gonna complain if you used one of them to find the answer, and
> >then worked to the answer algebraically...
> >
> >Like:
> >
> >a + ab +ac +abc.
> > it boils down to:
> >a
> >
> >;-)
> >
> >--Peter-Martijn
> >
> >
> > >
> > >
> > > Thus you have to use rules like a+a=a and that sort of rules. It's all
> >new
> > > to me, and I'm having quite a bit of problems with it.
> > > I'd be very very greatfull if somebody can explain this to me simply !!!
> > >
> > >
> > >
> > > _________________________________________________________________
> > > Get your FREE download of MSN Explorer at
> >http://explorer.msn.com/intl.asp
> > >
> > >
> > >
> >
> >
> >
>
>
> _________________________________________________________________
> Get your FREE download of MSN Explorer at http://explorer.msn.com/intl.asp
>
>
>
References: