+1-415-670-9189
info@expertsmind.com
Finite-state machine design
Course:- Theory of Computation
Reference No.:- EM13393




Assignment Help
Assignment Help >> Theory of Computation

Create a finite-state machine design to turn your FPGA development board into a simple programmable music box.

The requirements are as follows:

The system should be able to generate melodies, i.e., a sequence of notes. Notes can be selected from a bank of 16 possible sounds: 15 notes and a pause (no sound). A note is generated by a vibration of a definite frequency as shown:

1364_Turn FPGA into a simple music box.png

The overall aim of the project is to create a machine capable of four functions of increasing complexity. The functions are listed below:

Level 1

Your system should take in a slide switch combination and give out the notes listed above as a square wave output fed to a speaker (Figure 1 below).

768_Turn FPGA into a simple music box1.png

                                                            Figure 1: From slide switches to sound

Level 2

As the next feature, your system should play a melody based on a given sequence of notes (in appendix 1 you will find some sequences, or you can make up your own). You will need to create a module which can be initialised to contain the desired sequence of notes. Upon pressure of a push button, these notes will be read by your machine and played out through the speaker. Notes should be played out in a "static" manner, i.e., all notes should be sounded for 0.4 seconds followed by a 0.1 second period of silence. This is simple but makes for a rather boring melody!

The four push buttons on the board should have the roles play and pause.

- Play plays the melody from the beginning

- Pause pauses the melody from playing and if pressed again playing will resume from where it stopped

Level 3

Create a system which can be programmed to make music with a customised melody. Notes can be entered as a slide switch input (as in function 1) and saved into a register one at a time, by pressing a button. Then, when a second button is pressed, the music will be played back to you, in the same "static" manner presented in function 2 (0.4s sound followed by 0.1s silence for each note). Allow for at least 64 notes.

The four push buttons on the board should act as save note, play, pause and reset:

- Play plays the melody from the beginning

- Pause pauses the melody from playing and if pressed again playing will resume from where it stopped

- Save note saves the note in your machine's memory

- Reset clears the memory ready for a new input to be stored

Level 4

Now the most difficult of all. Create a system which will record your own musical performance with the slide switches (you will start the recording by pressing a push button, play a melody with your slide switches, and finally stop recording by pressing a second push button). Then, the system will play your performance back to you when another button is pressed. Both the notes and the timing must be the same as in your performance.

The four push buttons on the board should act as start recording, stop recording, play from the beginning and reset:

- Start recording tells the machine to commence storing your actions into memory

- Stop recording tells the machine that you have finished playing music

- Play from the beginning plays the sounds from the start

- Reset clears the memory ready for a new performance to be memorised

Level 5: the overall state machine

The four functions can be implemented as separate designs, but you will get extra marks for creating a single machine which can switch between the different functions. Since most of your buttons are taken up by the four functions, you can consider using the central button [V16] (it has a dial on it, but it also works as a push button if you press down on it) to switch between functions. I also recommend using an informative LED output to make the user aware of what function they are using.




Put your comment
 
Minimize


Ask Question & Get Answers from Experts
Browse some more (Theory of Computation) Materials
Design Turing machine (using Sipser notation) having at least 4 nontrivial (i.e., nonrejecting) states and at least six nontrivial (i.e., not to the rejecting state) transit
Construct for this grammar its collection of sets of LR(0) items. If we try to build an LR-parsing table for the grammar, there are certain conicting actions. What are they?
Write some examples of declarative knowledge. Write some examples of procedural knowledge. Then, compare examples, highlighting the similarities & differences.
Explain the importance of having a test coupled with real users' views of the product at the end of the development effort, even if it is the test of a prototype and not the
How the problem would be encountered in attempting to represent the following statements in Predicate logic. it should be possible to: John only likes to see French movies.
Let  be a 3cnf-formula. An  assignment to the variables of  is one where each clause contains two literals with unequal truth values. In other words
Give state diagram of DFA recognizing the following languages, alphabet S = {0, 1}: - How cardinality of infinite sets is measured? Provide couple of closure properties of co
Determine, formally, whether L(R1(R1 + R2)*) = L((R1 + R2)*). That is, if it is true, provide a proof; otherwise provide a counter example.It is a well known result that every