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
2
votes
2 answers

Combinational Circuit with LED Lighting

Combinational Circuit design question. A ____ | | F | | B | | ____ | G | E | | C | | ____ D Suppose this is a LED display. It would take input of 4 bit (0000)-(1111) and display the Hex of it. For…
JavaStudent
  • 153
  • 1
  • 4
  • 13
2
votes
1 answer

Karnaugh Map for Logic Function

I have the following boolean function: F=(a1+b1)(a2+b2) and am trying to construct a K-map for it. This is what I have so far: I'm relatively new to K-maps, so I'm not entirely convinced this is correct. Could someone please double check it for me?
John Roberts
  • 5,885
  • 21
  • 70
  • 124
1
vote
0 answers

Having trouble getting code to draw kmap based on user input, and grouping them based on SOP and POS then writing them in simplified and original

Can you fix this code for me? #include #include #include #include #include using namespace std; // Function to print the Karnaugh Map void printKMap(const vector& kMap, const vector& variables) { int numRows = kMap.size(); int numCols…
Damian Roberts
  • 11
  • 1
1
vote
1 answer

Ungrouped ones in karnaugh map

There are ungrouped ones in the answers to the questions I showed in the picture.Bottom one is my solving style but the right answer is upper pic .Shouldn't we group each one in the map? What is this?
GAIUS12100
  • 31
  • 6
1
vote
1 answer

Find a boolean expression from a truth table (several bits)

I have the following truth table (a and b being my inputs and r the result): a b r 00 00 00 00 01 01 00 11 01 01 00 01 01 01 01 01 11 01 11 00 01 11 01 01 11 11 11 The issue is that I can't find the boolean expression to…
lfalkau
  • 896
  • 7
  • 21
1
vote
1 answer

How to generate Karnaugh maps from state transition table?

I have a state transtion table that looks like this: And the binary equation obtained from this is: I don't have any example in my text book that solves this table with Karnaugh map. The text book just states that it can be done by inspection and…
goxarad784
  • 395
  • 6
  • 17
1
vote
1 answer

Why is the highlighted area where D is constant is not considered in this Karnaugh map?

Here is a link to the K map:…
Dushan
  • 49
  • 1
  • 4
1
vote
0 answers

Smart way of simplifying logical circuits by hand?

Let's say I have the following logical circuit: How can I create a simplified version (assuming that one exists) without laboriously creating a truth table for it? I was thinking of perhaps writing the boolean expression as a sum of minterms to…
daedsidog
  • 1,732
  • 2
  • 17
  • 36
1
vote
1 answer

Stuck in simplifying logic expression using Boolean algebra also simplified by karnaugh maps

I also done this with a karnaugh map. My answers for this logical expression are different. I know the output can't be 1 for this question but I can't get the right one using Boolean laws. A'B'C'D'+A'B'CD'+A'BC'D+AB'C'D'+AB'CD'+ABCD My answers for…
Tharindi
  • 11
  • 1
1
vote
2 answers

Is the implementation of `Don't care condition ( X ) in k- map is right

I have a little confusion regarding the Don't care condition in the karnaugh map. As we all know karnaugh map is used to achieve the complete accurate/precise optimal output equation of 16bit or sometime 32 bits binary solution,till that…
Ahmad Raza
  • 145
  • 6
1
vote
2 answers

How do i simplify f = x'yz + xy'z + xyz'?

I am working on simplifying the expression f = x'yz + xy'z + xyz' + xyz. Actually, it may not be this expression. The question is: simplify the boolean expression for a voting system, the system being: three people vote on multiple candidates, and…
Alex
  • 17
  • 1
  • 1
  • 6
1
vote
4 answers

Optimal implementation of truth table

I have identified a truth table such as the one below prev_state| input1 | input2 |next_state| Action (def/new) |(Disable/Enable)|(Off/On)| | def | D | Off | def | Nothing def | D | On …
Satrapes
  • 183
  • 1
  • 18
1
vote
0 answers

Minimizing large queries before passing them to Solr

I'm working on a problem to minimize large boolean expressions that are being provided as the input to Solr. This seems like a problem similar to minimizing the logic gates on a circuit by using techniques like boolean algebra / K-Map. However,…
sparsh sidana
  • 31
  • 6
1
vote
1 answer

Min and max terms and Karnaugh maps

Could anyone explain what is the importance of max and min terms in boolean algebra and uses of Karnaugh maps. I feel like confused in those titles.
Akila Godigamuwa
  • 21
  • 3
1
vote
1 answer

Karnaugh Map with tri-state input (non-boolean)

Is there a way to create a Karnaugh Map of an expression with tri-state variables? I'm thinking in maybe "expanding" to new inputs third condition. Is it possible? ie: T: true F: false _: unset AB Y AbCd Y ---- ------ __ 0 …
Andre Figueiredo
  • 12,930
  • 8
  • 48
  • 74
1
2
3 4 5