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.

Filter by
Sorted by
Tagged with
0
votes
1answer
42 views

State Table & Karnaugh-map for Finite State Machine

I am trying to create a Finite State Machine that is able to check if a number string is valid. For example, it would accept 3, 4.65 or 8.93e-10. So far I have created a transition table for the ...
0
votes
0answers
25 views

KMAP Sum of Products - How to get the Simplified Function from the KMAP Table

I am answering a KMAP Sum of Products with don't care table but I don't know how to get the simplified function. Here's my progress: Problem: Q(C, O, D, E) = Σ(0,1,2,3,7,8,10) + d(5,6,11,15) The ...
0
votes
1answer
25 views

Can anyone help me understand how to implement a karnaugh map using multiplexers in logism?

I am quite confused on how to implement a function using multiplexers. I know how to use a karnaugh map and get the necessary minimized function that I need, but I don't know how to implement it in ...
2
votes
0answers
41 views

Logic operation on Karnaugh Maps?

Question: Normally I find Karnaugh Map of an expression from its truth table, but can we have Logic operation on two Karnaugh Maps ? Update:
0
votes
0answers
32 views

How to obtain POS from the Karnaugh map?

I know there is a way of getting both without having to draw two maps, which is to draw the minterms on the map and then the Maxterms and organize them in groups just like the minterms. My question ...
0
votes
0answers
148 views

Mapping XOR expression into K map

I know any SOP and POS can be minimised directly with the help of KMAP and there is no difficulty in mapping each Boolean product or sum term into KMAP. However what if the boolean expression is in ...
0
votes
2answers
120 views

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. ...
0
votes
2answers
145 views

Finding a minimal cost function from a Karnaugh Map

Below is a problem I made up and did. Is my solution wrong? Problem: Attached is following map for the function \$f\$. We want a minimal cost expression using only and, or and not gates. The cost ...
1
vote
1answer
43 views

K-map: how to decide which implicant to be prime

I am a bit confused about deciding which implicants to turn into prime. If I group implicants 1 and 2 into a bigger implicant, can I group implicants 2 and 3 as well? For example, if I have the K-map ...
0
votes
1answer
34 views

How is the boolean expression for mux2 and mux4 deduced?

I've been looking at the following article: https://www.electronics-tutorials.ws/combination/comb_2.html I am confused as to how the boolean expression Q = a'b'A + ab'B + a'bC + abD is deduced for ...
0
votes
1answer
182 views

Finding functions for JK / D / T flip flops

