会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 9. 发明申请
    • System and method for converting binary to decimal
    • 将二进制转换为十进制的系统和方法
    • US20060179090A1
    • 2006-08-10
    • US11054232
    • 2005-02-09
    • Steven CarloughBruce FleischerWen LiEric Schwarz
    • Steven CarloughBruce FleischerWen LiEric Schwarz
    • G06F7/00
    • H03M7/12
    • A method for converting from binary to decimal. The method includes receiving a binary number, the binary number including one or more sets of bits. An accumulated sum is set to zero. The accumulated sum is in a binary coded decimal (BCD) format. The following loop is repeated for each set of bits in the binary number in order from the set of bits containing the most significant bit of the binary number to the set of bits containing the least significant bit of the binary number: the accumulated sum is converted into a 5,1 code format resulting in an interim sum. The loop also includes repeating for each next bit in the set in order from the most significant bit to the least significant bit in the set: doubling the interim sum; and replacing the least significant bit of the interim sum with the next bit. The last step in the loop includes converting the interim sum into the BCD format and storing the results of the converting in the accumulated sum. Once all of the sets of bits in the binary number have been processed through the loop, the accumulated sum is output as the final result.
    • 一种从二进制转换为十进制的方法。 该方法包括接收二进制数,该二进制数包括一个或多个位组。 累积和设为零。 累加和是二进制编码十进制(BCD)格式。 从包含二进制数的最高有效位的位的集合到包含二进制数的最低有效位的位的位的顺序从二进制数中的每组位重复以下循环:累积和被转换 成为5,1代码格式,产生临时总和。 循环还包括从组中的最高有效位到最低有效位的顺序对集合中的每个下一个位进行重复:使中间和加倍; 并用下一位代替中间和的最低有效位。 循环的最后一步包括将中间和转换为BCD格式,并将转换的结果存储在累加和中。 一旦通过循环处理了二进制数的所有位组,就将输出累加和作为最终结果。
    • 10. 发明申请
    • System and method for performing decimal division
    • US20060179102A1
    • 2006-08-10
    • US11055221
    • 2005-02-10
    • Steven CarloughPaulomi KadakiaWen LiEric Schwarz
    • Steven CarloughPaulomi KadakiaWen LiEric Schwarz
    • G06F7/52
    • G06F7/4917G06F2207/5352
    • A method for performing decimal division including receiving a scaled divisor and dividend and storing a subset of the multiples of the scaled divisor. An accumulated quotient is initialized to be equal to zero, a first current remainder is initialized to be equal to the scaled dividend, and a second current remainder is initialized to be equal to the scaled dividend minus the scaled divisor. The following loop is performed until a selected number of quotient digits are produced. An estimated next quotient digit is calculated based on the first digit of the first current remainder. A temp remainder is selected to be either the first current remainder or the second current remainder based on the estimated next quotient digit. A first next remainder is calculated by subtracting one of the stored multiples from the temp remainder, where the stored multiple is selected based on a first digit of the first current remainder. A second next remainder is calculated by subtracting an other one of the stored multiples from the temp remainder, where the other one of the stored multiples is selected based on the first current remainder. An actual quotient digits is calculated based on the estimated next quotient digit, the first current remainder and the first next remainder. The accumulated quotient is updated with the actual next quotient digit. Finally, the first current remainder is set to be equal to the first next remainder and the second current remainder is set to be equal to the second next remainder.