会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Data compressing method, data compressing apparatus, data decompressing
method and data decompressing apparatus
    • 数据压缩方法,数据压缩装置,数据解压缩方法和数据解压缩装置
    • US5801648A
    • 1998-09-01
    • US574436
    • 1995-12-15
    • Noriko SatohYoshiyuki OkadaShigeru YoshidaHironori Yahagi
    • Noriko SatohYoshiyuki OkadaShigeru YoshidaHironori Yahagi
    • H03M7/42H03M7/30H03M7/40
    • H03M7/40H03M7/3084
    • A data compressing method involves the use of a data string registering unit for registering a charactor or charactor string and the context and a code information registering unit for registering coding information of the character or character string following the context, the coding information following previous a input data. The data compressing method includes a data string new registering step of, when the input character or character string and the context set is not registering in the string registering unit, register the set in the data string registering unit. The same method also includes a code information new registering step of, when the input character or character string's code information following the context is not registering in the code information registering unit, register the code information in the code information registering unit and a code outputting step of outputting the code following the code information registered in the code information registering unit and a code information updating step of updating the code information registering unit.
    • 数据压缩方法涉及使用用于登记字符串或字符串的数据字符串登记单元和上下文,以及用于在上下文之后登记字符或字符串的编码信息的代码信息登记单元,在输入之后的编码信息 数据。 数据压缩方法包括数据串新的登记步骤,当输入字符或字符串和上下文集合未在字符串注册单元中注册时,将该集合注册到数据串登记单元中。 同样的方法还包括代码信息新登记步骤,当输入字符或字符串在上下文之后的代码信息未被注册到代码信息登记单元中时,将代码信息注册到代码信息登记单元中,并且代码输出步骤 输出代码信息登记单元中登记的代码信息的代码,代码信息更新步骤更新代码信息登记单元。
    • 2. 发明授权
    • Method of and apparatus for compressing and restoring data
    • 压缩和恢复数据的方法和装置
    • US06061398A
    • 2000-05-09
    • US749330
    • 1996-11-14
    • Noriko SatohYoshiyuki OkadaShigeru Yoshida
    • Noriko SatohYoshiyuki OkadaShigeru Yoshida
    • G06F5/00G06T9/00H03M7/40H04B1/66
    • H03M7/40G06T9/005
    • A data compression apparatus is capable of compressing data at a high compression rate and at a high speed. A data decompression apparatus is used in combination with this data compression apparatus to decode the compressed data. The data compression apparatus includes a RAM which stores Huffman code trees each of which corresponds to a character string, i.e. "context." A CPU encodes each character which is to be encoded by use of a Huffman code tree corresponding to the context at that time. Each time a character is encoded, the Huffman code tree used is reconstructed so as to account for the encoded character. The data decompression apparatus stores Huffman code trees corresponding to contexts respectively, decodes the code to be decoded by use of a Huffman code tree corresponding to the context (a character string previously decoded). Each time one character is decoded, the Huffman code tree used for decoding is reconstructed so as to account for the decoded character.
    • 数据压缩装置能够以高压缩率和高速压缩数据。 数据解压缩装置与该数据压缩装置组合使用以对压缩数据进行解码。 该数据压缩装置包括一个RAM,它存储每一个对应于一个字符串的霍夫曼代码树,即“上下文”。 CPU通过使用与当时上下文相对应的霍夫曼代码树对每个要编码的字符进行编码。 每次对字符进行编码时,重构所使用的霍夫曼代码树,以便考虑编码字符。 数据解压缩装置分别存储对应于上下文的霍夫曼代码树,通过使用与上下文相对应的霍夫曼代码树(先前解码的字符串)对要解码的代码进行解码。 每次解码一个字符时,重构用于解码的霍夫曼码树,以便解释解码的字符。
    • 3. 发明授权
    • Method and apparatus for compressing data string
    • 压缩数据串的方法和装置
    • US06563956B1
    • 2003-05-13
    • US09348163
    • 1999-07-07
    • Noriko SatohShigeru Yoshida
    • Noriko SatohShigeru Yoshida
    • G06K936
    • H03M7/3084
    • The present invention provides a data compression method in which a plurality of consecutive characters of a data string to be compressed are set as a character string to be searched for. Bits of a bit string representing the set character string are allocated to at least two codewords. Thus, first and second searching codewords are generated. These first and second codewords are used as array addresses. Fist and second array tables are prepared, in which information on the past occurrence positions of the set character string is previously entered as the contents thereof. When the first and second codewords are generated from the character string to be compressed, the first and second array tables are looked up by using these codewords as the addresses of the arrays. When results of looking up these tables match with each other, it is found that the set character string occurred in the past. Thus, information on the past occurrence position information of the set character string is obtained according to the obtained array content. Then, this information is encoded, so that data compression is performed. Thus, the amount of memory needed for the tables is significantly reduced, while information on the past occurrence position of the set character string is obtained without reducing a searching speed.
    • 本发明提供一种数据压缩方法,其中将要压缩的数据串的多个连续字符设置为要搜索的字符串。 代表所设置的字符串的位串的位被分配给至少两个码字。 因此,生成第一和第二搜索码字。 这些第一和第二码字被用作阵列地址。 准备第一和第二阵列表,其中预先输入关于所设置的字符串的过去出现位置的信息作为其内容。 当从要压缩的字符串生成第一和第二码字时,通过使用这些码字作为阵列的地址来查找第一和第二阵列表。 当查找这些表的结果相互匹配时,发现设置的字符串在过去发生。 因此,根据获得的阵列内容获得关于所设置的字符串的过去发生位置信息的信息。 然后,对该信息进行编码,进行数据压缩。 因此,在不降低搜索速度的情况下,获得表的所需内存量大大降低,同时获得所设置的字符串的过去发生位置的信息。
    • 4. 发明授权
    • Method and apparatus for compressing data string
    • 压缩数据串的方法和装置
    • US06876774B2
    • 2005-04-05
    • US10230236
    • 2002-08-29
    • Noriko SatohShigeru Yoshida
    • Noriko SatohShigeru Yoshida
    • G06F5/00G06K9/36G06K9/72H03M7/30H03M7/38H03M7/40
    • H03M7/3084
    • The present invention provides a data compression method in which a plurality of consecutive characters of a data string to be compressed are set as a character string to be searched for. Bits of a bit string representing the set character string are allocated to at least two codewords. Thus, first and second searching codewords are generated. These first and second codewords are used as array addresses. First and second array tables are prepared, in which information on the past occurrence positions of the set character string is previously entered as the contents thereof. When the first and second codewords are generated from the character string to be compressed, the first and second array tables are looked up by using these codewords as the addresses of the arrays. When results of looking up these tables match with each other, it is found that the set character string occurred in the past. Thus, information on the past occurrence position information of the set character string is obtained according to the obtained array content. Then, this information is encoded, so that data compression is performed. Thus, the amount of memory needed for the tables is significantly reduced, while information on the past occurrence position of the set character string is obtained without reducing a searching speed.
    • 本发明提供一种数据压缩方法,其中将要压缩的数据串的多个连续字符设置为要搜索的字符串。 代表所设置的字符串的位串的位被分配给至少两个码字。 因此,生成第一和第二搜索码字。 这些第一和第二码字被用作阵列地址。 准备第一和第二阵列表,其中预先输入所设置的字符串的过去出现位置的信息作为其内容。 当从要压缩的字符串生成第一和第二码字时,通过使用这些码字作为阵列的地址来查找第一和第二阵列表。 当查找这些表的结果相互匹配时,发现设置的字符串在过去发生。 因此,根据获得的阵列内容获得关于所设置的字符串的过去发生位置信息的信息。 然后,对该信息进行编码,进行数据压缩。 因此,在不降低搜索速度的情况下,获得表的所需内存量大大降低,同时获得所设置的字符串的过去发生位置的信息。
    • 6. 发明授权
    • Document managing apparatus, data compressing method, and data
