Finite State Machine Based Vending Machine

6m ago
12 Views
0 Downloads
354.79 KB
10 Pages
Last View : 4d ago
Last Download : n/a
Upload by : Gannon Casey
Transcription

International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.2, April 2012Finite State Machine based Vending MachineController with Auto-Billing FeaturesAna Monga1, Balwinder Singh21,2Academic and Consultancy Services-Division,Centre for Development of Advanced Computing(C-DAC), Mohali, .comABSTRACTNowadays, Vending Machines are well known among Japan, Malaysia and Singapore. The quantity ofmachines in these countries is on the top worldwide. This is due to the modern lifestyles which require fastfood processing with high quality. This paper describes the designing of multi select machine using FiniteState Machine Model with Auto-Billing Features. Finite State Machine (FSM) modelling is the most crucialpart in developing proposed model as this reduces the hardware. In this paper the process of four state(user Selection, Waiting for money insertion, product delivery and servicing) has been modelled usingMEALY Machine Model. The proposed model is tested using Spartan 3 development board and itsperformance is compared with CMOS based machine.KEYWORDSFSM; VHDL; Vending Machine; FPGA Spartan 3 development board;1. INTRODUCTIONVending Machines are used to dispense various products like Coffee, Snacks, and Cold Drink etc.when money is inserted into it. Vending Machines have been in existence since 1880s. The firstcommercial coin operated machine was introduced in London and England used for selling postcards. The vending machines are more accessible and practical than the convention purchasingmethod. Nowadays, these can be found everywhere like at railway stations selling train tickets, inschools and offices vending drinks and snacks , in banks as ATM machine and provides evendiamonds and platinum jewellers to customers. Previous CMOS and SED based machines aremore time consuming than the FPGA based machines [7]. The FPGA based machine is also moreflexible, programmable and can be re-programmed. But in microcontroller based machine, if onewants to enhance the design, he has to change the whole architecture again but in FPGA user caneasily increase the number of products.In this paper a new approach is proposed to design an FSM based Vending Machine [3] withauto-billing features. The machine also supports a cancel feature means that the person canwithdraw the request and the money will be returned back to the user. The user will get a bill oftotal number of products delivered with total price. This machine can be used at various placeslike Hotels, Restaurants and food streets. This reduces the time and cost.DOI : 10.5121/vlsic.2012.320219

International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.2, April 20121.1 Operation of Vending MachineI.II.III.IV.When the user puts in money, money counter tells the control unit, the amount of moneyinserted in the Vending Machine.When the user presses the button to purchase the item that he wants, the control unit turnson the motor and dispenses the product if correct amount is inserted.If there is any change, machine will return it to the user.The machine will demand for servicing when the products are not available inside themachine.1.2 FSM (Finite State Machine) [2] [3]In a Finite State Machine the circuit’s output is defined in a different set of states i.e. each outputis a state. A State Register to hold the state of the machine and a next state logic to decode thenext state. An output register defines the output of the machine. In FSM based machines thehardware gets reduced as in this the whole algorithm can be explained in one process.Two types of State machines are:MEALY Machine: In this machine model, the output depends on the present state as well as onthe input. The MEALY machine model is shown in figure 1.Figure 1: MEALY Machine ModelMOORE Machine: In Moore machine model the output only depends on the present state. TheMOORE machine model is shown in figure 2.Figure 2: MOORE Machine ModelThe paper is organized as: section 2 describes the related work. Section 3 relates theimplementation of Vending Machine and section 4 gives the design methodology with descriptionof states. Section 5 and section 6 shows simulation results and conclusion respectively.2. RELATED WORKVarious researches have been carried out in order to design the Vending Machines. A few of themare discussed here as: Fauziah Zainuddin [1] proposes a vending machine for steaming frozenfood using conceptual modelling. In which the process of three main states (user selection state,freezer state and steaming state) has been modelled using process approach, which emphasized onthe process flow or control logic to construct the model for steamed buns vending machineapplication. Conceptual modelling is described in [6]. In [4] the concept of automatic mobilepayment is discussed. This concept is based on the short message payment with the main controlmodule M68HC11 and GPRS module MC35. Thee various methods of designing VHDL based20

