Constructive Computer Architecture

CS-629

Little follow up after our session. Thanks again e...

This page is part of the content downloaded from Little follow up after our session. Thanks again e... on Wednesday, 25 December 2024, 15:53. Note that some content and any files larger than 50 MB are not downloaded.

Description

Little follow up after our session. Thanks again everyone for all your questions and participation!

- Canberk's  questions about array and vector: there is actually a way to convert between them! (arrayToVector and vectorToArray!) I was a little to quick to complain.

- Shanqing's also asked about how to do a recursive "binary tree" version of the arbiter. While recursion on Integer/standard types is easy, recursion on Vector is quite tricky, because of the typesystem. 

For the people that are interested, one of the "cleanest" way to do it is to use the typeclasses that I briefly mentioned (because it is a grad class, I talk about that for the curious minds, though to be clear, this is not required for the class/labs).

 I attached such an example here: intro/CombArbiter.bsv?time=1708554281648 

You can compile it using `bsc -verilog CombArbiter.bsv`, if you want to look at the verilog.