Levels Tought:
University
Teaching Since: | Apr 2017 |
Last Sign in: | 343 Weeks Ago, 4 Days Ago |
Questions Answered: | 9562 |
Tutorials Posted: | 9559 |
bachelor in business administration
Polytechnic State University Sanluis
Jan-2006 - Nov-2010
CPA
Polytechnic State University
Jan-2012 - Nov-2016
Professor
Harvard Square Academy (HS2)
Mar-2012 - Present
Â
15.12  A Moore sequential circuit has a single input (X) and a single output (Z).Z is 1if the most recent four inputs contained exactly two consecutive 1's or exactly two consecutive o's, i.e., the input sequences 0011, 1001, 1100, 0110, 0100, 1011, and 1101. (The initial stateS0 acts as if the preceding inputswere all o's.) The following state tablewas constructed using a sufficient number of states to remember the last four inputs and the output for each state assigned according to the sequence remembered by that state.
Â
Â
(a)   Reduce the table to a minimum number of states. (Hint: First use the simple example of state equivalence used in Section 1 5. 1to eliminate as many states as possible.)
(b)Â Â For each state in the reduced table, give the input pattern remembered by that state.
(c)Â Â Convert the reduced table from Part
(a) into a Mealy state table that produces the same outputs.
(d) Reduce the Mealy state table to a minimum number of states.
Â
Â
Input Pattern |
Present State |
Next State XÂ =Â OÂ X = 1 |
Output z |
0000 0001 0010 0011 0100 0101 0110 0111 1000 1001 1010 1011 1100 1101 1110 1111 |
So s, 52 53 s. Ss 56 s, Sa Sg S,o s,, S,2 513 s,. S,s |
So    s, 52   53 s.  Ss 56    s, Sa    Sg S,o    s,, S,2  513 s,. S,s So    s, 52    53 s.  Ss 56    s, Sa    Sg S,o    s,, S,2  513 s,. S,s |
0 0 0 1 1 0 1 0 0 1 0 1 1 1 0 0 |
Â
Â
-----------