Boolean Simplicifation -Sorry

Thread Starter

Iamthewalrus

Joined Mar 14, 2007
1
Hey guys.

I'm currently working on a circuit for school and i have arrived at this stage. I personally do not know where to go from this stage as there are 6 inputs and i have trouble with merely 2. Any help what so ever would be very much appreciated.

The underlines being the nots:

1. B.P.(D+S+F+M)
2. D.M.(P+S+F+B) + D.B.(P+S+F+M) + D.M.B.(P+S+F)


Thanks guys :)
 

Papabravo

Joined Feb 24, 2006
14,459
You need to start with DeMorgan's therorems. There are two of them. Then you need to express your formulas in the sum of products form. From this point there are a variety of techniques to minimize the expression. My favorite is the method of prime implicants.

Good Luck
 

Dave

Joined Nov 17, 2003
6,970
Hey guys.

I'm currently working on a circuit for school and i have arrived at this stage. I personally do not know where to go from this stage as there are 6 inputs and i have trouble with merely 2. Any help what so ever would be very much appreciated.

The underlines being the nots:

1. B.P.(D+S+F+M)
2. D.M.(P+S+F+B) + D.B.(P+S+F+M) + D.M.B.(P+S+F)


Thanks guys :)
Just so you know, 1 is in its simplest form.

I'm struggling a little with the original question. Can you explain more precisely what you are trying to do? Part 2 can be simplified in one of several ways depending on what you are trying to achieve.

Dave
 

recca02

Joined Apr 2, 2007
1,214
have you learned abt kernaugh map or quinn mcclusky methods.
wiyh those methods and a multiplexer you might be able to implement
the logic with lesser inputs or atleast with a less complicated expression.
 
Top