Lecture05.ppt-People.vcu.edu.pptVIP

Lecture 5EGRE 254 1/28/09 Boolean algebra a.k.a. “switching algebra” deals with Boolean values -- 0, 1 Positive-logic convention analog voltages LOW, HIGH -- 0, 1 Negative logic -- seldom used Signal values denoted by variables(X, Y, FRED, etc.) Boolean operators Complement: X￠ or (opposite of X) AND: X × Y OR: X + Y More definitions Literal: a variable or its complement X, X￠, FRED￠, CS_L Expression: literals combined by AND, OR, parentheses, complementation X+Y P × Q × R A + B × C ((FRED × Z￠) + CS_L × A × B￠ × C + Q5) × RESET￠ Equation: Variable = expression P = ((FRED × Z￠) + CS_L × A × B￠ × C + Q5) × RESET￠ Logic symbols Basic Axioms Proving theorems Using axioms or theorems already proven. Perfect induction – Verify theorem for all possible values of the variables. 1 variable 2 = 21 possible values. 0, 1 2 variables 4 = 22 possible values. 00, 01, 10, 11 3 variables 8 = 23 possible values. 000, 001, …, 111 n variables 2n possible values. For general case of n variable we use the mathematical technique of finite induction. Prove T1 and T1’ T1 : X + 0 = X Proof 1a If X = 0 then X + 0 = X by A4’ If X = 1 then X + 0 = X by A5’ Proof 2a,b T1’: X?1 = X Proof 1b If X = 1 then X?1= X by A4 If X = 0 then X?1= X by A5 Proof 3b T1’ follows from duality of T1. Basic Theorems Theorems T8’ Not what we would expect! Proof 1: using truth table (perfect induction) T8’ Proof 2: Algebraically using proved theorems (X + Y)(X + Z) = (X+Y)X +(X+Y)Z ;Why? = XX+YX+XZ+YZ ; T6’, T8 = X+XY+XZ+YZ ; T3’, T6’ = X?1 + X(Y+Z) + YZ ; T1’, T8 = X(1+(Y+Z)) + YZ ; T8 = X?1 + YZ ; T6, T1’ = X + YZ ; T1’ Better (X + Y)(X + Z) = X + XZ + XY + YZ = X(1+Z+Y) + YZ = X + YZ Proof 3: Follows from T8 and duality. Algebraic Proofs T10: XY+XY’ = X(Y+Y’) = X?