Give minimal sum of products expressions for the following function (F and F(not))?

Discussion in 'Homework Help' started by DPatel304, Feb 17, 2010.

  1. DPatel304

    Thread Starter New Member

    Feb 17, 2010
    1
    0
    Here is the question:
    Give minimal sum of products expressions for the following function F and for F(not)
    F(A;B;C;D) = *sigma*(2; 3; 5; 6; 8; 9; 10); Fdc(A;B;C;D) = *sigma*(0; 12; 13; 14)
    http://img15.imageshack.us/img15/4801/quesiton6.png

    For 'F', all I did was create a Karnaugh map with 1's in the place of 2,3,5,6,8,9,10 and X's for 0,12,13,14.

    I'm not sure what I am supposed to do to find the minimal sum of products for F(not). The way I did it was create another Karnaugh map with 1's in the place of 1,4,7,11 and X's again for 0,12,13,14. I got an answer, just wanted to make sure that if I invert the Karnaugh map, I will get the corrent F(not) minimal sum of products.
     
  2. LoganFife

    New Member

    Feb 7, 2010
    13
    0
    you can prove that your methods correct by drawing a truth table for F and F'

    just don't forget about 15
     
  3. count_volta

    Active Member

    Feb 4, 2009
    435
    24
    Yea, just draw the K map for f and then replace all 0's with 1's and vice versa, and solve the map to find f NOT.
     
Loading...