11 by equation 23 we can write as and as

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: pport infinite precision arithmetic to allow arbitrary (within the memory limits of the machine, of course) integer arithmetic. More commonly, programming languages support fixed-precision arithmetic, and hence operations such as “addition” and “multiplication” differ from their counterpart operations over integers. Unsigned arithmetic can be viewed as a form of modular arithmetic. Unsigned addition is equivalent to computing the sum modulo ¾Û . This value can be computed by simply discarding the high-order bit in the Û · ½-bit representation of Ü · Ý. For example, consider a four-bit number representation with Ü and Ý ½¾, having bit representations ½¼¼½ and ½½¼¼ , respectively. Their sum is ¾½, having a 5-bit representation ½¼½¼½ . But if we discard the high-order bit, we get ¼½¼½ , that is, decimal value . This matches the value ¾½ ÑÓ ½ . In general, we can see that if Ü · Ý ¾ Û , the leading bit in the Û · ½-bit representation of the sum will equal 54 CHAPT...
View Full Document

This note was uploaded on 09/02/2010 for the course ELECTRICAL 360 taught by Professor Schultz during the Spring '10 term at BYU.

Ask a homework question - tutors are online