Issue No. 07 - July (2000 vol. 49)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.863038
<p><b>Abstract</b>—High-speed multiplication is frequently used in general-purpose and application-specific computer systems. These systems often support integer multiplication, where two <tmath>$n$</tmath>-bit integers are multiplied to produce a <tmath>$2n$</tmath>-bit product. To prevent growth in word length, processors typically return the <tmath>$n$</tmath> least significant bits of the product and a flag that indicates whether or not overflow has occurred. Alternatively, some processors saturate results that overflow to the most positive or most negative representable number. This paper presents efficient methods for performing unsigned or two's complement integer multiplication with overflow detection or saturation. These methods have significantly less area and delay than conventional methods for integer multiplication with overflow detection or saturation.</p>
Overflow, saturation, two's complement, unsigned, integer, array multipliers, tree multipliers, computer arithmetic.
Michael J. Schulte, Pablo I. Balzola, Ahmet Akkas, Robert W. Brocato, "Integer Multiplication with Overflow Detection or Saturation", IEEE Transactions on Computers, vol. 49, no. , pp. 681-691, July 2000, doi:10.1109/12.863038