发明申请
- 专利标题: DATA COMPRESSION UTILIZING LONGEST COMMON SUBSEQUENCE TEMPLATE
- 专利标题(中): 数据压缩利用最长的通用模式
-
申请号: US13587669申请日: 2012-08-16
-
公开(公告)号: US20140049412A1公开(公告)日: 2014-02-20
- 发明人: Kanak B. Agarwal , Damir A. Jamsek , Michael A. Paolini , Robert B. Tremaine
- 申请人: Kanak B. Agarwal , Damir A. Jamsek , Michael A. Paolini , Robert B. Tremaine
- 申请人地址: US NY Armonk
- 专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人: INTERNATIONAL BUSINESS MACHINES CORPORATION
- 当前专利权人地址: US NY Armonk
- 主分类号: H03M7/30
- IPC分类号: H03M7/30
摘要:
In response to receipt of an input string, an attempt is made to identify, in a template store, a closely matching template for use as a compression template. In response to identification of a closely matching template that can be used as a compression template, the input string is compressed into a compressed string by reference to a longest common subsequence compression template. Compressing the input string includes encoding, in a compressed string, an identifier of the compression template, encoding substrings of the input string not having commonality with the compression template of at least a predetermined length as literals, and encoding substrings of the input string having commonality with the compression template of at least the predetermined length as a jump distance without reference to a base location in the compression template. The compressed string is then output.
公开/授权文献
信息查询
IPC分类: