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

Gastric juice, what are composition and its function of gastric juice

what are composition and its function of gastric juice

Myhill-nerode theorem, This close relationship between the SL2 languages an...

This close relationship between the SL2 languages and the recognizable languages lets us use some of what we know about SL 2 to discover properties of the recognizable languages.

Describe the algorithm and draw the transition diagram, 1. Simulate a TM wi...

1. Simulate a TM with infinite tape on both ends using a two-track TM with finite storage 2. Prove the following language is non-Turing recognizable using the diagnolization

Suffix substitution , Exercise Show, using Suffix Substitution Closure, tha...

Exercise Show, using Suffix Substitution Closure, that L 3 . L 3 ∈ SL 2 . Explain how it can be the case that L 3 . L 3 ∈ SL 2 , while L 3 . L 3 ⊆ L + 3 and L + 3 ∈ SL

Finiteness of languages is decidable, To see this, note that if there are a...

To see this, note that if there are any cycles in the Myhill graph of A then L(A) will be infinite, since any such cycle can be repeated arbitrarily many times. Conversely, if the

Local suffix substitution closure, The k-local Myhill graphs provide an eas...

The k-local Myhill graphs provide an easy means to generalize the suffix substitution closure property for the strictly k-local languages. Lemma (k-Local Suffix Substitution Clo

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

Defining strictly local automata, One of the first issues to resolve, when ...

One of the first issues to resolve, when exploring any mechanism for defining languages is the question of how to go about constructing instances of the mechanism which define part

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