How “add” could be implemented in only bitshift operations
-
05-11-2019 - |
Question
Typically, add/subtract/multiply/divide are primitive operations in an Instruction Set Architecture (ISA). I am interested to know if they can instead be implemented efficiently using only bitshift operators. I'm interested to know what sequence of bitshift operations can reproduce the addition operation.
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange