专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

WO2012150396A3 DEVICE AND METHOD FOR FAST MULTIPLICATION 审中-公开
标题翻译：用于快速多路复用的设备和方法
公开(公告)号：WO2012150396A3
公开(公告)日：2013-01-03
申请号：PCT/FR2012050818
申请日：2012-04-13
申请人： ALTIS SEMICONDUCTOR SNC , NACCACHE DAVID , SABEG KARIM
发明人： NACCACHE DAVID , SABEG KARIM
IPC分类号： G06F7/53
CPC分类号： G06F7/5324
摘要： The present invention relates to a method of encoding an integer number using an encoding function taking as input an integer number of n words of t bits or a multiple of t bits, and outputting an ordered array U of j rows and i columns containing integers Ui,,j. The words a[k] making up the number a are intercompared in order to organise them into a series of words having an increasing value (k=0, k=1, k=2,...). An array of indices makes it possible to conserve the rank k of the word a[k] in the ordered list. A first word of a is calculated by an equation using a group of words which are not expressed as a function of other words of a. Next, all the other words of a are calculated with the aid of an equation using already calculated words. In this way, it is possible to express a large number as an ordered series of terms having small discrepancies from one another. Such encoding makes it possible to limit the number of elementary multiplications when multiplying this number with another. The present invention also relates to the circuit implementing the encoding, as well as to a circuit implementing the multiplication of numbers thus encoded.
摘要翻译：本发明涉及一种使用编码函数编码整数的方法，该编码函数将t位的n个字的整数或t位的整数作为输入，并输出包含整数U i的j行和i列的有序数组U ,,学家为了将它们组合成具有增加值的一系列词（k = 0，k = 1，k = 2，...），组合数字a的词a [k]被比较。索引数组使得有可能节省有序列表中单词a [k]的秩k。通过使用不表示为a的其他单词的函数的一组单词的方程来计算a的第一个单词。接下来，使用已经计算的单词借助于等式来计算a的所有其他单词。以这种方式，可以将大量表示为彼此具有小差异的有序序列。这样的编码使得可以在将该数乘以另一个时限制基本乘法的数量。本发明还涉及实现编码的电路，以及实现如此编码的数字相乘的电路。

IPRDB

热门服务

关于我们

友情链接

联系方式