(¬a.¬b.c.¬d)+(¬a.¬b.c.d) +(¬a.b.¬c.d)+(¬a.b.c.d)+(a.¬b.c.d)+(a.b.¬c.d)

+ = OR
. = AND
¬ = NOT

How do I simplify as much as possible?

Thanks

 

The best way to simplify Boolean equations is to look for patters. Which of the identities and properties look like they apply? Try them. Which rules of simplification look like they would work? Try them.

http://www.allaboutcircuits.com/vol_4/chpt_7/index.html has examples of how to do this sort of thing.

 

captainjapan,

How do I simplify as much as possible?

The first thing to do is to abandon the clunky, clumsy notation you use. Try
A'B'CD'+A'B'CD+A'BC'D+A'BCD+AB'CD+ABC'D which corresponds to maxterm numbers 2,3,5,7,11,13 . Next use a Karnaugh map, or a tabulation method like Quine-McCluskey to reduce the Boolean expression. You will then see other alternate simplifications too. Using the QM method I get:

A'B'C+B'CD+BC'D+A'CD or alternatively A'B'C+B'CD+BC'D+A'BD

Ratch