公开(公告)号：US07870160B2

公开(公告)日：2011-01-11

申请号：US12081316

申请日：2008-04-14

Applicant: Paul Jones

Inventor： Paul Jones

IPC: G06F7/00 ,  H03M7/00

CPC classification number: H03M7/3084

Abstract: A method for compressing a data stream based on a 3 byte sequence is used. Each three byte sequence is assigned a code word including a location and a length of the data associated with the code word. When a 6 byte sequence is located, a binary tree of 6 byte sequences sharing the same first three bytes is built, associating each 6 byte sequence with a position in the stream where the 6 byte sequence is found. When the length of a code word is changed, a byte sequence is emitted that identifies the code word to be changed and updating the length of the code word, so that when a match is found, a byte sequence is emitted that identifies the code word associated with the matched data. The method finds particular application in data streams that are sent to printers, and which contain large blocks of identical data.

Abstract translation: 使用基于3字节序列来压缩数据流的方法。 每个三字节序列被分配一个代码字，其包括与代码字相关联的数据的位置和长度。 当位于6字节序列时，构建共享相同前三个字节的6字节序列的二叉树，将每个6字节序列与找到6字节序列的流中的位置相关联。 当代码字的长度改变时，发出标识要改变的代码字并更新代码字的长度的字节序列，使得当发现匹配时，发出字节序列，其识别代码字 与匹配的数据相关联。 该方法在发送到打印机并且包含相同数据的大块的数据流中发现特定应用。

公开(公告)号：US08417730B2

公开(公告)日：2013-04-09

申请号：US12960109

申请日：2010-12-03

Applicant: Paul Jones

Inventor： Paul Jones

IPC: H01F7/00

CPC classification number: H03M7/3084

Abstract: A method for compressing a data stream based on a combination of two digests is used. Each combination of digests that occurs multiple times is assigned a codeword. When the first digest matches, a data structure of second digests occurring with the same first digest is built, associating each combination of digests with a position in the stream where the combination of digests is found. When a new match is found a new codeword is defined. When a match with an existing codeword is found, a byte sequence is emitted that identifies the codeword associated with the matched data. When a partial match is found, the length of a codeword is changed and a corresponding byte sequence is emitted. The method finds particular application in data streams that are sent to printers, and which contain large blocks of identical data such as images or repetitive text.

Abstract translation: 使用基于两个摘要的组合来压缩数据流的方法。 发生多次的每个摘要的组合被分配一个码字。 当第一摘要匹配时，构建出具有相同的第一摘要的第二摘要的数据结构，将每个消息组合与消息的组合的流中的位置相关联。 当发现新的匹配时，定义了新的码字。 当找到与现有码字的匹配时，发出标识与匹配数据相关联的码字的字节序列。 当发现部分匹配时，改变码字的长度并发出相应的字节序列。 该方法在发送到打印机的数据流中找到特定应用，并且包含大块相同的数据，如图像或重复文本。