A Two's Complement Parallel Array Multiplication Algorithm

@article{Baugh1973ATC,
  title={A Two's Complement Parallel Array Multiplication Algorithm},
  author={C. Baugh and B. Wooley},
  journal={IEEE Transactions on Computers},
  year={1973},
  volume={C-22},
  pages={1045-1047}
}
  • C. Baugh, B. Wooley
  • Published 1973
  • Mathematics, Computer Science
  • IEEE Transactions on Computers
  • 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. 
    659 Citations

    Topics from this paper

    A high-speed two's complement bit-sequential multiplier
    • H. Lo
    • Mathematics
    • Proceedings of TENCON'94 - 1994 IEEE Region 10's 9th Annual International Conference on: 'Frontiers of Computer Technology'
    • 1994
    Two's complement parallel multiplier
    • 3
    A Two's Complement Array Multiplier Using True Values of the Operands
    • 4
    A multioperand two's complement addition algorithm
    • H. Kobayashi
    • Computer Science
    • 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH)
    • 1985
    • 5
    Parallel Encryted Array Multipliers
    • 2
    Algorithms for Iterative Array Multiplication
    • S. Nakamura
    • Computer Science
    • IEEE Transactions on Computers
    • 1986
    • 30
    Multiplexer-based array multipliers
    • 66

    References

    A 40-ns 17-Bit by 17-Bit Array Multiplier
    • 121