A Two's Complement Parallel Array Multiplication Algorithm

@article{Baugh1973ATC,
  title={A Two's Complement Parallel Array Multiplication Algorithm},
  author={Charles R. Baugh and Bruce A. Wooley},
  journal={IEEE Transactions on Computers},
  year={1973},
  volume={C-22},
  pages={1045-1047}
}
An algorithm for high-speed, two's complement, m-bit by n-bit parallel array multiplication is described. The two's complement multiplication is converted to an equivalent parallel array addition problem in which each partial product bit is the AND of a multiplier bit and a multiplicand bit, and the signs of all the partial product bits are positive. 

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 376 CITATIONS

Application-Specific Low-Power Multipliers

  • IEEE Transactions on Computers
  • 2016
VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Energy-Efficient Digital Signal Processing via Voltage-Overscaling-Based Residue Number System

  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • 2013
VIEW 4 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Design and Implementation of Area Optimized Low Power Reversible Digital Multiplier

Deva Kumar Talluri, Venkateswara Reddy, Bala Krishna
  • 2016
VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

An efficient approach to design a reversible signed multiplier

  • TENCON 2014 - 2014 IEEE Region 10 Conference
  • 2014
VIEW 6 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A Flexible Low Power DSP With a Programmable Truncated Multiplier

  • IEEE Transactions on Circuits and Systems I: Regular Papers
  • 2012
VIEW 7 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1975
2019

CITATION STATISTICS

  • 30 Highly Influenced Citations

  • Averaged 13 Citations per year from 2017 through 2019