Patent US3339102A successfully refreshed from Google Patents.
Patent US1145455A successfully refreshed from Google Patents.
Patent US4813008A successfully refreshed from Google Patents.
US4813008A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Multiplier circuit suitable for obtaining a negative product of a multiplier and a multiplicand
Assignee: Toshiba Corp
•
Filing: 1987-03-19
•
Granted: 1989-03-14
•
Expires: 2007-03-19
Abstract
Abstract A Pi generator receives the multiplier data Y and produces the Pi on the basis of the data Y2i, Y2i+1, and Y2i+2 of three continuous bits of the multiplier data Y (in which, it is defined that Pi=Y2i+Y2i+1-2·Y2i+2, Pi=Y2i+Y2i+1-2·Y2i+2' and Y0=0, and i=0, 1, . . . , n/2-1, and Yj is the bit data of the jth bit of the multiplier Y). A partial-product generator receives the Pi from the Pi generator and a multiplicand X, and obtains the partial products X·Pi of the multiplicand X and the Pi. A partial-product adding circuit weights 2 2i to the partial products X·Pi derived by the partial-product generator, and adds the resultant data, thereby producing the negative product (-X·Y) of the multiplicand X and multiplier Y.
Inventors
- 👤 Hiroshi Shigehara
- 👤 Mikio Shiraishi
- 👤 Yasuhiro Watanabe
- 👤 Nobuo Sugi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-04 16:59
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/52; G06F7/523; G06F7/533; G06F7/5334; G06F7/5336; G06F7/5338
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
106 words
An arithmetic operation circuit having a multiplier comprising: pi generating means for receiving a multiplier Y and for generating pi (in which it is defined that pi=y2i+y2i+1-2·y2i+2, pi=y2i+y2i+1-2·y2i+2, and y0=0, and i=0, 1, . . . , (n-1)/2, and yj is data of a jth bit of the multiplier Y); partial-product generating means for receiving the pi from said pi generating means, and a multiplicand X, and producing partial products pi·X; and partial-product adding means for producing a negative product (-X·Y=Σpi·X·2 2i ) of the multiplicand X and the multiplier Y, by weighting 2 2i to the partial products pi·X and by adding the resultant data.
Claim 2
Dependent Claim
106 words
An arithmetic operation circuit having a multiplier comprising: pi generating means for receiving a multiplier Y and for generating pi (in which it is defined that pi=y2i+y2i+1-2·y2i+2, pi=y2i+y2i+1-2·y2i+2, and y0=0, and i=0, 1, . . . , (n-1)/2, and yj is data of a jth bit of the multiplier Y); partial-product generating means for receiving the pi from said pi generating means, and a multiplicand X, and producing partial products pi·X; and partial-product adding means for producing a negative product (-X·Y=Σpi·X·2 2i ) of the multiplicand X and the multiplier Y, by weighting 2 2i to the partial products pi·X and by adding the resultant data.
Claim 3
Dependent Claim
64 words
An arithmetic operation circuit having a multiplier according to claim 1, wherein said pi generating means comprises: Pi generating means for outputting the pi when said multiplier Y is input; and inverting means for receiving the multiplier Y and supplying the inverted data of the multiplier Y to said pi generating means, thereby allowing the pi to be produced by said pi generating means.
Claim 4
Dependent Claim
42 words
An arithmetic operation circuit having a multiplier according to claim 2, wherein said inverting means includes means for receiving a control signal and for supplying said multiple Y, as it is, to said pi generating means in response to said control signal.
Claim 5
Dependent Claim
112 words
An arithmetic operation circuit having a multiplier according to claim 1, wherein said pi generating means is a circuit which outputs signals to instruct said partial-product generating means to selectively produce the multiplicand X, the data 2·X which is twice the multiplicand X, and "0", and which outputs signals to instruct said partial product generating means to output the produced data as they are, or inverts them and outputs the inverted data as the partial products, and converts one or more partial products into 2's complement, in the case where one or more partial products are the 1's complement of the multiplicand X, 1's complement of 2·X, and 1's complement of "0".
Claim 6
Dependent Claim
57 words
An arithmetic operation circuit having a multiplier according to claim 4, wherein said pi generating means further has means for receiving a control signal, for inverting the signals which instruct the inversion and the conversion into the 2's complement, and for outputting the inverted signal or directly outputting the signal on the basis of said control signal.
Claim 7
Dependent Claim
110 words
An arithmetic operation circuit having a multiplier according to claim 1, wherein said pi generating means is a circuit which outputs signals to instruct said partial product generating means to selectively produce the multiplicand X, the data 2·X which is twice the multiplicand X, and "0", and which outputs signals to instruct said partial-product generating means to output the produced data as they are, or inverts them and outputs the inverted data as the partial products, and converts one or more partial products into the 2's complement, in the case where said one or more partial products, are the 1's complement of the multiplicand X and 1's complement of 2·X.
Claim 8
Dependent Claim
56 words
An arithmetic operation circuit having a multiplier according to claim 6, wherein said pi generating means further has means for receiving a control signal, for inverting signals which, instruct the inversion and the conversion into the 2's complement, and for outputting the inverted signal or directly outputting said signal on the basis of said control signal.
Claim 9
Dependent Claim
113 words
An arithmetic operation circuit having a multiplier according to claim 1, wherein said pi generating means is a circuit which outputs signals to instruct said partial-product generating means to selectively produce, as the partial products, the multiplicand x, the data 2·x which is twice the multiplicand x, the inverted data X of the multiplicand X, the inverted data 2·X of the data 2·X, and "0", and which outputs signals to instruct said partial-product generating means to convert one or more partial products into the 2's complement, in the case where said one or more partial products are the 1's complement of the multiplicand X, 1's complement of 2·X, and 1's complement of "0".
Claim 10
Dependent Claim
121 words
An arithmetic operation circuit having a multiplier according to claim 8, wherein said pi generating means further has: means for receiving a control signal, switching, upon receipt of the control signal, the signal for instructing the production of said multiplicand X and the signal for instructing the production of the data X, and switching, also upon receipt of the control signal, the signal for instructing the production of the data 2·X and the signal for instructing the production of the data 2·X; and means for receiving the control signal, for inverting the signal which instructs the inversion and conversion into the 2's complement, and for outputting the inverted signal or directly outputting the signal on the basis of the control signal.
Claim 11
Dependent Claim
109 words
An arithmetic operation circuit having a multiplier according to claim 1, wherein said pi generating means is a circuit which outputs signals to instruct said partial-product generating means to selectively produce, as the partial products, the multiplicand x, the data 2·X which is twice the multiplicand X, the inverted data X of the multiplicand X, the inverted data 2·X of the data 2·X, and "0", and which outputs signals to instruct said partial-product generating means to convert one or more partial products into the 2's complement, in the case where said one or more partial products are the 1's complement of the multiplicand X and 1's complement of 2·X.
Claim 12
Dependent Claim
121 words
An arithmetic operator circuit having a multiplier according to claim 10, wherein said pi generating means further has: means for receiving a control signal, switching, upon receipt of the control signal, the signal for instructing the production of said multiplicand X and the signal for instructing the production of the data X, and switching, also upon receipt of the control signal, the signal for instructing the production of the data 2·X and the signal for instructing the production of the data 2·X; and means for receiving the control signal, for inverting the signal which instructs the inversion and conversion into the 2's complement, and for outputting the inverted signal or directly outputting the signal on the basis of the control signal.
Claim 13
Dependent Claim
78 words
An arithmetic operation circuit having a multiplier according to claim 1, wherein said pi generating means includes Pi generating means for receiving a control signal and producing the pi on the basis of said control signal, and wherein said partial-product generating means includes means for producing the partial products X·pi, for adding the partial products X·pi, and for obtaining the positive product of said multiplicand X and said multiplier Y when said pi generating means outputs the pi.
Claim 14
Dependent Claim
56 words
An arithmetic operation circuit having a multiplier according to claim 1, including means for receiving the output of said partial-product adding means, data X, and an addition control signal, and for adding the data Z to or subtracting it from the output of said adding means, in response to the level of said addition control signal.
Claim 15
Dependent Claim
93 words
An arithmetic operation having a multiplier according to claim 13, wherein said pi generating means includes pi generating means for producing said pi, said partial-product generating means and said partial-product adding means includes means for selectively obtaining one of the positive product (X·Y) and the negative product (-X·Y) of said multiplicand X and said multiplier Y, in response to the output of said pi generating means and said pi generating means respectively, and wherein said adding/subtracting means adds or subtracts the data Z to or from the output of said partial-product adding means.
Claim 16
Dependent Claim
29 words
An arithmetic operation circuit having a multiplier according to claim 1, wherein said multiplicand X and said multiplier Y are the data which are expressed as the 2's complement.
Claim 17
Dependent Claim
153 words
An arithmetic operation circuit having a multiplier according to claim 1, wherein said pi generating means is constituted by a decoder which consists of a plurality of logic gates, each of which receives three continuous bits of said multiplier Y, and which outputs the signals corresponding to said pi, said partial product generating means and said partial-product adding means are constituted by a plurality of multiplying cells arranged in a matrix form, and each of said multiplying cells is constituted by a logic circuit for receiving the signals corresponding to said pi, from the corresponding decoder, and corresponding bits data of the multiplicand, and for obtaining one bit (X·pi)j of said partial products, and a full adder for adding one bit of the partial products, a carry from the adjacent multiplying cell, and the sum data from the multiplying cells at the form stage, and for outputting the sum data and the carry.
Claim 18
Dependent Claim
88 words
A multiplier for obtaining the negative product of data X and Y, comprising: decoding means for receiving and decoding the multiplier Y, and producing pi (in which, it is defined that pi=y2+y2i+1-2y2i+2, pi=y2i+y2i+1-2·y2i+2, Y0=0, and i=0, 1, . . . , (n-1)/2, and yj is a jth bit of data Y); and obtaining means for receiving said pi and the multiplicand X, and obtaining the negative product (-X·Y) of the data X and Y in response to the pi and multiplicand X, on the basis of Booth's algorithm.
Claim 19
Dependent Claim
88 words
A multiplier for obtaining the negative product of data X and Y, comprising: decoding means for receiving and decoding the multiplier Y, and producing pi (in which, it is defined that pi=y2+y2i+1-2y2i+2, pi=y2i+y2i+1-2·y2i+2, Y0=0, and i=0, 1, . . . , (n-1)/2, and yj is a jth bit of data Y); and obtaining means for receiving said pi and the multiplicand X, and obtaining the negative product (-X·Y) of the data X and Y in response to the pi and multiplicand X, on the basis of Booth's algorithm.
Claim 20
Dependent Claim
60 words
A multiplier according to claim 17, wherein said pi generating means includes means for receiving a control signal and selectively producing the pi and the pi in response to the control signal, and said obtaining means selectively obtains the negative product and the positive product of the data X and Y, in response to the pi and the pi, respectively.
Claim 21
Dependent Claim
137 words
An arithmetic operation circuit comprising a multiplier, including: means for receiving data Y and a control signal, and selectively producing pi and pi by decoding the data Y, on the basis of the control signal (in which, it is defined that pi=y2i+y2i+1-2y2i+2, pi=y2i+y2i+1-2Y2i+2, y0=0, and i=0, 1, . . . , (n-1)/2, and yj is a bit data of a jth bit of data Y); and partial-product generating/adding means for receiving the output of said pi and pi generating means and data X, for selectively producing the partial products X·pi and X·pi in response to the pi or pi, respectively, and data X, and for selectively outputting the negative product (-X·Y) and the positive product (X·Y) of the data X and Y, by weighting 2 2i to the produced partial products and by accumulating the resultant data.
Claim 22
Dependent Claim
137 words
An arithmetic operation circuit comprising a multiplier, including: means for receiving data Y and a control signal, and selectively producing pi and pi by decoding the data Y, on the basis of the control signal (in which, it is defined that pi=y2i+y2i+1-2y2i+2, pi=y2i+y2i+1-2Y2i+2, y0=0, and i=0, 1, . . . , (n-1)/2, and yj is a bit data of a jth bit of data Y); and partial-product generating/adding means for receiving the output of said pi and pi generating means and data X, for selectively producing the partial products X·pi and X·pi in response to the pi or pi, respectively, and data X, and for selectively outputting the negative product (-X·Y) and the positive product (X·Y) of the data X and Y, by weighting 2 2i to the produced partial products and by accumulating the resultant data.
Claim 23
Dependent Claim
47 words
An arithmetic operation circuit according to claim 19, further comprising including an adding/subtracting circuit for receiving the output of said partial-product generating/adding means, a switching signal, and data Z, and for adding the data Z to or subtracting it from the output of said partial-product generating/adding means.
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) | 1992-03-13 | 1992-09-12 | 1993-03-14 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-03-13 | 1996-09-12 | 1997-03-14 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-03-13 | 2000-09-12 | 2001-03-14 | $7700.00 | Window Closed / Lapsed |