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

DOI10.1109/TC.2010.156zbMath1367.65236OpenAlexW1978433222WikidataQ60350138 ScholiaQ60350138MaRDI QIDQ5280620

P. Montuschi, Fabrizio Lamberti, Nikos Andrikos, 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)

Related Items (1)

A delay efficient Vedic multiplier

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