1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Karnaugh Mapping

  1. Feb 10, 2012 #1
    1. The problem statement, all variables and given/known data
    I'm working on a problem that implements the product of two 2-bit binary numbers (wx, yz) and produces such as the output. However, I am having a bit of confusion in regards to implementing the Karnaugh Map.

    So this is what I have:
    wx and yz can be 00, 01, 10, 11, the output can be either 0000, 0001, 0010, 0011, 0100, 0110, 1001

    Would I simply make a sum of products for these outputs, then perhaps reduce it with the Karnaugh Map?

    also keep in mind the output can be 0000 for essentially every other combination that does not make the output 0001, 0010, 0011, 0100, 0110, 1001

    My question more or less comes down to this: how does one implement K-MAPS when the output is given with 4 bits?
     
    Last edited: Feb 10, 2012
  2. jcsd
  3. Feb 10, 2012 #2

    berkeman

    User Avatar

    Staff: Mentor

    Does the problem make more sense now, after our PM conversation?
     
  4. Sep 14, 2012 #3

    T.K

    User Avatar

    You need to make karnaugh map for each resultant bit using wx and yz.
    Suppose R=0011
    then R(3)=0 R(2)=0 R(1)=1 R(0)=1 .

    This way you will get an equation for each bit in terms of w,x,y,z.
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Karnaugh Mapping
Loading...