The Lossless Adaptive Binomial Data Compression Method

Author:

Borysenko Oleksiy,Matsenko SvitlanaORCID,Salgals Toms,Spolitis SandisORCID,Bobrovs VjaceslavsORCID

Abstract

In this paper, we propose a new method for the binomial adaptive compression of binary sequences of finite length without loss of information. The advantage of the proposed binomial adaptive compression method compared with the binomial compression method previously developed by the authors is an increase in the compression rate. This speed is accompanied in the method by the appearance of a new quality—noise immunity of compression. The novelty of the proposed method, which makes it possible to achieve these positive results, is manifested in the adaptation of the compression ratio of compressible sequences to the required time, which is carried out by dividing the initial set of binary sequences into compressible and incompressible sequences. The method is based on the theorem proved by the authors on the decomposition of a stationary Bernoulli source of information into the combinatorial and probabilistic source. The last of them is the source of the number of units. It acquires an entropy close to zero and practically does not affect the compression ratio at considerable lengths of binary sequences. Therefore, for the proposed compression method, a combinatorial source generating equiprobable sequences is paramount since it does not require a set of statistical data and is implemented by numerical coding methods. As one of these methods, we choose a technique that uses binomial numbers based on the developed binomial number system. The corresponding compression procedure consists of three steps. The first is the transformation of the compressible sequence into an equilibrium combination, the second is its transformation into a binomial number, and the third is the transformation of a binomial number into a binary number. The restoration of the compressed sequence occurs in reverse order. In terms of the degree of compression and universalization, the method is similar to statistical methods of compression. The proposed method is convenient for hardware implementation using noise-immune binomial circuits. It also enables a potential opportunity to build effective systems for protecting information from unauthorized access.

Publisher

MDPI AG

Subject

Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science

Reference24 articles.

1. Lossless Compression of Medical Images for Better Diagnosis;Reddy;Proceedings of the 2016 IEEE 6th International Conference on Advanced Computing (IACC),2016

2. Lossless compression of industrial time series with direct access

3. Lossless Compression Techniques in Edge Computing for Mission-Critical Applications in the IoT;Gia;Proceedings of the 2019 Twelfth International Conference on Mobile Computing and Ubiquitous Network (ICMU),2019

4. A Lossless Data Compression Algorithm for Real-time Database;Huang;Proceedings of the 2006 6th World Congress on Intelligent Control and Automation,2006

5. Lossless Image Compression in Cloud Computing;Nivedha;Proceedings of the 2017 International Conference on Technical Advancements in Computers and Communications (ICTACC),2017

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Binomial Data Compression Method without Loss of Information;2023 Photonics & Electromagnetics Research Symposium (PIERS);2023-07-03

2. Special Issue: Real, Complex and Hypercomplex Number Systems in Data Processing and Representation;Applied Sciences;2023-05-28

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3