Forum: µC & Digital Electronics Non-Restoring Division Algorithm for Signed Magnitude

von Ali M. (kooh)

Attached files:

Rate this post
0 useful
not useful

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.

: Edited by User


Entering an e-mail address is optional. If you want to receive reply notifications by e-mail, please log in.

Rules — please read before posting

  • Post long source code as attachment, not in the text
  • Posting advertisements is forbidden.

Formatting options

  • [c]C code[/c]
  • [avrasm]AVR assembler code[/avrasm]
  • [code]code in other languages, ASCII drawings[/code]
  • [math]formula (LaTeX syntax)[/math]

Bild automatisch verkleinern, falls nötig
Note: the original post is older than 6 months. Please don't ask any new questions in this thread, but start a new one.