Patent US2910528A successfully refreshed from Google Patents.
Patent US6327772B1 successfully refreshed from Google Patents.
US4549280A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Apparatus for creating a multiplication pipeline of arbitrary size
Assignee: Unisys Corp
•
Filing: 1982-12-20
•
Granted: 1985-10-22
•
Expires: 2002-12-20
Abstract
Abstract A multiply pipeline with parity circuit to be used as a building block in a multiplication pipeline of arbitrary size is disclosed. It includes circuits for generating and checking parity. The parity of the output carries leaving the component chips of the multiply pipeline are explicitly generated internally to those chips. By generating output carry parity on-chip, all single-bit errors except for those caused by on-chip internal gate or metallization faults will be detected. Thus, means are provided for detection of single-bit errors in the multiplication circuitry. The proposed multiply pipeline with parity circuit includes a pair of gate arrays, or chips, which participate as follows. A 6-bit by 6-bit multiply with parity chip is used as a building block in a portion of the pipeline in which all logical products are initially generated, and reduction of these logical products, or partial products, commences. A 6-bit by 4-bit adder/register with parity chip is used as a building block in subsequent sections of the pipeline, which are used to further reduce the partial products. This latter chip type also contains a latch register to provide orderly and controlled staging of the intermediate partial products.
Inventors
- 👤 John R. Schomburg
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 21:00
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/52; G06F7/523; G06F7/53; G06F7/5324; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F2207/00; G06F2207/38; G06F2207/3804; G06F2207/386; G06F2207/3884
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
191 words
A multiply pipeline building block with parity checking capabilities comprising: a. a multiplicand register; b. a multiplier register; c. multiple ranks of multiply gate arrays each rank connected to said multiplicand register and to said multiplier register; d. a single rank of adder tree/register gate arrays connected to each of said multiple ranks of multiply gate arrays; e. a first parity generating means and a second parity generating means each connected to said single rank of adder tree/register gate arrays; f. a first parity checking means and a second parity checking means, said first parity checking means connected to said first parity generating means and to said single rank of adder tree/register gate arrays and said second parity checking means connected to said second parity generating means and to said single rank of adder tree/register gate arrays; and g. said first parity checking means further coupled to said multiplicand register, and to said multiplier register, and to each of said multiple ranks of multiply gate arrays to provide circuitry for receiving parity signals there from and for checking parity within the multiply pipeline building block and thereby internally detecting single-bit errors.
Claim 2
Dependent Claim
191 words
A multiply pipeline building block with parity checking capabilities comprising: a. a multiplicand register; b. a multiplier register; c. multiple ranks of multiply gate arrays each rank connected to said multiplicand register and to said multiplier register; d. a single rank of adder tree/register gate arrays connected to each of said multiple ranks of multiply gate arrays; e. a first parity generating means and a second parity generating means each connected to said single rank of adder tree/register gate arrays; f. a first parity checking means and a second parity checking means, said first parity checking means connected to said first parity generating means and to said single rank of adder tree/register gate arrays and said second parity checking means connected to said second parity generating means and to said single rank of adder tree/register gate arrays; and g. said first parity checking means further coupled to said multiplicand register, and to said multiplier register, and to each of said multiple ranks of multiply gate arrays to provide circuitry for receiving parity signals there from and for checking parity within the multiply pipeline building block and thereby internally detecting single-bit errors.
Claim 3
Dependent Claim
53 words
The multiply pipelined building block as set forth in claim 1 wherein each gate array in said multiple ranks of multiply gate arrays are identical gate arrays of a first gate array type and each gate array in said single rank of adder tree/register gate arrays are of a second gate array type.
Claim 4
Dependent Claim
47 words
The multiply pipeline building block as set forth in claim 2 wherein each of said multiple ranks of multiply gate arrays of identical first gate array types includes means for providing stage carry output signals thereby allowing direct interconnection of a plurality of multiply pipeline building blocks.
Claim 5
Dependent Claim
26 words
The invention as set forth in claim 3 wherein the second gate array type further includes latching means which are directly connected to said adder circuit.
Claim 6
Dependent Claim
130 words
The multiply pipeline building block as set forth in claim 2 wherein each gate array in said multiple ranks of multiply gate arrays of identical gate arrays of a first gate array type comprises: a. forming means including a tree of carry-save adders for forming a six-bit by six-bit square slice of the parallelogram of logical products formed in a binary multiplication; b. input means connected to said forming means which includes eleven bits of multiplicand and six bits of a multiplier for application to said forming means; and c. output means connected to the output of said forming means which includes a six-bit word sum and a six-bit carry word, wherein logical products are formed at the inputs of the first level of said carry-save adders of said tree.
Claim 7
Dependent Claim
41 words
The multiply pipeline building block as set forth in claim 2 wherein said single rank adder tree/register gate array of the second gate array type includes an adder circuit capable of summing four numbers and producing two numbers as a result.
Claim 8
Dependent Claim
33 words
The invention as set forth in claim 6 wherein the second gate array type further includes means for providing carries which do not ripple more than one bit position thereby minimizing propagation delay.
Claim 9
Dependent Claim
83 words
A multiply pipeline building block circuit with parity formed on a single circuit chip, a plurality of said chips capable of being interconnected to form the multiply pipeline, each chip comprising: a. multiplication circuitry for receiving a multiplier and a multiplicand; b. a plurality of parity generating circuits each coupled to said multiplication circuitry for explicitly generating internally to the circuit chip, parity signals; and c. parity checking circuits further connected to said multiplication circuitry for checking parity internally to said circuit chip.
Claim 10
Dependent Claim
83 words
A multiply pipeline building block circuit with parity formed on a single circuit chip, a plurality of said chips capable of being interconnected to form the multiply pipeline, each chip comprising: a. multiplication circuitry for receiving a multiplier and a multiplicand; b. a plurality of parity generating circuits each coupled to said multiplication circuitry for explicitly generating internally to the circuit chip, parity signals; and c. parity checking circuits further connected to said multiplication circuitry for checking parity internally to said circuit chip.
Claim 11
Dependent Claim
73 words
The invention as set forth in claim 8 wherein said parity generating and checking means includes intercoupling means connecting said parity checking and generating means to the multiplication circuitry to enable the generating and checking of a parity carry signal for providing detection of single-bit errors in the multiplication circuitry wherein by providing output carry parity on said circuit chip, all single-bit errors, except those caused by on-chip gate faults, will be detected.
Claim 12
Dependent Claim
169 words
A multiply pipeline gate array with parity generating and checking capabilities to be used as a building block in a binary digital multiplier circuit comprising: a. forming means, including a tree of carry-save adders for forming a multiple bit by multiple square slice of the parallelogram of logical products formed in a binary multiplication; b. input means connected to said forming means which includes multiple bits of a multiplicand and multiple bits of a multiplier for application to said forming means; c. output means connected to said forming means for providing a multiple bit word sum and a multiple bit word carry, wherein logical products are formed for entrance into said carry-save adders of said tree; and d. parity generating and checking means coupled to said tree of carry-save adders for generating and checking a parity carry signal and for providing detection of single-bit errors in the multiply pipeline gate array wherein by providing output carry parity from said multiply pipeline gate array, all single-bit errors will be detected.
Claim 13
Dependent Claim
169 words
A multiply pipeline gate array with parity generating and checking capabilities to be used as a building block in a binary digital multiplier circuit comprising: a. forming means, including a tree of carry-save adders for forming a multiple bit by multiple square slice of the parallelogram of logical products formed in a binary multiplication; b. input means connected to said forming means which includes multiple bits of a multiplicand and multiple bits of a multiplier for application to said forming means; c. output means connected to said forming means for providing a multiple bit word sum and a multiple bit word carry, wherein logical products are formed for entrance into said carry-save adders of said tree; and d. parity generating and checking means coupled to said tree of carry-save adders for generating and checking a parity carry signal and for providing detection of single-bit errors in the multiply pipeline gate array wherein by providing output carry parity from said multiply pipeline gate array, all single-bit errors will be detected.
Claim 14
Dependent Claim
25 words
The invention as set forth in claim 10 wherein said multiple bits of said square slice of the parallelogram is a six-bit by six-bit slice.
Claim 15
Dependent Claim
28 words
The invention as set forth in claim 10 wherein said multiple bits of the multiplicand comprise eleven bits and said multiple bits of said multiplier comprise six bits.
Claim 16
Dependent Claim
29 words
The invention as set forth in claim 10 wherein said multiple bit word sum is a six-bit word and said multiple bit carry word is also a six-bit word.
Claim 17
Dependent Claim
25 words
The invention as set forth in claim 10 wherein said multiply with parity gate array is a six by six multiply with parity gate array.
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-10-21 | 1989-04-22 | 1989-10-22 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1992-10-21 | 1993-04-22 | 1993-10-22 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1996-10-21 | 1997-04-22 | 1997-10-22 | $7700.00 | Window Closed / Lapsed |