Design and implementation of the state machine, Theory of Computation

Assignment Help:

You are required to design a system that controls the speed of a fan's rotation. The speed at which the fan rotates is determined by the ambient temperature, i.e. as the temperature increases, so does the rotation speed of the fan. The system makes use of a small D.C. Motor connected to a microcontroller via a H-Bridge configuration, so that the direction of the fan's rotation can also be controlled.
As the fan rotates, a small disk attached to shaft of the motor passes through an optical encoder, this facility allows us measure the number of rotations in a specific time, usually measured as Rotations Per Minute (RPM)

The user of the system can configure the speed of rotation for a given temperature. This is achieved by using a 4x4 keypad, along with a 128x64 graphics liquid crystal display, to provide feedback to the user. The initial LCD layout is shown below when normally operating.

Temperature Fan's Rotation

22C 2000RPM

Enter Pin to Change System Parameters

A four digit PIN number is required to gain access to allow configuration of system parameters. The method adopted for entering the pin number, needs to be a non-blocking approach, as the motor's speed needs to be continually monitored and controlled as a background task.

As soon as a the four digits have been entered, validation of the entered pin is required. If the PIN number has been entered incorrectly, an appropriate message needs to be displayed for 3 seconds before returning to the normal operation. A correctly entered pin, will display the configuration menu as below  Please select one of the following

Change PIN number

Stop Motor

Start Motor

Change Direction

Configure Temperature vs RPM

A message asking the user to enter their old PIN number will be displayed. If correctly entered, a new message prompting the user to enter their New PIN number will be shown. Once entered, they will be required to enter it again for verification. When the process is complete, the system will return to normal operation. Any error during this procedure will be displayed before returning to normal operation, keeping the existing pin number.

As it suggests, Stops the motor before returning to normal operation. The motor's speed will need to be ramped down before stopping.

Starts the motor before returning to normal operation where the rotation speed is determined by the ambient temperature. The motor's speed needs to be ramped up to the RPM.


Related Discussions:- Design and implementation of the state machine

Construct a recognizer, Let L1 and L2 be CGF. We show that L1 ∩ L2 is CFG t...

Let L1 and L2 be CGF. We show that L1 ∩ L2 is CFG too. Let M1 be a decider for L1 and M2 be a decider for L2 . Consider a 2-tape TM M: "On input x: 1. copy x on the sec

Equivalence of nfas and dfas, In general non-determinism, by introducing a ...

In general non-determinism, by introducing a degree of parallelism, may increase the accepting power of a model of computation. But if we subject NFAs to the same sort of analysis

Xx, Ask queyystion #Minimum 100 words accepted#

Ask queyystion #Minimum 100 words accepted#

Local myhill graphs, Myhill graphs also generalize to the SLk case. The k-f...

Myhill graphs also generalize to the SLk case. The k-factors, however, cannot simply denote edges. Rather the string σ 1 σ 2 ....... σ k-1 σ k asserts, in essence, that if we hav

Non-regular languages, Suppose A = (Q,Σ, T, q 0 , F) is a DFA and that Q = ...

Suppose A = (Q,Σ, T, q 0 , F) is a DFA and that Q = {q 0 , q 1 , . . . , q n-1 } includes n states. Thinking of the automaton in terms of its transition graph, a string x is recogn

Suffix substitution closure, Our primary concern is to obtain a clear chara...

Our primary concern is to obtain a clear characterization of which languages are recognizable by strictly local automata and which aren't. The view of SL2 automata as generators le

Finite state automata, Since the signi?cance of the states represented by t...

Since the signi?cance of the states represented by the nodes of these transition graphs is arbitrary, we will allow ourselves to use any ?nite set (such as {A,B,C,D,E, F,G,H} or ev

Operator p, implementation of operator precedence grammer

implementation of operator precedence grammer

Dfa to re, c program to convert dfa to re

c program to convert dfa to re

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd