数字设计--第四章.ppt

Chapter4  Combinational Logic Design Principles Logic Circuits Combinational logic circuit Outputs depend only on its current inputs No feedback loop Sequential logic circuit Outputs depend on its current inputs and present states Feedback loop Contents Switching Algebra Axioms and Theorems Combinational-Circuit Analysis Combinational-Circuit Synthesis Combinational-Circuit Minimization Karnaugh Maps Timing Hazards 4.1 Switching Algebra Boolean Algebra - formulated by mathematician George Boole in 1854 - basic relationships manipulations for a two-value system Switching Algebra - adaptation of Boolean Logic to analyzer and describe behavior of relays - Claude Shannon of Bell Labs in 1938 - this works for all switches (mechanical or electrical) - we generally use the terms Boolean Algebra Switching Algebra interchangeably Boolean Algebra What is Algebra- the basic set of rules that the elements and operators in a system follow- the ability to represent unknowns using variables- the set of theorems available to manipulate expressions Boolean- we limit our number set to two values (0, 1)- we limit our operators to AND, OR, INV Axioms (公理) Axioms- also called Postulates- minimal set of basic definitions that we assume to be true- all other derivations are based on these truths- since we only have two values in our system, we typically define an axiom and then its complement (A1 A1) Axioms Axiom #1 Identity- a variable X can only take on 1 or 2 values (0 or 1) (A1) X = 0, if X ≠ 1 (A1) X = 1, if X ≠ 0 Axiom #2 Complement- a prime following a variable denotes an inversion function (A2) if X = 0, then X = 1 (A2) if X = 1, then X = 0 Axioms Axiom #3 AND- also called Logical Multiplication- a dot (·) is used to represent an AND function (A3) 0·0 = 0 (A3) 1+1 = 1 Axiom #4 OR- also called Logical Addition- a plus (+) is used to represent an OR function (A4) 1·1 = 1 (A4) 0+0 = 0 Axioms Axiom #5 Precedence- multiplication precedes addi