Академический Документы
Профессиональный Документы
Культура Документы
NEED FOR SIMPLIFICATION SIMPLIFICATION METHODS 1.USING BOOLEAN THEOREMS 2. KARNAUGH MAP METHOD 3.QUINE Mc CLUSKY METHOD
In each square, the minterm is either 0 or 1 depending on the value of the function at that square
5
(ex) f = AB + AB
f is true when AB = 01 or 10 f = (1, 2)
3-variable K-map
A 3-variable logic function has 8 minterms and its truth table has 8 rows Hence, a 3-variable K-map has 8 squares
10
11
12
13
PROCEDURE
Construct the K map, place 1s as indicated in the truth table. Check for octets (group of eight 1s) If octets not available check for quads (four adjacent 1s) Loop 1s that are adjacent to only one other 1 and encircle such pairs. Loop 1s that are not adjacent to any other 1s. 1s which are already present in a group can be included in new group to group the other 1s. Form the sum of all product terms generated by each loop.
14
Examples
15
16
17
DONT-CARE Conditions
In logic function, sometimes we do not have the specification for all the combinations We might define a logic function to be 1 for some combinations and 0 for some others but the rest is not define We do not care about the logic value of the function for these undefined combinations called as DONT-CARE conditions DONT-CARE conditions are usually denoted by x, or X or d
18
f has unknown (or dont care) values for combinations abc = 100 or 110 Usually expressed as: f(a,b,c) = (1, 2, 5) + d(4, 6)
19
20