ECE 3110: Introduction to Digital Systems

23
ECE 3110: Introduction to Digital Systems Combinational Logic Design Principles

description

ECE 3110: Introduction to Digital Systems. Combinational Logic Design Principles. Other codes. Character codes (nonnumeric) ASCII (7-bit string) Codes for action/condition/states Codes for Detecting and Correcting Errors Codes for Serial Data Transmission. - PowerPoint PPT Presentation

Transcript of ECE 3110: Introduction to Digital Systems

Page 1: ECE 3110: Introduction to Digital Systems

ECE 3110: Introduction to Digital Systems

Combinational Logic Design Principles

Page 2: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 2

Other codes Character codes (nonnumeric)

ASCII (7-bit string) Codes for action/condition/states Codes for Detecting and Correcting

Errors Codes for Serial Data Transmission

Page 3: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 3

Codes for Actions/Conditions/States

If there are n different actions, conditions, or states, we can represent them with a b-bit binary code with

Ceiling function: the smallest integer greater than or equal to the bracketed quantity.

nb 2log

Page 4: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 4

Page 5: ECE 3110: Introduction to Digital Systems

Codes for serial data transmission and storage Parallel data: disk storage Serial data: telephone network Bit rates: bps, numerically equals to the

clock frequency(Hz) Bit time: reciprocal of bit rate Bit cell: time occupied by each bit. Line code: format of actual signal on the

line, NRZ (Non-Return-to-Zero) Synchronization signal: identify the

significane of each bit in the stream.

Page 6: ECE 3110: Introduction to Digital Systems
Page 7: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 7

Chapter Summary

Positional Number Systems, 2, 8, 10, 16

Conversions Representation of Negative Numbers Addition/Subtraction for unsigned and

signed numbers Binary multiplication/division BCD, Gray…codes

Page 8: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 8

Chapter 4 Combinational Logic Design

Principles Analyze Synthesis Fundamental Theory: Switching

Algebra

Page 9: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 9

Combinational 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.

Page 10: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 10

Analysis vs. Synthesis Analysis:

Start with a logic diagram and proceed to a formal description of the function performed by that circuit.

Synthesis: Do the reverse, starting with a formal

description and proceeding to a logic diagram.

Page 11: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 11

Combinational-Circuit Analysis Kinds of combinational analysis:

exhaustive (truth table) algebraic (expressions) simulation / test bench

Write functional description in HDL Define test conditions / test vectors, including

corner cases Compare circuit output with functional description

(or known-good realization) Repeat for “random” test vectors

Page 12: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 12

Switching algebra a.k.a. “Boolean algebra”

deals with boolean values -- 0, 1 Positive-logic convention

analog voltages LOW, HIGH --> 0, 1 Negative logic -- seldom used Signal values denoted by variables

(X, Y, FRED, etc.)

Page 13: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 13

Boolean operators

Complement: X (opposite of X) AND: X Y OR: X + Y

binary operators, describedfunctionally by truth table.

Page 14: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 14

Logic symbols

Page 15: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 15

Some 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

Page 16: ECE 3110: Introduction to Digital Systems

16

Axioms (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=1

Logic multiplication and addition

precedence

Page 17: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 17

Theorems (Single variable)

Proofs by perfect induction

Page 18: ECE 3110: Introduction to Digital Systems

18

Two- and three- variable Theorems

In all of the theorems, it is possible to replace each variable with an arbitrary logic expression.

Page 19: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 19

Duality Swap 0 & 1, AND & OR

Result: Theorems still true Principle of Duality (Metatheorem)

Any theorem or identity in switching algebra remains true if 0 and 1 are swapped and • and + are swapped throughout.

Why? Each axiom (A1-A5) has a dual (A1-A5

Page 20: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 20

Duality Counterexample:

X + X Y = X (T9)X X + Y = X (dual)X + Y = X (T3)????????????

X + (X Y) = X (T9)X (X + Y) = X (dual)(X X) + (X Y) = X (T8)X + (X Y) = X (T3)parentheses,operator precedence!

Page 21: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 21

Dual of a logic expression

If F(X1, X2, X3,… Xn,, +, ‘) is a fully parenthesized logic expression involving variables X1, X2, X3,… Xn and the operators +,, and ‘, then the dual of F, written FD, is the same expression with + and swapped.

FD(X1, X2, X3,… Xn, +,, ‘)=F(X1, X2, X3,… Xn,,

+, ‘)

Page 22: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 22

Sumamry Variables, expressions, equations Axioms (A1-A5 pairs) Theorems (T1-T15 pairs)

Single variable 2- or 3- variable

Prime, complement, logic multiplication/addition, precedence

Duality

Page 23: ECE 3110: Introduction to Digital Systems

Dr. Xubin He ECE 3110: Introduction to Digital systems 23

Next…

N-variables theorems Representations of logic fucntions Read Chapter 4.2 and take notes Combinational circuit analysis