Hi,

Would some be able to help me to understand how you go about simplifying boolean algebra. I am trying to simplify the following:

A'.B'.C'.D + A'.B'.C.D + A.B'.C'.D + A.B'.C.D + A.B.C'.D


I don't really understand the rules of this.

Thanks
Krystal

 

Have a look at the information on boolean algebra contained in the AAC ebook at http://www.allaboutcircuits.com/vol_4/chpt_7/2.html.

hgmjr

 

Hi,

Would some be able to help me to understand how you go about simplifying boolean algebra. I am trying to simplify the following:

A'.B'.C'.D + A'.B'.C.D + A.B'.C'.D + A.B'.C.D + A.B.C'.D


I don't really understand the rules of this.

Thanks
Krystal

There are a couple of properties that you should learn.
1. Commutative.
2. Distributive.
3. Demorgan's Theorem.

Then identities allow you to simplify.
1. 0 AND anything = 0.
2. 1 OR anything = 1.
3. X AND 'X = 0. One of them must be zero, so identity 1 applies.
4. X OR 'X = 1. One of them must be a 1, so identity 2 applies.

Also look at Karnaugh Maps for a graphical way of solving.