US4153938A
Expired / Lapsed
US
⏱️ 0.0 years remaining
High speed combinatorial digital multiplier
Assignee: Advanced Micro Devices Inc
•
Filing: 1977-08-18
•
Granted: 1979-05-08
•
Expires: 1997-08-18
Abstract
Abstract This disclosure relates to a high speed combinatorial 8 by 8 digital multiplier suitable for implementation on a single semiconductor chip including an encoder for implementing the Modified Booth Algorithm to encode the eight multiplier digits. The encoder includes five subsections which generate a plurality of control signals. Each of the plurality of control signals is inputted into a separate one of five multiplexor circuits each of which also receives inputs representative of eight multiplicand bits in accordance with implementation of the Modified Booth Algorithm. Each of the five multiplexer circuits provides a plurality of outputs, each of the pluralities of outputs representing a separate partial product of the multiplier and multiplicand inputs. The partial products are inputted to an array of carry-save adders. The final stage of the adder network includes a carry-look-ahead adder which produces sixteen outputs which represent the product of the multiplier and the multiplicand. The multiplier includes circuitry for permitting encoding of the multiplier inputs in either binary unsigned or in two's compliment form. A multiplier mode control input controls whether the multiplier inputs are operated upon as two's compliment or as unsigned binary numbers. Similarly, a mode control input to circuitry which generates the multiplexer inputs representative of the multiplicand also controls whether the multiplicand inputs are operated upon as two's compliment numbers or as unsigned binary numbers. The mode of the multiplier inputs and multiplicand inputs can be independently controlled, so that mixed signed and unsigned representations of the multiplier and multiplicand, respectively, can be utilized.
Inventors
- 👤 Robert C. Ghest
- 👤 Hua-Thye Chua
- 👤 John M. Birkner
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 07:58
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/52; G06F7/523; G06F7/533; G06F7/5334; G06F7/5336; G06F7/5338; G06F7/499; G06F7/49942; G06F7/49947; G06F7/49963
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
86 words
A digital multiplier having a plurality of multiplier inputs and a plurality of multiplicand inputs comprising: first means responsive to three of said multiplier inputs for producing a selection signal representative of logic levels applied to said three multiplier inputs; and second means responsive to two adjacent ones of said multiplicand inputs and responsive to said selection signal for producing an output signal representative of one of said adjacent multiplicand inputs or the complement of one of said adjacent multiplicand inputs determined by said selection signal.
Claim 2
Dependent Claim
86 words
A digital multiplier having a plurality of multiplier inputs and a plurality of multiplicand inputs comprising: first means responsive to three of said multiplier inputs for producing a selection signal representative of logic levels applied to said three multiplier inputs; and second means responsive to two adjacent ones of said multiplicand inputs and responsive to said selection signal for producing an output signal representative of one of said adjacent multiplicand inputs or the complement of one of said adjacent multiplicand inputs determined by said selection signal.
Claim 3
Dependent Claim
88 words
The digital multiplier as recited in claim 1 comprising a plurality of said second means each responsive to separate pairs of adjacent ones of said multiplicand inputs and to said selection signal for producing a plurality output signals, respectively, each representative of a one of said adjacent multiplicand inputs of said respective pair or the complements of one of said adjacent multiplicand inputs of said respective pair, determined by said selection signal, said plurality of outputs comprising a partial product of said multiplier inputs and said multiplicand inputs.
Claim 4
Dependent Claim
39 words
The digital multiplier as recited in claim 2 including: a plurality of said first means for producing a plurality of said selection signals, respectively, each of said first means being responsive to a separate group of three multiplier bits.
Claim 5
Dependent Claim
22 words
The digital multiplier as recited in claim 3 further comprising adder means having a plurality of adders for adding said partial products.
Claim 6
Dependent Claim
38 words
The digital multiplier as recited in claim 4 wherein successive ones of said partial products are inputted to successive alternate inputs said adder means in order to account for the arithmetic weight of each of said partial products.
Claim 7
Dependent Claim
14 words
The digital multiplier as recited in claim 5 implemented in a single semiconductor chip.
Claim 8
Dependent Claim
27 words
The digital multiplier as recited in claim 5 wherein said adder means includes an array of carry-save adders interconnected in a form similar to a Wallace Tree.
Claim 9
Dependent Claim
21 words
The digital multiplier as recited in claim 7 wherein said adder means includes a carry-look-ahead adder stage as a final stage.
Claim 10
Dependent Claim
62 words
The digital multiplier as recited in claim 5 further including a rounding input for receiving a rounding input signal, and rounding means responsive to said rounding input signal and coupled to said adder means for adding the number 1 to a predetermined bit of said adder means and truncating that bit and all less significant bits in response to said rounding input.
Claim 11
Dependent Claim
41 words
The digital multiplier as recited in claim 1 wherein said first means produces said selection signal according to the modified Booth Algorithm truth table, and said second means produces said output signal in accordance with said modified Booth Algorithm truth table.
Claim 12
Dependent Claim
54 words
The digital multiplier as recited in claim 1 further including a mode control input for receiving a mode control input signal, and mode control means for controlling whether said digital multiplier operates on a multiplier number applied to said multiplier inputs as an unsigned or signed number in response to said mode control signal.
Claim 13
Dependent Claim
53 words
The digital multiplier as recited in claim 1 further including a mode control input for receiving a mode control input signal, and mode control means responsive to said mode control signal for controlling whether said digital multiplier operates on a multiplicand number applied to said multiplicand inputs as a signed or unsigned number.
Claim 14
Dependent Claim
14 words
The digital multiplier as recited in claim 1 implemented in a single semiconductor chip.
Claim 15
Dependent Claim
75 words
The digital multiplier as recited in claim 1 wherein said second means includes a four-input OR-type gate having an output where said output signal is produced, and four two input gates each having an output coupled, respectively, to a separate one of said four inputs of said OR-type gate, each of said two-input gates implementing the Boolean equation A·B=C, where A and B are the two input logic variables and C is the output variable.
Claim 16
Dependent Claim
73 words
The digital multiplier as recited in claim 14 wherein the A and B inputs of a first and second ones, respectively, of said two-input gates are coupled to one of said adjacent multiplicand inputs, and the A and B inputs of third and fourth ones, respectively, of said two-input gates are coupled to the other of said adjacent multiplicand inputs, the other inputs of said two-input gates being coupled to said first means.
Claim 17
Dependent Claim
42 words
The distal multiplexor as recited in claim 15 wherein each of said two-input gates requires no more than one transistor one input being coupled to the base of said transistor and the other input being coupled to the emitter of said transistor.
Claim 18
Dependent Claim
87 words
A digital multiplier having a plurality of inputs for receiving logic signals representative of a binary multiplier and a binary multiplicand, comprising: first means responsive to said multiplier inputs and to said multiplicand inputs for producing a plurality of partial products of said binary multiplier and said binary multiplicand; adder means coupled to said first means for adding said partial products to produce a plurality of product output signals; and mode input means for receiving a signal representative of whether said binary multiplier is signed or unsigned.
Claim 19
Dependent Claim
87 words
A digital multiplier having a plurality of inputs for receiving logic signals representative of a binary multiplier and a binary multiplicand, comprising: first means responsive to said multiplier inputs and to said multiplicand inputs for producing a plurality of partial products of said binary multiplier and said binary multiplicand; adder means coupled to said first means for adding said partial products to produce a plurality of product output signals; and mode input means for receiving a signal representative of whether said binary multiplier is signed or unsigned.
Claim 20
Dependent Claim
29 words
The digital multiplier as recited in claim 17 further including second mode input means for receiving a second signal representative of whether said binary multiplicand is signed or unsigned.
Claim 21
Dependent Claim
65 words
The digital multiplier as recited in claim 18 further including rounding input means for receiving a third signal for controlling rounding of said product output signals, said adder means adding the number 1 to a predetermined bit of said adder means in response to said third signal and truncating said predetermined bit and all bits of said adder means less significant than said predetermined bit.
Claim 22
Dependent Claim
15 words
The digital multiplier as recited in claim 17 implemented in a single integrated circuit chip.
Claim 23
Dependent Claim
19 words
The digital multiplier as recited in claim 17 wherein said first means effects implementation of the Modified Booth Algorithm.
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) | 1982-05-07 | 1982-11-06 | 1983-05-08 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1986-05-07 | 1986-11-06 | 1987-05-08 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1990-05-07 | 1990-11-06 | 1991-05-08 | $7700.00 | Window Closed / Lapsed |