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

multiplicationcomputer arithmeticone's complement

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

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

(5)

• New methods for binary multiplication
• Fast binary multiplication by performing dot counting and complement recoding
• Parallel algorithms for addition and multiplication on processor arrays with reconfigurable bus systems
• Computational Science – ICCS 2005
• Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers

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)