Fill in the module RiscvITypeDecoder
to practice bit extraction. Given a 32-bit instruction word (instWord
) as input, it extracts the fields of a RISC-V I-type instruction (ISA summary). Here are the fields and their bit positions:
Field | Positions (inclusive) |
---|---|
opcode | 6 - 0 |
funct3 | 14 - 12 |
rs1 | 19 - 15 |
rd | 11 - 7 |
immSignExtended | 31 - 20 (sign-extend to 32b) |
We can use Scala to write exhaustive tests for a module assuming its input space is relatively small. In this problem, we provide the implementation of MajorityCircuit
in the file src/main/scala/hw1/HW1.scala
. Your job is to edit the file src/test/scala/hw1/MajorityCircuitTester.scala
to fill in the unimplemented test for MajorityCircuit using Chiseltest's peek
, poke
, and expect
. Make sure to test that the output is correct for all 8 possible input values. You may run your test using the command sbt test
from your terminal. We strongly encourage you to fill in your own tests for the other problems using src/test/scala/hw1/HW1Tester.scala
but they will not be graded.
The PolyEval
module will be given 3 input coefficients (c0
, c1
, and c2
) at generation time and produce a circuit that computes the polynomial using them and a hardware input x
. The circuit will also take an input enable
that if true, the output will be the polynomial result, and if false, it will be 0. Fill in the rest of PolyEval
.
- c0: positive Int (8b)
- c1: positive Int (8b)
- c2: positive Int (8b)
- enable: Bool
- x: UInt of width 8
- out: UInt of sufficient width to support growth
- if
enable
is high:c0 * x^0 + c1 * x^1 + c2 * x^2
- if
enable
is low:0
- if
ComplexALU
is a generator for an adder/subtractor for complex numbers. If the Chisel input doAdd
is high, the module adds the complex numbers, and if it is low, the module subtracts the complex numbers. There is also a Scala parameter (for generation time) onlyAdder
, which if true, the generated module should not have any hardware for subtraction logic (and thus ignore doAdd
). Fill in ComplexALU
, and a summary of its operation is below:
- if
doAdd
is high, add the complex numbers (add the real inputs and add the imaginary inputs) - if
doAdd
is low, subtract the complex numbers (find the difference between the real inputs and the difference between the imaginary inputs) - if
onlyAdder
is true, only generate hardware to sum the real inputs and sum the imaginary inputs (ignoredoAdd
)