Sign in to follow this  
veda

Binary arithmetic

Recommended Posts

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.

Share this post


Link to post
Share on other sites
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 :)

Share this post


Link to post
Share on other sites
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.



Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this