Fast one's-complement multiplication

DOI10.1016/0020-0190(91)90158-EMaRDI QIDQ1182122zbMATH OpenOpenAlexFDO

Authors Amos Omondi

Publication date 27 June 1992

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(91)90158-e

zbMATH Keywords

computer arithmeticmultiplicationone's complement

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Review text

We describe a new method for the direct multiplication of numbers represented in one's complement notation. This method is simple and, as far as the author knows, both faster and cheaper to implement than previous methods (direct and indirect).

Recommendations

• scientific article; zbMATH DE number 4203715
• Modular Multiplication Without Trial Division
• Representation of numbers with negative digits and multiplication of small integers
• scientific article; zbMATH DE number 2085209
• A faster modular multiplication algorithm

Cited in

(6)

• Parallel algorithms for addition and multiplication on processor arrays with reconfigurable bus systems
• scientific article; zbMATH DE number 4203715 (Why is no real title available?)
• New methods for binary multiplication
• Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers
• Computational Science – ICCS 2005
• Fast binary multiplication by performing dot counting and complement recoding

This page was built for publication: Fast one's-complement multiplication

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