首页> 外国专利> 'B C P' computer compression

'B C P' computer compression

机译:“b c p”计算机压缩

摘要

"Compression B" digital computer data compression processcBCP (BCP for basis, combination, product) is a coding / compression process suitable for any computer document, with infinite theoretical compression ratio and lossless.On the basis of (b) natural integer, the original binary code of the document is encoded and compressed intoBit, indicating the number of boxes where there is a bit called "research bit" and labeled "be". The number is marked "NBE".According to the NBE value, compression can be divided into three stagesStage 1 = = Be studies simple block coding of bit.Stage 2 = = The box of be research bit is coded according to combination number.Stage 3 = = The blocks of be research bits are coded according to the product number of these blocks, and the product is decomposed into prime factors.For B ≥ 8, each binary sequenceBits can be encoded / compressed to less thanBit.The larger the base B is, the larger the bit gain is.In particular: 25% based on 10 (in thousand order)50% based on 20 (megabit order)75% based on 30 (about Gigabit)Since the existential frame of be research bit is known, the existential frame of the second bit is deduced through complementarity.Considering the inherent characteristics of coding (compressing binary sequence to lower binary sequence), the repetition of the process can be carried out according to the required number of times, so the theoretical property of compression is infinite.Therefore, when the original file tends to infinity, the theoretical compression ratio tends to infinity.Coding calculation only involves the arithmetic operation of natural integers (there is no approximate compression, so there is no loss).The special coding / compression case must come from the operation of this "compression-b C P" method.
机译:“压缩B”数字计算机数据压缩过程CBCP(BCP为基础,组合,产品)是适用于任何计算机文件的编码/压缩过程,具有无限的理论压缩比和无损。在(b)自然整数的基础上,文档的原始二进制代码被编码并压缩到位,指示有一个名为“研究位”并标记为“be”的框数。该数字标有“nbe”。根据NBE值,压缩可分为三个阶段阶段1 = = 学习简单的块编码位。阶段2 = = 通过组合号码编码一组是研究位。第3阶段= = 通过这些块的产品编号对Be研究位的块进行编码,并且该产品被分解成主要因素。对于B≥8,每个二进制序列比特可以编码/压缩到小于少量。基础B越大,比特增益越大。特别是:25%基于10(千顺序)根据20(兆比特)50%(兆字节)基于30的75%(关于千兆)由于已知是研究位的存在帧,因此通过互补性推导出第二位的存在帧。考虑到编码的固有特性(压缩二进制序列到较低二进制序列),可以根据所需的次数进行该过程的重复,因此压缩的理论属性是无限的。因此,当原始文件倾向于无穷大时,理论压缩比趋于无穷大。编码计算仅涉及自然整数的算术运算(没有近似压缩,因此没有损失)。特殊编码/压缩案件必须来自此“压缩-b c p”方法的操作。

著录项

  • 公开/公告号FR3104349A1

    专利类型

  • 公开/公告日2021-06-11

    原文格式PDF

  • 申请/专利权人 REMY BLANC;

    申请/专利号FR20190013910

  • 发明设计人 REMY BLANC;

    申请日2019-12-07

  • 分类号H03M7/30;

  • 国家 FR

  • 入库时间 2022-08-24 19:09:44

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号