Unformatted text preview:

ECE 3110: Introduction to Digital SystemsCombinational logic circuitCombinational-Circuit AnalysisSwitching algebraBoolean operatorsLogic symbolsSome definitionsAxioms (postulates)Theorems (Single variable)Two- and three- variable TheoremsSummaryNext…ECE 3110: Introduction to Digital SystemsCombinational Logic Design Principles2Combinational logic circuitOutputs depend only on the current inputs (Not on history)Contain an arbitrary number of logic gates and inverters, but NO feedback loops.3Combinational-Circuit AnalysisKinds of combinational analysis:exhaustive (truth table)algebraic (expressions)simulation / test bench ( not in this course)Write functional description in HDLDefine test conditions / test vectorsCompare circuit output with functional description (or known-good realization)Repeat for “random” test vectors4Switching algebra“Boolean algebra”deals with Boolean values -- 0, 1Positive-logic conventionanalog voltages LOW, HIGH --> 0, 1Negative logic -- seldom usedSignals denoted by symbolic variables(X, Y, FRED, etc.)5Boolean operatorsComplement: X (opposite of X)AND: X  YOR: X + Ybinary operators, describedfunctionally by truth table.6Logic symbols7Some 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8Axioms (postulates)A1) X=0 if X‡1 A1’ ) X=1 if X‡0A2) if X=0, then X’=1 A2’ ) if X=1, then X’=0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=1Logic multiplication and additionprecedence9Theorems (Single variable)Proofs by perfect induction10Two- and three- variable Theorems11SummaryVariables, expressions, equationsAxioms (A1-A5 pairs)Theorems (T1-T11 pairs)Single variable2- or 3- variablePrime, complement, logic multiplication/addition, precedence12Next…Chapter 4.1,4.2N-variable theorem, DeMorgan’s theoremsStandard representations of logic functionsHW


View Full Document

TnTech ECE 3110 - Lecture notes

Download Lecture notes
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Lecture notes and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture notes 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?