Design a single-purpose processor that outputs fibonacci numbers up to n places. Start with a function...

Design a single-purpose processor that outputs fibonacci numbers up to n places. Start with a function computing the desired result. translate it into a state diagram, and sketch a probable datapath.

Expert Solution

In this lab you will be demonstrating the final result of your processor implementation. Your main focus will be on benchmarking your processor.

Demonstration: A live demonstration of your processor will be required for all groups.
Progress Report: Your progress report will consist mainly of the answers to the questions posed in this lab. Your report should also contain copies of the final datapath for both your front-end (fetch) and back-end (execution). In addition, you will need to include all the the source files for the final version of your project. This includes all your Verilog source files, assembly code files (*.s, *.coe), testbenches, and Megawizard generated files. You should also include an updated copy of your ISA manual (if you didn't implement certain instructions, make sure they do not show up in your manual). Your final grade will ultimately be determined by whether you have a working processor so it goes without saying that the files you submit must be synthesizable and implementable and produce the correct output on all the benchmark programs.

venereology answered 1 year ago

1. What is a difference between general purpose processor and single purpose processor? Also write the...

1. What is a difference between general purpose processor and single purpose processor? Also write the Advantages and disadvantages, and how they complement each other. 2. Give one ESD hypothetical application and discuss SOC system.

The Fibonacci numbers are recursively dened by F1 = 1; F2 = 1 and for n...

The Fibonacci numbers are recursively dened by F1 = 1; F2 = 1 and for n > 1; F_(n+1) = F_n + F_(n-1): So the rst few Fibonacci Numbers are: 1; 1; 2; 3; 5; 8; 13; 21; 34; 55; 89; 144; : : : There are numerous properties of the Fibonacci numbers. a) Use the principle of Strong Induction to show that all integers n > 1 and m > 0 F_(n-1)F_(m )+ F_(n)F_(m+1) = F_(n+m): Solution. (Hint: Use...

Consider the following C code that outlines Fibonacci function int fib (int n) { if (n...

Consider the following C code that outlines Fibonacci function int fib (int n) { if (n == 0) return 0; else if (n==1) return 1; else return fib(n-1) + fib (n-2); } For this programming assignment, write and test an ARMv8 program to find Fibonacci (n). You need to write a main function that calls the recursive fib function and passes an argument n. The function fib calls itself (recursively) twice to compute fib(n-1) and fib (n-2). The input to...

Let function F(n, m) outputs n if m = 0 and F(n, m − 1) +...

Let function F(n, m) outputs n if m = 0 and F(n, m − 1) + 1 otherwise. 1. Evaluate F(10, 6). 2. Write a recursion of the running time and solve it . 3. What does F(n, m) compute? Express it in terms of n and m.

Part 1: Write a recursive function that will calculate Fibonacci numbers using a recursive definition. Write...

Part 1: Write a recursive function that will calculate Fibonacci numbers using a recursive definition. Write a short program to test it. The input of this program must be a positive integer n; the output is the corresponding Fibonacci number F(n) Part 2: Write an iterative function to calculate Fibonacci numbers. Write a test driver for it. The input of this program must be a positive integer n; the output is the corresponding Fibonacci number F(n). Part 3: Write a...

Write a function that will accept a list of numbers and an integer (n). The function...

Write a function that will accept a list of numbers and an integer (n). The function should return a list containing every nth item from the input list, always starting with the first item in the list. The original list should not be modified. For example, if the function is passed the list [8, 3, 19, 26, 32, 12, 3, 7, 21, 16] and the integer 3, it will return the list [8, 26, 3, 16] If the function is...

Write a MIPS assembly program to calculate the Fibonacci numbers from 1..n using the recursive method....

Write a MIPS assembly program to calculate the Fibonacci numbers from 1..n using the recursive method. The definition of a Fibonacci number is F(n) = F(n-1) + F(n-2). The implementation must follow the following guidelines: Prompt the user for a number n Allocate heap memory to hold the exact number of elements in the Fibonacci sequence for n Implement recursive Fibonacci method as a subprogram Print the Fibonacci sequence array

We are given an array of n numbers A in an arbitrary order. Design an algorithm...

We are given an array of n numbers A in an arbitrary order. Design an algorithm to find the largest and second largest number in A using at most 3/2n -2 comparisons. (i) describe the idea behind your algorithm in English (3 points); (ii) provide pseudocode (5 points); (iii) analyze the number of comparisons used in your algorithm (2 points).

You have been accepted as an intern at an IT start-up. In a database design session,...

You have been accepted as an intern at an IT start-up. In a database design session, you see that phone number, post code and some other attributes have been defined as numeric datatype. Do you think it is the correct decision? If not, suggest the reasons why this is not appropriate.

1. What is the purpose of level numbers in COCOL records? 2.What are design issues for...

1. What is the purpose of level numbers in COCOL records? 2.What are design issues for character string types? 3.What are two common problems with pointers? 4.What is a C++ reference type, what is its common use, and why are they better than pointers for formal parameters? 5.What is a type error?

Question