发明申请
US20070214205A1 MODULAR BINARY MULTIPLIER FOR SIGNED AND UNSIGNED OPERANDS OF VARIABLE WIDTHS
有权
用于可变宽度的签名和不相关操作的模块化二进制多路复用器
- 专利标题： MODULAR BINARY MULTIPLIER FOR SIGNED AND UNSIGNED OPERANDS OF VARIABLE WIDTHS
- 专利标题（中）： 用于可变宽度的签名和不相关操作的模块化二进制多路复用器
-
申请号： US11749239申请日： 2007-05-16
-
公开(公告)号： US20070214205A1公开(公告)日： 2007-09-13
- 发明人: Fadi Busaba , Steven Carlough , David Hutton , Christopher Krygowski , John Rell , Sheryll Veneracion
- 申请人： Fadi Busaba , Steven Carlough , David Hutton , Christopher Krygowski , John Rell , Sheryll Veneracion
- 申请人地址： US NY Armonk 10504
- 专利权人： INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人： INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人地址： US NY Armonk 10504
- 主分类号： G06F7/52
- IPC分类号： G06F7/52
摘要：
A method of implementing binary multiplication in a processing device includes obtaining a multiplicand and a multiplier from a storage device; in the event the multiplier is larger than a selected length, partitioning the multiplier into a plurality of multiplier subgroups; in the event the multiplicand is larger than a selected length, partitioning the multiplicand into a plurality of multiplicand subgroups and at least one of zeroing out of unused bits of the multiplicand subgroup and sign-extending a smaller portion of the multiplicand subgroup; establishing a plurality of multiplicand multiples based on at least one of a selected multiplicand subgroup of the plurality of multiplicand subgroups and the multiplicand; selecting one or more of the multiplicand multiples of the plurality of multiplicand multiples based on the each multiplier subgroup of the plurality of multiplier subgroups; and generating a first modular product based on the selected multiplicand multiples.
公开/授权文献
信息查询
