Electrical Engineering Stack Exchange
Electrical Engineering Stack Exchange

Questions tagged [karnaugh-map]

A Karnaugh map (or K-Map) is a diagram that assists with simplifying Boolean expressions. The method takes advantage of a human's pattern recognition ability as an alternative to performing potentially complex calculations.

149 questions
12
votes
2 answers

Karnaugh Mapping with Two Outputs?

Is it possible to create a Karnaugh Map when there are two outputs, the examples I have seen are all one output. If it is possible, what is the process to convert a truth table like this to a k map? If it is not possible, are there any processes…
Kyle Brandt
  • 235
  • 1
  • 2
  • 7
8
votes
1 answer

How do I design a clocked synchronous state machine for a combinational lock?

I need help in completing a task, I’m stuck on quite a few things. Since I’m very new to this topic on finite machines. I’ve attempted the state diagram, state table, transition table, K-map values and the k-maps (Karnaugh - map) themselves.…
Omuse
  • 237
  • 2
  • 10
7
votes
4 answers

Software To Create Karnaugh Maps

Does anyone know of any (foss) application to create karnaugh maps. I don't need a K-map solver, just to be able create them so I can export them to ms-word.
volting
  • 897
  • 3
  • 12
  • 18
6
votes
3 answers

Simplifying digital circuit

I know how to simplify digital circuits using Karnaugh maps. However, the resulting circuits always consist of only not, and and or gates (basic Boolean algebra operators). Often, by using other gates (xor, nor, xnor, nand, etc) you can get a…
Halst
  • 240
  • 2
  • 7
5
votes
2 answers

Unable to get the correct k-map for this finite state machine (Crosswalk System)

I am trying to create a Crosswalk System using a finite state machine. Although I understand how to do it, apparently I am continuously arriving at the wrong equations for my D inputs since my K-maps are incorrect. I am using 2 D-flipflops for this…
Pen
  • 51
  • 1
  • 3
5
votes
3 answers

Karnaugh Maps - What is the purpose of a "don't care" condition?

I've got a problem and was stuck for whole day.. I'm designing an octal to 7 segment common cathode decoder which only octal digits 2 to 7 are applied to the inputs of the decoder so combination for digits 0 and 1 are never applied. I understand…
user159676
  • 77
  • 1
  • 1
  • 6
4
votes
1 answer

What is d in a boolean function?

I know if it's \$ \Sigma \$ we put 1's in the Karnaugh map, but I don't know what \$ d \$ is. $$ f(a,b,c,d) = \Sigma m(0,1,4,10,15) + d(7,14) $$ From what I've googled, https://en.wikipedia.org/wiki/Karnaugh_map it seems to be a "don't care", but…
Shayan
  • 143
  • 4
4
votes
1 answer

Divide clock frequency by 3 with 50% duty cycle by using a Karnaugh Map?

In this document, On semiconductor describe how to design a divide by 3 system using a Karnaugh Map: Specify, Divide By 3, 50% duty cycle on the output Synchronous clocking 50% duty cycle clock in Using D type Flop flips and karnaugh maps we…
nettek
  • 1,035
  • 4
  • 13
  • 23
3
votes
3 answers

Do Karnaugh maps use a base ten numbering system?

Do Karnaugh maps use a base ten numbering system??
Aleatory
  • 497
  • 2
  • 5
  • 12
3
votes
3 answers

How do you fix the glitches in the following Karnaugh maps?

The following circuit is supposed to output 1 if the input is greater or equal than 1010 (decimal 10). The truth table is given and we are supposed to convert that to POS and SOP using Karnaugh maps. Here's the truth table with the minterms and the…
SilenceOnTheWire
  • 143
  • 5
3
votes
1 answer

4-bit Finite State Machine with 6 states and synchronous reset using D Flip-Flops

I have recently began studying Digital Electronics and have hit a wall trying to figure out how to design FSMs. At the moment, I am attempting to desing the FSM in the title which generates the following states: 1101->1011->0111->0101->0011->0010.…
KOB
  • 169
  • 1
  • 2
  • 9
3
votes
1 answer

Why does the Karnaugh map use gray code and not binary?

The row and column headers for a Karnaugh map are written in gray code and not binary. I am wondering why. Is it because that the Karnaugh map needs to wrap around, and gray code is symmetrical?
Chris Ryder
  • 31
  • 1
  • 2
2
votes
1 answer

Is Quine–McCluskey algorithm globally optimal or is there a better way for K-Map reduction?

A bit of context... We are working on a project to convert FA (Finite Automata) to Digital Sequential Circuits and vice-versa. In this process we came across a step: Reduction of Karnaugh (K-Maps). Now, we are aware of the steps to be done when…
Dheeraj Lalwani
  • 23
  • 2
2
votes
1 answer

How to simplify the actual function using K-maps?

So I'm trying to learn how to use Karnaugh maps. I've found what are the rules of simplification and how to apply them but every tutorial or lesson I find uses some generic function like "Here's how to do Karnaugh maps for three variables" and…
Straightfw
  • 179
  • 1
  • 6
2
votes
1 answer

Minimizing Karnaugh map

I have the following Karnaugh map's for JK flip flops. I've attempted to minimize them myself, however whenever I go to implement them I run in to an error. Anyone able to see if I've made an error in my minimization. (originally uploaded to…
Kyle93
  • 289
  • 2
  • 9
1
2 3
…
9 10