Referenced Items are not available for this document.
Y. Ofman (1963), C.S. Wallace (1964), and others used carry save adders to design multiplication circuits whose total delay is proportional to the logarithm of the length of two numbers multiplied. An extension of their work is presented. A general theory is presented describing the optimal way in which given carry save adders can be combined into carry save networks. Two new designs of basic carry save adders are described. Using these building blocks and the general theory, the shallowest known theoretical circuits for multiplication are obtained
Published in:
Computer Arithmetic, 1991. Proceedings., 10th IEEE Symposium on
Date of Conference: 26-28 Jun 1991
- Page(s):
- 28 - 34
- Meeting Date :
- 26 Jun 1991-28 Jun 1991
- Print ISBN:
- 0-8186-9151-4
- INSPEC Accession Number:
- 4060514
- Conference Location :
- Grenoble
- Digital Object Identifier :
- 10.1109/ARITH.1991.145530
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
