A general proof for overlapped multiple-bit scanning multiplications

DOI10.1109/12.16494MaRDI QIDQ3817597zbMATH OpenOpenAlexWikidataFDO

Authors Eric M. Schwarz, Don J. Hanrahan, Stamatis Vassiliadis

Publication date 1989

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.16494

zbMATH Keywords

Booth algorithmcomputer arithmeticoverlapped bit scanningparallel multiplierstwo's complement multiplicationuniform overlapped shift algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• The combinatorics of product scanning multiplication and squaring
• New Self-Checking Booth Multipliers
• Multiple Operand Addition and Multiplication
• Implementing multiplication with split read-only memory
• A new algorithm for design of the Booth-based multiplier unit

Cited in

(1)

• The combinatorics of product scanning multiplication and squaring

This page was built for publication: A general proof for overlapped multiple-bit scanning multiplications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3817597)