会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • HIGH-SPEED DATA COMPRESSION BASED ON SET ASSOCIATIVE CACHE MAPPING TECHNIQUES
    • 基于相关高速缓存映射技术的高速数据压缩
    • WO2007112083A2
    • 2007-10-04
    • PCT/US2007007412
    • 2007-03-26
    • UNIV MISSISSIPPIPARIS LUIS
    • PARIS LUIS
    • G06F5/10
    • H03M7/3084G06F12/0864G06F12/123G06F2212/401H03M7/3088
    • A method is provided for compressing data from a source stream of data comprising a string of values using one or more distinct computer memory addresses as workspace, each computer memory address having one or more locations to hold one or more distinct values, respectively. The method works by reading two contiguous data values, of length K and N bits respectively, from a source data stream, as a memory address reference, and a current symbol value, respectively. The current symbol value is written to replace one of the values at the memory address reference if the current symbol value does not match any of the values at the memory address reference, and a MISS code, followed by the current symbol value, are appended to the compressed data stream. Alternatively, if the current symbol value matches any of the values at the memory address reference, then a hit code is added to the compressed data stream, said hit code representing the location, or an attribute associated with the location, where the value was found in the memory address reference. The method is repeated for all symbols read from the source stream. An equivalent, symmetric and reversible decompression or reconstruction method creates an uncompressed data stream equivalent to the original source stream. Advantageously, the workspace employed by the compression method has similar behavior to that of a cache memory used in computer architecture, allowing the compression method to be implemented using content addressable memory, that is associative or intelligent memory for hardware designs or associative arrays for software implementation.
    • 提供了一种用于使用一个或多个不同的计算机存储器地址作为工作空间从包括一串值的数据源的数据流压缩数据的方法,每个计算机存储器地址具有分别保存一个或多个不同值的一个或多个位置。 该方法通过分别从源数据流,作为存储器地址参考和当前符号值分别读取长度为K和N位的两个相邻数据值来工作。 如果当前符号值与存储器地址引用中的任何值不匹配,则写入当前符号值以替换存储器地址引用中的一个值,并将随后的当前符号值的MISS代码附加到 压缩数据流。 或者,如果当前符号值与存储器地址引用中的任何值匹配,则将命中码添加到压缩数据流,表示位置的所述命中码或与该位置相关联的属性,其中找到该值 在内存地址引用。 对从源流读取的所有符号重复该方法。 等效的,对称的和可逆的解压缩或重构方法创建等价于原始源流的未压缩数据流。 有利的是,压缩方法采用的工作空间与计算机体系结构中使用的高速缓冲存储器的行为相似,允许使用内容可寻址存储器来实施压缩方法,即用于硬件设计的关联或智能存储器或用于软件实现的关联阵列 。
    • 2. 发明申请
    • HIGH-SPEED DATA COMPRESSION BASED ON SET ASSOCIATIVE CACHE MAPPING TECHNIQUES
    • 基于相关高速缓存映射技术的高速数据压缩
    • WO2010045334A2
    • 2010-04-22
    • PCT/US2009060651
    • 2009-10-14
    • UNIV MISSISSIPPIPARIS LUIS
    • PARIS LUIS
    • G06F7/00G06F17/30
    • G06F12/0864G06F12/123G06F2212/401H03M7/3084
    • A method is provided for compressing data from a stream of values using one or many distinct memory addresses as workspace, each memory address containing one or many values. The method works by reading two contiguous data values, of length K and N bits, from the stream, as a memory address reference (MAR) and a symbol, respectively. If the symbol does not match any of the values in the memory address pointed to by MAR, the symbol replaces one of those values, and a MISS code, followed by the symbol, is appended to the compressed stream; otherwise, a HIT code is appended to the compressed stream, said code representing a function of the location where the matched value was found in the memory address. Advantageously, the workspace behaves analogous to a cache memory used in computer architecture, allowing hardware or software parallel implementations using content addressable memory or associative arrays.
    • 提供了一种用于使用一个或多个不同存储器地址作为工作空间从数据流压缩数据的方法,每个存储器地址包含一个或多个值。 该方法通过从流中读取长度为K和N比特的两个相邻数据值作为存储器地址引用(MAR)和符号来工作。 如果符号与MAR指向的存储器地址中的任何值不匹配,则符号替换这些值中的一个,并且随后的符号的MISS代码被附加到压缩流; 否则,将HIT代码附加到压缩流,所述代码表示在存储器地址中找到匹配值的位置的函数。 有利地,工作空间的行为类似于在计算机体系结构中使用的高速缓冲存储器,允许使用内容可寻址存储器或关联数组的硬件或软件并行实现。