Asymptotic upper bound for multiplier design
Asymptotic upper bound for multiplier design
- Author(s): R.G.E. Pinch
- DOI: 10.1049/el:19960348
For access to this article, please select a purchase option:
Buy article PDF
Buy Knowledge Pack
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
Electronics Letters — Recommend this title to your library
Thank you
Your recommendation has been sent to your librarian.
- Author(s): R.G.E. Pinch 1
-
-
View affiliations
-
Affiliations:
1: Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge, United Kingdom
-
Affiliations:
1: Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, Cambridge, United Kingdom
- Source:
Volume 32, Issue 5,
29 February 1996,
p.
420 – 421
DOI: 10.1049/el:19960348 , Print ISSN 0013-5194, Online ISSN 1350-911X
The cost, in terms of adders/subtractors, of multiplication by n-bit integers when shifts are free is shown to be of the order of n/(log n)α for any α < 1.
Inspec keywords: digital arithmetic; multiplying circuits
Other keywords:
Subjects: Logic circuits; Digital arithmetic methods
References
-
-
1)
- A.G. Dempster , M.D. Macleod . Constant integer multiplication using minimum adders. IEE Proc., Circuits Devices Syst. , 5 , 407 - 413
-
2)
- A.G. Dempster , M.D. Macleod . General algorithms for reduced-adder integer multiplier design. Electron. Lett. , 21 , 1800 - 1802
-
3)
- Hartley, R.: `Optimization of canonic signed-digit multipliers for circuit design', Proc. IEEE Int. Symp. on Circuits and Systems (ISCAS'91), 1991, p. 1992–1995.
-
4)
- Potkonjak, M., Srivasta, M.B., Chandrakasan, A.: `Efficient substitution of multiple constant multiplications by shiftsand additions using iterative pairwise matching', Proc. 31st ACM/IEEE Design Automation Conf., 1994, p. 189–194.
-
5)
- Y. Han , D. Gollman , C. Mitchell , C. Boyd . (1994) Minimal weight , Cryptography and coding, .
-
1)
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19960348
Related content
content/journals/10.1049/el_19960348
pub_keyword,iet_inspecKeyword,pub_concept
6
6
