Invention Grant
- Patent Title: Look-ahead hash chain matching for data compression
-
Application No.: US15406133Application Date: 2017-01-13
-
Publication No.: US09768802B2Publication Date: 2017-09-19
- Inventor: Vinodh Gopal , James D. Guilford , Gilbert M. Wolrich , Daniel F. Cutter
- Applicant: Intel Corporation
- Applicant Address: US CA Santa Clara
- Assignee: Intel Corporation
- Current Assignee: Intel Corporation
- Current Assignee Address: US CA Santa Clara
- Agency: Hanley, Flight & Zimmerman, LLC
- Main IPC: H03M7/00
- IPC: H03M7/00 ; H03M7/30 ; H03M7/42

Abstract:
Example data compression methods disclosed herein include determining a first hash chain index corresponding to a first position in an input data buffer based on a first group of bytes accessed from the input data buffer beginning at a first look-ahead offset from the first position. If a first hash chain (indexed by the first hash chain index), does not satisfy a quality condition, a second hash chain index corresponding to the first position in the input data buffer based on a second group of bytes accessed from the input data buffer beginning at a second look-ahead offset from the first position is determined. The input data buffer is searched at respective adjusted buffer positions to find a second string of data bytes matching a first string of data bytes and information related to the second string of data bytes is provided to an encoder to output compressed data.
Public/Granted literature
- US20170126248A1 LOOK-AHEAD HASH CHAIN MATCHING FOR DATA COMPRESSION Public/Granted day:2017-05-04
Information query