International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.2, April 2012machines are discussed in [2], [3] and [9]. Also in [5] the passenger’s requirements for ticketingsystem are given. In [7] a coffee vending machine is designed using single electron encoded logic(SEEL). The designed circuit is tested and its power and switching time is compared with theCMOS technology.3. IMPLEMENTATION OF VENDING MACHINEIn this paper a state diagram is constructed for the proposed machine which can vend fourproducts that is coffee, cold drink, candies and snacks. Four select (select1, select2, select3,select4) inputs are taken for selection of products. Select1 is used for the selection of snacks.Similarly select2, select3, select4 are used for coffee, cold drink and candies respectively. Rs 10and rs 20 inputs represents rupees 10/- and 20/- notes respectively. A cancel input is also usedwhen the user wants to withdraw his request and also the money will be returned through thereturn output. Return, product and change are the outputs. Return and change vectors are sevenbits wide. Money is an in/out signal which can be updated with the total money of all productsdelivered at a time. Money signal is seven bits wide. Money count is an internal signal which canbe updated at every transition. This signal is also seven bits wide. If the inserted money is morethan the total money of products then the change will be returned through the change outputsignal. The products with their prices are shown by table 1. There are also two input signal clkand reset. The machine will work on the positive edge of clock and will return to its initial statewhen reset button is pressed. The proposed vending machine is designed using FSM modellingand is coded in VHDL language. The detail of the entire signal with their direction anddescription is shown in table 2.Table 1: Products with their pricesS.No.1.2.3.4.ProductsSnacksCoffeeCold drinkCandiesPrice30/40/40/30/-Table 2: Inputs/Outputs with RemarksNameclkResetSel1Sel2Sel3Sel4CancelMoneyRs 10Rs tputoutputoutputDescriptionClockSyn resetSnacksCoffeeCold drinkCandiesCancelTotal moneyRupees 10/Rupees 20/Product outExtra changeReturn money21

International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.2, April 20124. DESIGN METHODOLOGYThe state diagram mainly consists of four states (User Selection, Waiting for the money insertion,product delivery and servicing (when product not available ’1’)). Initially when the reset buttonis pressed, the machine will be ready for the users to select the product. This state is the initialstate of the design. After this the user will select the product to be dispensed. This state can beone of the select1, select2, select3 and select 4. The machine can accept only two types of notesi.e. rupees 10/- and 20/-. Let us suppose that the user selects sel1 input. The machine will firstlycheck that whether the products are available in the machine or not. After this the control unit willmove to the waiting state, where it will wait for the money to be inserted. Then if rupees 10/- noteis inserted then the machine will go to state 1 and wait until the desired money is inserted. And ifrupees 20/- note is inserted the machine will move to state 2 and then wait until 30/- rupees areinserted to the machine. When the desired amount is inserted the machine will go to the snacksstate and snacks will be delivered at the product output. If products are not available in themachine then the control unit will demand for servicing and after service the machine will getreset. This methodology is explained using a flow diagram shown in figure 3.StartSelect ProductYesSelect 1?NoYesSelect 2?NoYesSelect 3?NoSelect 4?NoIf Productavailable?YesInsert Desired Money forselected productNoCancel therequestIf rightAmount?YesInserted MoneyReturnedProduct out with changereturns if anyEndFigure 3: Flow Chart for Proposed Vending MachineThere is also an additional feature of withdrawing the request if the user doesn’t want to take theproduct. When cancel button is pressed then the money inserted will be returned to the user22

International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.2, April 2012through the return output. A money count signal is used for calculating the total money insertedin the machine. And if the money inserted is more than the money of the product then the extrachange will be returned to the user. The total amount of the product taken at a time is shown bythe money signal. Similarly the user can select and get the other products following the aboveprocedure.Description of statesThe selection of products and all the states are shown below in figure 4. When initialize money count 0; Change 0; Product 0; When select1 Sel1&!sel2&!sel3&!sel4 When product available 1 nx st1 waiting1; When product available 0 nx st1 service1; When waiting1 When rs 10&!rs 20 nx st1 state 1; When !rs 10&rs 20 nx st1 state 2; Change 0;product 0; When money count 30 nx st1 snacks; When state 1 Rs 10 1 & rs 20 0; Change 0;Product 0; Money count money count 10;Figure 4: Finite State Machine Diagram of Vending Machine23

