会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明申请
    • COMPRESSION OF A TESSELLATED PRIMITIVE INDEX LIST IN A TILE RENDERING SYSTEM
    • 压缩系统中压缩的主要指标列表的压缩
    • WO2012120261A3
    • 2013-04-25
    • PCT/GB2012000226
    • 2012-03-08
    • IMAGINATION TECH LTDFISHWICK STEVEN
    • FISHWICK STEVEN
    • G06T9/00
    • G06T17/20G06T9/001G06T9/004
    • A method and apparatus are provided for compressing a list of primitives in a computer graphics system from a tessellated patch of surface data. Uncompressed domain point indices (2410) are received and stored in an index buffer (2420). The domain point index for the next primitive in the list is compared (2430) with the domain point indices stored in the buffer to determine any matches. The domain point indices of the next primitive are stored in the buffer or, where a match was found, a reference to the position of the matched index. The step of storing the domain point indices in the buffer (2430) includes the storage of a further predicted domain point index which is computed from the domain point indices stored in the buffer. Compressed domain point indices (2490) for the tessellated patch are then output from the buffer. The domain point index value may split into a base identifier as an offset from that base position. The base identifier comprises a row number for point or line primitives or a ring/edge number for triangular primitives.
    • 提供了一种方法和装置,用于从表面数据的镶嵌补丁压缩计算机图形系统中的原语列表。 未压缩域点索引(2410)被接收并存储在索引缓冲器(2420)中。 将列表中下一个原语的域点索引与存储在缓冲区中的域点索引进行比较(2430)以确定任何匹配。 下一个基元的域点索引存储在缓冲区中,或者在找到匹配项时,引用匹配索引的位置。 将域点索引存储在缓冲器(2430)中的步骤包括从存储在缓冲器中的域点索引计算的另外预测的域点索引的存储。 然后从缓冲区输出镶嵌补丁的压缩域点索引(2490)。 域点索引值可能会分裂为与该基本位置的偏移量的基本标识符。 基本标识符包括点或线原语的行号或三角形基元的环/边数。
    • 5. 发明申请
    • REQUESTS AND DATA HANDLING IN A BUS ARCHITECTURE
    • 总线架构中的请求和数据处理
    • WO2011114090A3
    • 2011-11-24
    • PCT/GB2011000291
    • 2011-03-03
    • IMAGINATION TECH LTDMEREDITH JASON
    • MEREDITH JASON
    • G06F13/18G06F13/16
    • G06F13/364G06F13/1621G06F13/1673
    • The present invention relates to improved methods for processing requests and sending data in a bus architecture. The present invention further relates to an improved bus architecture for processing requests and data. There is provided a method for processing read requests in a bus architecture comprising at least one master device connected to at least two slave devices via a bus. The architecture comprises an allocator for allocating incoming requests from the master device to a target slave device and an optimiser for each slave device. Each optimiser is for buffering incoming requests for the respective slave device. The method comprising the steps of: a) the master device sending a read request for a first slave device to the bus; b) the allocator generating a current-state indicator associated with the read request. The current-state indicator has an initial value, The method further comprises c) the allocator generating a priority indicator associated with the read request; d) the allocator sending the read request, the current-state indicator and the priority indicator to the optimiser of the first slave device; e) the optimiser of the first slave device receiving the read request, the current-state indicator and the priority indicator. Finally, if the initial value of the current-state indicator equals the value of the priority indicator, the method comprises processing the read request; or if the initial value of the current-state indicator does not equal the value of priority indicator, the method comprises deferring processing of the read request until a later time.
    • 本发明涉及用于在总线体系结构中处理请求和发送数据的改进方法。 本发明还涉及用于处理请求和数据的改进的总线体系结构。 提供了一种用于处理总线体系结构中的读请求的方法,该总线体系结构包括经由总线连接到至少两个从设备的至少一个主设备。 该架构包括用于将来自主设备的传入请求分配给目标从设备的分配器以及用于每个从设备的优化器。 每个优化器都用于缓存各个从设备的传入请求。 该方法包括以下步骤:a)主设备发送对第一从设备的读请求到总线; b)分配器产生与读取请求相关联的当前状态指示符。 当前状态指示符具有初始值。该方法还包括:c)分配器生成与读取请求相关联的优先级指示符; d)分配器将读取请求,当前状态指示符和优先级指示符发送给第一从设备的优化器; e)第一从设备的优化器接收读请求,当前状态指示符和优先级指示符。 最后,如果当前状态指示符的初始值等于优先级指示符的值,则该方法包括处理读取请求; 或者如果当前状态指示符的初始值不等于优先级指示符的值,则该方法包括将读取请求的处理推迟到稍后的时间。
    • 6. 发明申请
    • A METHOD AND APPARATUS FOR RENDERING A COMPUTER GENERATED IMAGE
    • 用于渲染计算机生成图像的方法和装置
    • WO2010133833A3
    • 2011-03-03
    • PCT/GB2010000995
    • 2010-05-17
    • IMAGINATION TECH LTDFENNEY SIMON
    • FENNEY SIMON
    • G06T15/00G06T17/20
    • G06T17/20G06T15/005
    • A method and apparatus for rendering a computer generated image using a stencil buffer is described. The method divides an arbitrary closed polygonal contour into first and higher level primitives, where first level primitives correspond to contiguous vertices in the arbitrary closed polygonal contour and higher level primitives correspond to the end vertices of consecutive primitives of the immediately preceding primitive level. The method reduces the level of overdraw when rendering the arbitrary polygonal contour using a stencil buffer compared to other image space methods. A method of producing the primitives in an interleaved order, with second and higher level primitives being produced before the final first level primitives of the contour, is described which improves cache hit rate by reusing more vertices between primitives as they are produced.
    • 描述了使用模板缓冲器呈现计算机生成的图像的方法和装置。 该方法将任意的闭合多边形轮廓划分成第一和更高级原语,其中第一级原语对应于任意封闭多边形轮廓中的连续顶点,并且较高级原语对应于紧接在前的原始级别的连续原语的结束顶点。 与其他图像空间方法相比,使用模板缓冲区渲染任意多边形轮廓时,该方法可以降低覆盖水平。 描述了以交错顺序产生原语的方法,其中在轮廓的最终第一级原语之前产生第二和更高级原语,其通过在产生原语之间重新使用多个顶点来改进高速缓存命中率。
    • 7. 发明申请
    • SCENE CHANGE DETECTION FOR RATE CONTROL
    • 用于速率控制的场景变化检测
    • WO2009133365A3
    • 2009-12-23
    • PCT/GB2009001085
    • 2009-04-29
    • IMAGINATION TECH LTDGAO JOHNLEABACK PETERHU MINGYOU
    • GAO JOHNLEABACK PETERHU MINGYOU
    • H04N7/26
    • H04N19/87H04N19/115H04N19/142H04N19/146H04N19/159H04N19/169
    • There is provided a method and apparatus for scene change detection for use with bit-rate control of a video compression system. The method and apparatus may be used for scene change detection in intra-coded and/or inter-coded pictures. The method comprises the steps of: compressing each picture in a video signal in turn; determining complexity data from the compressed signal for each picture after partial compression of the picture; determining from the complexity data whether a scene change may have taken place; and adjusting the compression step and allocated compressed bit number for pictures after a scene change detection in dependence on the result of the determination. For an intra-coded picture, the complexity data is a monotonically increasing function of a quantisation parameter and a compressed bit number used in the compression step for the partial compression from which the complexity data is determined. For an inter-coded picture, the complexity data is determined from a combination of a) the change of temporal prediction difference in relation to the average prediction difference of previous inter-coded pictures, b) the intra-coded macroblock number in the current inter-coded picture in relation to the average intra-coded macroblock number in previous inter-coded pictures, and c) the intra- coded macroblock number in the current inter-coded picture in relation to the total encoded macroblock number in the current inter-coded picture.
    • 提供了用于视频压缩系统的比特率控制的场景变化检测的方法和装置。 该方法和装置可用于帧内编码和/或帧间编码图像中的场景变化检测。 该方法包括以下步骤:依次压缩视频信号中的每个图像; 在图像的部分压缩之后从每个图像的压缩信号确定复杂度数据; 从复杂性数据确定场景变化是否可能发生; 并且根据确定结果调整压缩步骤并且在场景变化检测之后分配用于图像的压缩比特数。 对于帧内编码图像,复杂度数据是量化参数和用于部分压缩的压缩步骤中使用的压缩比特数的单调递增函数,从该压缩步骤确定复杂度数据。 对于帧间编码图像,复杂度数据由a)相对于先前帧间编码图像的平均预测差异的时间预测差的变化的组合确定,b)当前帧间编码的宏块数 相关于先前帧间编码图像中的平均帧内编码宏块数的编码图像,以及c)当前帧间编码图像中当前帧间编码图像中的总编码宏块数目的帧内编码宏块数目 图片。
    • 9. 发明申请
    • SCALABLE MULTI-THREADED MEDIA PROCESSING ARCHITECTURE
    • 可扩展多线程媒体处理架构
    • WO2007034232A3
    • 2008-01-24
    • PCT/GB2006003603
    • 2006-09-26
    • IMAGINATION TECH LTDHOWSON JOHN
    • HOWSON JOHN
    • G06F9/38G06F9/48G06F9/50
    • G06F9/3851G06F9/3824G06F9/5011G06F2209/507
    • A method and apparatus are provided for processing multiple streams of data on a plurality of execution threads. Data is selected from a plurality of data sources (1001 ). An address in the data storage means (1036) is allocated for the data thus selected. The selected data is then loaded into the allocated address. Following this an execution task comprising the selected data source, the data address and an execution address is constructed and the data task is queued with previously constructed tasks. A determination is made as to which processing resources are required for each task and tasks are selected for execution in dependence on this. Tasks selected for execution are distributed across a plurality of processing threads (170). The allocation of data storage in the data storage means includes the steps of selecting data from one of the data sources and supplying a code execution address to a programmable data sequencer (1004). The code from the code execution address is executed to cause data to be written to the data storage means. Furthermore, a tile based computer graphic rendering system may comprise a plurality of mulit-threaded processor cores. Each processor core is allocated to different sectors of the tile.
    • 提供了一种用于在多个执行线程上处理多个数据流的方法和装置。 从多个数据源(1001)中选择数据。 为这样选择的数据分配数据存储装置(1036)中的地址。 然后将选定的数据加载到分配的地址中。 在此之后,包括所选数据源的执行任务,构建数据地址和执行地址,并且数据任务与先前构造的任务排队。 确定每个任务需要哪些处理资源,并根据此选择执行任务。 选择执行的任务分布在多个处理线程(170)上。 数据存储装置中的数据存储的分配包括从数据源之一中选择数据并将代码执行地址提供给可编程数据定序器(1004)的步骤。 执行代码执行地址的代码以使数据被写入数据存储装置。 此外,基于瓦片的计算机图形呈现系统可以包括多个多线程处理器核心。 每个处理器核心分配给瓦片的不同扇区。