Title: Review of Digital Logic Design Concepts
1Review of Digital Logic Design Concepts
2Basic Digital Logic Gates
3Digital (Positive) Logic
- Logic Level High
- 1 or ONE or HIGH or H or Vdd or yes or ON or
True - Logic Level Low
- 0 or ZERO or LOW or L or GND or no or OFF or False
1
0
4Definitions
- Assert
- A control signal is asserted when the action
control by the signal is being done. - Ex Assume a control signal labeled en
- en is asserted when en is high
- Active low signal
- A signal that is asserted when it is a logic
level low. - Active high signal
- A signal that is asserted when it is a logic
level high.
5Buffer
Equation
Symbol
Truth Table
A Y
0 0
1 1
6NOT (Inverter) GATE
Equation
Symbol
Truth Table
A Y
0 1
1 0
7AND GATE
Equation
Symbol
Truth Table
A B Y
0 0 0
0 1 0
1 0 0
1 1 1
8NAND GATE
Equation
Symbol
Truth Table
A B Y
0 0 1
0 1 1
1 0 1
1 1 0
9OR GATE
Equation
Symbol
Truth Table
A B Y
0 0 0
0 1 1
1 0 1
1 1 1
10NOR GATE
Equation
Symbol
Truth Table
A B Y
0 0 1
0 1 0
1 0 0
1 1 0
11XOR GATE
Equation
Symbol
Truth Table
A B Y
0 0 0
0 1 1
1 0 1
1 1 0
12XNOR GATE
Equation
Symbol
Truth Table
A B Y
0 0 1
0 1 0
1 0 0
1 1 1
Equivalence Function
13Digital Logic Types
- Combinatorial Logic Circuits
- No Memory (or Registers)
- Sequential Logic Circuits
- Memory (or Registers)
- Asynchronous Logic Circuits
- No common clock
- Synchronous Logic Circuits
- Common clock
Synchronous Sequential Circuits
14Memory Storage Registers
15D-Latch with (P)reset
Symbol
d dont care
D E Pre Rst Qn1
d d 1 0 0
d d 0 1 1
d 0 1 1 Qn
0 1 1 1 0
1 1 1 1 1
Equation (level clock)
Truth Table
- When Pre/SET (Preset) is asserted, Q ? 1
immediately. - When Rst/CLR (Reset) is asserted, Q ? 0
immediately. - When neither SET nor CLR is asserted,
- Q ? D (data) when E (enable) is asserted
- Maintains previous value otherwise.
16D Flip-Flop Positive Edge Triggered
Symbol
D Clk Pre Rst Qn1
d d 1 0 0
d d 0 1 1
d 0 1 1 Qn
d 1 1 1 Qn
0 1 1 0
1 1 1 1
Equation (rising clock)
Truth Table
- Q changes to D on rising edge of Clk
17Finite State Machines
18Finite State Machines (FSMs)
- Three basic types
- Moore FSM
- Mealy FSM
- Mealy-Moore FSM
19Moore FSM General Block Diagram
Next State
Present State
Output Vector
Input Vector
Clock
Feedback Path
Reset
CL Combinational Logic Cloud
Reg D Registers
20Moore FSM State Equations
Next State
Present State
Output Vector
Input Vector
Clock
Feedback Path
Reset
State Equations
21Mealy FSM State Equations
Next State
Present State
Input Vector
Output Vector
Feedback Path
22Mealy-Moore FSM State Equations
Present State
Next State
Input Vector
Mealy Outputs
Moore Outputs
23State Diagrams
24State Bubble
25State Bubble Example
Unconditional Transition
State name S0 State value 00 Y 0 for this
state
26FSM Example
27Example 2 2-bit Up Counter
Clock is implied
28Example 2-bit Up Counter
State Value Assignment
S0 00
S1 01
S2 10
S3 11
Let
ps ns y
S0 S1 0
S1 S2 1
S2 S3 2
S3 S0 3
Output Vector
Let S0 reset state
29Example 2-bit Up Counter
ps1 ps0 ns1 ns0 y1 y0
0 0 0 1 0 0
0 1 1 0 0 1
1 0 1 1 1 0
1 1 0 0 1 1
30Example 2-bit Up Counter
31Recall Moore FSM
Next State
Present State
Output Vector
Input Vector
Clock
Feedback Path
Reset
State Equations
32Logic Diagram
No X Vector in this Example No H Logic needed
332-bit Counter in 68HC11 Assembly
- L0 LDAA 00 Reset A with 0
- L1 INCA AA1
- CMPA 03 Is A3?
- BNE L1 No. Increment A
- JMP L0 Yes, Reset A to 0