International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.2, April 2012 When state 2 Rs 10 0 & rs 20 1; Change 0;Product 1; Money count money count 20; When snacks Money count 30; Product 1; Change money count-30; Snack count snack count-1; When service snack count 4 product 0; next state resett;When cancel1 cancel 1; return money count;Similarly we can select other products (coffee, Cold drink and candies).5. SIMULATION RESULTSThe state diagram shown in figure 4 is simulated using Xilinx ISE Simulator. SimulationWaveforms for the selection of four products like snacks is shown in figure 5 and 6 respectivelywith servicing feature when products are not available in the machine and change return featureswhen the money inserted is more than the money of the product.Let us take an example that the user wants to take Snacks. When one selects sel1 button, themachine will check that whether the products are available or not, if available then it will go tothe waiting state and wait for total money insertion. If rs 10 note is inserted it will go to state 1and if rs 20 note is inserted it will so to state 2 and check whether money count 30 or not. Ifthe money count - 30 then machine will go to state snacks and vend the product.Figure 5: Simulation waveform showing selection of Snacks24

International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.2, April 2012Figure 6: Simulation waveform when snack count 0If the user wants to cancel the request, can do so by pressing the cancel button and the wholemoney entered will be returned to the user. This is shown in figure 7.Figure 7: Simulation waveform showing Cancel OperationThe RTL view of the machine is shown in figure 8.Figure 8: RTL view of Vending Machine.The design summary of the proposed machine is shown below in table 3.25

International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.2, April 2012Table 3: Device Utilization SummaryLogic utilizationUsedAvailableUtilizationNumber of Slices22835846%Number of Slice flip flopsNumber of 4 input LUT’s98432716871681%6%Number of bonded IOB’s3117317%Number of GCLK’s1812%The comparison of VHDL based machine with the CMOS technology based machine on the basisof switching speed is shown in table 4.Table 4: Comparison of Switching SpeedParameterusing FPGAUsing Single ElectronEncoded Logic (SEEL)Using CMOStechnologySwitching Speed9.3 ns12.53 ns300ns6. CONCLUSIONThe present FPGA based vending machine controller is implemented using FSMs with the help ofXilinx ISE Design Suite 12.4. The design is verified on the FPGA Spartan 3 development Board.State machines based vending Systems enhances productivity, reduces system development cost,and accelerates time to market. Also FPGA based vending machine give fast response and easy touse by an ordinary person. The designed machine can be used for many applications and we caneasily enhance the number of selections. The next stage of this study is to convert this model intohardware and to calculate the total power consumption of the machine.REFERENCES[1]Fauziah Zainuddin, Norlin Mohd Ali, Roslina Mohd Sidek, Awanis Romli, Nooryati Talib & Mohd.Izham Ibrahim (2009) “Conceptual Modeling for Simulation: Steaming frozen Food Processing inVending Machine” International Conference on Computer Science and Information Technology,University Malaysia Pahang, pp.145-149.[2]Xilinx Inc., Spartan 3 Data sheet: http://ww w.xilinx.com.[3]Bhaskar “VHDL primer” Second Edition,[4]Peter Minns & Ian Elliott, “FSM-based Digital Design using Verilog HDL”, John Wiley & Sons Ltd2008.[5]Zhang Wen & Zhang Xin Long (2010) “Design and Implementation of automatic vending machineBased on the short massage payment” International Conference on Information and Communicationtechnology in Electrical Sciences, Neijiang, Sichuan, China.pp.978-981.[6]B. Caulfield & M.O Mahony (2005) “Passenger Requirements of a Public Transport TicketingSystem” Proceedings of the 8th International IEEE Conference on Intelligent Transportation SystemsVienna, Austria, pp-32-37.[7]M. Zhou, Q. Zhang & Z. Chen (2006), “What Can Be Done to Automate Conceptual SimulationModelling?” Proceedings of the 2006 Winter Simulation Conference, pp. 809 – 814.26

