US2005125480A1PendingUtilityA1
Method and apparatus for multiplying based on booth's algorithm
Est. expiryDec 3, 2023(expired)· nominal 20-yr term from priority
H04N 19/427
50
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
A multiplying apparatus and method based on Booth's algorithm are disclosed. According to a multiplier index, a one of several predetermined multiplier coefficient sets can be chosen. Each multiplier coefficient set contains several multiplier coefficients that are generated according to a predetermined multiplier value by Booth's algorithm. Then the multiplier coefficients can be used to generate the partial products according to a multiplicand by Booth's algorithm. By summing all of the partial products, an output value can be generated.
Claims
exact text as granted — not AI-modified1 . A method for multiplying based on Booth's algorithm, comprising:
choosing a multiplier coefficient set according to a multiplier index, wherein said multiplier coefficient set comprises a plurality of multiplier coefficients transformed by Booth's algorithm according to a determined multiplier corresponding to said multiplier index; generating a plurality of partial products by multiplying said multiplier coefficients with a multiplicand while using a Booth's algorithm; and summing said partial products to generated an output value.
2 . The method for multiplying based on Booth's algorithm according to claim 1 , wherein said multiplier coefficients are indexed by said multiplier index in a lookup table, wherein said lookup table comprises the correspondent relations of a plurality of multiplier indexes and a plurality of multiplier coefficient sets.
3 . The method for multiplying based on Booth's algorithm according to claim 1 , wherein the sum of said partial products is a sum of the multiplication of said determined multiplier and said multiplicand.
4 . The method for multiplying based on Booth's algorithm according to claim 1 , wherein said product is a set of binary bits and said output value is formed by partial bits of said product.
5 . The method for multiplying based on Booth's algorithm according to claim 1 , wherein each of said partial products is a set of binary bits comprising a high bit set and a low bit set, wherein the sum of said high bit set of said partial products is a high bit product and said product is the sum of said high bit product and a carry out value that is the rest bits except said low bit set in the sum of said low set of said partial products.
6 . The method for multiplying based on Booth's algorithm according to claim 1 , wherein said output value is a sum of said high bit product and said carry out value.
7 . The method for multiplying based on Booth's algorithm according to claim 1 , wherein said multiplier index is chosen from the floating point value and the fixed point value, and is identified by the following representations: binary, nibble, decimal and hexadecimal.
8 . The method for multiplying based on Booth's algorithm according to claim 1 , wherein said multiplicand is chosen from the floating point value and the fixed point value, and is identified by the following representations: binary, nibble, decimal and hexadecimal.
9 . An apparatus for multiplying based on Booth's algorithm, comprising:
a coefficient generation means for choosing one of a plurality of coefficient sets to be a multiplier coefficient set comprising a plurality of multiplier coefficients transformed by Booth's algorithm according to a determined multiplier corresponding to said multiplier index; a partial product generation means for generating a plurality of partial products by multiplying said multiplier coefficients with a multiplicand; and a summing means for summing said partial products to generate an output value.
10 . The apparatus for multiplying based on Booth's algorithm according to claim 9 , wherein said multiplier coefficients are indexed by said multiplier index in a lookup table, wherein said lookup table comprises the correspondent relations of a plurality of multiplier indexes and a plurality of multiplier coefficient sets.
11 . The apparatus for multiplying based on Booth's algorithm according to claim 9 , wherein the sum of said partial products is a product of the multiplication of said determined multiplier and said multiplicand.
12 . The apparatus for multiplying based on Booth's algorithm according to claim 9 , wherein said product is a set of binary bits and said output value is formed by partial bits of said product.
13 . The apparatus for multiplying based on Booth's algorithm according to claim 12 , wherein each of said partial products is a set of binary bits comprising a high bit set and a low bit set, wherein the sum of said high bit set of said partial products is a high bit product and said product is the sum of said high bit product and a carry out value that is the rest bits except said low bit set in the sum of said low set of said partial products.
14 . The apparatus for multiplying based on Booth's algorithm according to claim 9 , wherein said output value is formed by partial bits of the sum of said-high bit product and said carry out value.
15 . The apparatus for multiplying based on Booth's algorithm according to claim 9 , wherein said multiplier index is chosen from the floating point value and the fixed point value, and is identified by the following representations: binary, nibble, decimal and hexadecimal.
16 . The apparatus for multiplying based on Booth's algorithm according to claim 9 , wherein said multiplicand is chosen from the floating point value and the fixed point value, and is identified by the following representations: binary, nibble, decimal and hexadecimal.
17 . The apparatus for multiplying based on Booth's algorithm according to claim 9 is applied in discrete cosine transform/inverse discrete cosine transform and said multiplier index is a cosine value.
18 . The apparatus for multiplying based on Booth's algorithm according to claim 17 , wherein said cosine value is one of the following group comprising:
1
2
cos
(
π
/
4
)
,
1
2
cos
(
π
/
8
)
,
1
2
cos
(
3
π
/
8
)
,
1
2
cos
(
π
/
16
)
,
1
2
cos
(
3
π
/
16
)
,
1
2
cos
(
7
π
/
16
)
and
1
2
cos
(
5
π
/
16
)
.Join the waitlist — get patent alerts
Track US2005125480A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.