3 ms·
It unfortunately makes all the hardware very messy, end around carry is not a pretty thing. You end up needing fiddly flagged prefix adders.
by jleahy 5y ago
It unfortunately makes all the hardware very messy, end around carry is not a pretty thing. You end up needing fiddly flagged prefix adders.
- potiuper 5y agoFurther down the rabbit hole: https://en.wikipedia.org/wiki/Gray_code#Balanced_Gray_code https://en.wikipedia.org/wiki/Gray_code#Balanced_Gray_code Have yet to discover/work out an addition algo for balanced similar to Harold Lucal's algorithm https://stackoverflow.com/questions/20923165/gray-codes-addition https://stackoverflow.com/questions/20923165/gray-codes-addi...
- CamperBob2 5y agoOr just constrain the problem to support only [-2^N-1, 2^N-1]. This gets you an extra bit of precision when multiplying two signed numbers, because you no longer need to leave room for two sign bits in the product.