International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.2, April 2012[8]Biplab Roy & Biswarup Mukherjee (2010) “Design of Coffee Vending Machine using SingleElectron Devices” Proceedings of 2010 International Symposium on Electronic System Design. Pp38-43.[9]C. J Clement Singh, K Senthil Kumar, Jayanto Gope, Suman Basu & Subir Kumar Sarkar (2007) “Single Electron Device based Automatic Tea Vending Machine” proceedings of InternationalConference on Information and Communication Technology in Electrical Sciences (ICTES 2007) , pp891-896.[10] P. Smith (1997) “Automatic Hot-food Vending Machine,” Trends in Food Science &October 1997, Vol. 81, and pp. 349.Technology[11] M. Zhou, Y. J. Son, & Z. Chen, (2004), “Knowledge Representation for Conceptual SimulationModeling” Proceedings of the 2004 Winter Simulation Conference, pp. 450 – 458.[12] J.Komer (2004) “Digital logic and state machine design”, 2nd ed., Oxford.[13] Muhammad Ali Qureshi, Abdul Aziz & Hafiz Faiz Rasool “Design and Implementation of AutomaticTicket System using Verilog HDL” proceedings of tnternational conference on InformationTechnology, pp- 707-712.[14] Steve Kilts,” Advanced FPGA Design: Architecture, Implementation, and optimization”, Wiley-IEEEpress, 2007.[15] Seyed Bahram Zahir Azami & Mohammad Tanabian “Automatic Mobile Payment on a nonConnected Vending Machine” proceedings of Canadian Conference on Electrical and ComputerEngineering, 2004, pp- 731-734.27

International Journal of VLSI design & Communication Systems (VLSICS) Vol.3, No.2, April 2012Authors BiographyBalwinder Singh has obtained his Bachelor of Technology degree fromNational Institute of Technology, Jalandhar and Master of Technology degreefrom University Centre for Inst. & Microelectronics (UCIM), Punjab UniversityChandigarh in 2002 and 2004 respectively. He is currently serving as SeniorEngineer in Centre for Development of Advanced Computing (CDAC), Mohaliand is a part of the teaching faculty and also pursuing Ph.D. from GNDUAmritsar. He has 6 years of teaching experience to both undergraduate andpostgraduate students. Singh has published three books and many papers in theInternational & National Journal and Conferences. His current interest includesGenetic algorithms, Low Power techniques, VLSI Design & Testing, and Systemon Chip.Ana Monga received the B.Tech. (Electronics and CommunicationEngineering) degree from the D.A.V Institute of Engineering and Technology,Jalandhar affiliated to Punjab Technical University, Jalandhar in 2006, andpresently she is doing M.Tech (VLSI design) degree from Centre forDevelopment of Advanced Computing (CDAC), Mohali and working on herthesis work. Her area of interest is FPGA Implementation and VLSI Design andTesting, Electronic devices and circuits, signals and systems.28

machine. 1.2 FSM (Finite State Machine) [2] [3] In a Finite State Machine the circuit’s output is defined in a different set of states i.e. each output is a state. A State Register to hold the state of the machine and a next state logic to decode the next state. An output register def

Related Documents:

Automata Theory, Vending Machine, Nondeterministic Finite State Machine, and VAS. 1. INTRODUCTION Vending machines (VM) are electronic devices used to provide different products such as snakes, coffee, and tickets, etc. They are designed to be able to accept money and serve p

The finite state machine (FSM) approach is adopted for the design of vending machine. The design is achieved by formulating the Verilog code for the FSM-based machine using behavioural modeling and simulating the testbench for three products using Xilinx ISE tool. Keywords:- Vending Machine,

FINITE STATE MACHINES (AUTOMATA) Think about the On/Off button Switch Example 1. Off On Push Push Switch Example 1 The corresponding Automaton Input: Push Push Push Push. Vending Machine Example 2 Vending machine dispenses Cola for 0.45. Input: D Q Q D Vending Machine Example 2 Input Accepted 45 is final

4. Lift up on the front of the tray and pull slightly forward (approximately 1/2 inch/1.5 cm) to clear the tray stop. 5. Lift up on the rear of the tray and remove it from the vending machine. To replace a tray in the vending machine: 6. 12 Selection Vending Machine: Place the back of the tray on the ra

