Professional Documents
Culture Documents
Imp points
y
precedence of operators:
y Parenthesis y Not y And y Or
y Literal primed or unprimed variable y Sop prime corresponds to 0 and unprime corresponds to 1.
most economical in terms of #gates & #inputs y A Karnaugh map is a graphical representation of a truth table
y The map contains one cell for each possible minterm y Adjacent cells differ in only one literal; i.e. x (or x) y Function is plotted by placing 1 in cells corresponding to
1. Any two adjacent squares in the map differ by only one variable which is primed in one square and unprimed in other 2. Any two minterms in the adjacent squares can be Ored together to remove the different variable e.g. take sum of m5 and m7
Example
y Simplify the Boolean function
F=xyz+xyz+xyz+xyz y Mark 1 in each square of corresponding minterm of the function y Next step is to form groups of marked adjacent squares
1 1 1
y Take sum of minterms forming a group. y m4+m5 = xyz+xyz = xy(z+z) = xy y m3+m2 = xyz+xyz = xy(z+z) = xy y So the minimized Boolean function is y F= xy+xy
Example
y Simplify the Boolean function y F=xyz + xyz+ xyz+ xyz
Example
Example
y Simplify the Boolean function y F=AC+AB+ABC+BC y Here some terms have a missing variable. In that case we will find squares which
correspond to that term and in this way mark more than one square.
Simplified function is
Example
Example
Simplified function is
Example
Example
minterms of the function F. We know complement F of the function F includes those minterms that are not mentioned in the function. This means that F can be represented marking those squares with 0 which are not marked as 1. If we combine the 0 marked in adjacent square then we can get simplified F. Taking complement of F gives us simplified products of sums.
Example
Example
y Last example show simplification of product of sums when sum of minterms is given. y But we can also do the simplification direct if we are given product of maxterms.
y Such dont care conditions are marked as X in the map. y We assume X to be either 0 or 1, whichever simplifies the
function. y Example
y y y y
A circuit to produce output 1 if a BCD digit is multiple of 3 BCD Four inputs (wxyz) 0 (0000) 9 (1001) Values of wxyz 10 (1010) 15 (1111) dont care The function F8 = (3,6,9) +d(10,11,12,13,14,15)
Example
Can you obtain the simplified product of sums using the previous map?
y State the simplified POS function.
variables 4 y Tabulation method is preferred for function with large # of variables y Tabulation method consists of grouping of minterms and systematically checking for single bit differences
their binary representation y Each member of each Section is compared with each member of Sections below; y All reduction are recorded in next column y Mark terms that combine y All unmarked terms are prime implicants
Example
Example
NOR- implementation