发明名称 Binary Number Multiplying Method and Circuit
摘要 A multiplier and a method multiply, using an array of adders, two binary numbers X and Y defining a matrix [Eni=xn-i.yi], wherein the initial matrix [Eni=xn-i.yi] is transformed into a matrix [Eni=(xn-i⊕yi).(yi-1⊕yi)=(xn-i⊕y1).Yi] with Yi=yi-1⊕yi or [Eni=eni.Yi] with eni=xn-i⊕yi. A first approximation Un0 and Rn-1i-1 is formed of the sum and carry of the first two rows y0 and y1 of this matrix, and this is used as an input for the following estimation step which is repeated for all the following rows, successively carrying out the addition of the following Yi+1 rows up to the last non-zero row, according to a first given series of propagation equations, and then the propagation of the carries Rni-1 is carried out over the zero Yi+1 rows according to a second given series of propagation equations, in order to obtain the final result of the product P.
申请公布号 US2010017451(A1) 申请公布日期 2010.01.21
申请号 US20070515709 申请日期 2007.03.15
申请人 TORNO DANIEL 发明人 TORNO DANIEL
分类号 G06F17/14;G06F7/52;G06F7/556;G06F17/16 主分类号 G06F17/14
代理机构 代理人
主权项
地址
您可能感兴趣的专利