Vending machines have been around long before computers. – Or Java, for that matter. Don’t really need int’s. – Each int introduces 232 possibilities. Don’t need to know how to add integers to model vending machine – total coin. Java grammar, if-then-else, etc. complica

deterministic finite-state machine to a deterministic one There is a potential exponential blowup: an N-state machine can become an 2N-state machine As a high-level example think –of a state machine that tracks the amount of money put into a vending machine and –of a state machine that

Finite State Machines 54 T he simplest and most efficient computational device that we will consider is the finite state machine (or FSM). EXAMPLE 5.1 A Vending Machine Consider the problem of deciding when to dispense a drink from a vending ma chine. To simplify the proble

The Coke Vending Machine Vending machine dispenses soda for 0.45 a pop. Accepts only dimes ( 0.10) and quarters ( 0.25). . state and add links to the fail state to finish the construction. Since there’s only a finite number of finite strings, the automaton is finite. Example

the moment it is sold. Currently, vending machines operate to keep soda cold at all times in case someone wants to pur-chase one. The energy consumption of vending machines can be significantly reduced by regulating the compressor based on a thermal model of the vending machine and sod

Bianchi Industry leading manufacturer of vending machines and professional coffee machines for Ho.Re.Ca. market was founded in 1959. The company boasts 50 years of activity in the vending machine market, initially as Nuova Bianchi and after as Bianchi Vending Group. Since 2008 the Group is identified with the trademark Bianchi Industry.

Deterministic Finite Automata plays a vital role in lexical analysis phase of compiler design, Control Flow graph in software testing, Machine learning [16], etc. Finite state machine or finite automata is classified into two. These are Deterministic Finite Automata (DFA) and non-deterministic Finite Automata(NFA).

Finite element analysis DNV GL AS 1.7 Finite element types All calculation methods described in this class guideline are based on linear finite element analysis of three dimensional structural models. The general types of finite elements to be used in the finite element analysis are given in Table 2. Table 2 Types of finite element Type of .

I Continue as MSc. in Computer Science and Engineering I Specialization in I Digital Systems I Embedded and Distributed Systems 14/68. Web Resources I DTU Learn . I Builds up to the final project: a vending machine I The vending machine and the report are graded 20/68. A Vending Machine fr

ensure that it is likely to be read at each point of sale. § 39-17-1507 Vending machine sales and Makes it unlawful for any person to sell tobacco products through a vending machine unless 21 C.F.R. the vending machine is located in a

The CF7000 is mounted onto the vending machine by hanging it onto three studs located on the vending machine. To do this you will need to open the discriminator assembly and line up the mounting keyholes of the coin manager with the vending machine studs. Press the yellow button at

Sep 18, 2018 · The Lottery Touch Vending Machine has a remote control that allows you to disable the machine if you see an underage Player trying to purchase tickets from the machine. Once disabled, the machine issues a refund slip for any credits remaining in the machine. To disable the mac

An automaton with a finite number of states is called a Finite Automaton (FA) or Finite State Machine (FSM). Formal definition of a Finite Automaton An automaton can be represented by a 5-tuple (Q, Σ, δ, q 0, F), where: Q is a finite set of states. Σ is a finite

1 CSE140 L Instructor: Thomas Y. P. Lee February 15, 2006 Agenda zLab3 Counters are FSM Finite State Machine Models to represent FSM – Mealy Machine and Moore Machine zFSM Design Procedure State Diagram State Transition Table Next State Logic Functions zExample One – Vending Machine Mealy Machine Imple

This vending machine has been designed to give you many years of dependable service. It requires little maintenance and is easy to set up and operate. READ THIS MANUAL COMPLETELY Your vending machine is designed to operate simply and reliably, but to take full advantage of

original reference. Referencing another writer’s graph. Figure 6. Effective gallic acid on biomass of Fusarium oxysporum f. sp. (Wu et al., 2009, p.300). A short guide to referencing figures and tables for Postgraduate Taught students Big Data assessment Data compression rate Data processing speed Time Efficiency Figure 5. Data processing speed, data compression rate and Big Data assessment .