公开(公告)号：US09912351B1

公开(公告)日：2018-03-06

申请号：US15673649

申请日：2017-08-10

Applicant: VIA Alliance Semiconductor Co., Ltd.

Inventor： Xiaoyang Li ,  Zongpu Qi ,  Zheng Wang ,  Mengchen Yang ,  Fangfang Wu ,  Shican Luo ,  Lei Meng ,  Jin Yu ,  Kuan-Jui Ho ,  Lin Li

IPC: H03M7/30 ,  G06F5/06 ,  G06F9/44 ,  G06F17/30 ,  G06F12/1018 ,  G06F12/02

CPC classification number: H03M7/3084 ,  G06F5/065 ,  G06F9/4498 ,  G06F12/0215 ,  G06F12/1018 ,  G06F17/30982 ,  G06F2212/401 ,  G06F2212/654 ,  H03M7/3086 ,  H03M7/6011 ,  H03M7/6017 ,  H03M7/6023

Abstract: The invention introduces a method for accelerating hash-based compression, performed in a compression accelerator, comprising: receiving, by a plurality of hash functions, a plurality of substrings from an FSM (Finite-State Machine) in parallel; mapping, by each hash function, the received substring to a hash index and directing a selector to connect to one of a plurality of match paths according to the hash index; transmitting, by a matcher of each connected match path, a no-match message to the FSM when determining that a hash table does not contain the received substring; and transmitting, by the matcher of each connected match path, a match message and a match offset of the hash table to the FSM when determining that the hash table contains the received substring, wherein the match offset corresponds to the received substring.

公开(公告)号：US09979414B1

公开(公告)日：2018-05-22

申请号：US15673736

申请日：2017-08-10

Applicant: VIA Alliance Semiconductor Co., Ltd.

Inventor： Xiaoyang Li ,  Zongpu Qi ,  Zheng Wang ,  Mengchen Yang ,  Fangfang Wu ,  Shican Luo ,  Lei Meng ,  Jin Yu ,  Kuan-Jui Ho ,  Lin Li

IPC: H03M7/34 ,  H03M7/30 ,  G06F5/06 ,  G06F9/44 ,  G06F3/06

CPC classification number: H03M7/3084 ,  G06F3/0613 ,  G06F3/0656 ,  G06F3/0673 ,  G06F5/065 ,  G06F9/4498 ,  H03M7/3086 ,  H03M7/3091 ,  H03M7/6023

Abstract: The invention introduces a method for accelerating hash-based compression, performed in a compression accelerator, comprising: fetching a string to be compressed from a data buffer; storing instances corresponding to the string in an intermediary buffer; issuing a hash request to a hash matcher for each instance, issuing a data request to an LSM (longest string matcher) according to a first reply sent by the hash matcher, and updating a state, a match length and a match offset of the instance according to a second reply sent by the LSM; and outputting the result to a formatter according to the state, the match length and the match offset of each instance in the original order of the associated substrings that appeared in the string.