ECE 274 – Homework Assignment 5 Due at the beginning of class – Monday April 23, 2007 1. (10 points) Implement a Moore FSM that outputs the sequence ab = 00, 11, 11, 10, repeat, when input x = 1. When input x = 0, output the current value (i.e. stay put). a. Capture the FSM b. Create the architecture c. Encode the states d. Create the state table e. Implement the combinational logic (don’t forget to optimize logic using k-maps) 2. (15 points) Determine the cost of the combinational logic required to implement the FSM provided, utilizing each of the encoding schemes listed below. For each implementation, provide a state table, the resulting equations, and the cost of the final circuit (combinational logic part only, ignore the state register). a. Minimum bit-width binary encoding b. One-hot encoding c. Output encoding 3. (5 points)Implement a Mealy FSM that detects the input sequence pattern z = 1, 0, 1, 0. Whenever the input pattern is detected immediately output f = 1 (do not wait until the next clock cycle). You only need to show the FSM. Hint: What happens when you detect input z = 1, 0, 1, 0, 1, 0? 4. (10 points) Minimize the following FSM using implication tables. Show the minimized FSM. 5. (10 points) Minimize the following state table using the partitioning approach. Show the corresponding partitions, you do not need to show the minimized FSM. Inputs Outputs Current State a Next State f P 0 S 1 P 1 T 1 Q 0 R 1 Q 1 T 1 R 0 T 0 R 1 R 0 S 0 T 0 S 1 R 0 T 0 S 1 T 1 Q 1 U 0 R 0 U 1 T 0 AB D Inputs: z Outputs: abc C abc = 100 abc = 011 abc = 000abc = 010 zz’ z z’ A B DInputs: q Outputs: out Cout = 1 out = 0 out = 0 out = 1 q’ q E q’ out = 0 q q’ q q’ q6. (5 points) Convert the following Moore FSM to a Mealy FSM. 7. (5 points) Convert the following Mealy FSM to a Moore FSM A B D Inputs: ab Outputs: w C w = 1 w = 1 w = 1 w = 0 a’b’a’b’ ab’ ab b’ ab b b’ + ab’ A B D Inputs: y Outputs: e y’ / e = 0 y’ / e = 1 y / e = 0 y / e = 0 / e =
View Full Document
Unlocking...