US4538238A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for calculating the residue of a signed binary number
Assignee: Bull HN Information Systems Inc
•
Filing: 1983-01-18
•
Granted: 1985-08-27
•
Expires: 2003-01-18
Abstract
Abstract Method and apparatus for calculating the residue of a signed binary number of "n" bits with respect to a given check base m where m=2 b -1. The bits of the binary number excluding the sign bit are partitioned into number segments, each of b bits starting with the least significant bit. If (n-1) is not an even multiple of b, higher order bit positions of the number segment containing the next most significant bit of the binary number are filled with logical zeros. A sign segment of b bits is formed. Both number and sign segments have boundaries. The bit position in the sign segment relative to a sign segment boundary which corresponds to the bit position of the sign bit "s" relative to the nearest boundary of a number segment is filled with a logical zero. All other bit positions of the sign segment are filled with the sign bit. The number and sign segments are applied to carry save adders to reduce the number segments and sign segment to a single sum segment and a single rotated carry segment. A rotated carry segment is a carry segment produced by a carry save adder, the most significant bit of which becomes the least significant bit of the rotated carry segment. The other bits of the carry segment and their significance are increased by one in the rotated carry segment. Carry segments produced by carry save adders of one level are converted to rotated carry segments before being applied to a carry save or full adder of a lower level. The single sum segment and single rotated carry segment produced by the lowest level carry save adder is applied to a one's complement adder. The b bit output of the one's complement adder is the residue of the signed binary number to the check base (2 b -1).
Inventors
- 👤 Joseph C. Circello
- 👤 Russell W. Guenthner
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-30 00:22
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/60; G06F7/72; G06F7/727
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
225 words
Apparatus for calculating the residue of a signed binary number in two's complement notation, in which the most significant bit of the binary number is a sign bit, the bits of the binary number of lesser significance than the sign bit being partitioned into a plurality of equally sized number segments having segment boundaries, comprising: circuit means for forming a sign segment having a segment boundary in which the sign position of the sign segment is filled with a logical zero and occupies the same position in the sign segment relative to a sign segment boundary as the sign bit of the number occupies with respect to the nearest boundary of a number segment, the other bit positions of the sign segment being filled with the sign bit; carry save adder means for adding in 1's complement notation the number segments and sign segment and for reducing said segments to a single sum segment and a single rotated carry segment the single rotated carry segment being a carry segment wherein each bit position of the carry segment is increased in its bit significance by one, and further wherein the most significant bit is rotated to the least significant bit position; and one's complement full adder means for adding said single sum and single rotated carry segment to produce the residue of said signed binary number.
Claim 2
Dependent Claim
225 words
Apparatus for calculating the residue of a signed binary number in two's complement notation, in which the most significant bit of the binary number is a sign bit, the bits of the binary number of lesser significance than the sign bit being partitioned into a plurality of equally sized number segments having segment boundaries, comprising: circuit means for forming a sign segment having a segment boundary in which the sign position of the sign segment is filled with a logical zero and occupies the same position in the sign segment relative to a sign segment boundary as the sign bit of the number occupies with respect to the nearest boundary of a number segment, the other bit positions of the sign segment being filled with the sign bit; carry save adder means for adding in 1's complement notation the number segments and sign segment and for reducing said segments to a single sum segment and a single rotated carry segment the single rotated carry segment being a carry segment wherein each bit position of the carry segment is increased in its bit significance by one, and further wherein the most significant bit is rotated to the least significant bit position; and one's complement full adder means for adding said single sum and single rotated carry segment to produce the residue of said signed binary number.
Claim 3
Dependent Claim
35 words
Apparatus as defined in claim 1 in which the check base equals the quantity 2 b -1, where b is an integer greater than 1 and the number of bits in a segment equals b.
Claim 4
Dependent Claim
9 words
Apparatus as defined in claim 2 in which b=5.
Claim 5
Dependent Claim
21 words
Apparatus as defined in claim 3 in which the number of bits in the binary number is a multiple of 9.
Claim 6
Dependent Claim
326 words
Apparatus for calculating the reside of a signed binary number of "n" bits in the two's complement notation with respect to a check base "m", the quantity (n-1) bits of said number being of lesser significance than the sign bit, and being partitioned into number segments of b bits each with each number segment having segment boundaries, where m=(2 b -1) and m, n, and b are positive integers greater than one, comprising: circuit means for forming a sign segment of b bits, the bit position of the sign segment corresponding to the bit position of the sign bit in the binary number with respect to a boundary of a number segment being filled with a logical zero, and all other bit positions of the sign segment being filled by the sign bit; carry save adder means for adding the bits of the number and sign segments and for producing a sum segment and a carry segment each of b bits, the lowest level of the carry save adders consisting of a single carry save adder, means for rotating the bits of each carry segment produced by each carry save adder so that the most significant bit of each carry segment becomes the least significant bit of its corresponding rotated carry segment; circuit means for applying the number and sign segments of the binary number and the sum and rotated carry segments to carry save adders to reduce them to a single sum segment and a single rotated carry segment; a one's complement full adder for producing a sum in 1's complement notation of said single sum segment and said single rotated carry segment; and circuit means for applying said sum segment and said rotated carry segment to the full adder, said full adder producing the sum in 1's complement notation of said sum segment and said rotated carry segment, said sum being the residue of said signed binary number with respect to the check base.
Claim 7
Dependent Claim
326 words
Apparatus for calculating the reside of a signed binary number of "n" bits in the two's complement notation with respect to a check base "m", the quantity (n-1) bits of said number being of lesser significance than the sign bit, and being partitioned into number segments of b bits each with each number segment having segment boundaries, where m=(2 b -1) and m, n, and b are positive integers greater than one, comprising: circuit means for forming a sign segment of b bits, the bit position of the sign segment corresponding to the bit position of the sign bit in the binary number with respect to a boundary of a number segment being filled with a logical zero, and all other bit positions of the sign segment being filled by the sign bit; carry save adder means for adding the bits of the number and sign segments and for producing a sum segment and a carry segment each of b bits, the lowest level of the carry save adders consisting of a single carry save adder, means for rotating the bits of each carry segment produced by each carry save adder so that the most significant bit of each carry segment becomes the least significant bit of its corresponding rotated carry segment; circuit means for applying the number and sign segments of the binary number and the sum and rotated carry segments to carry save adders to reduce them to a single sum segment and a single rotated carry segment; a one's complement full adder for producing a sum in 1's complement notation of said single sum segment and said single rotated carry segment; and circuit means for applying said sum segment and said rotated carry segment to the full adder, said full adder producing the sum in 1's complement notation of said sum segment and said rotated carry segment, said sum being the residue of said signed binary number with respect to the check base.
Claim 8
Dependent Claim
8 words
The apparatus of claim 5 in which b=5.
Claim 9
Dependent Claim
13 words
The apparatus of claim 6 in which n equals a multiple of 9.
Claim 10
Dependent Claim
59 words
The apparatus of claim 7 in which the means for rotating the bits of each carry segment includes a bus having conductors for each bit of each carry segment and in which the conductor of the most significant bit of the carry segment is adapted to be connected to the least significant input terminal of a lower level adder.
Claim 11
Independent Claim
231 words
The method of calculating the residue of a signed binary number with respect to a given check base, comprising the steps of: partitioning the bits of the binary number other than the sign bit into number segments, each of b bits per number segment starting with the least significant bit of the binary number, each of said number segments having boundaries; forming a sign segment of b bits in which the bit position in the sign segment corresponding to that of the sign bit relative to the closest boundary of a number segment is filled with a logical zero and all other bit positions are filled with the sign bit; applying the number and sign segments to a plurality of carry save adders, each of which produces a sum segment and carry segment each of b bits; rotating the bits of each carry segment to form rotated carry segment in which the most significant bit of each carry segment becomes the least significant bit of its corresponding rotated carry segment; reducing the sign and number segments and the sum and rotated carry segments produced by carry save adders to a single sum segment and a single rotated carry segment; and adding the single sum segment and single rotated carry segment in a one's complement adder to produce the residue of said signed binary number with respect to the given check base.
Claim 12
Independent Claim
231 words
The method of calculating the residue of a signed binary number with respect to a given check base, comprising the steps of: partitioning the bits of the binary number other than the sign bit into number segments, each of b bits per number segment starting with the least significant bit of the binary number, each of said number segments having boundaries; forming a sign segment of b bits in which the bit position in the sign segment corresponding to that of the sign bit relative to the closest boundary of a number segment is filled with a logical zero and all other bit positions are filled with the sign bit; applying the number and sign segments to a plurality of carry save adders, each of which produces a sum segment and carry segment each of b bits; rotating the bits of each carry segment to form rotated carry segment in which the most significant bit of each carry segment becomes the least significant bit of its corresponding rotated carry segment; reducing the sign and number segments and the sum and rotated carry segments produced by carry save adders to a single sum segment and a single rotated carry segment; and adding the single sum segment and single rotated carry segment in a one's complement adder to produce the residue of said signed binary number with respect to the given check base.
Claim 13
Dependent Claim
16 words
The method of claim 9 in which the check base equals the quantity 2 b -1.
Claim 14
Dependent Claim
14 words
The method of claim 10 in which b is an integer greater than 2.
Claim 15
Dependent Claim
10 words
The method of claim 11 in which b equals 5.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1988-08-26 | 1989-02-25 | 1989-08-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-08-26 | 1993-02-25 | 1993-08-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-08-26 | 1997-02-25 | 1997-08-27 | $7700.00 | Window Closed / Lapsed |