Stack Overflow
Stack Overflow

Questions tagged [karnaugh-map]

The Karnaugh map provides a simple and straight-forward method of minimising boolean expressions. With the Karnaugh map Boolean expressions having up to four and even six variables can be simplified.

A Karnaugh map provides a pictorial method of grouping together expressions with common factors and therefore eliminating unwanted variables. The Karnaugh map can also be described as a special arrangement of a truth table.

Karnaugh maps can be used to simplify expressions

For example:

Karnaugh map example

71 questions
1
vote
1 answer

How would I go about putting this boolean expression into sum of two products form?

So I started with xy'+x'y+xz+y'z I used a Kmap and ended up with the equvalent solution z+x'y+xy' From here I need to make this into a sum of two products and take the complement of it to get the solution I need. But I see no way to turn this into a…
Jude
  • 449
  • 1
  • 7
  • 17
1
vote
1 answer

Truth table with 5 inputs and 3 outputs

I have to make a truth table with 5 inputs and 3 outputs, something like this: A B C D E red green blue 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 1 0 0 0 1 . . . . 1 1 0 1 0 0 1 1 . . . 1 1 1 1 1 1 0 …
lepsztyk
  • 53
  • 2
  • 6
1
vote
2 answers

Which Variables go on which side of a Karnaugh Map

For a Karnaugh map of three or more variables deciding which side the variables go makes the solution easier to spot and simpler. But how do you know which side which variables go on. eg. For variables x, y and z; You could have x and y as column…
Tristan Warren
  • 435
  • 1
  • 7
  • 17
1
vote
2 answers

Product of Sum(POS) or Sum of Product(SOP) after Karnaugh map simplification

I am just curious on how do I determine whether a simplified boolean expression is in a SOP form or POS form. for example this question: Question the answer to this expression is : NOT B.D/ ⌝B.D and this is in SOP form Can anyone explain why?
Jerry
  • 19
  • 1
  • 3
1
vote
1 answer

circuits using karnaugh's map technique

A combinational circuit is to be designed that counts the number of occurrences of 1 bits in a 4 bit input. However, an input 1111 is an invalid input for the circuit and output in such case will be 00. One valid input for such circuit may be 1110…
Khiratul kounain
  • 11
  • 2
1
vote
1 answer

How to take sum of product of the following function?

I'm trying to find the sum of products of the following function using K-Map: F(A,B,C,D) = m(0, 1, 5, 7, 8, 10, 14, 15) Since the function is already in sum of products form, what I am trying to do is simply mark '1' on the K-map on the boxes of…
HQuser
  • 640
  • 10
  • 26
1
vote
1 answer

K-map ( karnaugh map ) 8,4,-2,-1 to binary code conversion

I'm taking computer science courses and some digital design knowledge is required, so I'm taking digital design 101. Image above is representing the conversion process of 8,4,-2,-1 to binary using K-map (Karnaugh map). I have no idea why 0001,…
Minjae
  • 31
  • 1
  • 2
  • 8
1
vote
3 answers

Reduce Truth table with Karnaugh Map

I am trying to reduce a boolean expression with a K-map. But when I make the map I end up with three true values which is not possible to make a map with. Is there a way to simplify this map? The original expression was: Y1 = A1 B1 A2' B2' + A1 B1…
user5412293
1
vote
1 answer

Karnaugh map dont-care case

I'm currently working with the following truth table I need to get the karnaugh map from this table and a simulation gives me this However when I manually do it I get this result (since X can be whatever you need) I don't really know what I'm…
Raggaer
  • 3,244
  • 8
  • 36
  • 67
1
vote
1 answer

Boolean truth table into SOP and Karnaugh Map

Hi, I am junior in college and having trouble with my computer architecture classwork. Anyone care to help & tell me if I got them right? Question1. Convert truth table into bool equation. Question2. Find miminum SOP(sum of products) Question3. Use…
Bossam
  • 744
  • 2
  • 9
  • 24
1
vote
1 answer

sum of minterm vs product of maxterm

Given the following Boolean expression of F(A,B,C): F(A,B,C) = A' + B + C' Which of the following statements is/are true about the above expression? (i) It is an SOP expression (ii) It is a POS expression (iii) It is a sum-of-minterms…
weejing
  • 173
  • 2
  • 12
1
vote
1 answer

Karnaugh map group sizes

Full disclosure, this is for an assignment I don't think I'm looking for spoon feeding, more so just a general question. Am a I allowed to break that into a group of 8 and 2 groups of 4, or do all group sizes have to be equal, ie 4 groups of 4 1 0…
kennedyl
  • 181
  • 1
  • 12
1
vote
1 answer

Karnaugh Map whic one is true?

I have a karnaugh map question. In the Digital Design course teacher learnt but I couldn't understand here clear. We can see in the picture. In the first one, we use all 1s and have 4x3 1s. In the second one we have 8x2 1s and we use some 1s two…
user119949
  • 101
  • 1
  • 9
1
vote
2 answers

I am right Boolean expression using Karnaugh map

I got an question from school - Obtain the minimal form for the following Boolean expression using Karnaugh map. F(U, V, W, Z) = ∑(0, 1, 2, 3, 6, 7, 8, 9, 10, 13, 15) And I solved it like this There are four pairs and one quad that reduce as given…
user2747954
  • 97
  • 1
  • 5
  • 16
1
vote
1 answer

Simplify Boolean Function with don't care

Can you help me with this problem: "Simplify the Boolean Function together with the don't care condition d in sum of the products and product of sum. F(x,y,z) = ∑(0,1,2,4,5) d(x, y, z) = ∑(3,6,7)" I try to solve it but I came up with 1 and 0.
user2745681
1 2
3
4 5