Patent US5412591A successfully refreshed from Google Patents.
US5412591A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Schematic compiler for a multi-format high speed multiplier
Assignee: Philips Semiconductors Inc
•
Filing: 1990-08-09
•
Granted: 1995-05-02
•
Expires: 2010-08-09
Abstract
Abstract A multiplier compiler produces a schematic of a high-speed, multi-format multiplier. The compiler receives user information which indicates design preferences. Based on the user information the compiler can select the format of numbers which the multiplier will multiply and/or select a type of adder with which to implement the final adder row of the multiplier. The compiler generates user readable schematics of the multiplier. The schematic displays discrete components of the multiplier arranged in locations which show to the user the flow of logic of the circuit. Additionally, the compiler generates test vectors.
Inventors
- 👤 Mark V. Bapst
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 16:46
CPC Classifications
G; G01; G01R; G01R31/00; G01R31/28; G01R31/317; G01R31/3181; G01R31/3183; G01R31/318307; G06; G06F; G06F30/00; G06F30/30; G06F7/00
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
135 words
An integrated circuit which implements the multiplication of a multiplicand and a multiplier in two's complement format, the integrated circuit comprising: a plurality of logical gates, arranged to receive the multiplicand and the multiplier and to generate summands for two's complement multiplication, the summands arranged in columns; a reduction means, coupled to the plurality of logical gates, for reducing the summands generated by the plurality of logical gates so there is a maximum of two summands in each column, the reduction means including a plurality of adders arranged in rows so that each row of adders reduces a maximum number of summands in each column to a next lower predetermined number stage; and, a final adder row which performs a final addition on summands remaining after the summands have been reduced by the reduction means.
Claim 2
Dependent Claim
135 words
An integrated circuit which implements the multiplication of a multiplicand and a multiplier in two's complement format, the integrated circuit comprising: a plurality of logical gates, arranged to receive the multiplicand and the multiplier and to generate summands for two's complement multiplication, the summands arranged in columns; a reduction means, coupled to the plurality of logical gates, for reducing the summands generated by the plurality of logical gates so there is a maximum of two summands in each column, the reduction means including a plurality of adders arranged in rows so that each row of adders reduces a maximum number of summands in each column to a next lower predetermined number stage; and, a final adder row which performs a final addition on summands remaining after the summands have been reduced by the reduction means.
Claim 3
Dependent Claim
51 words
An integrated circuit as in claim 1 wherein a lowest predetermined number stage is two and wherein a predetermined number stage S j , other than the lowest predetermined number stage, is calculated by a next lower number stage S j-1 using a formula: S j =S j-1 +int(S j-1 /2).
Claim 4
Independent Claim
133 words
A method for performing multiplication of a multiplicand by a multiplier, the multiplicand and the multiplier being in two's complement numbers on an integrated circuit, the method comprising the steps of: (a) receiving, by a plurality of logical gates, the multiplicand and the multiplier; (b) generating, by the plurality of logical gates, summands for two's complement multiplication, the summands arranged in columns; (c) reducing the summands generated by the plurality of logical gates so there is a maximum of two summands in each column, the reduction being done by a plurality of adders arranged in rows so that each row of adders reduces a maximum number of summands in each column to a next lower predetermined number stage; and, (d) performing a final addition on summands remaining after the summands have been reduced.
Claim 5
Independent Claim
133 words
A method for performing multiplication of a multiplicand by a multiplier, the multiplicand and the multiplier being in two's complement numbers on an integrated circuit, the method comprising the steps of: (a) receiving, by a plurality of logical gates, the multiplicand and the multiplier; (b) generating, by the plurality of logical gates, summands for two's complement multiplication, the summands arranged in columns; (c) reducing the summands generated by the plurality of logical gates so there is a maximum of two summands in each column, the reduction being done by a plurality of adders arranged in rows so that each row of adders reduces a maximum number of summands in each column to a next lower predetermined number stage; and, (d) performing a final addition on summands remaining after the summands have been reduced.
Claim 6
Dependent Claim
53 words
A method as in claim 3 wherein, in step (c), a lowest predetermined number stage is two and wherein a predetermined number stage S j , other than the lowest predetermined number stage, is calculated by a next lower number stage S j-1 using a formula: S j =S j-1 +int(S j-1 /2)
Claim 7
Dependent Claim
185 words
An integrated circuit which implements the multiplication of a multiplicand and a multiplier, the integrated circuit comprising: a plurality of logical gates, arranged to receive the multiplicand and the multiplier and to generate summands, the summands arranged in columns; a reduction means, coupled to the plurality of logical gates, for reducing the summands generated by the plurality of logical gates so there is a maximum of two summands in each column, the reduction means including a plurality of adders arranged in rows so that each row of adders reduces a maximum number of summands in each column to a next lower predetermined number stage; an adder which performs a final addition on summands remaining after the summands have been reduced by the reduction means; and, mode changing means, coupled to the plurality of logical gates, for, when a mode bit is in a first state, causing the plurality of logical gates to generate summands for multiplication of unsigned magnitude numbers, and when the mode bit is in a second state, causing the plurality of logical gates to generate summands for multiplication of two's complement numbers.
Claim 8
Dependent Claim
185 words
An integrated circuit which implements the multiplication of a multiplicand and a multiplier, the integrated circuit comprising: a plurality of logical gates, arranged to receive the multiplicand and the multiplier and to generate summands, the summands arranged in columns; a reduction means, coupled to the plurality of logical gates, for reducing the summands generated by the plurality of logical gates so there is a maximum of two summands in each column, the reduction means including a plurality of adders arranged in rows so that each row of adders reduces a maximum number of summands in each column to a next lower predetermined number stage; an adder which performs a final addition on summands remaining after the summands have been reduced by the reduction means; and, mode changing means, coupled to the plurality of logical gates, for, when a mode bit is in a first state, causing the plurality of logical gates to generate summands for multiplication of unsigned magnitude numbers, and when the mode bit is in a second state, causing the plurality of logical gates to generate summands for multiplication of two's complement numbers.
Claim 9
Dependent Claim
51 words
An integrated circuit as in claim 5 wherein a lowest predetermined number stage is two and wherein a predetermined number stage S j , other than the lowest predetermined number stage, is calculated by a next lower number stage S j-1 using a formula: S j =S j-1 +int(S j-1 /2).
References Cited (Backward Citations)
US3614608A
Cited
US4285059A
Cited
US4791601A
Cited
US4745570A
Cited
US5097422A
Cited
US4839848A
Cited
US4918639A
Cited
US4922432A
Cited
US5005136A
Cited
US4965741A
Cited
US4967367A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-05-01 | 1998-10-31 | 1999-05-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-05-01 | 2002-10-31 | 2003-05-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-05-01 | 2006-10-31 | 2007-05-02 | $7700.00 | Window Closed / Lapsed |