US4839847A
Expired / Lapsed
US
⏱️ 0.0 years remaining
N-clock, n-bit-serial multiplier
Assignee: Harris Corp
•
Filing: 1987-04-14
•
Granted: 1989-06-13
•
Expires: 2007-04-14
Abstract
Abstract A bit-serial multiplier has a multi-stage input data register and a multi-tiered tree of multiplexer/adder circuits coupled thereto which produces, at the output of the adder at the top tier of the tree, successive bit serial digital output codes representative of the products of a prescribed digital data code and successive input data codes as the input data codes are sequentially shifted into and through the input data register. By multiplexing the inputs to the adders of the tree to execute either an add function or to bypass data to the output successive output products codes can be generated at a twice the rate required to shift respective input codes into and through the input data register, thereby increasing the effective computational speed of the multiplier. The multiplexing/addition function of each multiplexer/adder involves controllably coupling the contents of selected stages of the input data register to selected adders of the adder tree and intercoupling selected ones of the adders between successive tiers of the adder tree, while effectively bypassing selected others of the adders between successive tiers of the adder tree, for each computational cycle of the adder tree, as the input data code is shifted therethrough. During the clocking of each input data code through the data register, the controllably coupling, intercoupling and bypassing of the adders of the tree is carried out in dependence upon the location of the code within the stages of the data register.
Inventors
- 👤 Kenneth C. Laprade
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-01 22:14
CPC Classifications
G; G06; G06F; G06F7/00; G06F7/38; G06F7/48; G06F7/52; G06F7/523
Claims Analysis
Total Claims: 23
Claim 1
Independent Claim
208 words
For use in a data processing apparatus wherein respective sequences of digital data codes representative of numerical values are subjected to at least one prescribed arithmetic signal processing operation, an arrangement for producing an output representative of the respective products of the numerical values represented by a sequence of digital data codes and a prescribed numerical value, said arrangement comprising: first means, having a plurality of sequential storage locations, for sequentially receiving and shifting therethrough respective successive portions of a digital data code; a plurality of multiplexer-adder means arranged in a tiered, tree-like configuration, each multiplexer adder means having a plurality of inputs and a plurality of outputs and including an adder circuit for providing at a selected one of said outputs the sum of data values coupled to selected ones of said plurality of inputs, and signal coupling means for coupling one of said plurality of inputs other than said selected ones of said plurality of inputs to an output other than said selected one of said outputs; and second means for coupling selected storage locations of said first means to inputs of selected ones of said multiplexer-adder means, and for selectively coupling outputs of said multiplexer-adder means to inputs of selected others of said multiplexer-adder means.
Claim 2
Dependent Claim
208 words
For use in a data processing apparatus wherein respective sequences of digital data codes representative of numerical values are subjected to at least one prescribed arithmetic signal processing operation, an arrangement for producing an output representative of the respective products of the numerical values represented by a sequence of digital data codes and a prescribed numerical value, said arrangement comprising: first means, having a plurality of sequential storage locations, for sequentially receiving and shifting therethrough respective successive portions of a digital data code; a plurality of multiplexer-adder means arranged in a tiered, tree-like configuration, each multiplexer adder means having a plurality of inputs and a plurality of outputs and including an adder circuit for providing at a selected one of said outputs the sum of data values coupled to selected ones of said plurality of inputs, and signal coupling means for coupling one of said plurality of inputs other than said selected ones of said plurality of inputs to an output other than said selected one of said outputs; and second means for coupling selected storage locations of said first means to inputs of selected ones of said multiplexer-adder means, and for selectively coupling outputs of said multiplexer-adder means to inputs of selected others of said multiplexer-adder means.
Claim 3
Dependent Claim
41 words
An arrangement according to claim 1, wherein said second means includes means for selectively coupling a respective storage location of said first means to inputs of ones of said multiplexer-adder mean in accordance with the contents of said prescribed numerical value.
Claim 4
Dependent Claim
99 words
An arrangement according to claim 2, wherein said plurality of sequential storage locations of said first means comprises first through M th sequentially arranged storage locations through which successive portions of a digital data code are sequentially shifted, and wherein said tiered, tree-like configuration of said plurality of multiplexer-adder means includes a first multiplexer-adder means of a first tier thereof having a first input coupled to said first storage location of said first means and a plurality of outputs coupled to a plurality of inputs of a multiplexer-adder means of a second tier of said plurality of multiplexer-adder means.
Claim 5
Dependent Claim
46 words
An arrangement according to claim 3, wherein said plurality of multiplexer adder means is configured of K=log 2 M tiers, and wherein the output representative of said product is derived from one of the plurality of outputs of a multiplexer-adder means of the K th tier.
Claim 6
Dependent Claim
85 words
An arrangement according to claim 4, wherein said second means includes means for controllably coupling selected inputs of each multiplexer-adder means to the adder circuit thereof and a selected input to a selected output thereof, such that for any digital data code received by shifted through the sequential storage locations of said first means, said adder circuits are engaged to operate on the contents of said digital code for one-half the number of shifts required to shift said code into and through said first means.
Claim 7
Dependent Claim
56 words
An arrangement according to claim 5, wherein said second means includes means for controlling the operation of said multiplexer-adder means such that a respective product is represented by a product code, the length of the product code corresponds to the code length of the digital code shifted through the sequential storage locations of said first means.
Claim 8
Dependent Claim
61 words
An arrangement according to claim 6, wherein the length of said product code produced by the output of said arrangement corresponds to the N most significant bits of said product code, where N is the bit length of said digital data code and M is the bit length of a prescribed digital code representative of said prescribed numerical value and N≧M.
Claim 9
Dependent Claim
88 words
An arrangement according to claim 1, wherein said second means includes means for controllably coupling selected inputs of each multiplexer-adder mean to the adder circuit thereof and a selected input to a selected output thereof, such that for any digital data code received by shifting through the sequential storage locations of said first means, said adder circuits, are engaged to operate on the contents of said digital data code for one-half the number of shifts required to shift said digital data code into and through said first means.
Claim 10
Dependent Claim
57 words
An arrangement according to claim 8, wherein said second means includes means for controlling the operation of said multiplexer-adder means such that a respective product is represented by a product code, the length of the product code corresponds to the code length of the digital data code shifted through the sequential storage locations of said first means.
Claim 11
Dependent Claim
61 words
An arrangement according to claim 9, wherein the length of said product code produced by the output of said arrangement corresponds to the N most significant bits of said product code, where N is the bit length of said digital data code and M is the bit length of a prescribed digital code representative of said prescribed numerical value and N≧M.
Claim 12
Dependent Claim
219 words
A bit serial multiplier for generating a bit-serial digital output code representative of the product of a predescribed digital code having a prescribed numerical value and an input digital code coupled to said multiplier in a bit serial manner, said bit serial multiplier comprising: sequential storage means having a plurality of sequential storage locations into and through which said input digital code is shifted in a bit serial manner; a multi-tiered tree-like arrangement of a plurality of multiplexer-adder means, each having first and second pairs of inputs and a pair of outputs and including an adder circuit for providing, at a selected output of said pair of outputs, the sum of data bit applied to a selected pair of said inputs, and signal coupling means for coupling one of the inputs of said first and second pairs of inputs to the other of said pair of outputs; signal coupling control means for coupling selected ones of said sequential storage locations to selected inputs of selected ones of said multiplexer-adder means and for selectively coupling the outputs of plural ones of said multiplexer-adder means to selected inputs of at least one selected other of said multiplexer-adder means; and output means, coupled to a selected output of a selected one of said multiplexer-adder means, for deriving said bit-serial digital output code.
Claim 13
Dependent Claim
219 words
A bit serial multiplier for generating a bit-serial digital output code representative of the product of a predescribed digital code having a prescribed numerical value and an input digital code coupled to said multiplier in a bit serial manner, said bit serial multiplier comprising: sequential storage means having a plurality of sequential storage locations into and through which said input digital code is shifted in a bit serial manner; a multi-tiered tree-like arrangement of a plurality of multiplexer-adder means, each having first and second pairs of inputs and a pair of outputs and including an adder circuit for providing, at a selected output of said pair of outputs, the sum of data bit applied to a selected pair of said inputs, and signal coupling means for coupling one of the inputs of said first and second pairs of inputs to the other of said pair of outputs; signal coupling control means for coupling selected ones of said sequential storage locations to selected inputs of selected ones of said multiplexer-adder means and for selectively coupling the outputs of plural ones of said multiplexer-adder means to selected inputs of at least one selected other of said multiplexer-adder means; and output means, coupled to a selected output of a selected one of said multiplexer-adder means, for deriving said bit-serial digital output code.
Claim 14
Dependent Claim
51 words
A bit serial multiplier according to claim 11, including means for coupling the output pairs of each of said multiplexer-adder means, other than said selected one of said multiplexer-adder means, to one of the first and second pairs of inputs of other multiplexer adder means of said plurality of multiplexer-adder means.
Claim 15
Dependent Claim
99 words
A bit serial multiplier according to claim 12, wherein said signal coupling control means includes means for controllably coupling selected inputs of each multiplexer adder means to the adder circuit thereof and a selected input to a selected output thereof such that for any digital code value received by and shifted through the sequential storage locations of said sequential storage means, said adder circuits are coupled to operate on the contents of said digital code for one-half the number of bits required to shift said digital code into and through the sequential storage locations of said sequential storage means.
Claim 16
Dependent Claim
59 words
A bit serial multiplier according to claim 11, wherein said signal coupling control means includes means for controlling the operating of said multiplexer-adder means such that said bit-serial digital output code corresponds to the most significant N bits of the product of said prescribed digital code of length M and said input digital code of length N, where N≧M.
Claim 17
Dependent Claim
45 words
A bit serial multiplier according to claim 14, wherein said plurality of multiplexer adder means is arranged in K=log 2 M tiers, and said bit serial digital output code is derived from one of the outputs of a multiplexer-adder means of the K th tier.
Claim 18
Dependent Claim
53 words
A bit serial multiplier according to claim 15, said second means including means for coupling the output pairs of each of said multiplexer-adder means, other than said selected one of said multiplexer-adder means, to one of the first and second pairs of inputs of other multiplexer-adder means of said plurality of multiplexer-adder means.
Claim 19
Dependent Claim
99 words
A bit serial multiplier according to claim 16, wherein said signal coupling control means includes means for controllably coupling selected inputs of each multiplexer adder means to the adder circuit thereof and a selected input to a selected output thereof such that for any digital code value received by and shifted through the sequential storage locations of said sequential storage means, said adder circuits are coupled to operate on the contents of said digital code for one-half the number of bits required to shift said digital code into and through the sequential storage locations of said sequential storage means.
Claim 20
Dependent Claim
185 words
For use with a bit-serial digital multiplier having a multi-stage input data register and a multitiered tree of adder circuits coupled thereto which produces, at the output of the adder at the top tier of the tree, successive bit serial digital output codes representative of the products of a prescribed digital data code and successive input data codes as said input data codes are sequentially shifted into and through said input data register, a method of operating said bit-serial digital multiplier so that said successive output codes are generated at twice the rate required to shift respective input data codes into and through said input data register, thereby increasing the effective computational speed of said multiplier, said method comprising the steps of controllably coupling the contents of selected stages of said input data register to selected adders of said adder tree, intercoupling selected ones of the adders between successive tiers of said adder tree, and effectively bypassing selected others of the adders between successive tiers of said adder tree, for each computational cycle of said adder tree, as said input data code is shifted therethrough.
Claim 21
Dependent Claim
185 words
For use with a bit-serial digital multiplier having a multi-stage input data register and a multitiered tree of adder circuits coupled thereto which produces, at the output of the adder at the top tier of the tree, successive bit serial digital output codes representative of the products of a prescribed digital data code and successive input data codes as said input data codes are sequentially shifted into and through said input data register, a method of operating said bit-serial digital multiplier so that said successive output codes are generated at twice the rate required to shift respective input data codes into and through said input data register, thereby increasing the effective computational speed of said multiplier, said method comprising the steps of controllably coupling the contents of selected stages of said input data register to selected adders of said adder tree, intercoupling selected ones of the adders between successive tiers of said adder tree, and effectively bypassing selected others of the adders between successive tiers of said adder tree, for each computational cycle of said adder tree, as said input data code is shifted therethrough.
Claim 22
Dependent Claim
46 words
A method according to claim 18, wherein, for each input data code, the controllably coupling, intercoupling and bypassing of the adders of said tree is carried out in dependence upon the location of said each input data code within the stages of said input data register.
Claim 23
Dependent Claim
45 words
A method according to claim 19, wherein the bits of said bit-serial digital output code correspond to the most significant N bits of the product of said prescribed digital data code of length M and said input digital data code of length N, where N≧M.
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-06-12 | 1992-12-12 | 1993-06-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-06-12 | 1996-12-12 | 1997-06-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-06-12 | 2000-12-12 | 2001-06-13 | $7700.00 | Window Closed / Lapsed |