Need Help in Boolean Equation

[TruthAdjuster]

Can anybody help me simplify the boolean equation:

~(((S^D)&(S^P))^S)

Thank you.

[Clearcode]

My Boolean algebra is a bit rusty but:


S D P Res
-------------------------------
0 0 0 1
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 0
1 1 0 0
1 1 1 0


for NOT(((S OR D) AND (S OR P)) OR S)

:. NOT S AND NOT (D AND P)




HTH,
D.

-------------------------------------------------
Ex. Datis: Duncan Jones
Merrion Computing Ltd
http://www.merrioncomputing.com

[TruthAdjuster]

Thank you Clearcode. Well, I'd already finalize my assembler codes. It was actually a raster operation that I coded in low-level for a driver. Thanks man.

[Clearcode]

No problem. It's so long since I did Boolean algebra at college that I had to do it out longhand, as you see.

-------------------------------------------------
Ex. Datis: Duncan Jones
Merrion Computing Ltd
http://www.merrioncomputing.com