数字逻辑第三到章,英文.pptVIP

Chapter 4 Combinational Logic Design Principles Preface Design Step 4.1 Switching Algebra 2.Theorems 3.Rules 4.Standard Representations of Logic Functions 5.Minterm and Maxterm 4.2 Combinational Circuit Analysis 4.3 Combination-Circuit Synthesis 4.4 Timing Hazards * Combinational Logic Circuit Sequential Logic Circuit Combinational Logic Circuit Input Output Logic Gates Combinational Logic Circuit Combinational Logic Circuit Input Output Feedback Logic Sequential Logic Circuit Logic Abstract Get Truth Table or Logic Function Simplify Logic Function Draw Logic Circuit Program by VHDL or ABEL Using PLD or CPLD Using Logic IC Module Emphasis Boolean Algebra (1854) 1.Axioms Positive-Logic Negative-Logic 1-High 0-Low 0-High 1-Low Default as Positive-Logic George Boole 1815-1864 (A1) (A2) (A3) (A4) (A5) (T1) Identities (T2) Null elements (T3) Idempotency (T4) Involution (T5) Complements Single-Variable Theorems (T6) Commutativity (T7) Associativity (T8) Distributivity (T9) Combining (T10) Covering (T11) Consensus (T12) DeMorgan’s Prove by using Truth Table X Y 0 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 (T13) Extending 1 Augustus De Morgan 1806-1871 I. Replacing Ex.4-1 If then n-Variable DeMorgan’s theorems II. Shannon’s Expansion Claude Elwood Shannon 1916-2001 1937 Prove? III. Inversion whole Be known Ask for Principle of Inversion: ■Swapping “+” and “·”. ■Swapping “1” and “0”. ■Complementing all Uncomplemented variables, and Uncomplementing all Complemented ones. Ex.4-2 Retain of original Sequence of Operation First “·” and Secend “+” · ( ) · ( ) Or IV. Duality Positive Logic Negative Logic Principle of Duality: ■Swapping “+” and “·”. ■Swapping “1” and “0”. Retain of original Sequence of Operation Ex.4-3 Distributivity Sum of products AND-OR Product of sums OR-AND NAND-NAND NOR-NOR AND-OR-NOT Base Rpresentations ■An n-variable minterm is a normal product term with n literals. ■An n-variable maxterm