ITI1100D-chapter-3.pdfVIP

ITI1100/section A Winter 2015 DIGITAL SYSTEM I Lectures: Tuesday, 13:00 – 14:30 room: STE G0103 Thursday, 11:30 – 13:00 room: STE G0103 DGD 1-Thursday 17:30 - 19:00 SMD 222 DGD 2-Wednesday 11:30 - 13:00 FTX 232 DGD 3-Thursday 17:30 -19:00 LMX 220 LAB 1 Thursday 19:00 - 22:00 CBY B302 LAB 2 Wednesday 14:30 - 17:30 CBY B302 Professor : Dr. A. Karmouch, office CBY A508 Mid-term exam: Saturday February 28, 2015(10:00-11:30) ITI1100A-Karmouch Chapter 3 Gate –Level Minimization 2 ITI1100A-Karmouch The Karnaugh MAP • An alternate approach to representing Boolean functions • used to minimize Boolean functions • Easy conversion from truth table to K-map • Easy to obtain minimized SOP function. • Simple steps used to perform minimization  Much faster and more efficient than previous minimization techniques with Boolean algebra. 3 ITI1100A-Karmouch The Karnaugh MAP • K-MAP is ideally suited for four or less variables, becoming cumbersome for five or more variables. Each square represents a Minterm Map is arranged such that two neighbors differ in only one variable (e.g. ABC +ABC’)  Two terms must be “adjacent” in the map A K-map of n variables will have 2n squares  For a Boolean expression, product terms are denoted by 1’s, while sum terms are denoted by 0’s – or left blank (represented by Minterms in the map) 4 ITI1100A-Karmouch K-Map with Two variables m