Digital Logic “102” 26 August 2013 Mark Schmalz
description
Transcript of Digital Logic “102” 26 August 2013 Mark Schmalz
CDA 3101 Spring 2016
Introduction to Computer Organization
Digital Logic “102”
12 Jan 2016Mark Schmalz
http://www.cise.ufl.edu/~mssz/CompOrg/Top-Level.html
Overview
• Review of gates and truth tables
• Boolean algebra
• Complex logic circuits
• Combinational logic systems
• Clocking
• Memory elements
Transistors
NOT gate (Inverter)
Symbol
Functional Behavior
NOT Gate NAND Gate
Gate Symbol
Truth Table
AND, OR, NOR Gates
NOR
Boolean Algebra
• Basic operators: OR (sum), AND (product), NOT• Boolean laws:
Circuit Equivalence
The Majority Function
M = f (A, B, C)
M = ABC + ABC + ABC + ABC
Step 3. a) Build SOP circuit using minterms (M=1);b) OR minterms
The Majority Function (cont’d)M = f (A, B, C)
Step 1. Build truth table for logic function f.
Step 2. Write logic equation in SOP form.
3a
3b
M = ABC + ABC + ABC + ABC1 1 0
Combinatorial Logic
• Many inputs and many outputs
• Outputs are uniquely determined by inputs
• Absence of memory elements
• Basic combinatorial circuits– Multiplexers– Demultiplexers– Decoders– Comparators
Multiplexer
2n data inputs
1 data output
n control inputs
Decoder
n data inputs
2n data outputs
3-to-8 decoder
Comparator
Two-Level Logic
x
PLA 12 inputs 6 outputs
Clocks
Clock period
Edge-Triggered Clocking
StateElement
1
StateElement
2
Combinational logic
State
Element
Combinational logic
NOR SR Latch
State 0 State 1
Inputs S - set
R - resetOutputs: Q and Q
Clocked SR Latch
Clocked D Latch
D
C
Q
D flip-flop
D
C
Q
C
D QD
latchC
D QD
latch
C
D Q
Setup time
hold time
Conclusions
• Digital logic – lowest level of CDA3101 worldview
• Digital logic circuits– Made from building blocks (AND,OR,NOT,…)– Simple or Complex, Combinatorial– Synchronous (clocked) or Asynchronous
• Know rules for Boolean Algebra
Enjoy your week!!