Lecture 8 More Karnaugh Maps and Don’t Cares. The main contents of the chapter consist of the following: Karnaugh maps with four inputs, same basic rules as three input k-maps, understanding prime implicants, related to minterms, covering all implicants, using don’t cares to simplify functions, don’t care outputs are undefined, summarizing Karnaugh maps. | Lecture 8 More Karnaugh Maps and Don’t Cares Give qualifications of instructors: DAP teaching computer architecture at Berkeley since 1977 Co-athor of textbook used in class Best known for being one of pioneers of RISC currently author of article on future of microprocessors in SciAm Sept 1995 RY took 152 as student, TAed 152,instructor in 152 undergrad and grad work at Berkeley joined NextGen to design fact 80x86 microprocessors one of architects of UltraSPARC fastest SPARC mper shipping this Fall Overview Karnaugh maps with four inputs Same basic rules as three input K-maps Understanding prime implicants Related to minterms Covering all implicants Using Don’t Cares to simplify functions Don’t care outputs are undefined Summarizing Karnaugh maps credential: bring a computer die photo wafer : This can be an hidden slide. I just want to use this to do my own planning. I have rearranged Culler’s lecture slides slightly and add more slides. This covers everything he covers in his first lecture (and more) but may We will save the fun part, “ Levels of Organization,” at the end (so student can stay awake): I will show the internal stricture of the SS10/20. Notes to Patterson: You may want to edit the slides in your section or add extra slides to taylor your needs. Karnaugh Maps for Four Input Functions Represent functions of 4 inputs with 16 minterms Use same rules developed for 3-input functions Note bracketed sections shown in example. C + B’D’ Solution set can be considered as a coordinate System! Karnaugh map: 4-variable example F(A,B,C,D) = m(0,2,3,5,6,7,8,10,11,14,15) F = D A B A B C D 0000 1111 1000 0111 1 0 0 1 0 1 0 0 1 1 1 1 1 1 1 1 C + A’BD A' B' D + A' C + B' C D B C' D' + A C' + A B D' LT = EQ = GT = K-map for LT K-map for GT Design examples 0 0 1 0 0 0 0 0 D A 1 1 1 1 0 1 0 0 B C K-map for EQ 1 0 0 1 0 0 0 0 D A 0 0 0 0 1 0 0 1 B C 0 1 0 0 1 1 1 1 D A 0 0 0 0 0 0 1 0 B C Can you draw the truth table for these examples? A'B'C'D' + A'BC'D + ABCD + AB'CD’ | Lecture 8 More Karnaugh Maps and Don’t Cares Give qualifications of instructors: DAP teaching computer architecture at Berkeley since 1977 Co-athor of textbook used in class Best known for being one of pioneers of RISC currently author of article on future of microprocessors in SciAm Sept 1995 RY took 152 as student, TAed 152,instructor in 152 undergrad and grad work at Berkeley joined NextGen to design fact 80x86 microprocessors one of architects of UltraSPARC fastest SPARC mper shipping this Fall Overview Karnaugh maps with four inputs Same basic rules as three input K-maps Understanding prime implicants Related to minterms Covering all implicants Using Don’t Cares to simplify functions Don’t care outputs are undefined Summarizing Karnaugh maps credential: bring a computer die photo wafer : This can be an hidden slide. I just want to use this to do my own planning. I have rearranged Culler’s lecture slides slightly and add more slides. This covers everything he covers in his first
