ECS 154A Lecture Notes - Lecture 13: Vending Machine, Hamming Distance
14 Jul 2016
School
Department
Course
Professor
Document Summary
Lectures 13: vending machine fsm using different flip-flops. Design a vending machine that takes only dimes and quarters. Merchandise is dispensed (z = 1) when the sum of the inputs >= 30 cents. This machine does not give change. x1 = quarter, x2 = dime. Assume that it is not possible to input both quarters and dimes simultaneously. So we have a two input, single output system. The format on the edges will be x1,x2/output. Note that 0,0 is omitted, and would cause the machine to stay in its current state. Second, minimize the number of states through the partition minimization procedure. P2 = (i)(10) (20, 25) based on outputs. Since 20 and 25 have identical k-successors they will remain together. Since there are three states, we will need log23 = 2 flip-flops. As usual, we will start with si in 00.
