Non-Restoring Division Algorithm for Signed Magnitude

Ali M. OP #5956536
Rate this post
• ▲ useful
▼ not useful 
Hi,

I have developed algorithm based on one existing in book named "Computer 
System Architecture," by Morris Mano. At that book, partial remainder is 
restored when it is less than divisor and it is time consuming.  I have 
attached modified algorithm that it does not need to restore remainder 
when partial remainder is less than divisor. But this algorithm does not 
work for some operands. I also attach to examples.
Attached files:
Reply Quote Edit Move Thread sperren Anmeldepflicht aktivieren Anpinnen Delete topic Thread mit anderem zusammenführen Report post
Watch this topic

Reply

Note: the original post is older than 6 months. Please don't ask any new questions in this thread, but start a new one.

Formatting
  • [c]C-Code[/c]
  • [code]code in other languages, ASCII drawings[/code]
  • [math]formula (LaTeX syntax)[/math]
  • [[Title]] – link to an article
  • Link to another post: right-click its post ID (#8078628), copy the address, paste it into the text

More about formatting

Post long source code as an attachment, not in the text.

Your name and e-mail address

Already registered? Log in

Not shown to anyone. We send you a link; your post appears once you confirm it there.

By submitting you create a free account and accept the terms of use.