Scribd
Upload
19 views4 pages

2024 - (Ee303a) HW4

The document outlines the homework assignment EE303(A) for Fall 2024, which includes tasks related to finite state machines (FSMs) such as drawing state diagrams, optimizing FSMs for a vending machine, partitioning an up-down counter, and constructing a state transition diagram for a counter. Each task has specific point values and requirements, including the use of Moore and Mealy machines, encoding states, and ensuring limited logic terms in FSM transitions. The assignment is due on November 28, 2024, at 11:59 PM.

Uploaded by

magiclampjinnii
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
19 views4 pages

2024 - (Ee303a) HW4

The document outlines the homework assignment EE303(A) for Fall 2024, which includes tasks related to finite state machines (FSMs) such as drawing state diagrams, optimizing FSMs for a vending machine, partitioning an up-down counter, and constructing a state transition diagram for a counter. Each task has specific point values and requirements, including the use of Moore and Mealy machines, encoding states, and ensuring limited logic terms in FSM transitions. The assignment is due on November 28, 2024, at 11:59 PM.

Uploaded by

magiclampjinnii
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

EE303(A) 2024 Fall HW #4

(Due: 2024-11-28 Thursday 11:59 PM)


1. [FSM Diagram, 20pts] The following is a state diagram of a Moore machine representing a 01/10
detector with 5 states. This can be represented as a Mealy machine using only 3 states. Based on
the Moore machine, draw the state diagram for the equivalent Mealy machine.

&

) sorece
o

as
G yo
0/2

00
2. [FSM Optimization, 40pts] Consider a vending machine that only accepts Dime ($10) and Nickel
($5). When the total input reaches $15, the machine dispenses a drink. Once the vending machine is
in the "open" state (drink dispensed), it remains in the open state until a RESET signal is received.
The FSM below represents all possible input sequences. Referencing this FSM, answer the following
questions:

No ⑲
+ Bo

↑X t L
%
) %

%
&

(a) Minimize the FSM using a Moore machine. (Ensure the FSM accounts for all possible inputs in
each state, including N, D, RESET, and N'D'.) [20pts]

(b) Encode the states of the Moore machine such that the current state's accumulated amount is
represented in increasing order. Use D flip-flops, 2-input AND gates, and OR gates to draw the
circuit. (The initial state with $0 should be encoded as 00, followed by 01 for the next smallest
amount, and so on.) [20pts]

·
next state

0 I 01 5 O
($0)
3. [FSM Partitioning, 20pts] Given the following up-down counter, you are tasked to split its FSM
into two separate FSMs. Draw the two resulting FSMs. (Ensure that the logic for state transitions in
each FSM is limited to a maximum of 2 terms.)
Hint: Assign a virtual state (SA or SB) to each of the divided FSMs. During state transitions, utilize
the state information from the other FSM where necessary.

So

#(DS3 + U St)
.

S1
SAD
Dis
S2
St
p
& SB S4
(D SO + U S2)/
Nus
.
.

S3
4. [FSM Construction, 20pts] Draw a state transition diagram for the following counter. Assume
that the counters start with CBA = 000

A
+
=
BC BT =
B + Acc
+
=
A

I
+
AB C B+ At

CO C. T
~
2BA
000

01 011 000 -X
2BA 2BA
11 101 100 110 010
10110110
↑
B

You might also like