Goodman, Rodney M. and McAuley, Anthony J. (1988) An efficient asynchronous multiplier. In: Proceedings. International Conference on Systolic Arrays. IEEE , Piscataway, NJ, pp. 593-599. ISBN 0818688602. https://resolver.caltech.edu/CaltechAUTHORS:20190314-130609515
![]() |
PDF
- Published Version
See Usage Policy. 239kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20190314-130609515
Abstract
An efficient asynchronous serial-parallel multiplier architecture is presented. If offers significant advantages over conventional clocked versions, without some of the drawbacks normally associated with similar asynchronous techniques, such as excessive area. It is shown how a general asynchronous communication element can be designed and illustrated with the CMOS multiplier chip implementation. It is also shown how the multiplier could form the basis for a faster and more robust implementation of the Rivest-Sharmir-Adleman (RSA) public-key cryptosystem.
Item Type: | Book Section | ||||||
---|---|---|---|---|---|---|---|
Related URLs: |
| ||||||
Additional Information: | © 1988 IEEE. | ||||||
DOI: | 10.1109/arrays.1988.18096 | ||||||
Record Number: | CaltechAUTHORS:20190314-130609515 | ||||||
Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20190314-130609515 | ||||||
Official Citation: | R. M. Goodman and A. J. McAuley, "An efficient asynchronous multiplier," [1988] Proceedings. International Conference on Systolic Arrays, San Diego, CA, USA, 1988, pp. 593-599. doi: 10.1109/ARRAYS.1988.18096 | ||||||
Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | ||||||
ID Code: | 93821 | ||||||
Collection: | CaltechAUTHORS | ||||||
Deposited By: | George Porter | ||||||
Deposited On: | 14 Mar 2019 21:12 | ||||||
Last Modified: | 16 Nov 2021 17:00 |
Repository Staff Only: item control page