Đang chuẩn bị liên kết để tải về tài liệu:
Lecture Digital logic design - Lecture 5: More boolean algebra

The main contents of the chapter consist of the following: Expressing boolean functions; relationships between algebraic equations, symbols, and truth tables; simplification of boolean expressions; minterms and maxterms; AND-OR representations. | Lecture 5 More Boolean Algebra A B 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 Expressing Boolean functions Relationships between algebraic equations, symbols, and truth tables Simplification of Boolean expressions Minterms and Maxterms AND-OR representations Product of sums Sum of products 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. Axioms and Graphical representation of DeMorgan's Law Commutative Law Associative Law Distributive Law Consensus Theorem Simplification Using the Laws Boolean Functions Boolean algebra deals with binary variables and logic operations. Function results in binary 0 or 1 x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 F 0 0 0 0 1 0 1 1 F = x(y+z’) x y z z’ y+z’ F = x(y+z’) Boolean Functions Boolean algebra deals with binary variables and logic operations. Function results in binary 0 or 1 x 0 0 0 0 1 1 1 1 y 0 0 1 1 0 0 1 1 z 0 1 0 1 0 1 0 1 xy 0 0 0 0 0 0 1 1 x y z G = xy +yz yz xy We will learn how to transition between equation, symbols, and truth table. yz 0 0 0 1 0 0 0 1 G 0 0 0 1 0 0 1 1 Representation Conversion Need to transition . | Lecture 5 More Boolean Algebra A B 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 Expressing Boolean functions Relationships between algebraic equations, symbols, and truth tables Simplification of Boolean expressions Minterms and Maxterms AND-OR representations Product of sums Sum of products 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