Computer Organization and Design Fundamental 第 5 章 Boolean Algebra Computer Organization and Design Fundamental 書籍作者：David Tarnoff 投影片製作者：陳鍾誠
5.1 Need for Boolean Expressions • Both schematics and truth tables take too much space to describe the operation of complex circuits with numerous inputs. • The truth table "hides" circuit information. • The schematic diagram is difficult to use when trying to determine output values for each input combination.
5.2 Symbols of Boolean Algebra AND OR NOT 0 = 1 1 = 0
XOR
5.3 Boolean Expressions of Combinational Logic
NOT 的效果 注意：
將布林式轉為電路
5.4 Laws of Boolean Algebra
交換律 OR
布林代數基本法則 交換律 結合律 分配律
5.5 Rules of Boolean Algebra
5.5.1 NOT Rule
5.5.2 OR Rules
5.5.3 AND Rules
5.5.4 XOR Rules
5.5.5 Derivation of Other Rules
證明範例
5.6 Simplification
簡化的範例 1
簡化的範例 2
簡化的範例 3
簡化的範例 4
簡化的範例 5
5.7 DeMorgan's Theorem
DeMorgan 定律的應用