Create a finite-state machine design to turn your fpga

Assignment Help Theory of Computation
Reference no: EM13346505

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.

Reference no: EM13346505

Questions Cloud

The supply chain management team at cwc is considering : the supply chain management team at cwc is considering whether the current production and distribution network is still
In a shell-and-tube heat exchanger one fluid passes through : in a shell-and-tube heat exchanger one fluid passes through a central tube while another fluid flows through an outer
Task - 1i- describe how test flumes and associated : task - 1i- describe how test flumes and associated equipment are used to assess and confirm hydraulic behaviour in open
A company enters into a four year service contract at a : a company enters into a four year service contract at a contracted price of 12000000 on december 31 20x0. at that time
Create a finite-state machine design to turn your fpga : create a finite-state machine design to turn your fpga development board into a simple programmable music box. the
Provide an executive summary of the individual researchwhat : provide an executive summary of the individual research.what were the key conclusions of the research?identify what you
Andrew brian colin diana and elizabeth were the directors : andrew brian colin diana and elizabeth were the directors of gemsales pty ltd a company engaged in the business of
Each candidate in this class is to identify a teacher in : each candidate in this class is to identify a teacher in herhis school who is willing to participate in a supervisory
Write a report on change is the only constant and answer : write a report on change is the only constant and answer the subsequent questions.1. change is the only constant

Reviews

Write a Review

Theory of Computation Questions & Answers

  Create and implement a lexical analyzer for c

Create and implement a lexical analyzer for C-- as follows: Write the set of token types to be returned by lexical analyzer. Explain regular expressions for this set of token types.

  Design mealy fsm with the input a and output z

Design a Mealy FSM with the input A and an output Z. If 10101 shows up on A, then in same cycle 1 must show up on Z, else Z is 0.

  Use algorithm np completeness of any of the problems

Use any algorithm we without writing out details of algorithm. In proving problem NP-complete, you may utilize NP completeness of any of the problems.

  Show polynomial-time algorithm for gdp

Goal is to find expedition of maximum profit. Either show that there exists polynomial-time algorithm for GDP, or show that corresponding decision problem is NP-complete.

  Write a research paper - utilize the lirn library

Utilize the LIRN Library to help you search for resources. You can visit the Academic Resource Center for a guide on how to utilize the LIRN Library successfully.

  Write problems which have no solutions

What does the term solvable mean to you? What does it mean to say that "you solved a problem"? Determine examples of problems for which you believe there are no solutions.

  How to express correctness properties in ltl

Express the given correctness properties in LTL. Defne propositions/variables to model the events mentioned in the question. If a parent process calls the blocking waitpid() system call then it is blocked until child process terminates.

  Deterministic finite and non-deterministic finite automata

Describe the difference between a Deterministic Finite Automata and Non-Deterministic Finite Automata. In general, which one is expected to have less number of states ?

  Considering a single programmed operating system

Considering a single programmed operating system, what is the minimal total time required to complete executions of the two processes? You should explain your answer with a diagram.

  Write mathematical formulation for non-terminal

Non-terminal A is useless if there is no derivation from start symbol to string of tokens in which A appears. Write a mathematical formulation of this property.

  Consider a logic function with three outputs

Consider a logic function with three outputs,  A ,  B , and  C , and three inputs,  D ,  E , and  F . The function is defined as follows:  A  is true if at least one input is true,  B  is true

  Explanation of turing machine

Devise a Turing machine with input given in unary notation such that the equipments produces the following output, 0 if x is divisible by 4,

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