.png){kind=icon}
返回
Integer multiplication with overflow detection or saturation
.png){kind=icon}
PRE
AI
DOI：10.1109/12.863038.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
High-speed multiplication is frequently used in general-purpose and application-specific computer systems. These systems often support integer multiplication, where two n-bit integers are multiplied to produce a 2n-bit product. To prevent growth in word length, processors typically return the n 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.
Keyword:
overflow
saturation
two's complement
unsigned
integer
array multipliers
tree multipliers
computer arithmetic
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
INDIRECT COMPARISON OF PROPHYLAXIS EFFICACY BETWEEN SIMOCTOCOG ALFA AND EFANESOCTOCOG ALFA IN SEVERE HEMOPHILIA A AND THEIR COST IN THE UNITED STATES比较Simoctocog alfa与Efanesoctocog alfa在严重血友病A中预防治疗有效性的间接比较及其在美国的成本
PREAI
分享收藏
查看更多内容