aproposorg / approx Goto Github PK

With the recent updates first to Chisel5 and recently Chisel6 with the upgraded CIRCT-based backend, this library really should be updated too. I'm not sure how much work this will involve, except there are implications to the ChiselTest-based verification flows: https://github.com/ucb-bar/chiseltest/releases/tag/v6.0.0.

With many adders (and multipliers) taking the same arguments, surely there is a way to simplify checking their validity. I'm not sure how exactly to approach this.

There is currently only one exact divider in the library. There should be at least an approximate version of that design too.

The current test flow takes beyond 10 minutes to complete a single full run mostly because of long execution times in the compressor tree generator. I believe the flow can be sped up, but it may require some timing analysis to better understand which part of the algorithm takes so long to execute.

The library currently only has a limited range of exact and approximate multiplier designs. This should be extended with more designs including flexible Booth-encoded designs and hybrid-radix designs.

The current approx.accumulation package can optionally make use of the compressor tree generator but performs accumulation external to the compressor tree itself. This is inefficient and prevents an initiation interval of one cycle if the compressor tree is pipelined. This should be altered.