Why is the highlighted area where D is constant is not considered in this Karnaugh map?
I've also attached the screenshot below.
My questions is, if the groups should be large enough, why the highlighted area is not considered but only a subset is considered to get BD instead of D?
Thank you in advance.
The groups should be "large enough" so they cancel a variable X and NOT X out. This only works when a complete X or NOT X is hit by your selection. When you select your six selected cells you will hit the AD area completely, but not the A'D area. This means you cannot cancel them out and get just D as you want to. When you hit the whole AD and A'D area this has the meaning as: "Well, the condition depends on D and is totally unrelated to the value of A."
When written as boolean algebra you get:
AD OR A'D
(A OR A') AND D
( true ) AND D
D
That would be the goal. But since you don't cover the whole A'D area you can't make this simplification here.
To check if you have selected the correct numbers of cell in a selected area, the numbers of cells must be a value of power of 2. So it must be one of 1, 2, 4, 18, 16, ...
In this case you have the regions:
A(2*4=8)BD(2*2=4)B'C(2*2=4, notice how the region "wraps" around the edge of the K-map)
Keep in mind that the result for A'B'C'D is false, not true. But when you have just D in your boolean algebra like in A+D+B'C, the result would be true.
- Boolean algebra: (A'+B)(A+C)
- Bitwise Operators: Using only & and ~ to get ^
- Generating DIMACS CNF file using bc2cnf is missing AND
- How do I create a simplified logic circuit of this given [(A’B’)’ + (A’+ B’)’]’ ? and What is the simplified Boolean expression?
- Construction of an AND Gate from NOR Gates
- Boolean expression in SOP
- How to represent nested if using OR or AND gates?
- Boolean algebra 2 different simplification?
- Simplifying a Karnaugh Map
- Simplify three way comparison a < b < c || b < c < a || c < a < b;
- Any one can solve this: Simplify the boolean expression Z=A+A'B + A'B'C+ A'B'C'D
- Can someone explain to me this question in C
- Is there a known algorithm for simplifying a boolean expression with number comparisons?
- Boolean algebra simplification exercise
- A, B and C are three boolean values. Write an expression in terms of only !(not) and &&(and) which always gives the same value as A||B||C
- SQL Question - What is wrong with my WHERE clause
- How to proof (x+y)(x’+z)(y+z) = (x+y)(x’+z)
- Difficulty resolving TRUE FALSE question using boolean
- Ways of using(assigning) variables in Sage
- Boolean Simplification - Why does (A + NOT(B.C)).(B + NOT(B.C)).(C + NOT(B.C)) = A + NOT B.C
- CNF by truth table
- Why is the highlighted area where D is constant is not considered in this Karnaugh map?
- Why is 1<<3 + 1<<4 = 256?
- How do I search for index values in each row of an array in numpy creating a boolean array
- How to tell if there is fault in the truth table?
- bit twiddling : checking non-negative integers as difference of powers of 2
- Explanation of conversion of CNF to imperative normal form in 2-SAT problem?
- Program corresponding to Complete Boolean Lattice *Q_n*
- How the expression !A + (A . !B) = !(A.B)?
- How to convert a boolean expression into assembly code