Thursday, 25 February 2016

KARNAUGH MAP

They are used to simplify a Boolean expression. They work in a similar way to a truth table with patterns within the table in order to simplify it. They illustrate a table of possible inputs mapped against the required output

RULES
- no zeros are allowed
- no diagonal joining of blocks
- groups should be large as possible
- everyone one must be within a block - no loners
- groups must be formed in powers of 2 (1,2,4,8,etc.)
- overlapping is allowed
- wrap around are allowed

(A^B) v (A^¬B) split into 2 parts and deal separately in the map


            A                       
B
 0
 1
 
 
 
 0
 
 
 
 
 1
 
1  
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

            A                       
B
A /B
0 0
A/B
01
A/B
11
A/B
10
 
 
C   0
 
 
1
 
 
 
C   1
 
 
1
1
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

A and B and C and A and not B and C and A and B and not C

A and B or C an A

No comments:

Post a Comment