Method and apparatus for floating point operations and format conversion operations
    1.
    发明授权
    Method and apparatus for floating point operations and format conversion operations 失效
    用于浮点运算和格式转换操作的方法和装置

    公开(公告)号:US06282554B1

    公开(公告)日:2001-08-28

    申请号:US09071466

    申请日:1998-04-30

    CPC classification number: H03M7/24

    Abstract: A floating point arithmetic apparatus for converting numbers between an integer format and a floating point format, wherein a conversion operation requires a greater data path width than a conversion operation. The apparatus comprises right shift circuitry that receives a number in the floating point format, wherein the right shift circuitry includes additional register positions to accommodate a shift beyond a data path width required by an arithmetic operation.

    Abstract translation: 一种用于在整数格式和浮点格式之间转换数字的浮点算术装置,其中转换操作需要比转换操作更大的数据路径宽度。 该装置包括接收浮点格式的数字的右移位电路,其中右移电路包括附加的寄存器位置,以适应超出算术运算所需的数据路径宽度的移位。

    Executing partial-width packed data instructions
    3.
    发明授权
    Executing partial-width packed data instructions 失效
    执行部分宽度打包的数据指令

    公开(公告)号:US6122725A

    公开(公告)日:2000-09-19

    申请号:US53002

    申请日:1998-03-31

    Abstract: A method and apparatus are provided for executing scalar packed data instructions. According to one aspect of the invention, a processor includes a plurality of registers, a register renaming unit coupled to the plurality of registers, and a decoder coupled to the register renaming unit. The register renaming unit provides an architectural register file to store packed data operands each of which include a plurality of data elements. The decoder is configured to decode a first and second set of instructions (e.g., a set of full-width packed data instructions and a set of partial-width packed data instructions) that each specify one or more registers in the architectural register file. Each of the instructions in the first set of instructions specify operations to be performed on all of the data elements stored in the one or more specified registers. In contrast, each of the instructions in the second set of instructions specify operations to be performed on only a subset of the data element stored in the one or more specified registers.

    Abstract translation: 提供了一种用于执行标量打包数据指令的方法和装置。 根据本发明的一个方面,处理器包括多个寄存器,耦合到多个寄存器的寄存器重命名单元和耦合到寄存器重命名单元的解码器。 寄存器重命名单元提供架构寄存器文件以存储打包数据操作数,每个数据操作数包括多个数据元素。 解码器被配置为对构造寄存器文件中的每个指定一个或多个寄存器的第一和第二组指令(例如,一组全宽度压缩数据指令和一组部分宽度压缩数据指令)进行解码。 第一组指令中的每个指令指定要对存储在一个或多个指定寄存器中的所有数据元素执行的操作。 相反,第二组指令中的每个指令指定仅对存储在一个或多个指定寄存器中的数据元素的子集执行的操作。

    Processor for computing a packed sum of absolute differences and packed multiply-add
    4.
    发明授权
    Processor for computing a packed sum of absolute differences and packed multiply-add 有权
    用于计算绝对差异和压缩乘积的压缩和的处理器

    公开(公告)号:US07516307B2

    公开(公告)日:2009-04-07

    申请号:US10005728

    申请日:2001-11-06

    Abstract: A method and apparatus is disclosed that computes multiple absolute differences from packed data and sums each one of the multiple absolute differences together to produce a result. According to one embodiment, a processor includes a decode unit to decode a packed sum of absolute differences (PSAD) instruction having an opcode format to identify a set of packed data operands. The decode unit initiates a sequence of operations on the set of packed data operands in response to decoding the PSAD instruction. An execution unit performs a first operation of the sequence of operations initiated by the decode logic, and a bus provides the execution unit with the set of packed data operands as identified in accordance with the opcode format.

    Abstract translation: 公开了一种从压缩数据计算多个绝对差异并将多个绝对差中的每一个相加在一起以产生结果的方法和装置。 根据一个实施例,处理器包括解码单元,用于解码具有操作码格式的绝对差(PSAD)指令的压缩和,以标识一组压缩数据操作数。 响应于解码PSAD指令,解码单元启动对该组打包数据操作数的操作序列。 执行单元执行由解码逻辑发起的操作序列的第一操作,并且总线向执行单元提供根据操作码格式识别的打包数据操作数集合。

    Pixel span depth buffer
    5.
    发明授权
    Pixel span depth buffer 失效
    像素跨度深度缓冲区

    公开(公告)号:US06498605B2

    公开(公告)日:2002-12-24

    申请号:US09442663

    申请日:1999-11-18

    CPC classification number: G06T15/40

    Abstract: An efficient way to determine which objects in a 3D image are to be displayed and which are not because they are obscured by other displayed objects. Displayable elements are assigned depth values defining their relative perceived nearness to the viewer of the image. A comparison of depth values determines which elements are to be displayed and which are not to be displayed because they are obscured by displayed elements. Rather than comparing the depth value of every pixel in a displayable object to determine whether it is to be displayed, the invention compares groups of pixels defined by spans. Minimum and maximum depth values are determined for each span so that depth variations within a span can be accommodated. Masks are used when only partial spans are to be considered because some pixels in a span are outside the pixel boundaries being considered in a particular comparison.

    Abstract translation: 确定要显示3D图像中哪些对象的有效方法,哪些不是因为它们被其他显示对象遮挡。 可显示元素被分配深度值,定义其与图像的观看者的相对感知的接近度。 深度值的比较确定要显示哪些元素以及不显示哪些元素,因为它们被显示的元素遮蔽。 不是比较可显示对象中的每个像素的深度值来确定是否要显示它,而是比较由跨度定义的像素组。 对于每个跨度确定最小和最大深度值,以便可以适应跨度内的深度变化。 当仅考虑部分跨度时使用掩模,因为跨度中的某些像素在特定比较中被考虑的像素边界之外。

    Method and apparatus for computing a sum of packed data elements using SIMD multiply circuitry
    6.
    发明授权
    Method and apparatus for computing a sum of packed data elements using SIMD multiply circuitry 失效
    用于使用SIMD乘法电路计算压缩数据元素之和的方法和装置

    公开(公告)号:US06377970B1

    公开(公告)日:2002-04-23

    申请号:US09052904

    申请日:1998-03-31

    Abstract: A method and apparatus that adds each one of multiple elements of a packed data together to produce a result. According to one such a method and apparatus, each of a first set of portions of partial products is produced using a first set of partial product selectors in a multiplier, each of the first set of portions of the partial products being zero. Each of the multiple elements is inserted into one of a second set of portions of the partial products using a second set of partial product selectors, each of the second set of portions of the partial products being aligned. Each of the multiple elements are added together to produce the result including a field having the sum of the multiple elements.

    Abstract translation: 将打包数据的多个元素中的每一个相加在一起以产生结果的方法和装置。 根据一种这样的方法和装置,使用乘法器中的第一组部分乘积选择器来产生部分乘积的第一组部分中的每一个,部分乘积的第一组部分中的每一个为零。 使用第二组部分产品选择器将多个元件中的每一个插入到部分产品的第二组部分中的一个中,部分产品的第二组部分中的每一个对齐。 将多个元素中的每一个相加在一起以产生包括具有多个元素之和的场的结果。

    Hardware predication for conditional instruction path branching
    8.
    发明授权
    Hardware predication for conditional instruction path branching 有权
    条件指令路径分支的硬件预测

    公开(公告)号:US06754812B1

    公开(公告)日:2004-06-22

    申请号:US09610895

    申请日:2000-07-06

    Abstract: An instruction associated with a condition is executed when the condition is resolved. In executing the instruction, a first operation designated by the instruction is performed to produce a first result, and a second operation is performed to produce a second result. The first result or the second result is output based on how the condition is resolved.

    Abstract translation: 当条件解决时,执行与条件相关联的指令。 在执行指令时,执行由指令指定的第一操作以产生第一结果,并且执行第二操作以产生第二结果。 第一个结果或第二个结果是根据条件如何解决输出的。

    3X adder
    10.
    发明授权
    3X adder 有权
    3X加法器

    公开(公告)号:US06269386B1

    公开(公告)日:2001-07-31

    申请号:US09172933

    申请日:1998-10-14

    CPC classification number: G06F7/508 G06F7/523

    Abstract: A 3x adder for adding 2a to a, where a is a binary number, the binary numbers 2a and a partitioned so that 2a=(xk . . . x0) and a=(yk . . . y0)where xi and yi have the same size for each i=0, 1, . . . , k, where the 3x adder provides the group generate terms for the sums xi+yi, i=0, 1, . . . , k, according to Boolean expressions, where for any sum xi+yi where xi and yi each have size n1+1, the number of Boolean variables in the product terms in the Boolean expression for the group generate terms of xi+yi do not exceed j+1, where j is the largest integer not exceeding ni/2.

    Abstract translation: 一个3×加法器,用于将2a加到a,其中a是二进制数,二进制数2a和a被分割,使得2a =(xk。。x0)和a =(yk ... y0),其中xi和yi具有 每个i = 0,1,...相同的大小。 。 。 ,k,其中3x加法器为和xi + yi,i = 0,1,提供组生成项。 。 。 ,k,根据布尔表达式,其中对于任何和xi + yi,其中xi和yi各自具有大小n1 + 1,组中布尔表达式中乘积项中的布尔变量的数量生成xi + yi的项 超过j + 1,其中j是不超过ni / 2的最大整数。

Patent Agency Ranking