Conversion from one number base to another Equation simplification Conversion to/from SOP/POS Minimization using Karnaugh Maps Minterm and Maxterm Equations Determining Prime Implicants and Essential Prime Implicants Logical completeness Using MUXs and ROMs to implement logic Timing Analysis The internal structure of flip-flops Flip-flop timings Rising and falling edge triggered flip-flops Counters and state machines Generating next state equations from counter sequences. Implementation using RS, D, T and JK flip-flops Determining next states from schematics Moore vs. Mealy State Graphs Completeness and conflict issues Creating transition tables and next state equations from state graphs Verilog code One-hot encoding LC3 control UART Review for Final Exam
45
Embed
Conversion from one number base to another Equation simplification Conversion to/from SOP/POS Minimization using Karnaugh Maps Minterm and Maxterm Equations.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Conversion from one number base to another
Equation simplification
Conversion to/from SOP/POS
Minimization using Karnaugh Maps
Minterm and Maxterm Equations
Determining Prime Implicants and Essential Prime Implicants
Logical completeness
Using MUXs and ROMs to implement logic
Timing Analysis
The internal structure of flip-flops
Flip-flop timings
Rising and falling edge triggered flip-flops
Counters and state machines
Generating next state equations from counter sequences.
Implementation using RS, D, T and JK flip-flops
Determining next states from schematics
Moore vs. Mealy State Graphs
Completeness and conflict issues
Creating transition tables and next state equations from state graphs
Verilog code
One-hot encoding
LC3 control
UART
Review for Final Exam
Conversion from one number base to another
Equation simplification
(X + Y)(X + Z) = (X + YZ)
X + XY = X
X + X’Y = X + Y
X + XY = X
Conversion to/from SOP/POS
(X + YZ) = (X + Y)(X + Z)
Minimization using Karnaugh Maps
AB
CD 00 01 11 10
00 1
01 1 1 1 1
11 1 1 1
10 1 1 1
AB + C’D + A’B’C + ABCD + AB’C
AB + C’D + B’C
Minterm and Maxterm Equations
F(ABCD) = m (0,2,4,7,9,12,14,15)
AB
CD 00 01 11 10
00 1 1 1
01 1
11 1 1
10 1 1
BC’D’ + BCD + ABC + A’B’D’ + AB’C’D
Determining Prime Implicants and Essential Prime Implicants