decompressing method
    • 文件管理装置,数据压缩方法和数据解压缩方法
    • US5854597A
    • 1998-12-29
    • US787537
    • 1997-01-22
    • Kimitaka MurashitaShigeru YoshidaYoshiyuki Okada
    • Kimitaka MurashitaShigeru YoshidaYoshiyuki Okada
    • H03M7/40G06F17/30H03M7/30
    • G06F17/30011H03M7/30
    • In a document managing apparatus for forming a compressed document file where a keyword retrieval is available, a first process operation and a second process operation are alternately executed. In the first process operation, when document data to be compressed is given, the respective characters are directly written into a compressed document file until an end control character string appears in this document data. In the second process operation, data obtained by coding the respective characters are written into the compressed document file until a start control character series appears in the document data. Also, in this document managing apparatus, a third process operation and a fourth process operation are alternately performed, when the compressed document file is restored. In the third process operation, the respective data (characters) are directly outputted until the end control character string appears in the data contained in the compressed document file. In the fourth process operation, the decoding operation is carried out until the start control character string appears in the restored result of the data contained in the compressed document file.
    • 在用于形成关键字检索可用的压缩文件文件的文件管理装置中,交替执行第一处理操作和第二处理操作。 在第一处理操作中,当给出要压缩的文档数据时,将各个字符直接写入压缩文档文件,直到该文档数据中出现结束控制字符串。 在第二处理操作中,通过对各个字符进行编码而获得的数据被写入到压缩文档文件中,直到起始控制字符系列出现在文档数据中。 此外,在本文档管理装置中,当压缩的文件文件被恢复时,交替执行第三处理操作和第四处理操作。 在第三处理操作中,直接输出各个数据(字符),直到结束控制字符串出现在压缩文档中包含的数据中。 在第四处理操作中,执行解码操作,直到起始控制字符串出现在包含在压缩文档文件中的数据的恢复结果中。
    • 8. 发明授权
    • Dictionary searching system
    • 字典搜索系统
    • US5136289A
    • 1992-08-04
    • US740912
    • 1991-08-06
    • Shigeru YoshidaYasuhiko NakanoYoshiyuki OkadaHirotaka Chiba
    • Shigeru YoshidaYasuhiko NakanoYoshiyuki OkadaHirotaka Chiba
    • G06F17/27H03M7/30
    • G06F17/2735H03M7/3088
    • A dictionary searching system retrieves a character string which is described by input reference number and characters from a plurality of mutually different character strings which are registered in a dictionary in correspondence with reference numbers assigned to the character strings. The dictionary searching system includes a dictionary which is made up of an index part for storing in correspondence with the reference numbers a reference number which is assigned to one of character strings which are obtained by adding a character to the character string which is assigned the input reference number and the character which is added to the one of the character strings and a list part for storing in correspondence with the reference numbers a reference number which is assigned to one of character strings having a last character which differs from that of the character string which is assigned the input reference number and the character which is added to the one of the character strings, a reading part for initially reading information from the index part by specifying the input reference number and thereafter reading information from the list part by specifying the reference number which is read from the dictionary, a detecting part for detecting each character which matches the input characters out of characters read from the dictionary and for outputting a result of this detection as a retrieval result, and a deciding part for deciding whether or not a reference number is included in an output of the dictionary and for outputting a result of this detection as a retrieval result, where the reading part, the detecting part and the deciding part operate independently of each other.