ECE2411 Logic Circuits II
Summer 2015
Final Exam
Name: _______________________________
Problem 1. Given the following state transition diagram of a finite state machine, using one-hot
encoding to implement this finite state machine.
Using one-hot encoding to solve this problem. Assume input is X and output is Z.
(1) show the coding for each state.
(2) derive the input equation for each flip flop.
(3) Draw the logic circuit diagram using flip flops and gates. (show on the back of this page)
Problem 2.
Given the above logic circuit diagram of a finite state machine, it has an input x and an output y.
(1) find the state transition table
(2) find the state transition diagram.
Problem 3. Design a counter using T flip flops. The counting sequence is 000 011 101 110 111 001,
repeat this sequence, treat unused sates as don’t cares.
You need to show:
(1) State transition table
(2) Input equations for each flip flop.
(3) Logic circuit diagram of this counter.
Problem 4.
The above finite state machine has one input X, one output Z.
(1) Is this a Moore machine or a Mealy machine?
(2) find the state transition table
(3) find the state transition diagram.
(4) redesign this finite state machine using one-hot encoding
find the input equation for each flip flop using one-hot encoding
(5) show a complete logic circuit diagram of your design