Boolean Algebra

Discussion in 'Homework Help' started by nal, Oct 27, 2004.

  1. nal

    Thread Starter New Member

    Oct 27, 2004
    3
    0
    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?
     
  2. ocean

    New Member

    Oct 29, 2004
    2
    0
    Hi..

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

    Member

    Nov 4, 2004
    18
    0
    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
     
Loading...