DigitalLogicApplicationsandDesign.pptVIP

CHAPTER 2: Boolean Switching Algebra(布尔开关代数) Introduction： Boolean algebra is a mathematical system that defines a series of logical operations (AND, OR, NOT) performed on sets of variables (a, b, c,.….. ).When stated in this form , the expression is called a Boolean equation or switching equation. Three Primitive Logic FunctionAND Operator Symbols: “()”, “ * ”, “ ·”,no space S=x y s=x*y s=(x) (y) Two input and truth table Distinctive shape symbols for AND gate Three Primitive Logic FunctionOR Operator Symbols: “+” s=x + y Two input and truth table Distinctive shape symbols for OR gate Three Primitive Logic FunctionNOT Operator Symbols: “ ”，“ ” x=x ，x=x truth table Distinctive shape of the NOT symbols Derived logic functions NAND 、NOR、EX-OR、EX-NOR NAND (not and)：s=(x y)? ; s=x y Derived logic functions NAND 、NOR、EX-OR、EX-NOR NOR (not or)：s=(x+ y)? ;s=x + y Derived logic functions NAND 、NOR、EX-OR、EX-NOR EX-OR (exclusive or)：s= x⊕ y Derived logic functions NAND 、NOR、EX-OR、EX-NOR EX-NOR (exclusive not or)：s= x⊕ y ; s=x☉ y IEEE Logic Symbols IEEE general logic symbols: IEEE Logic Symbols IEEE Logic Symbols The Basic Definition of A Binary Switching Algebra Set A set of elements is a collection of items that have something in common. e.g. D={0,1,2,3,4,5,6,7,8,9,} 3∈D denote that element 3 is a member of D P∈D means that P is not a member of set D The Basic Definition of A Binary Switching Algebra Equivalence If two variables x and y , have the same value they are said to be equivalent. e.g. X=0 Y=0 X=1 Y=1 The Basic Definition of A Binary Switching Algebra closure A set is closed with respect to a binary operator(· , +)if, when the operation is applied to members of the set, the result is a member of the set. The property of closure would not hold if an operation coul