会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Method of and an apparatus for compressing/decompressing data
    • 用于压缩/解压缩数据的方法和装置
    • US5673042A
    • 1997-09-30
    • US405209
    • 1995-03-16
    • Shigeru YoshidaYoshiyuki OkadaYasuhiko NakanoHironori Yahagi
    • Shigeru YoshidaYoshiyuki OkadaYasuhiko NakanoHironori Yahagi
    • G06F5/00G06F17/30G06T9/00H03M7/30H03M7/46H03H7/00
    • G06F17/30985G06T9/005H03M7/3086
    • The present invention relates to a method of and an apparatus for compressing/decompressing data, to improve the compression ratio of sliding-dictionary-type Ziv-Lempel codes. A sliding-dictionary-type data compression method finds a matching character string in a coding character string and in a coded character string stored in a dictionary 101. According to the length of the matching character string, the method chooses a raw data mode that codes the matching character string that must consist of a single character as it is, or a reproduction mode that codes the position and length in the dictionary 101 of the matching character string. The method allocates consecutive numbers to different codes to be prepared under the raw data mode and reproduction mode. The method relates any code prepared under one of the raw data mode and reproduction mode to a corresponding one of the consecutive numbers, codes the number according to a code book, and rearranges the code book to shorten the length of the code of the number.
    • 本发明涉及一种用于压缩/解压缩数据的方法和装置,以提高滑动词典型Ziv-Lempel码的压缩率。 滑动字典型数据压缩方法在编码字符串和字典101中存储的编码字符串中找到匹配的字符串。根据匹配字符串的长度,该方法选择编码的原始数据模式 必须由单个字符组成的匹配字符串,或者编码匹配字符串的字典101中的位置和长度的再现模式。 该方法将连续的数字分配给在原始数据模式和再现模式下准备的不同的代码。 该方法将在原始数据模式和再现模式之一下准备的任何代码与相应的一个连续数字相关联,根据代码簿对该编号进行编码,并重新排列代码簿以缩短编号的代码长度。
    • 4. 发明授权
    • 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.