Boolean Algebra

Thread Starter

nal

Joined Oct 27, 2004
3
Dear all

Im doing a project with designing circiuts, as a beginner i am finding it hard to simplify the expressions (using boolean algebra) that i have recieved from my truth tabels, any help?
 

ocean

Joined Oct 29, 2004
2
Hi..

well, as I understand .. the solution of your problem is to use K-map to find the minimum expression of the function.
 

arvind

Joined Nov 4, 2004
18
hi,
as suggested by ocean i think k(karnaugh) maps are the best way to simplify the expressions.
other than that u can use the GENERAL BOOLEAN ALGEBRA RULES AND demorgan laws:

A +A=A
A.A=A
A + 1=1
A.1 = A etc.

(ABCD..)' = A' + B' + C'+ D'....
(A + B +C+D+...)' = A'B'C'D'E'...
etc. :rolleyes: :rolleyes: :rolleyes: :rolleyes: :) :) :) :) :D :D :D :D :D :D
 
Top