Hi everyone! long time reader, first time poster.
I need to implement a non-restoring signed division algorithm, but have no idea under what conditions post-corrections need to be performed. I'm starting to think the algorithm is really difficult, since I have not found any sources that explain it completely. Here is where i got the first part of the algorithm:
Notice it doesn't explain when post-corrections for signed integer non-restoring division need to be performed, just what they are. And notice it skips over showing the algorithm. I need to finish it by tomorrow and getting pretty frustrated, so I was hoping someone around here is a good mathematician. Also you can check out my extended rant and pseudocode about this over at stackoverflow : http://stackoverflow.com/questions/1...st-corrections