loading...
Implementing Multiply-Accumulate Operation in Multiplication Time
Asilomar, CA March 06-March 09
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.1997.61488413th IEEE Symposium on Computer Arith ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Paul F. Stelling, California University of California, Davis, USA
Vojin G. Oklobdzija, California University of California, Davis, USA
Multiply-accumulate is an important and expensive operation. It is frequently used in digital signal processing and video/graphics applications. As a result, any improvement in the delay for performing this operation could have a positive impact on clock speed, instruction time and processor performance. In this paper, we show how, by extending our view of a parallel multiplier, we can apply recent innovations in parallel multiplier design to multiply-accumulators. This application results in multiply-accumulators that are as fast as multipliers of the same size (these multipliers have been shown to result in provably optimal delays faster than current designs). This allows a single (optimal multiply-accumulate) circuit to be used for both operations without delay penalty. As a result, multiply-accumulate can be efficiently and effectively implemented as an instruction in RISC CPUs. Additionally, the circuit design reduces the number of devices needed over current fast multiplier designs, so that real estate and power savings also result.
Index Terms:
multiplying circuits, multiply-accumulate operation, multiplication time, digital signal processing, video applications, graphics applications, optimal delays, clock speed, instruction time, processor performance, parallel multiplier, optimal multiply-accumulate circuit, RISC CPU, circuit design, power savings, partial product reduction tree, final adder, VLSI circuits
Citation:
Paul F. Stelling, Vojin G. Oklobdzija, "Implementing Multiply-Accumulate Operation in Multiplication Time," arith, pp.99, 13th IEEE Symposium on Computer Arithmetic (ARITH-13 '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.