Turns out I actually need to solve a harder problem: Find the permutation so that the arithmetic difference between smallest and largest integer after permutation is minimal.https://twitter.com/oe1cxw/status/1119226244992774144 …
-
disappear. You're then left with the smallest support. I think you're not there yet; one can probably reduce the max value more by moving more '0's within the data to more significant positions, except for the '1' in the MSB position. No idea if this actually works.
btw, this is what I ended up doing. Not sure if it is optimal but it seems to work good enough. https://github.com/YosysHQ/yosys/pull/944/files#diff-ca250655cb5c938947732bf2d34b6542R202 …
