会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 22. 发明授权
    • Accelerated decomposition of small polygons into trapezoids
    • 将小多边形加速分解成梯形
    • US5133049A
    • 1992-07-21
    • US493185
    • 1990-03-14
    • Bradley W. CainRandall D. Briggs
    • Bradley W. CainRandall D. Briggs
    • G06T11/20G06T11/40G06T17/20
    • G06T17/20
    • A method and device for improving the processing performance of a transform engine by off-loading the processing of those input polygons which have no more than a predetermined number of edges and decomposing such polygons into trapezoids which can be rendered by a scan conversion system. This is accomplished in accordance with the invention by reading edge data of each input polygon into a RAM and determining the relative positions of the Y coordinates of end points of each edge so that the beginning and end of each respective edge of the polygon in the Y direction may be determined. The polygon is then broken into trapezoids by reading in the respective beginning points of respective edges of the polygon and proceeding until the end point of one of the edges is reached. At the end of one edge, another edge of the polygon is read in, and the process continues until all trapezoids in the polygon have been drawn. Since trapezoids may be much more efficiently handled by the scan conversion system, a significant performance enhancement in the polygon processing is made possible in accordance with the invention.
    • 一种用于通过对具有不超过预定数量的边缘的那些输入多边形的处理进行卸载来改进变换引擎的处理性能并将这样的多边形分解成可由扫描转换系统呈现的梯形的方法和装置。 根据本发明,通过将每个输入多边形的边缘数据读入RAM并确定每个边缘的端点的Y坐标的相对位置,使得Y中的多边形的每个相应边缘的开始和结束 方向可以确定。 然后通过读取多边形的相应边缘的相应起始点,然后将多边形分解成梯形,直到达到其中一个边缘的终点。 在一个边缘的末端,多边形的另一个边缘被读入,并且该过程继续进行,直到多边形中的所有梯形被绘制为止。 由于可以通过扫描转换系统更有效地处理梯形,所以根据本发明可以实现多边形处理中的显着性能增强。
    • 25. 发明授权
    • Method and device for scan chain management of dies reused in a multi-chip package
    • 用于多芯片封装中重复使用的裸片扫描链管理的方法和装置
    • US07945827B1
    • 2011-05-17
    • US11986529
    • 2007-11-20
    • Randall D. Briggs
    • Randall D. Briggs
    • G01R31/28
    • G01R31/318513G01R31/318563
    • An apparatus and method for economical testing of dies in a multichip module. Internal I/O pins on a die are logically connected to external I/O pins of the multichip module through the use of a silicon interposer on which the dies are attached. Multiplexers on the interposer can select between the external pins of the multichip module and the internal pins of the dies. The silicon interposer can be economically manufactured using manufacturing technology having relatively a large feature size, such as is found in a relatively mature IC fabrication plant. Further, use of the present invention allows multichip modules to be tested for faults without the necessity of redesigning test circuitry or adding additional pins to the package.
    • 一种用于在多芯片模块中经济测试模具的装置和方法。 芯片上的内部I / O引脚通过使用连接有裸片的硅插入件在逻辑上连接到多芯片模块的外部I / O引脚。 插入器上的多路复用器可以在多芯片模块的外部引脚和芯片的内部引脚之间进行选择。 可以使用具有相对较大特征尺寸的制造技术经济地制造硅插入器,例如在相对成熟的IC制造工厂中发现的。 此外,使用本发明允许对多芯片模块进行故障测试,而无需重新设计测试电路或向封装添加额外的引脚。
    • 26. 发明授权
    • Method and apparatus for preventing print overruns by rasterizing
complex page strips using an increased clock frequency
    • 用于通过使用增加的时钟频率光栅化复杂页面条来防止打印超限的方法和装置
    • US5444827A
    • 1995-08-22
    • US247806
    • 1994-05-23
    • Randall D. BriggsGreg L. Allen
    • Randall D. BriggsGreg L. Allen
    • B41J5/30G06F3/12G06K15/00G06K15/12
    • G06K15/12G06K15/1823G06K15/1848G06K2215/0082
    • A page printer includes a variable frequency clock for producing at least two clock frequencies, one higher than the other. The page printer includes a first memory for storing a page processing procedure and a second memory for storing data comprising full page strips. A processor operates at the first clock frequency in conjunction with the page processing procedure and derives a rasterization execution time (RET) for display commands that define images to be printed in each page strip of a page. The processor compares the RET for each page strip with a threshold value and rasterizes in the standard manner any page strip whose RET is equal to or less than the threshold value (while operating under the influence of the first clock frequency). When a complex page strip is found (whose RET exceeds the threshold), the variable frequency clock is controlled to generate a second higher frequency clock signal and to cause the processor to operate at a rate determined by the higher clock frequency so that display commands in the complex page strip are rasterized at higher speed.
    • 页面打印机包括用于产生至少两个时钟频率的可变频率时钟,一个高于另一个。 页面打印机包括用于存储页面处理过程的第一存储器和用于存储包括全页条带的数据的第二存储器。 处理器在第一时钟频率下与页面处理过程一起操作,并且导出用于定义要在页面的每个页面条中打印的图像的显示命令的光栅化执行时间(RET)。 处理器将每个页面条的RET与阈值进行比较,并以标准方式栅格其RET等于或小于阈值(同时在第一个时钟频率的影响下工作)的任何页面条。 当发现复杂的页面条(其RET超过阈值)时,控制可变频率时钟以产生第二较高频率时钟信号,并使处理器以由较高时钟频率确定的速率工作,使得显示命令 复杂的页面条以更高的速度进行光栅化。
    • 30. 发明授权
    • Updating data in a one-time programmable data storage device
    • 更新一次性可编程数据存储设备中的数据
    • US08294940B1
    • 2012-10-23
    • US12129076
    • 2008-05-29
    • Walter Lee McNallRandall D. Briggs
    • Walter Lee McNallRandall D. Briggs
    • G06K15/00G06F3/12
    • G06F12/0238G06F2212/202
    • A system and method are disclosed for updating data stored in a one-time programmable (non-rewritable) non-volatile storage device (“OTP”). The OTP is segmented so that updated data may be written to unused areas. Valid data may be differentiated from stale data using a data recognition technique such as tallying or indexing. According to a tallying technique, an updated event count may be obtained by counting the number of blown bits in the OTP. Each time the event occurs, the next bit is blown. According to an indexing technique, each bit in an index corresponds to a data block in the OTP. When updated data is written to the next (empty) data block in order in the OTP, the corresponding (next) index bit is blown. A valid data set may be located by counting the number of blown bits in the index.
    • 公开了一种用于更新存储在一次性可编程(非可重写)非易失性存储设备(OTP)中的数据的系统和方法。 OTP被分段,以便更新的数据可能被写入未使用的区域。 有效数据可以使用数据识别技术(如统计或索引)与陈旧的数据进行区分。 根据计算技术,可以通过对OTP中的比特数进行计数来获得更新的事件计数。 每次事件发生时,下一位都将被释放。 根据索引技术,索引中的每个比特对应于OTP中的数据块。 当更新的数据在OTP中按顺序写入下一个(空)数据块时,相应的(下一个)索引位将被释放。 可以通过对索引中的比特数进行计数来定位有效的数据集。