发明授权
US4970675A Multiplier for binary numbers comprising a very high number of bits
失效
用于包含非常高数量位的二进制数的乘数
- 专利标题: Multiplier for binary numbers comprising a very high number of bits
- 专利标题(中): 用于包含非常高数量位的二进制数的乘数
-
申请号: US310172申请日: 1989-02-15
-
公开(公告)号: US4970675A公开(公告)日: 1990-11-13
- 发明人: Philippe Gallay , Eric Depret
- 申请人: Philippe Gallay , Eric Depret
- 申请人地址: FRX Issy-Les Moulineaux
- 专利权人: Etat Francais represente par le Ministre des Postes
- 当前专利权人: Etat Francais represente par le Ministre des Postes
- 当前专利权人地址: FRX Issy-Les Moulineaux
- 优先权: FRX8802096 19880215
- 主分类号: G06F7/50
- IPC分类号: G06F7/50 ; G06F7/52 ; G06F7/72
摘要:
A multiplier for two binary values, X and Y, comprising a very high number (q) of bits, wherein memories storing the numbers X and Y and a result register MR are provided, X being expressed as the sequence of bits (x.sub.q-1 . . . x.sub.j . . . x.sub.0), uses the algorithm consisting in sequentially carrying out from j=q-1 to j=0 the additions 2R+x.sub.j Y and each time entering the result in the result memory (MR). In this multiplier the adders are grouped into n blocks of m bits (with n.times.m=q), m being chosen so that the carry transfer time into a block is lower than a clock period. Each block comprises a first and a second line of elementary adders forming the cells (C.sub.1 to C.sub.m+1) associated with each pair of bits to be added. This multiplier is more particularly adapted for carrying out the operations XYmodN and X.sup.S modN.
公开/授权文献
- US5556438A Composite abrasive products 公开/授权日:1996-09-17
信息查询