Simplify Boolean Expressions

Discussion in 'Computing and Networks' started by subaharan, Aug 19, 2014.

  1. subaharan

    Thread Starter New Member

    Aug 19, 2014
    1
    0
    Always the result of K-map simplification and Boolean algebra simplification are same or not? Please clarify it.
     
  2. tshuck

    Well-Known Member

    Oct 18, 2012
    3,531
    675
    No, it isn't always possible to minimize with a K-map to it's simplest Boolean expression.

    In most cases it is, however depending on what reduction steps are taken during minimization for both K-maps (grouping) and using Boolean properties, you may get different results.
     
    Last edited: Aug 19, 2014
  3. shteii01

    AAC Fanatic!

    Feb 19, 2010
    3,398
    497
    Some people are more "visual" so k-maps are very helpful to them.
     
Loading...