OfficeHours.pptVIP

Boolean Algebra 1854, George Boole created a two valued algebraic system which is now called Boolean algebra. 1938, Claude Shannon adapted Boolean algebra to analyze and describe the behavior of circuits built with relays. This adaptation is called switching algebra. Switching Algebra In switching algebra the condition of a logic signal is represented by symbolic variables, such as x, y, and/or z, and these variables can only have two values, 0 or 1. Two possible conventions: Positive Logic. Where LOW = 0 and HIGH = 1. Negative Logic. Where LOW = 1 and HIGH =0. Axioms The axioms or postulates of a mathematical system are a minimum set of basic definitions that are assumed to be true, and from which all other information about the system can be derived. The axioms stated below embody the “digital abstraction” by formally stating that X can take on only one of two values. (A1) X = 0 if X ? 1 (A1’) X = 1 if X ? 0 Axioms Complement. (A2) If X = 0, then X’ = 1. (A2’) If X = 1, then X’ = 0. Notation. Axioms Logical multiplication ( ? ). (A3) 0 ? 0 = 0 (A4) 1 ? 1 = 1 (A5) 0 ? 1 = 1 ? 0 = 0 Logical addition ( + ). (A3’) 1 + 1 = 1 (A4’) 0 + 0 = 0 (A5’) 1 + 0 = 0 + 1 = 1 Precedence By convention, the precedence of operations in a logic expression is the following: Parentheses. Complement. Multiplication. Addition. Theorems Theorems are statements, known to be always true, that are used to manipulate algebraic expressions to allow simpler analysis or more efficient synthesis of circuits. Identities. (T1) X + 0 = X (T1’) X ? 1 = X Null elements. (T2) X + 1 = 1 (T2’) X ? 0 = 0 Idempotency. (T3) X + X = X (T3’) X ? X = X Theorems Involution. (T4) (X’)’ = X Complements. (T5) X + X’ = 1 (T5’) X ? X’ = 0 Proofs. Theorems T1 through T5’ can be proved by using a technique called perfect induction. Since a switching variable can take on only two different values, 0 or 1 by Axiom A1, we can prove a theorem involving a single variable by showing that the theorem