Differences
This shows you the differences between two versions of the page.
|
ac-is:teme-ie:proiect [2024/01/07 18:42] ionut.pascal [Recourses] |
ac-is:teme-ie:proiect [2024/01/07 18:47] (current) ionut.pascal old revision restored (2023/12/13 23:58) |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ====== MARIE - Extend the ISA ====== | + | ====== Floating point multiplication automata ====== |
| - | * Soft Deadline: **19.01.2024**, **23:59** | + | * Soft Deadline: **22.12.2023**, **23:59** |
| - | * Hard Deadline: **19.01.2024**, **23:59** | + | * Hard Deadline: **28.12.2023**, **23:59** |
| - | * Publish date: **07.01.2024** | + | * Publish date: **13.12.2023** |
| - | * Last update: **07.01.2024, 20:00** | + | * Last update: **13.12.2023, 23:50** |
| * History: | * History: | ||
| - | * 07.01.2024, 20:00 | + | * 13.12.2023, 23:50 |
| - | * Publish the assignment - detailed | + | * Publish the assignment |
| ===== Objectives ===== | ===== Objectives ===== | ||
| - | The main purpose of this assignment is to build up a stronger perspective around the MARIE architecture. You will: | + | This assignment exercise the basic notions of Verilog by implementing complex sequential circuits. You will: |
| - | * Use the [[https://marie.js.org | MARIE simulator]] in order to observe the micro-operations specific for each instruction; | + | * Understand numeral representations by implement an arithmetic algorithm for processing integer numbers |
| - | * Link the behavior with the Verilog implementation; | + | * Divide and conquer - implement a finite state machine, based on a given scheme; |
| - | * Implement the new instructions and follow the testcase to determine the correct behavior. | + | * Interact with memory elements (register) when you process the data; |
| ===== Description and requirements ===== | ===== Description and requirements ===== | ||
| Line 124: | Line 124: | ||
| ===== Grading ===== | ===== Grading ===== | ||
| - | * +10.0 pts.: Correct implementation with the test passing | + | * +10.0 pts.: Correct implementation with the tests passing |
| - | * 1.8 pts.: Each implemented instruction | + | * 0.5 pts.: Booth Multiplication Example - 2 8bit numbers on your choice |
| - | * 1.0 pts.: Test Passing | + | * 5.5 pts.: Multiplication Module |
| + | * 0.5 pts.: Floating Point Multiplication Example - 2 12bit numbers with the specified format of your choice | ||
| + | * 3.5 pts.: Floating Point Multiplication | ||
| + | * 0.5 pts.: (bonus) Add your numbers in the test file; verify there is a match. | ||
| * -10.0 pts.: using looping instructions with variable steps (i.e. while x > 0); | * -10.0 pts.: using looping instructions with variable steps (i.e. while x > 0); | ||
| + | * -6.0 pts.: using * operator in the booth_mul implementation; | ||
| + | * -1.0 pts.: not using the ''booth_mul'' module for implementing the FSM | ||
| * -1.0 pts.: the absence of the README file; | * -1.0 pts.: the absence of the README file; | ||
| * -1.0 pts.: bad coding style (chaotic indentation, irregular spacing, strange naming for variables, etc.); | * -1.0 pts.: bad coding style (chaotic indentation, irregular spacing, strange naming for variables, etc.); | ||
| * -0.5 pts.: incorrect using of continuous assignments ( assign ), procedural blocking ( = ) and non-blocking ( <= ) assignments; | * -0.5 pts.: incorrect using of continuous assignments ( assign ), procedural blocking ( = ) and non-blocking ( <= ) assignments; | ||
| + | * -0.5 pts.: /day if submitted after the soft deadline; | ||
| * -0.2 pts.: other generic implementation issues (/issue); | * -0.2 pts.: other generic implementation issues (/issue); | ||
| * -0.1 pts.: useless code comments. | * -0.1 pts.: useless code comments. | ||
| + | |||
| + | Remember that you have an error counter already implemented in each testcase inside the project files, which tells you exactly when an error is detected. However, do not count on that; the project evaluation is done manually, after analyzing the code and the anti-plagiarism report. | ||
| Even if you do not finish the assignment, you can receive up to 25% of the grade if you properly explain your idea in the README file. Your code must pass the compilation and run. | Even if you do not finish the assignment, you can receive up to 25% of the grade if you properly explain your idea in the README file. Your code must pass the compilation and run. | ||
| ===== Recourses ===== | ===== Recourses ===== | ||
| - | * **VIVADO Project Files** - {{:ac-is:teme-ie:c_project_vivado.zip| skel_vivado}} | + | * **VIVADO Project Files** - {{:ac-is:teme-ie:lab_project_vivado.zip| skel_vivado}} |
| - | * **XILINX Project Files** - {{:ac-is:teme-ie:c_project_xilinx.zip| skel_xilinx}} | + | * **XILINX Project Files** - {{:ac-is:teme-ie:lab_project_xilinx.zip| skel_xilinx}} |
| - | * **MARIE Simulator DATABOOK** - [[https://marie.js.org/book.pdf|MARIE Sim Databook]] | + | * **IEEE754 Multiplication Article** - {{ac-is:teme-ie:c0383011016.pdf| Implementation and Simulation of Ieee 754 Single-Precision Floating Point Multiplier}} |
| - | * **MARIE Simulator** - [[https://marie.js.org |MARIE Sim ]] | + | * **Booth Multiplication Algorithm** - [[https://en.wikipedia.org/wiki/Booth%27s_multiplication_algorithm|Wiki]] |
| + | * **Booth Multiplication Another Example** - [[https://www.javatpoint.com/booths-multiplication-algorithm-in-coa|Click]] | ||
| ===== Appendix ===== | ===== Appendix ===== | ||
