loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'04)
An Asynchronous, Iterative Implementation of the Original Booth Multiplication Algorithm
Crete, Greece
April 19-April 23
ISBN: 0-7695-2133-9
A. Efthymiou, University of Manchester
W. Suntiamorntut, University of Manchester
J. Garside, University of Manchester
L. E. M. Brackenbury, University of Manchester
One of the main reasons for using asynchronous design is that it offers the opportunity to exploit the data-dependent latency of many operations in order to achieve low-power, high-performance, or low area. This paper describes a novel, asynchronous, iterative multiplier which exhibits data-dependency in both the number of iterations required to produce the result and in the delay of each step of the iteration. The preliminary evaluation of the multiplier, implemented using standard-cells, shows that speed improvements can be achieved in comparison to a standard iterative, radix-4 Booth multiplier.
Citation:
A. Efthymiou, W. Suntiamorntut, J. Garside, L. E. M. Brackenbury, "An Asynchronous, Iterative Implementation of the Original Booth Multiplication Algorithm," async, pp.207-215, 10th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.