🔒 Locked

Binary arithmetic

Started by veda Nov 8, 2008 at 11:33 PM 1 replies 600+ views

Original Post

Nov 8, 2008 at 11:33 PM

Hi friends, I am new to this board.Can anybody explain the two algorithms in the link given below. http://www.spsoc.ntu.edu.sg/limyc/CAS/1991_SPT.pdf Actually the paper is about converting two's complement to signed power of two terms.I could not understand clearly the algorithms given in section IV. hoping for your reply friends.

Crazyfool

Nov 8, 2008 at 11:55 PM

What exactly are you trying to do? Is this for a class? If so, we can't do your homework for you. If this is not for class, please ask us a question directly rather than leave us to read an article. I have learned 2's compliment (and skimming the article, the logic gates and such) but I do not want to reread it so I can answer your question.

I'd love to help you, but ask a more direct question.

Thanks :)

veda

Author

veda

Nov 9, 2008 at 8:20 AM

Hi,
Thx for your reply.

How to convert a two's complement to sum of signed power of two terms?
sum of signed power of two terms is similar to canonical signed digit.
This conversion is usually done to reduce the number of nonzero digits in the two's complement.

Topic Locked

This topic has been locked by a moderator. New replies are not allowed.