AUTOMATIC VENDING MACHINE

PROJECT REPORT
Submitted for CAL in B.Tech Digital Logic and Design (CSE1003)

By

AYUSH THADA (16BCE1333)

TANAY AGARWAL (16BCE1324)
SACHET SUNIL ZODE (16BCE1002)
RAHUL ANOOP KELKAR (16BCE1380)
RAJAT MAHESHWARI (16BCE1001)

Slot: F1
NITHYADARISINI P.S.

(SCHOOL OF COMPUTER SCIENCE AND ENGINEERING)

April, 2017
1
 CERTIFICATE

This is to certify that the Project work entitled “Automatic Vending Machine” that is being
submitted by “ Ayush Thada, Tanay Agarwal, Sachet Sunil Zode, Rahul AnoopKelkar and Rajat
Maheshwarifor CAL in B. Tech/MIS Digital Logic and Design is a record of bonafide work done
under my supervision. The contents of this Project work, in full or in parts, are not submitted for
any other CAL course.

Place: Chennai
Date: April 5, 2017

Group Members:

Ayush Thada (16bce1333)

Tanay agarwal (16bce1324)
Sachet Sunil Zode (16bce1002)
Rahul Anoop Kelkar (16bce1380)
Rajat Maheshwari (16bce1001)

Submitted To:

Nithyadarisini P.S
2
 ACKNOWLEDGEMENT

I would firstly like to thank my course instructor,Nithyadarisini P.S who gave me his extremely
helpful inputs about my project on “AUTOMATIC VENDING MACHINE”. Without her help we could
not have proceeded with this project. This project was collaborated work of all the group
members of our project. Hard work and dedication of our team is responsible for completion of
this project which is really a challenging task for all of us.

ABSTRACT

A finite-state machine or finite-state automaton, finite automaton, or simply a state machine, is a

mathematical model of computationIt is an abstract machine that can be in exactly one of a finite
number of states at any given time. The FSM can change from one state to another in response to
some external inputs; the change from one state to another is called a transition. A FSM is defined
by a list of its states, its initial state, and the conditions for each transition.The behavior of state
machines can be observed in many devices in modern society that perform a predetermined
sequence of actions depending on a sequence of events with which they are presented.

In our project we intend to design one finite a state machine i.e. vending machines, which
dispense products when the proper combination of coins is deposited. In this project we will
design logic of vending machine and implement it through a digital circuit.

OBJECTIVE
 To design a digital logic for vending machine, hence implement the circuits to design circuit
of an automatic time machine.
 To demonstrate the working of an automatic vending machine.
3
 DESIGN PROCESS

A circuit was designed that would implement the function of a vending machine controller. The
machine was designed to accept 10 and 25 coins. In addition, the machine dispensed items
priced at 10 (item A) and 25 (item B), when the respective amount of money was inputted. The
machine accepted coins up to the price of the most expensive item (25). In other words, if the
user inputted 30 the machine returned 5 in change, retained 25, and waited for the user to
perform an action (select A, select).If the user deposited a total of 25 and then deposited
another coin, the coins were immediately returned as change.

Figure 1: Inputs and outputs of vending machine controller

4
The vending machine controller was designed as a Mealy machine. In other words, the outputs of
the machine depended on the inputs. The vending machine controller was first implemented in a
Figure 2: Finite state machine for the vending machine controller
(Format: input/change/dispense)

5
With the use of the state diagram, the state assignments, change assignments, item assignments,
and input encoding, the following tables were constructed :

The state transition table demonstrates the transition of states based on the user input. For
example, if the machine is at state 01 (contains 10) and the user decides to input another 10
(input 001), the machine will now move to state 11 (containing20). The first column of each block
represents Q1*, while the second column represents Q0*.

6
The change table demonstrates the amount of change to be dispensed based on the input.
For example, if the machine contains 25 (state 10), and the user selects item A to be
dispensed (input 011), the machine will return 15 in change (output 110).The first column of
each block Represents C1, the second column represents C2, and the third column represents
C3.

The dispense table demonstrates the item being dispense based on the input. For example, if
the machine contains 10(state 01), and the user selects item A to be dispensed (input 011),
the machine will dispense item A (output 10). The first column of each block represents D1,
while the second column represents D2.

7
After the tables were carefully analyzed,a
softwareprogramcalledEspressowasusedtominimizethelogicanddeterminethefollowingequations
:

IMPLEMENTATION

The equations listed above were used to determine the hardware needed to successfully
create a fully functioning vending machine dispenser. Logic gates such as AND ,OR, Inverters,
and D- Flip Flops were used to create the vending machine controller on a breadboard. Due to
the complex nature of the assignment, the hardware implementation proved to be far more
difficult than previously thought .Often, many wires were inserted in to the wrong terminals
on the breadboard. In addition, the clock (a push button) was implemented in correctly at
first, and thus the machine was not able to change states. The circuit was assembled and
reassembled several times in order to remove all bugs. Figure 3 depicts the circuit diagram of
the vending machine controller.

8
Figure3: Circuit diagram and list of types of chips used

9
Figure: Implemented Circuit

1
0
 RESULT

The vending machine controller performed exact to its design. The controller changed states,
gave change, and dispensed items appropriately. Each input/output case was carefully tested
and deemed to be in working condition.

CONCLUSION

In the end this was a very educational assignment .The project provided a small insight to how to
designing a real-world machine is like. This project was very fascinating because it allowed
students to design and implement the entire circuit from scratch. It was an appropriate end-of-
course project because it required knowledge in all the topics taught in class (such as logic gates,
logic minimization, combinational and sequential logic, and state diagrams etc.) .

BIBILOGRAPHY

https://electronics.stackexchange.com/questions/64838/simple-vending-machine-circuit
https://www.slideshare.net/sososos39794/vending-machine-24580255
https://courses.cs.washington.edu/courses/cse370/09wi/LectureSlides/23-Encoding.pdf
http://www.electronics-tutorials.ws/waveforms/555_timer.html
https://www.youtube.com/watch?v=Z4Zz7n-Lj0g&t=59s

1
1