I am trying to understand this concept of flip flops. Given some Karnaugh Map, all I need to know is how to find the functions of various flip-flop types: sr flip-flop (\$s = \text{ ??} \quad r = \...
0
votes
1answer
28 views

Implementing function with NAND only quickest way

I'm trying to remind myself how to implement given function or karnaugh map with NAND or NOR gates. I remember how DeMorgan's laws work. Let's say I have some Karnaugh Map and I want to implement the ...
1
vote
0answers
52 views

What are essential prime implicants in this example?

F(A,B,C,D) = Sum (0,2,3,5,7,8,9,10,11,13,15). The prime implicants are represented in different colours as below and the equation of the function is found to be F = B'D' + BD + CD + AB'. I tried to ...
1
vote
2answers
38 views

Can a circuit that shows an error if a 4-bit number is higher than 9 be simplified to “(DC) + (DB)”?

I need to build a circuit that accepts a 4-bit number and turns on a LED (representing an error) if the given number is higher than 9. As I understood, it should represent an "error display for a BCD ...
0
votes
1answer
59 views

What is the general mathematical proof that K map and Boolean Algebra are equivalent?

Is there a mathematical proof that shows K map always reduces the Boolean expression into it's minimal form?
-1
votes
2answers
62 views

How to transform a 3 variables Boolean Function into a K-map when some variables are not specified in the expression? [closed]

I looked at the already answered questions and used google, but I didn't found anything that explains the thing clearly. My problem is that I don't know how to solve function like ...
1
vote
1answer
89 views

Karnaugh Maps in POS instead of SOP

From my understanding, to use karnaugh maps to simplify an expression, you would have an SOP expression that does not have to be canonical and then group the 1s in the table. So that got me wondering....
0
votes
1answer
88 views

How to convert following Karnaugh map to a simplified Boolean expression?

This is the Karnaugh map which I draw for F = A'B'C'+AB'C+A'BC+ABC' But I am not sure how to simplify the Boolean expression for this as there are no groups here
0
votes
1answer
285 views

7 Segment Display Segment C Kmap Confusion

I am working on the Kmap for the Segment C on the 7 Segment Display. The list of numbers that light up the 7 segment displays segment C are as follows: The Kmap I came up with, without grouping yet, ...
0
votes
1answer
76 views

K map minimization need confirmation

So I have to solve this f= ∑m(0,4,10,17,21,26,27,31)+ ∑d(1,5,7,8,11,16,19,20,23,24,25) Please tell me if this is correct:
0
votes
1answer
172 views

Converting boolean function (dnf) to only 2-input NANDs

I'm currently preparing for an exam and was doing some exercices regarding boolean logic. Commonly asked question is to build a function from a truth table and simplify it with a karnaugh map. After ...
0
votes
0answers
36 views

Easiest way to get minterms from a SOP Boolean expression?

So far, I've come across problems were I need to get the list of the minterms in a truthtable from a SOP Boolean expression. For example; They way I've tackled these problems was to convert the ...
1
vote
2answers
97 views

Karnaugh Graph Simplification

I have following truth Table : F(w,x,y,z) = Σ(0,2,5,7,8,10,12,13,14); ...
2
votes
2answers
655 views

State Machines - What happens to 'Don't Care's in the Output?

This is referencing the article about state machines on allaboutcircuits.com In their state table, they have a 'Don't Care' listed under the output for the state 11. However, in their k-map of the ...
0
votes
1answer
677 views

K-maps, do they completely simplify?

I've been told that K-maps produce a completely simplified boolean equation, and they can't or shouldnt be simplified anymore after that. However, on allaboutcircuits.com they were able to simplify an ...
0
votes
1answer
50 views

Karnaugh Map and Mirroring

In widening Karnaugh map, what Mirroring means? I can not understand the name of Mirroring, could you explain?
-5
votes
1answer
59 views

question in Boolean algebra? [closed]

the question states: (Using Boolean Algebra; show that the following equation is valid: A'BC'D+(A'+BC)(A+C'D')+BC'D+A'BC' = ABCD+A'C'D'+ABD+ABCD'+BC'D RHS and using de Morgan law A'BC'D+(A'+...
-2
votes
1answer
285 views

BCD and numbers [closed]

i should do a BCD numbers that has 2,3,6,8. I did it. Sometimes it asks me to do BCD that has 3,6,9. I lost my way with 3,6,9. How? As far as i did 2 is on binary 0010 the 3 is 0011 the 6 is 0101 i ...
0
votes
2answers
82 views

Karnaugh maps how i put them exactly

Hello i have issue how i locate the variables on karnaugh maps.I know what to do but i have the problem how i locate it.What i mean by that as you can see i have this: F=A'B'C'+B'CD'+A'BCD'+AB'C' ...
1
vote
0answers
288 views

minimize hazard free function

Given a function, e.g. \$y = f(x_0, x_1, x_2, x_3) = \sum m(0, 3, 4, 5, 6, 7, 8, 9, 11, 15)\$. How can i find the minimized function without hazards? I see this can be minimized using a Karnaugh map: ...
1
vote
0answers
124 views

Converting BCD Truth Table to Output Functions Using K-Maps

To be honest, I'm just looking to see if I'm on the right track with a certain question. This here would be my answer for the K-Map for the "H" output function and im just curious if im on the right ...
2
votes
2answers
468 views

Karnaugh Map race conditions with don't cares

Karnaugh maps show race conditions as adjacent minterms that are not covered in the same implicand. Take the following example: We have race conditions when moving from the blue implicand to the ...
2
votes
2answers
107 views

Simplification of boolean expression

I am asking you for a help with following boolean expression that i can't solve by myself. I can minimize expression in Karnaugh map but i have to use boolean algebra too. Expression: !(C + !D) * !(...
0
votes
0answers
98 views

finding if certain numbers are don't cares in KMAP

i've solved several question but i don't know how to solve this one, please help me if you can, as my due date is today. \$f(a,b,c,d)=\sum(0,1,2,4,5,10,12)\$ after a lot of trials, i know that this ...
0
votes
1answer
1k views

Order of writing variables at the top left of a K-Map

[Beginner here] I was studying from AAC and I've reached till here. On this page, they've this example: My confusion is NOT in how to make pairs, quads or octets or how to fill gray codes. I'm good ...
0
votes
1answer
1k views

Implementing 3 variable boolean function od 2-1 multiplexers

Recently i've been given a task from my lecturer to implement \$f=\sum(1, 3, 4, 5, 7)\$ on "2-bit multiplexers". That's it. I assume he meant 2:1 MUX. I've came up with following k-map... +------+--...
0
votes
0answers
278 views

Concerning truth table, Karnaugh map, cost and delay of a logic function

A logic function called \$defragment(n)\$ receives as its input \$n\$ bits, \$d[0],...,d[n-1]\$, and \$n\$ flags, \$v[0],...,v[n-1]\$, indicating whether the input is valid. The function returns only ...
0
votes
2answers
63 views

How to design a circuit that cycles

I want to design a digital circuit that transitions in the following sequence as follows: (0,0,0,0) -> (0,1,0,1) -> (0,0,0,0) -> (1,0,1,0) How would I go about making a k-map for this? Should I add ...
0
votes
1answer
2k views

karnaugh map and don't care states

I'm trying to figure out the boolean expressions I need for drawing a circuit based on a state transition table. I wound up with the k maps below, but I'm not really sure what to do with them. Would I ...
0
votes
1answer
152 views

Gray Code Conversion

I'm aware that in Gray code the successive numbers will differ only by one bit. However I'm not able to proceed further.
3
votes
1answer
36k views

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: ...
-4
votes
1answer
123 views

What is the boolean expression?

I'm not sure how to tackle this problem. I think it might involve creating a logic table first. Please help! An elevator has the following sensors: G - The gate is closed L - The elevator is loaded. ...
0
votes
1answer
463 views

4 To 1 MUX - Figuring out the inputs

If i have a 2to1 mux together with logic gates like this: I can simply create a karnaugh map and test the different values of XYZ and get a function. From this i get the function f = x'z + yz + x'y ...
0
votes
2answers
2k views

How can I convert multiple Karnaugh maps into a logic gate circuit?

I'm designing a 8421 BCD to 84-2-1 BCD converter circuit. The truth table is: ...
1
vote
1answer
2k views

Is a Karnaugh map always a good way to simplify a Boolean expression?

I want to simply the following expression: (NOT A AND NOT B AND NOT C) OR (NOT A AND B) OR (A AND B AND NOT C) OR (A AND C) I created a truth table first, then a K map from the truth table. (See ...
1
vote
1answer
577 views

K Map, Essential prime Implicant

I have solved the above problem in two ways.And both the times I have a unique solution with the same number of gates. According to my understanding of Essential Prime Implicants, This particular ...
7
votes
1answer
946 views

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 ...
1
vote
1answer
528 views

Solving 5 variables Karnaugh map - grouping with hazard

Welcome, according to topic Solving 5 variables Karnaugh map - grouping I would like to ask you if for this exercise, should I create anti-hazard group? Is it good? The solver http://www.32x8.com/ ...
0
votes
1answer
11k views

Solving 5 variables Karnaugh map - grouping

Welcome. I would like to ask about solving Karnaugh Maps, especially grouping 5-variables map. I am not sure if I made this good way, so if you could, please let me know what is wrong. It seems to me ...
-1
votes
2answers
6k views

Excess-3 to binary decoder using unused combinations of the code as don't-care condition

This problem is from my textbook chapter review question, and it seems a lot different from the example provided by textbook, so I have no idea what to do. I even have solution manual for this, but ...