Differences
This shows you the differences between two versions of the page.
|
ac-is:teme-ie:proiect [2023/12/13 23:33] ionut.pascal [Description and requirements] |
ac-is:teme-ie:proiect [2024/01/07 18:47] (current) ionut.pascal old revision restored (2023/12/13 23:58) |
||
|---|---|---|---|
| Line 4: | Line 4: | ||
| * Hard Deadline: **28.12.2023**, **23:59** | * Hard Deadline: **28.12.2023**, **23:59** | ||
| * Publish date: **13.12.2023** | * Publish date: **13.12.2023** | ||
| - | * Last update: **13.12.2023, 22:00** | + | * Last update: **13.12.2023, 23:50** |
| * History: | * History: | ||
| - | * 13.12.2023, 22:00 | + | * 13.12.2023, 23:50 |
| * Publish the assignment | * Publish the assignment | ||
| Line 24: | Line 24: | ||
| * 7 mantissa bits - M | * 7 mantissa bits - M | ||
| The implementation can follow the proposed state machine: | The implementation can follow the proposed state machine: | ||
| + | {{ :ac-is:teme-ie:untitled_diagram.jpg?nolink |}} | ||
| Because we encounter a multiplication of fixed point (mantissa), we should implement a dedicated module responsible for this operation. The Booth algorithm is a suitable option which reduces the complexity but keeps a good understanding behind. The size of the operands is dependent on the size of the mantissa. | Because we encounter a multiplication of fixed point (mantissa), we should implement a dedicated module responsible for this operation. The Booth algorithm is a suitable option which reduces the complexity but keeps a good understanding behind. The size of the operands is dependent on the size of the mantissa. | ||
| Line 35: | Line 35: | ||
| - Implement the Verilog code. | - Implement the Verilog code. | ||
| - | <note important>Don't forget to follow the TODO's inside the code and check for the errors and messages in the console</note> | + | <note important>Don't forget to follow the TODO's inside the code and check for the errors and messages in the console! Checking is implemented inside the testcase!</note> |
| ===== Implementation ===== | ===== Implementation ===== | ||
| Line 115: | Line 115: | ||
| * general presentation of your solution; | * general presentation of your solution; | ||
| * description of any complex coding parts that you consider additional explanation is needed and they are too long to be an inline comment; | * description of any complex coding parts that you consider additional explanation is needed and they are too long to be an inline comment; | ||
| + | * Pictures/Scans of your paper demonstrations. | ||
| * The archive shall __**not**__ contain any other files from the implementation folder (i.e. test files, project specific files, etc). | * The archive shall __**not**__ contain any other files from the implementation folder (i.e. test files, project specific files, etc). | ||
| Line 150: | Line 151: | ||
| * **Booth Multiplication Another Example** - [[https://www.javatpoint.com/booths-multiplication-algorithm-in-coa|Click]] | * **Booth Multiplication Another Example** - [[https://www.javatpoint.com/booths-multiplication-algorithm-in-coa|Click]] | ||
| - | ===== Anexă ===== | + | ===== Appendix ===== |
