首页> 外国专利> IMPROVED HUFFMAN CODING METHOD AND APPARATUS THEREOF BY CREATING CONTEXT-BASED INNER-BLOCK AND GROUP BASED ON VARIANCE IN GROUP'S SYMBOL FREQUENCY DATA

IMPROVED HUFFMAN CODING METHOD AND APPARATUS THEREOF BY CREATING CONTEXT-BASED INNER-BLOCK AND GROUP BASED ON VARIANCE IN GROUP'S SYMBOL FREQUENCY DATA

机译:通过在组符号频率数据中创建基于上下文的内部块和基于组的改进的哈夫曼编码方法及其装置

摘要

The present invention relates to a kind of raising compression ratios by the concept of introducing loop blocks, classification data input data group is whose compression ratio, it can be by using huffman coding technology, the case where in the case where using different Huffman code tables blockings to data, when traditional huffman coding technology not will lead to better compression ratio or be not effective. The present invention is a kind of very cleverly processing of the cyclic annular block of method identification in compression and decompression. Compression can effectively pass through no matter when all symbols of cyclic annular block of classifying, it can conceptually seem, encounter for the first time more than once, the symbol circulation gear in analytical characteristics appearance frequency is to whether determining whether to execute Huffman, only part carries out huffman coding, this needs huffman coding. Meanwhile the range of cyclic annular block as above can slightly be expanded, when maximum cyclic annular block configuration technology. Referring to the data of compression, the field that all data are carried out with huffman coding is not needed, and there are fields, can efficiently perform in huffman coding according to data characteristics, such as seem intensively in additional character at specific data interval. According to the present invention, the symbol of the distinctive concept of data fields classified utilization, referred to as cyclic annular block and distribution characteristics is analyzed to determine whether it suitably carries out huffman coding to data fields in cyclic annular block. Be when to be determined as appropriate, execute coding, meanwhile, be when, otherwise do not execute coding. Therefore, data can be compressed in a manner of more effective and is efficient. ;The 2016 of copyright KIPO submissions
机译:本发明涉及一种通过引入循环块的概念来提高压缩率的方法,分类数据输入数据组的压缩率可以通过使用霍夫曼编码技术,在使用不同霍夫曼代码表的情况下实现。当传统的霍夫曼编码技术无法获得更好的压缩率或无效时,将无法对数据进行阻塞。本发明是对压缩和解压缩中方法识别的循环环形块的一种非常巧妙的处理。压缩无论何时对环状块的所有符号进行分类时都可以有效地通过,它在概念上似乎会多次遇到,符号循环齿轮在解析特性出现频率上是否决定是否执行霍夫曼,仅部分执行霍夫曼编码,这需要霍夫曼编码。同时,当采用最大循环环形块配置技术时,上述循环环形块的范围可以稍微扩大。参照压缩数据,不需要用霍夫曼编码来执行所有数据的领域,并且存在可以根据数据特性在霍夫曼编码中有效地执行的领域,诸如在特定数据间隔上密集地集中在附加字符上。根据本发明,对利用分类的数据字段的独特概念的符号(称为循环环形块和分布特性)进行分析,以确定是否适当地对循环环形块中的数据字段进行霍夫曼编码。在适当的时候确定执行编码,与此同时,在适当的时候执行,否则不执行编码。因此,可以以更有效的方式压缩数据。 ; 2016年版权KIPO提交文件

著录项

  • 公开/公告号KR20160106229A

    专利类型

  • 公开/公告日2016-09-12

    原文格式PDF

  • 申请/专利权人 KIM JEONG HUN;

    申请/专利号KR20150028760

  • 发明设计人 KIM JEONG HUN;

    申请日2015-03-02

  • 分类号H03M7/40;

  • 国家 KR

  • 入库时间 2022-08-21 14:13:36

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号