Download presentation
Presentation is loading. Please wait.
Published byJewel Lawrence Modified over 9 years ago
1
Karnaugh Maps (K maps)
2
What are Karnaugh 1 maps? Karnaugh maps provide an alternative way of simplifying logic circuits. Instead of using Boolean algebra simplification techniques, you can transfer logic values from a Boolean statement or a truth table into a Karnaugh map. The arrangement of 0's and 1's within the map helps you to visualise the logic relationships between the variables and leads directly to a simplified Boolean statement. 1 Named for the American electrical engineer Maurice Karnaugh.
3
Karnaugh maps Karnaugh maps, or K-maps, are often used to simplify logic problems with 2, 3 or 4 variables. For the case of 2 variables, we form a map consisting of 2 2 =4 cells as shown in Figure A B 01 0 1 Cell = 2 n,where n is a number of variables 0010 0111 A B 01 0 1 A B 01 0 1 MaxtermMinterm 0 2 1 3
4
Karnaugh maps 3 variables Karnaugh map AB C 00011110 0 1 0 2 64 5 3 1 7 Cell = 2 3 =8
5
Karnaugh maps 4 variables Karnaugh map AB CD 00011110 00 01 11 10 5 3 1 7 6 2 04 9 15 13 11 10 14 128
6
The Karnaugh map is completed by entering a '1‘(or ‘0’) in each of the appropriate cells. Within the map, adjacent cells containing 1's (or 0’s) are grouped together in twos, fours, or eights. Karnaugh maps
7
Example 2-variable Karnaugh maps are trivial but can be used to introduce the methods you need to learn. The map for a 2-input OR gate looks like this: ABY 000 011 101 111 A B 01 0 1 1 11 B A A+B
8
Example ABCY 0001 0011 0100 0110 1001 1011 1101 1110 AB C 00 01 1110 0 1 1 1 11 1
9
Exercise Let us use Karnaugh map to simplify the follow function. F 1 = m 0 +m 2 +m 3 +m 4 +m 5 +m 6 +m 7 F 2 = m 0 +m 1 +m 2 +m 5 +m 7 Answer
10
Exercise ABCY 0000 0010 0100 0111 1001 1011 1101 1111 Given the truth table, find the simplified SOP and POS form.
11
Exercise Design two-level NAND-gate logic circuit from the follow timing diagram.
12
Don’t care term X X1 XX XX AB CD 00011110 00 01 11 10 AD
13
Exercise Design logic circuit that convert a 4-bits binary code to Excess-3 code ABCDWXYZ 00000011 00010100 00100101 00110110 01000111 01011000 01101001 01111010 10001011 10011100 1010xxxx 1011xxxx 1100xxxx 1101xxxx 1111 1111 1111 0101 xXxX XXXX XxXx XxXx
Similar presentations
© 2024 SlidePlayer.com. Inc.
All rights reserved.