This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: maps to minimize the number of literals in the logic implementation of the machine. (20 points) Input Present Next Output 0 S0 S0 0 1 S0 S2 0 0 S1 S2 1 1 S1 S1 0 0 S2 S0 0 1 S2 S1 1 After the encoding is applied: Input X Present AB Next D A D B Output Y 0 0 0 (S0) 0 0 (S0) 0 1 0 0 (S0) 1 0 (S2) 0 0 0 1 (S1) 1 0 (S2) 1 1 0 1 (S1) 0 1 (S1) 0 0 1 0 (S2) 0 0 (S0) 0 1 1 0 (S2) 0 1 (S1) 1 Use Kmaps with don't care conditions (AB = 11) to minimize the logic: X B AX Y B)X (A BX AX D X B X B A D B A + = + = + = + =...
View
Full
Document
This note was uploaded on 06/17/2008 for the course ECE 2030 taught by Professor Wolf during the Fall '07 term at Georgia Tech.
 Fall '07
 WOLF
 Transistor

Click to edit the document details