This shows you the differences between two versions of the page.
ac-is:teme-ie:proiect [2024/01/04 13:39] ionut.pascal [Objectives] |
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: **04.01.2024** | + | * Publish date: **13.12.2023** |
- | * Last update: **04.01.2024, 20:00** | + | * Last update: **13.12.2023, 23:50** |
* History: | * History: | ||
- | * 04.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 ===== |