数字逻辑4-1n.pptVIP

* * Switching algebra Representations of the logic function Logic circuit design Chapter 4 Combinational logic design principles Principle of Switching algebra Basic value of any variable or function: 1 / 0 Basic operation in logic algebra: AND (?) , OR(+), NOT( ’ ) Axiom of switching algebra if x≠1,then x =0; if x =1 ,then x≠0; if x =0 ,then x’=1; if x =1 ,then x’=0; 0·0 = 0 1·1=1 0·1=0 1·0=0 0+0=0 1+1=1 1+0=1 0+1=1 Some important theorem Some important theorem Perfect induction of the theorem Use the truth table to prove the functions on both side are same ! Two kind of logic Positive logic : 1 ( high level ) 0 (low level) Negative logic: 0 ( high level ) 1 (low level) If a logic relation exist in positive logic, it must be exist in negative logic. Both logic are duality for each other. The difference from duality logic When a logic changed to its duality,the only change is 0 and 1 are swapped , · and + are swapped ! Be careful to keep the operation orders of the logic functions. Principle of Duality: Duality of the function is the negative logic form of the function . Some important theorem DeMorgan’s theorem: (Complimentary theorem) The complimentary of the function is the duality of the function with complimentary variables Some important theorem DeMorgan’s theorem:  (x1+x2)’=x1’ ·x2’ (x1 ·x2)’=x1’+x2’ Some important theorem Combinational logic The output is determined only by its input. Output can be changed when input changed. Representations of logic functions Truth table Timing diagram Logic equations Logic circuits Truth table Left: the input combinations in binary order Right: the output for the input Logic design: Construct a Truth table A device with majority judge function  output the majority input state . Full adder  add three input numbers to get their sum. Logic design: Construct a Truth tabl