COMBINATIONALLOGICDESIGNPRINCIPLES-bYTEBoss.pptVIP

COMBINATIONAL LOGIC DESIGN PRINCIPLES COMBINATIONAL LOGIC DESIGN PRINCIPLES SWITCHING ALGEBRA COMBINATIONAL CIRCUIT ANALYSIS COMBINATIONAL CIRCUIT SYNTHESIS TIMING HAZARDS ALGEBRA? n. 1. A GENERALIZATION OF ARITHMETIC IN WHICH LETTERS REPRESENTING NUMBERS ARE COMBINED ACCORDING TO THE RULES OF ARITHMETIC SWITCHING ALGEBRA GEORGE BOOLE: 1854, BOOLEAN ALGEBRA BOOLEAN ALGEBRA: TWO-VALUED ALGEBRAIC SYSTEM CLAUDE SHANNON: 1938, ADAPTATION OF BOOLEAN ALGEBRA ? SWITCHING ALGEBRA SWITCHING ALGEBRA OPERATIONS NOT OPERATION: X’ AND OPERATION (LOGICAL MULTIPLICATION): X?Y, X?Y OR OPERATION (LOGICAL ADDITION): X+Y, X?Y SWITCHING ALGEBRA OPERATIONS AXIOMS AXIOM = POSTULATE THE AXIOMS OF A MATHEMATICAL SYSTEM ARE A MINIMAL SET OF BASIC DEFINITIONS THAT WE ASSUME TO BE TRUE, FROM WHICH ALL OTHER INFORMATION ABOUT THE SYSTEM CAN BE DERIVED. AXIOMS (A1) X=0 IF X?1 (A1’) X=1 IF X?0 AXIOMS (A2) IF X=0 THEN X’=1 (A2’) IF X=1 THEN X’=0 AXIOMS (A3) 0?0=0 (A3’) 1+1=1 (A4) 1?1=1 (A4’) 0+0=0 (A5) 0?1=1?0=0 (A5’) 1+0=0+1=1 AXIOMS A1-A5 AND A1’-A5’ COMPLETELY DEFINE SWITCHING ALGEBRA ALL OTHER FACTS ABOUT SYSTEM CAN BE PROVED USING A1-A5 AND A1’-A5’ THEOREM? n. 1. AN IDEA ACCEPTED OR PROPOSED AS A DEMONSTRABLE TRUTH OFTEN AS PART OF A GENERAL THEORY SINGLE-VARIABLE THEOREMS PERFECT INDUCTION: A1: X=0 OR X=1 PROVE THEOREM FOR BOTH X=0 AND X=1 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 INVOLUTION (T4) (X’)’=X COMPLEMENTS (T5) X+X’=1 (T5’) X?X’=0 MORE THEOREMS TWO- AND THREE-VARIABLE THEOREMS PROOF: PERFECT INDUCTION OR OTHER THEOREMS AND AXIOMS COMMUTATIVITY (T6) X+Y=Y+X (T6’) X?Y=Y?X ASSOCIATIVITY (T7) (X+Y)+Z=X+(Y+Z) (T7’) (X?Y)?Z=X?(Y?Z) DISTRIBUTIVITY (T8) X?(Y+Z)=X?Y+X?Z (T8’) (X+Y)?(X+Z)=X+Y?Z EXAMPLE NOTE: POSSIBLE TO REPLACE VARIABLE WITH EXPRESSION COVERING (T9) X+X?Y=X (T9’) X?(X+Y)=X X COVERS Y COMBINING (T10) X?Y+X?Y’=X (T10’) (X+Y)?(X+Y’)=X CONSENSUS (T11) X?Y+X’?Z+Y?Z=X?Y+X’?Z (T11’) (X+Y)?(X’+Z)?(Y+