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.
157 questions
2 votes
3 answers
430 views
Karnaugh map transforming expression into a k map
I'm not sure if I can post this here, but I need help understanding how to transform an expression like this A'C(A'BD)' + A'BC'D'+ AB'C into a K -map
3 votes
2 answers
205 views
Karnaugh Map with don't care condition
I have the following Karnaugh map: $$\begin{array}{c|c|c|c|c} x_0 \backslash x_2x_1 & 00 & 01 & 11 & 10 \\ \hline 0 & 0 & 1 & 0 & 0 \\ 1 & \oslash &...
0 votes
0 answers
54 views
How do I go about kmapping a boolean expression of 6 variables using splitting?
Say I want the SOP. I plan to split the kmap into kmaps of 3 variables each then get their respective SOPs. After which, do I need to combine the SOPs? If so, how? What if my SOPs from all kmaps are (...
0 votes
1 answer
159 views
How Do I Simplify These Massive Boolean Equations?
I'm fairly new to this, and I am working on a computer that would play tic-tac-toe with you. It takes the position convert it into binary split it into different inputs, run it through some function ...
0 votes
2 answers
219 views
Karnaugh Maps and "Impossible" Bit Combinations
I'm new to learning about how to use Karnaugh maps to optimise truth tables into efficient logic circuits, and have been following Dave Jones' excellent tutorial. As an example to work on, I have ...
0 votes
0 answers
177 views
Building a circuit which adds 2 signed numbers
I am developing circuitry to add 2 numbers with sign.They have the form: $$b_{1}:(sign)|(absoluteval)$$ I realised that the calculation of the sign of the addition of such 2 binary numbers must be ...
0 votes
1 answer
396 views
Converting this boolean expression to NOR only expression
I was given an expression which I simplified using k-maps to obtain the following: ~WY + W~YZ + ~W~X~Z I followed along with some of the other workings people have done for converting functions, but ...
0 votes
1 answer
234 views
How can I make sure I have reached the simplest result by using K-map
I know how to simplify a circuit by using the K-map. However, I am still curious whether my result is the simplest. I have heard that when using K-map, try using the biggest and the fewest loops. But, ...
1 vote
0 answers
160 views
Find static 0 hazard
In this question, the top F=A'C'D' + A'B'C + ACD' + AB'C' is given in the question. With the question, im able to generate the kmap. Then in the kmap, i find F'=A'C'D + A'BC + ABC'+ ACD. To remove the ...
0 votes
1 answer
434 views
How to fill in k-map with values from an finite state machine table?
I'm struggling to understand how I am supposed to fill in this k-map with the help of this finite state machine table? I understand that q1q0 shows the present state but I don't understand how I am ...
-1 votes
1 answer
6k views
simplify Boolean function F(A, B, C, D) = ∑ m(0, 1, 3, 4, 5, 7,8,9 11, 13,14,15)
Hello just got stuck simplifying this boolean function using four variable K-Map. I have to simplify this boolean function in terms of sum of minterms. ...
0 votes
2 answers
4k views
Need help understanding multiplexer (MUX) inputs and K-map combinations
I'm trying to understand multiplexers (MUX) and I have a few questions that I hope someone can help me with. I'm not sure what determines if the inputs to the MUX are multiplications (AND) or ...
1 vote
2 answers
221 views
Did I create this Karnaugh map correctly?
I'm tasked with making a 4-7 decoder for a 7-segment LED (common anode). I am an extreme layman (1st year EEE student) I have 4 inputs (A,B,C,D) ...
0 votes
1 answer
154 views
Trouble with FSM circuit using Schmitt trigger clock
I'm having some trouble with my circuit based on the design below, that I built for the lab. I'm using a Schmitt trigger clock. I built the circuit on a breadboard and connected it to the clock and ...
1 vote
0 answers
92 views
Kmap and boolean equation for a function
F(A,B,C,D) = Σm(1, 2, 4, 6, 8, 10, 11, 13, 15) Here's my try of the kmap: Are my kmap and boolean equation correct for this function?