Invention Grant
- Patent Title: Data compression utilizing longest common subsequence template
- Patent Title (中): 使用最长公共子序列模板的数据压缩
-
Application No.: US13780735Application Date: 2013-02-28
-
Publication No.: US09106251B2Publication Date: 2015-08-11
- Inventor: Kanak B. Agarwal , Damir A. Jamsek , Michael A. Paolini , Robert B. Tremaine
- Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Russell Ng PLLC
- Agent Steven Bennett
- Main IPC: H03M7/30
- IPC: H03M7/30

Abstract:
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.
Public/Granted literature
- US20140049413A1 DATA COMPRESSION UTILIZING LONGEST COMMON SUBSEQUENCE TEMPLATE Public/Granted day:2014-02-20
Information query
IPC分类: