会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • System and method for performing decimal to binary conversion
    • 用于执行十进制到二进制转换的系统和方法
    • US20060179091A1
    • 2006-08-10
    • US11054233
    • 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 coded decimal (BCD) number made up of one or more sets of three digits. A running sum and a running carry are set to zero. The following steps are performed for each set of three digits in the BCD number in order from the set of three digits containing the three most significant digits of the BCD number to the set of three digits containing the three least significant digits of the BCD number. The steps include: creating six partial products based on the set of three digits, the running sum and the running carry; combining the six partial products into two partial products; and storing the two partial products in the running sum and the running carry. After the loop has been performed for each set of three digits in the BCD number, the running sum and the running carry are combined into a final binary result.
    • 一种从二进制转换为十进制的方法。 该方法包括接收由一个或多个三位数字组成的二进制编码十进制(BCD)号码。 运行总和和运行进位设置为零。 对于BCD号码中的每一组三位数字,按照从包含BCD号码三个最高有效数字的三位数字到包含BCD号码三个最低有效位数字的三位数组的顺序执行以下步骤。 步骤包括:根据三位数字,运行总和和运行进位创建六个部分产品; 将六部分产品合并成两部分产品; 并将两个部分乘积存储在运行和运行中。 在对BCD号码中的每组三位数进行了循环之后,运行总和和运行进位被组合成最终的二进制结果。
    • 2. 发明申请
    • 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格式,并将转换的结果存储在累加和中。 一旦通过循环处理了二进制数的所有位组,就将输出累加和作为最终结果。
    • 3. 发明申请
    • 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.
    • 5. 发明申请
    • System and method for performing decimal floating point addition
    • US20060179099A1
    • 2006-08-10
    • US11055231
    • 2005-02-10
    • Steven CarloughWen LiEric Schwarz
    • Steven CarloughWen LiEric Schwarz
    • G06F7/38
    • G06F7/4912G06F2207/4911
    • A method for performing a decimal floating point operation. A first operand including a first coefficient and a first exponent is received. The method also includes receiving a second operand that includes a second coefficient and a second exponent. An operation associated with the first operand and the second operand is received. The operation is an addition or a subtraction. Three concurrent calculations are performed on the first operand and the second operand. The first concurrent calculation includes applying the operation to the first operand and the second operand based on a first assumption that the first exponent is equal to the second exponent. The applying the operation based on the first assumption results in a first result and includes utilizing a two cycle adder. The second concurrent calculation includes applying the operation to the first operand and the second operand based on a second assumption that an absolute difference between the first exponent and the second exponent is less than or equal to a number of leading zeros in the coefficient of the operand with the larger exponent. The applying the operation based on the second assumption results in a second result and includes utilizing the two cycle adder. The third concurrent calculation includes applying the operation to the first operand and the second operand based on a third assumption that the absolute difference between the first exponent and the second exponent is greater than the number of leading zeros in the coefficient of the operand with the larger exponent. The applying the operation based on the third assumption results in a third result and includes utilizing the two cycle adder. A final result is selected from the first result, the second result and the third result.
    • 7. 发明申请
    • Decimal multiplication using digit recoding
    • 使用数字重新编码的十进制乘法
    • US20050010631A1
    • 2005-01-13
    • US10616556
    • 2003-07-10
    • Steven CarloughEric Schwarz
    • Steven CarloughEric Schwarz
    • G06F7/48G06F7/496G06F7/52
    • G06F7/4824G06F7/496
    • A system and methodology for decimal multiplication in a microprocessor comprising: a recoder configured to recode decimal digits of a first operand to a corresponding set of {−5 to +5}. The recoder also configured to recode decimal digits of a second operand to a corresponding set of {−5 to +5}. The system also includes a multiplier array of digit multipliers, each digit multiplier configured to generate a partial product of a selected digit of a recoded first operand and a recoded second operand; and an adder array of digit adders, each adder configured to generate a sum of the partial products, wherein a least significant digit of the sum is shifted to a results register, and each adder includes carry feedback.
    • 一种微处理器中十进制乘法的系统和方法,包括:重新编码器,被配置为将第一操作数的十位数字重新编码为对应的{-5至+5}集合。 编码器还配置为将第二操作数的十进制数字重新编码为相应的{-5到+5}集合。 该系统还包括数字乘法器的乘法器阵列,每个数字乘法器被配置为生成重新编码的第一操作数的选定位数和重新编码的第二操作数的部分乘积; 和加法器数组加法器阵列,每个加法器被配置为产生部分乘积的和,其中该和的最低有效位被移位到结果寄存器,并且每个加法器包括进位反馈。
    • 10. 发明申请
    • Storage pre-alignment and EBCDIC, ASCII and unicode basic latin conversions for packed decimal data
    • 用于打包十进制数据的存储预对齐和EBCDIC,ASCII和unicode基本拉丁转换
    • US20050246507A1
    • 2005-11-03
    • US10834637
    • 2004-04-29
    • Fadi BusabaSteven CarloughMark CheckChristopher KrygowskiJohn RellFrank Tanzi
    • Fadi BusabaSteven CarloughMark CheckChristopher KrygowskiJohn RellFrank Tanzi
    • G06F9/30G06F9/312G06F9/315G06F9/38G06F12/00G06F12/08
    • G06F9/30025G06F9/30032G06F9/30036G06F9/30043G06F9/3816G06F9/3824G06F12/0886
    • A method of pre-aligning data for storage during instruction execution improves performance by eliminating the cycles otherwise required for data alignment. The method can convert data between ASCII and Packed Decimal format, and between Unicode Basic Latin and Packed Decimal format. Conversion to Packed Decimal format is needed for decimal hardware in a microprocessor designed to generate decimal results. Converting from Packed Decimal to ASCII and Unicode Basic Latin is necessary to report Decimal Arithmetic results in a required format for the application program. To further improve performance, all available write ports in the fixed point unit (FXU) are utilized to reduce the number of cycles necessary to store results. To prevent data fetching of the unused destination data from slowing down instruction execution, the destination locations are tested for storage access exceptions, but the data for these operands are not actually fetched. A single read request from the FXU to the operand buffers effectively reads the entire destination address (up to 8 double-words of data) in a single cycle.
    • 在指令执行期间预先对准用于存储的数据的方法通过消除数据对准所需的周期来提高性能。 该方法可以在ASCII和Packed Decimal格式之间以及Unicode Basic Latin和Packed Decimal格式之间转换数据。 转换为打包十进制硬件需要十进制格式,用于生成十进制结果的微处理器。 从包装十进制转换为ASCII和Unicode基本拉丁文需要以应用程序所需的格式报告十进制算术结果。 为了进一步提高性能,利用固定点单元(FXU)中的所有可用写入端口来减少存储结果所需的周期数。 为了防止数据获取未使用的目标数据缓慢的指令执行,目标位置被测试存储访问异常,但是这些操作数的数据实际上并没有被提取。 从FXU到操作数缓冲区的单个读取请求在单个周期中有效读取整个目标地址(最多8个双字的数据)。