Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers

DOI10.1109/TC.2010.156MaRDI QIDQ5280620zbMATH OpenOpenAlexWikidataFDO

Authors Fabrizio Lamberti, Nikos Andrikos, P. Montuschi, Elisardo Antelo

Publication date 27 July 2017

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

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

Mathematics Subject Classification ID

Numerical algorithms for computer arithmetic, etc. (65Y04)

Recommendations

• Two's complement computation sharing multiplier and its applications to high performance DFE
• scientific article; zbMATH DE number 5708383
• Fast one's-complement multiplication
• Area—Time optimal VLSI integer multiplier with minimum computation time
• scientific article; zbMATH DE number 3887073
• Information Security and Cryptology - ICISC 2003
• Fast binary multiplication by performing dot counting and complement recoding
• Inefficiency of common-multiplicand multiplication and exponentiation algorithms by performing binary complements
• Area-Efficient Multipliers Based on Multiple-Radix Representations
• Efficient realization of large size two's complement multipliers using embedded blocks in FPGAs

Cited in

(4)

• A delay efficient Vedic multiplier
• Area—Time optimal VLSI integer multiplier with minimum computation time
• Bit-Width Optimization by Divide-and-Conquer for Fixed-Point Digital Signal Processing Systems
• scientific article; zbMATH DE number 5708383 (Why is no real title available?)

This page was built for publication: Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers

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