专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20070229323A1 METHODS OF CREATING A DICTIONARY FOR DATA COMPRESSION 失效
标题翻译：创建数据压缩字典的方法
公开(公告)号：US20070229323A1
公开(公告)日：2007-10-04
申请号：US11278118
申请日：2006-03-30
申请人： Piotr Plachta , Wolfram Sauer , Balakrishna Iyer , Steven White
发明人： Piotr Plachta , Wolfram Sauer , Balakrishna Iyer , Steven White
IPC分类号： H03M7/34
CPC分类号： H03M7/3088
摘要： Some aspects of the invention provide methods, systems, and computer program products for creating a static dictionary in which longer byte-strings are preferred. To that end, in accordance with aspects of the present invention, a new heuristic is defined to replace the aforementioned frequency count metric used to record the number of times a particular node in a data tree is visited. The new heuristic is based on counting the number of times an end-node of a particular byte-string is visited, while not incrementing a count for nodes storing characters in the middle of the byte-string as often as each time such nodes are visited. The result is an occurrence count metric that favours longer byte-strings, by being biased towards not incrementing the respective occurrence count values for nodes storing characters in the middle of a byte-string.
摘要翻译：本发明的一些方面提供用于创建静态词典的方法，系统和计算机程序产品，其中优选较长的字节串。为此，根据本发明的方面，定义新的启发式来代替用于记录数据树中的特定节点被访问次数的上述频率计数度量。新的启发式是基于对特定字节串的端节点进行访问的次数进行计数，而不会在每次访问这些节点时频繁地在字节串中间存储字符的节点递增计数。结果是有利于较长字节串的发生计数度量，偏向于不增加在字节串中间存储字符的节点的相应出现计数值。

IPRDB

热门服务

关于我们

友情链接

联系方式