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
0
votes
1 answer

Latex, karnaugh-map usepackage, unable to connect specific cells

I need to use the \usepackage{karnaugh-map} to draw some karnaugh-map. In this table: \begin{karnaugh-map} \manualterms{1,0,0,1,0,0,0,0,1,1,1,1,0,1,1,1} \end{karnaugh-map} I would like to operate the logical connection like in the photo But…
Alessandro Pierro
  • 117
  • 1
  • 10
0
votes
1 answer

Simplify boolean function with k-map

I have a function who outputs 1 when the four bit input represents a multiple of 3 in a complement-two style notation. The truth table for this function should be: x y z t | f 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 1 1 0 1 0 0 …
J Alan
  • 77
  • 1
  • 11
0
votes
0 answers

k-map for a function with more than 4 inputs

For functions with more than 4 variables, the usual solution is to use a number of 4-input K-map tables in parallel. I wonder why not use one table with more than 2 inputs per row or column as long as the set of variabes is coded in gray code. The…
Karlo
  • 1
0
votes
1 answer

Boolean expression from a State machine diagram

I'm having trouble to determine the boolean equation for Q1 and Q2. What I did was to input the values into a karnaugh-map. But since the state Diagram only consists of 3 states (00, 01 and 11), I'm a bit unsure of how to setup the Karnaugh. I know…
LarmadVara
  • 47
  • 8
0
votes
1 answer

Simplification with karnaugh maps

I have 2 boolean equations, and I have to simplify them with karnaugh-maps, but I have a little problem understanding the procedure: First, I got this one: out = (~a * b * ~c * d) + (~a * b * c * d). This reduces to ~a * b * d. The bit changes at c,…
MassU
  • 51
  • 1
  • 2
  • 5
0
votes
1 answer

Can Math help to formulate an UPDATE query in SQL through Karnaugh map?

I've got a database with 2 tables. Let call them table and tableWithUpdatedValues The table structure is the same, they have only few columns: title, plot and review. table has also a column updated. The value both can assume are NULL, 1 and 2. Null…
Revious
  • 7,816
  • 31
  • 98
  • 147
0
votes
1 answer

In K maps can a group be formed which consists only Don't Cares?

While working with K maps,we can consider the don't cares as 0 or 1 whichever helps us to form a larger group.But can a group be made consisting of only don't cares????
Satyaki Guha
  • 23
  • 4
0
votes
1 answer

Reducing Logical Expressions

I am having trouble reducing a logical expression via logical equivalences. The expression is as follows: ~A~C~D + AB~C~D + ABD + ABC~D + A~B~C~D Using a Karnaugh Map I am able to reduce the expression to AB + ~C~D. The problem comes in that I am…
Dan Brenner
  • 880
  • 10
  • 23
0
votes
1 answer

What to do with an element in Karnaugh map that remains single?

Suppose I face a situation where I can neither form octect nor quad nor pair with an element and it remains single. What should I do with it ? Should I ignore it?
Neer
  • 203
  • 4
  • 13
0
votes
1 answer

How is this Karnaugh Map organized?

A K-map generator generated this for me! Karnaugh Map And I`ve been trying to figure out how the values match up with one another. For eg. the value 7 on the table is seemingly identified by 01101 which is not 7, and so on and so forth.
Louis93
  • 3,843
  • 8
  • 48
  • 94
-2
votes
1 answer

Prime number detector between 0 and 101, digital logic karnaugh map

For the input of 101, one needs to have 7 bits, but I dunno how to start drawing a k-map with 7 variables... Here's a tutorial on doing 5 variable k-map, and the SOP equation is: F = a' b' e + a' b' c' d + b c d' e + a c d e + b' c' e + a' c' d…
Jack
  • 121
  • 4
1 2 3 4
5