Boolean Algebra Simplification

Discussion in 'Homework Help' started by seannz, Apr 10, 2009.

  1. seannz

    Thread Starter New Member

    Apr 10, 2009
    5
    0
    Hey Guys,
    Im fairly new to digital logic and just was wondering about a couple of things.
    Heres the expression ive come up with from my K-Map
    'A'BC'D + ABC + AB'D
    one of the questions is to simplify the circuit so its using the minimum number of logic gates. I cant work out any boolean algebra that will simplify it further. Any help would be greatly appreciated and if you could show the steps you took.
    Thanks.
     
  2. hgmjr

    Moderator

    Jan 28, 2005
    9,030
    214
    Take a look at the material on Boolean Algebra contained in the AAC ebook.

    hgmjr
     
  3. Ratch

    New Member

    Mar 20, 2007
    1,068
    3
    seannz,

    That is because it is simplified as far as it can be for minterms.

    Ratch
     
  4. seannz

    Thread Starter New Member

    Apr 10, 2009
    5
    0
    ah ok thanks, so all i can do is use de morgans to minimize the number of not gates from here?
     
Loading...