会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 25. 发明申请
    • COMBINED SET BIT COUNT AND DETECTOR LOGIC
    • 组合设置位计数和检测器逻辑
    • US20100082718A1
    • 2010-04-01
    • US12242727
    • 2008-09-30
    • Rajaraman RamanarayananSanu K. MathewRam K. KrishnamurthyShay GueronVasantha K. Erraguntla
    • Rajaraman RamanarayananSanu K. MathewRam K. KrishnamurthyShay GueronVasantha K. Erraguntla
    • G06F7/00
    • G06F7/74G06F7/607
    • A merged datapath for PopCount and BitScan is described. A hardware circuit includes a compressor tree utilized for a PopCount function, which is reused by a BitScan function (e.g., bit scan forward (BSF) or bit scan reverse (BSR)). Selector logic enables the compressor tree to operate on an input word for the PopCount or BitScan operation, based on a microprocessor instruction. The input word is encoded if a BitScan operation is selected. The compressor tree receives the input word, operates on the bits as though all bits have same level of significance (e.g., for an N-bit input word, the input word is treated as N one-bit inputs). The result of the compressor tree circuit is a binary value representing a number related to the operation performed (the number of set bits for PopCount, or the bit position of the first set bit encountered by scanning the input word).
    • 描述了PopCount和BitScan的合并数据路径。 硬件电路包括用于PopCount功能的压缩器树,其由BitScan功能(例如,位扫描前向(BSF)或位扫描反向(BSR))重用。 选择器逻辑使压缩器树能够基于微处理器指令对PopCount或BitScan操作的输入字进行操作。 如果选择了BitScan操作,则输入字被编码。 压缩器树接收输入字,对位进行操作,好像所有位具有相同的重要程度(例如,对于N位输入字,输入字被视为N个一位输入)。 压缩器树电路的结果是表示与执行的操作有关的数字的二进制值(PopCount的设置位数,或通过扫描输入字所遇到的第一组位的位位置)。
    • 29. 发明授权
    • High-performance adder
    • 高性能加法器
    • US07188134B2
    • 2007-03-06
    • US09967240
    • 2001-09-28
    • Sanu K. MathewRam K. Krishnamurthy
    • Sanu K. MathewRam K. Krishnamurthy
    • G06F7/50
    • G06F7/506G06F7/507
    • An adder for use in summing two binary numbers in an arithmetic logic unit of a processor. The adder includes a sparse carry-merge circuit adapted to generate a first predetermined number of carries and a plurality of intermediate carry generators coupled to the sparse carry merge circuit and adapted to generate a second predetermined number of carry signals. The adder further includes a plurality of conditional sum generators coupled to the intermediate carry generators and to the sparse carry-merge circuit to provide the sum of the two binary numbers. The adder may also include a multiplexer recovery circuit that enables a single rail dynamic implementation of the adder core.
    • 一种加法器,用于对处理器的算术逻辑单元中的两个二进制数进行求和。 加法器包括适于生成第一预定数量的进位的稀疏进位合并电路和耦合到稀疏进位合并电路并适于产生第二预定数量进位信号的多个中间进位发生器。 加法器还包括耦合到中间进位发生器和稀疏进位合并电路的多个条件和发生器,以提供两个二进制数的和。 加法器还可以包括多路复用器恢复电路,其实现加法器核的单轨动态实现。