January 2004
Intermediate to advanced
246 pages
6h 4m
English
Content preview from Arithmetic and Logic in Computer SystemsBecome an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
11
Signed-Digit Number Operations
In a signed-digit (SD) number system, carry propagation can be limited to one position to the left during the digit-wise addition and subtraction. The addition time is independent of the word length since the chains of carry-propagations are eliminated.
11.1 CHARACTERISTICS OF SD NUMBERS
In a conventional number representation with an integer radix r > 1, each digit is allowed to have exactly r values: 0,1, · · · , r − 1. In an SD representation with the same radix r, each digit is allowed to have more than r values. In the method of addition described below, each digit is allowed to have q different values where
Obviously q is more than r. Redundancy in the number representation allows a method of fast addition/subtraction called totally parallel addition/subtraction.
In the totally parallel addition/subtraction, the signed-digit representations are required to have a unique representation of zero. Thus the magnitude of allowed digit values may not exceed r − 1, since otherwise we could let a digit equal to r and represent zero by 
r as well as 00.
Some characteristics of the SD numbers are as follows.
Let A = (an−1 · · · a−k) be an SD number, we have
- where
- Let p = max{i|ai ≠ 0}, sign(an−1 · · · a−k) = sign(ap) for (an−1 · · · a−k) ≠ 0.
11.2 ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.