CEG 2136 Lecture Notes - Lecture 2: Sequential Circuits, Logic Optimization, Boolean Expression
15 Sep 2017
School
Department
Course
Professor
Document Summary
Aims to reduce the number of gates and the number of inputs for a gate. Results in reduced cost, better efficiency and power consumption. Implicant: product term that, if equal to 1, implied f=1. Prime implicant: an implicant which cannot be totally covered by another implicant (can be more than one box on a k-map) Essential prime implicant: a prime implicant that contains at least one prime implicant. Minimum cover: the combination of all the essential prime implicants. Don"t care terms: terms that can be treated as 1"s or 0"s, depending on which one is more advantageous. Set up of a number of connected logic gates implementing the logic function between n input variables and m output variables. Output is re-computed as soon as a change in the input occurs. Assign different litter symbols to the input and output variables. Derive the truth table defining the relationship between the inputs and the outputs.
