Differences
This shows you the differences between two versions of the page.
|
ac-is:lab-ie:lab01 [2023/11/07 10:40] ionut.pascal [Resources] |
ac-is:lab-ie:lab01 [2023/11/07 22:46] (current) ionut.pascal [Home assignment] |
||
|---|---|---|---|
| Line 12: | Line 12: | ||
| * //Hint//: Follow the proper tutorial for understanding the simulation; skip the test-adding part if needed. | * //Hint//: Follow the proper tutorial for understanding the simulation; skip the test-adding part if needed. | ||
| - Add extra stimuli in order to have the carry bit exercised. | - Add extra stimuli in order to have the carry bit exercised. | ||
| - | * //Hint//: Values must be added in the //adder8_test//, the file which drives the stimuli to our module. | + | * //Hint//: The values must be added in the //adder8_test//, the file which drives the stimuli to our module. |
| - Implement a 4bit **Comparator** using only continuous assignments. This module has 2 inputs and 3 outputs ( less than, equal, grater than). | - Implement a 4bit **Comparator** using only continuous assignments. This module has 2 inputs and 3 outputs ( less than, equal, grater than). | ||
| * //Hint//: To verify a condition, '**?**' operator can be used. | * //Hint//: To verify a condition, '**?**' operator can be used. | ||
| Line 24: | Line 24: | ||
| ==== Home assignment ==== | ==== Home assignment ==== | ||
| - | Work in progress... | + | For the home assignment, you should use the corresponding resources from below. |
| - | - **(2p)** Change the adder | + | - **(2p)** Change the adder8 module from exercise 1 by including a carry bit as an additional input. You can use any of //a// or //b// implementation. Add at least 5 data sets in adder8_test.sv, which will exercise the module and upload a screenshot with the simulation waveform to emphasize them. |
| - | - **(4p)** Construct a multiplier | + | * //Hint//: You should modify the interface and the logic inside. |
| - | - **(3p)** Change the comparator - implement using if statements | + | * //Hint//: A complete testing shall exercise all of the inputs. |
| - | - **(4p)** Mini - ALU | + | - **(3p)** Change the implementation of the comparator, following the rules below: |
| + | * Implement it using if constructs, using a procedural block; | ||
| + | * Change the size of the inputs to 6 bits. | ||
| + | * //Hint//: Do not forget to use the reg type when needed! | ||
| + | * //Note//: In procedural blocks, the outputs shall have a value at any moment so that they do not become memory components at the synthesis level. Considering this, it is useful to initialize them in the beginning. | ||
| + | - **(4p)** Implement a 8bit multiplier, with 2 inputs and one output. | ||
| + | * //Hint//: Take as reference the adder8 module. | ||
| + | * //Hint//: What is the size of the output? Consider the highest 8bit number. | ||
| + | - **(4p)** Implement a tiny ALU (**A**rithmetical **L**ogical **U**nit), that shall be able to execute 16bit ADD and SUB operations. The ALU has 3 inputs, op1 (16bits), op2(16bits), sel(1bit) and 2 outputs, result(16bits) and carry(1bit). | ||
| + | * //Hint//: Sel input selects the operation that is executed: 0 - ADD, 1 - SUB | ||
| + | * //Hint//: You can use the concatenate operator { } in order to make the result a 17bit variable! | ||
| + | * //Note//: When you operate the ALU inside a CPU, you have a fixed length bus available for all the data. | ||
| ===== Resources ===== | ===== Resources ===== | ||
| * {{ac-is:lab-ie:lab1_xilinx.zip|XILINX work files}} | * {{ac-is:lab-ie:lab1_xilinx.zip|XILINX work files}} | ||
| * {{ac-is:lab-ie:lab1_vivado.zip|VIVADO work files}} | * {{ac-is:lab-ie:lab1_vivado.zip|VIVADO work files}} | ||
| + | * {{ac-is:lab-ie:lab1ha_xilinx.zip|XILINX home assignment files}} | ||
| + | * {{ac-is:lab-ie:lab1ha_vivado.zip|VIVADO home assignment files}} | ||
| <ifauth @ac-is> | <ifauth @ac-is> | ||
