-
公开(公告)号：US09917596B2
公开(公告)日：2018-03-13
申请号：US15374462
申请日：2016-12-09
Applicant: Intel Corporation
Inventor： Vinodh Gopal , Sean M. Gulley , James D. Guilford
CPC classification number: H03M7/3086 , G06F3/0604 , G06F3/064 , G06F3/065 , G06F3/0673 , G06F9/3818 , G06F9/3863 , G06F12/023 , G06F12/0875 , G06F2212/1044 , G06F2212/452 , H03M7/3091 , H03M7/6005 , H03M7/6017
Abstract: Technologies for data decompression include a computing device that reads a symbol tag byte from an input stream. The computing device determines whether the symbol can be decoded using a fast-path routine, and if not, executes a slow-path routine to decompress the symbol. The slow-path routine may include data-dependent branch instructions that may be unpredictable using branch prediction hardware. For the fast-path routine, the computing device determines a next symbol increment value, a literal increment value, a data length, and an offset based on the tag byte, without executing an unpredictable branch instruction. The computing device sets a source pointer to either literal data or reference data as a function of the tag byte, without executing an unpredictable branch instruction. The computing device may set the source pointer using a conditional move instruction. The computing device copies the data and processes remaining symbols. Other embodiments are described and claimed.
-
公开(公告)号：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
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.
-
公开(公告)号：US20170250708A1
公开(公告)日：2017-08-31
申请号：US15056081
申请日：2016-02-29
Applicant: International Business Machines Corporation
Inventor： Tobias Blaettler , Thomas Parnell
CPC classification number: H03M7/42 , G06F3/0608 , G06F3/0661 , G06F3/0673 , H03M7/3086 , H03M7/3088 , H03M7/6017
Abstract: A mechanism is provided for high-throughput compression of data. Responsive to receiving an indication of a match of a current 4-byte sequence from an incoming data stream to stored hash values in a set of hash tables, numerous variables are set to initial values. Responsive to receiving a subsequent 4-byte sequence from the incoming data stream and determining that an active match variable is set to one, the subsequent 4-byte sequence is compared to data in a copy of the incoming data stream in memory at an active position with a predefined length offset. A constraint variable is set to a number of bytes for which the match is to be extended. Responsive to the constraint variable being below a predetermined number, a length, distance pair is output indicating a match to a previous pattern in the incoming data stream.
-
公开(公告)号：US20170250706A1
公开(公告)日：2017-08-31
申请号：US15374462
申请日：2016-12-09
Applicant: Intel Corporation
Inventor： Vinodh Gopal , Sean M. Gulley , James D. Guilford
CPC classification number: H03M7/3086 , G06F3/0604 , G06F3/064 , G06F3/065 , G06F3/0673 , G06F9/3818 , G06F9/3863 , G06F12/023 , G06F12/0875 , G06F2212/1044 , G06F2212/452 , H03M7/3091 , H03M7/6005 , H03M7/6017
Abstract: Technologies for data decompression include a computing device that reads a symbol tag byte from an input stream. The computing device determines whether the symbol can be decoded using a fast-path routine, and if not, executes a slow-path routine to decompress the symbol. The slow-path routine may include data-dependent branch instructions that may be unpredictable using branch prediction hardware. For the fast-path routine, the computing device determines a next symbol increment value, a literal increment value, a data length, and an offset based on the tag byte, without executing an unpredictable branch instruction. The computing device sets a source pointer to either literal data or reference data as a function of the tag byte, without executing an unpredictable branch instruction. The computing device may set the source pointer using a conditional move instruction. The computing device copies the data and processes remaining symbols. Other embodiments are described and claimed.
-
公开(公告)号：US20170235752A1
公开(公告)日：2017-08-17
申请号：US15042662
申请日：2016-02-12
Applicant: Oracle International Corporation
Inventor： Milton Shih
CPC classification number: G06F17/30153 , G06F17/3007 , G06F17/30115 , H03M7/30 , H03M7/3084 , H03M7/3086 , H03M7/4037 , H03M7/6017 , H03M7/6076
Abstract: A method for sharing a hardware decompression engine, including performing a compression type check on a first data stream to determine a compression type of the first data stream, wherein the first data stream is compressed using one selected from a group consisting of a first compression type and a second compression type; wherein, when the first data stream is compressed with the second compression type: receiving the second compression type at a selector; converting the first data stream compressed with the second compression type into a second data stream of the first compression type; inputting the converted second data stream into the selector; and decompressing the converted second data stream using the hardware decompression engine capable of decompressing a data stream compressed using the first compression type. In other aspects, a system for sharing a hardware decompression engine and a computing system are provided.
-
Patent Agency Ranking
公开(公告)号：US20170192709A1
公开(公告)日：2017-07-06
申请号：US14985460
申请日：2015-12-31
Applicant: International Business Machines Corporation
Inventor： Bulent Abali , Hubertus Franke , Luis A. Lastras
CPC classification number: H03M7/3086 , H03M7/6011 , H03M7/6017
Abstract: A compression engine and method for optimizing the high compression of a content addressable memory (CAM) and the efficiency of a static random access memory (SRAM) by synchronizing a CAM with a relatively small near history buffer and an SRAM with a larger far history buffer. An input stream is processed in parallel through the near history and far history components and an encoder selects for the compressed output the longest matching strings from matching strings provided by each of the near history and far history components. A further optimization is enabled by selectively disabling one or the other of the two types of compressors.
-
公开(公告)号：US20160380649A1
公开(公告)日：2016-12-29
申请号：US15258867
申请日：2016-09-07
Applicant: VIA ALLIANCE SEMICONDUCTOR CO., LTD.
Inventor： G. GLENN HENRY , TERRY PARKS
CPC classification number: H03M7/42 , H03M7/3086 , H03M7/6017 , H03M7/6088
Abstract: A hardware data compressor that compresses an input block of characters by replacing strings of characters in the input block with back pointers to matching strings earlier in the input block. A hash table is used in searching for the matching strings in the input block. A plurality of hash index generators each employs a different hashing algorithm on an initial portion of the strings of characters to be replaced to generate a respective index. The hardware data compressor also includes an indication of a type of the input block of characters. A selector selects the index generated by of one of the plurality hash index generators to index into the hash table based on the type of the input block.
-
88.发明授权Hardware data compressor that sorts hash chains based on node string match probabilities 有权基于节点字符串匹配概率对哈希链进行排序的硬件数据压缩器公开(公告)号：US09503122B1
公开(公告)日：2016-11-22
申请号：US14883090
申请日：2015-10-14
Applicant: VIA ALLIANCE SEMICONDUCTOR CO., LTD.
Inventor： G. Glenn Henry , Terry Parks , Kyle T. O'Brien
CPC classification number: H03M7/42 , G11B20/1426 , H03H17/0685 , H03M7/08 , H03M7/30 , H03M7/3086 , H03M7/40 , H03M7/4006 , H03M7/6017
Abstract: A hardware data compressor. A first hardware engine scans an input block of characters and uses a plurality of lists of nodes to produce back pointers to matching strings in the input block to compress the input block. Each node points to a character in the input block previously scanned and has an associated probability that a back pointer to a matching string that begins with the pointed-to character will be produced by the first hardware engine. A second hardware engine, for each list of nodes of the plurality of lists, sorts the list according to the probabilities of the nodes in the list so that higher probability nodes appear earlier in the list for use by the first hardware engine to search for matching strings during the scan of the input block of characters.
Abstract translation: 硬件数据压缩器。 第一硬件引擎扫描输入的字符块并使用多个节点列表来产生输入块中的匹配字符串的反向指针以压缩输入块。 每个节点指向先前扫描的输入块中的一个字符，并具有相关联的概率，即由第一个硬件引擎产生一个以指向字符开头的匹配字符串的后退指针。 对于多个列表中的每个节点列表，第二硬件引擎根据列表中的节点的概率对列表进行排序，使得较高概率节点在列表中较早出现以供第一硬件引擎使用以搜索匹配 在输入字符串的扫描期间的字符串。
-
公开(公告)号：US09450607B1
公开(公告)日：2016-09-20
申请号：US14328010
申请日：2014-07-10
Applicant: GOOGLE INC.
Inventor： Jyrki Antero Alakuijala , Zoltan Szabadka
CPC classification number: H03M7/3086 , G06F17/2217 , G06F17/2276 , H03M7/3088 , H03M7/6005 , H03M7/6017
Abstract: Data may be decompressed by receiving a compressed sequence of characters, the compressed sequence of characters being represented by at least a first received number, dividing the first received number by a number of words in a corpus of words to determine a quotient and a remainder, retrieving a word from the corpus of words based on the remainder, retrieving a transformation from a transformation index based on the quotient, and performing the retrieved transformation on the retrieved word. The representations of characters included in the transformed word may be a decompressed version of the received compressed sequence of characters.
Abstract translation: 可以通过接收压缩的字符序列来解压缩数据，压缩的字符序列由至少第一接收号码表示，将第一接收号码除以字语料库中的字数，以确定商和余数， 基于剩余部分从词语语料库检索单词，基于商从变换索引检索变换，并且对检索到的单词执行检索的变换。 包含在变换字中的字符的表示可以是所接收的压缩字符序列的解压缩版本。
-
公开(公告)号：US20160124867A1
公开(公告)日：2016-05-05
申请号：US14526868
申请日：2014-10-29
Applicant: QUALCOMM Incorporated
Inventor： Andres Alejandro Oportus Valenzuela , Richard Senior , Raghuveer Raghavendra , Nieyan Geng , Gurvinder Singh Chhabra
CPC classification number: G06F12/12 , G06F12/08 , G06F12/1009 , G06F2212/401 , H03M7/30 , H03M7/6017 , H03M7/6023 , H03M7/702
Abstract: Aspects include computing devices, systems, and methods for implementing executing decompression of a compressed page. A computing device may determine a decompression block of a compressed page that contains a code instruction requested in a memory access request. Decompression blocks, other than the decompression block containing the requested code instruction, may be selected for decompression based on being situated between an end of the compressed page and the decompression block containing the requested code instruction. Decompression blocks not identified for decompression may be substituted for a fault or exception code. The computing device may decompress decompression blocks identified for decompression, starting at the end of the compressed page and terminating the decompression of the compressed page upon filling all blocks with decompressed blocks, faults, or exception code. The remaining decompression blocks of the compressed page may be decompressed after or concurrently with the execution of the requested code instruction.
Abstract translation: 方面包括用于实现压缩页面的执行解压缩的计算设备，系统和方法。 计算设备可以确定包含在存储器访问请求中请求的代码指令的压缩页面的解压缩块。 可以基于位于压缩页面的末端和包含所请求的代码指令的解压缩块之间来选择解压缩块（除了包含所请求的代码指令的解压缩块）以用于解压缩。 未被解压缩的解压缩块可以替代故障或异常代码。 计算设备可以解压缩被解压缩的解压缩块，从压缩页的末尾开始，并且在用解压块，故障或异常代码填充所有块时终止压缩页的解压缩。 压缩页面的剩余解压缩块可以在执行所请求的代码指令之后或同时执行解压缩。
-
-
-
-
-
-
-
-
-
Search Results
95
records
(took 0.025 seconds)
