Boolean function multiplexer

Discussion in 'Homework Help' started by philmetz, Jun 3, 2008.

  1. philmetz

    Thread Starter New Member

    Jun 3, 2008
    1
    0
    I got a question:
    Implement the following boolean function with a multiplexer and external gates (if needed)

    F(A,B,C,D) = sum m (1,3,4,10,12,13,14,15)

    Would I use a 8x1 multiplexer, would I use B,C,D as the selectors? If not what would i do? How would i determine the inputs as well?

    BELOW IS TEH TRUTH TABLE THAT I HAVE GOT SO FAR:

    DCBA F
    0000 0
    0001 1 A

    0010 0
    0011 1 A

    0100 1
    0101 0 A'

    0110 0
    0111 0 0

    1000 0
    1001 0 0

    1010 1
    1011 0 A'

    1100 1
    1101 1 1

    1110 1
    1111 1 1

    This is what iv got so far, what do i do next if am correct?
     
    Last edited: Jun 3, 2008
  2. mccormick.cj

    Member

    May 25, 2008
    10
    0
    I think you got it.

    For these problems I was taught to take your minterms and put them into a K map

    0 1 1 0
    1 0 0 0
    1 1 1 1
    0 0 0 1


    then take that and go to an MEV (map entered variable), like you did

    and then from there you have your 8 inputs for an 8-1 mux, and your 3 remianing variables will be your select bits.

    Then, I think the only external gate you need will be to AND your mux output with 1... not sure about that last part though.

    hope that helps.
     
Loading...