Jump to content
  • Advertisement
Sign in to follow this  
veda

Binary arithmetic

This topic is 3692 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

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
Advertisement
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
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

GameDev.net is your game development community. Create an account for your GameDev Portfolio and participate in the largest developer community in the games industry.

Sign me up!