Skip to main content

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.

2 votes
3 answers
430 views

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
jojo 'S's user avatar
  • 31
3 votes
2 answers
205 views

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 &...
dareen's user avatar
  • 531
0 votes
0 answers
54 views

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 (...
Avery's user avatar
  • 103
0 votes
1 answer
159 views

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 ...
Knedllll's user avatar
0 votes
2 answers
219 views

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 ...
Wossname's user avatar
  • 656
0 votes
0 answers
177 views

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 ...
Miss Mulan's user avatar
0 votes
1 answer
396 views

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 ...
agni_ka1's user avatar
0 votes
1 answer
234 views

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, ...
mendax1234's user avatar
1 vote
0 answers
160 views

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 ...
randomnick's user avatar
0 votes
1 answer
434 views

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 ...
Dyson's user avatar
  • 5
-1 votes
1 answer
6k views

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. ...
CREATIVITY Unleashed's user avatar
0 votes
2 answers
4k views

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 ...
Bryan C's user avatar
  • 17
1 vote
2 answers
221 views

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) ...
NonComposMentis's user avatar
0 votes
1 answer
154 views

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 ...
bittscoterie's user avatar
1 vote
0 answers
92 views

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?
user326829's user avatar

15 30 50 per page
1
2 3 4 5
11