会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Bit searching through 8, 16, or 32 bit operands using a 32 bit data path
    • 通过使用32位数据路径的8,16或32位操作数进行位搜索
    • US5831877A
    • 1998-11-03
    • US451204
    • 1995-05-26
    • Thomas William Schaw Thomson
    • Thomas William Schaw Thomson
    • G06F7/74G06F7/00G06F15/00
    • G06F7/74
    • A bit searching method shifts an operand and counts the number of shifts it takes to shift out the value one, thereby identifying the bit position in operand containing the value one. The operand is first compared to zero. If the operand is zero, the zero flag is set, otherwise, a register is initialized by being cleared for a bit search forward instruction or, for a bit search reverse instruction, being initialized to 15 for a 16-bit data length or 31 for a 32-bit data length For a bit search forward instruction, the operand is then shifted right one bit and the register is incremented, while for a bit search reverse instruction, the operand is shifted left one bit and the register is decremented. The operand is then examined to see if a 1 has been shifted out. If so, the register is read and decremented by 1 to yield the bit position of the operand where the first 1 was found. If not, then another shift and increment (decrement) step is performed.
    • 位搜索方法移位操作数并计数移出值1所需的移位数,从而识别包含值1的操作数中的位位置。 操作数首先比较为零。 如果操作数为零,则设置零标志,否则,通过针对位搜索转发指令清零寄存器,或者对于位搜索反向指令,16位数据长度初始化为15或31 32位数据长度对于位搜索转发指令,操作数随后向右移位一位,寄存器递增,而对于位搜索反向指令,操作数向左移一位,寄存器递减。 然后检查操作数,看看是否已经移出1。 如果是这样,则寄存器被读取并递减1,以产生找到第一个1的操作数的位位置。 如果没有,则执行另一个移位和递增(递减)步骤。