会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Method of building an adaptive huffman codeword tree
    • 构建自适应huffman码字树的方法
    • US6040790A
    • 2000-03-21
    • US87389
    • 1998-05-29
    • Simon M. Law
    • Simon M. Law
    • H03M7/40H03M7/42
    • H03M7/405H03M7/6047
    • Many compression algorithms require the compressor to generate trees (tables) for encoding purposes. To generate the optimum tree for a set of Huffman symbols either takes too much time or requires too much hardware. This invention proposes to separate the symbols into groups according to the symbol's occurring frequency. With these groups of symbols available, subsequent code length assignment of these groups can be done without a complete sorting of all the symbols and their parents. During code length assignment, some relocation of individual symbols from one group to another can also be performed to optimize the Huffman table. In most of the cases this technique can achieve a compression ratio within 5% of the optimum Huffman table, while requiring less hardware or software overhead.
    • 许多压缩算法要求压缩器生成用于编码目的的树(表)。 要为一组霍夫曼符号生成最佳树需要太多时间或者需要太多的硬件。 本发明提出根据符号发生的频率将符号分成组。 使用这些符号组,可以对这些组的后续代码长度分配进行,而无需对所有符号及其父母进行完整排序。 在代码长度分配期间,也可以执行单个符号从一个组到另一个组的一些重定位,以优化霍夫曼表。 在大多数情况下,这种技术可以在最佳霍夫曼表的5%内实现压缩比,同时要求更少的硬件或软件开销。
    • 4. 发明授权
    • High speed CCITT decompressor
    • 高速CCITT解压缩器
    • US5229863A
    • 1993-07-20
    • US632781
    • 1990-12-24
    • Jean-Swey KaoSimon M. LawLi-Fung Cheung
    • Jean-Swey KaoSimon M. LawLi-Fung Cheung
    • G06T9/00H03M7/30H03M7/42H03M7/46H04N1/417
    • H03M7/425H03M7/46H04N1/4175
    • A new and improved decoder for decoding CCITT compressed image data. This decoder separates all the incoming codes into short codes and long codes. The short codes are sent to the short channel decoder and the long codes are sent to the long channel decoder. At each decoding cycle either the long channel decoder or the short channel decoder is active. The short channel decoder has a twin set decoder which decodes two short codes in parallel and guarantees two bits of decompressed data per decoding cycle. If the decoding of a first code generates a decompressed data of only one bit, then the decompressed data of a second code will be combined with the first decompressed data and the combination will be sent out. This process guarantees at least two bits of decompressed data per decoding cycle. The long channel decoder decodes the long intermediate codes which always generate at least four bits of decompressed data.
    • 一种用于解码CCITT压缩图像数据的新型改进解码器。 该解码器将所有输入码分成短码和长码。 短码被发送到短信道解码器,长码被发送到长信道解码器。 在每个解码周期,长信道解码器或短信道解码器都是有效的。 短信道解码器具有双集解码器,其并行解码两个短码,并且每个解码周期保证两比特的解压缩数据。 如果第一代码的解码产生仅一位的解压缩数据,则第二代码的解压缩数据将与第一解压缩数据组合,并且组合将被发送出去。 该过程保证每个解码周期至少两位解压缩的数据。 长通道解码器解码总是生成至少四位解压缩数据的长中间码。
    • 5. 发明授权
    • String-match array for substitutional compression
    • 用于替代压缩的字符串匹配数组
    • US5930790A
    • 1999-07-27
    • US937554
    • 1997-09-25
    • Simon M. LawDaniel H. GreeneLi-Fung Cheung
    • Simon M. LawDaniel H. GreeneLi-Fung Cheung
    • H03M7/40G06T9/00H03M7/30G06F17/30
    • G06T9/005H03M7/3086Y10S707/99936Y10S707/99942
    • A circuit for implementing a substitutional compressor. Comparators compare a current input pixel against a large number of previous pixels, the "history", stored in a series of shift registers. Each register and associated comparator constitutes a cell. If one or more matches are found the history data is shifted one pixel, the non-matching cells are disabled, and the next input pixel is compared against the contents of the same cells that had the previous matches. The matching is terminated when the longest series of matching pixels is found. The output code is then the length of the matching series of pixels, and the displacement of the first input pixel from the first matching pixel. An encoder generates an initialize signal that resets all of the disabled cells on the same clock cycle on which the output code word is generated. To make the circuit more compact, the cells can be arranged into a square format with one output line for each row and column from the cells to the encoder.
    • 用于实现替代压缩机的电路。 比较器将当前输入像素与大量先前像素“历史”进行比较,存储在一系列移位寄存器中。 每个寄存器和相关比较器构成单元。 如果找到一个或多个匹配历史数据被移动一个像素,则不匹配的单元被禁用,并且将下一个输入像素与先前匹配的相同单元格的内容进行比较。 当找到最长的匹配像素系列时,匹配结束。 然后,输出代码是匹配的像素系列的长度,以及第一输入像素与第一匹配像素的位移。 编码器产生一个初始化信号,该信号在产生输出代码字的相同时钟周期上复位所有禁用的单元。 为了使电路更紧凑,可以将单元格排列成方形格式,每个行和列从单元格到编码器都有一条输出线。