REQUIREMENTS Design and implement the vending machine (explained in the lecture notes) using JK flip-flops. 1) Derive the state table. 2) Obtain the optimized FF input and output equations. 3) Implement the circuit on Logisim software. 4) Finally, archive the related files and submit via MERGEN LMS. NOTES 1) Make sure that you connect a clock source, and reset FFs at initialization to put them into a known state. Example: Vending Machine Specification . deliver package of gum after 15 cents deposited single coin slot for dimes (10 cents), nickels (5 cents) no change N Coin Sensor D Open Vending Machine FSM Gum Release Mechanism Reset Cik Example: Vending Machine Inputs: N, D, reset Reset SO Output: open N D S1 S2 Coin Possibilities N D D N S3 S4 S5 S6 three nickels nickel, dime dime, nickel two dimes two nickels, dime open) Topen) Topen] N D S8 S7 [open] [open) Example: Vending Machine Reset 0 Present State O NV 5 D 5 N Inputs DN 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1 0 0 0 1 1 0 1 1 X X Next State O 5 10 X 5 10 15 X 100 15 15 15 Output Open 0 0 0 X 0 0 0 X 0 0 0 1 10 D 10 N, D 15 (open) 15 reuse states whenever possible Symbolic State Table Example: Vending Machine Output Open 0 0 0 0 0 State Encoding Present State Inputs Next State Q, Qo DN D DO 0 0 0 0 0 0 0 1 0 1 1 0 1 0 1 1 X X 0 1 0 0 0 1 0 1 1 0 1 0 1 1 1 1 X X 1 0 0 0 1 0 0 1 1 1 1 0 1 1 1 1 x x 1 1 0 1 1 0 1 1 1 1 1 1 1 1 x x O XOO -Ool 0 1 1 1 Example: Vending Machine Q1 Q1 Q1 Q1 QO DN Q1 QO DN Q1 QO DN IN IN AN D D QO K-map for D1 QO K-map for DO QO K-map for Open Q1 D LK D type FFs for implementation 1Q Treset D1 = Q1 +D+QON I QO OPEN DO = N QO + QON + Q1 N + Q1D DO D Qo 1 Q. Q1 OPEN = Q1 Q0 JK Treset go 8 Gates