Development of data compressing coding methods on basis of binary binomial numbers
DOI:
https://doi.org/10.15587/2312-8372.2019.169897Keywords:
binary binomial numbers, binomial number systems, binary information compressionAbstract
The object of research is the methods of compressive coding, which are used for economical presentation of data in information systems. Compression methods can be used at various stages of data processing, in the transmission of messages and their storage. One of the most problematic places for the application of compression methods are high requirements for computing resources, significant hardware and software costs for their implementation and low coding/decoding speed. In this case, of particular interest are methods, on the results of compression of which computational operations are possible without reversing them.
Within the framework of the approach, when at the basis of any code it is possible to detect a structural number system, mathematical models of compression based on binary binomial numbers are developed. In the structure of sequences, the corresponding binomial numbers are determined on the basis of systems of code-forming constraints. As a result, each combination is assigned a binomial number, which is its compressed image.
In the course of the study, theorems on a one-to-one correspondence between the initial sequences and binary binomial numbers are formulated, which demonstrate how to implement mappings based on simple analytical relations. The examples given confirm the simplicity of the transformations under compression coding and decoding.
The models of the processes of compression and recovery are obtained, which are characterized by a small number of simple operations. As a result, the considered methods are characterized by high speed with good compression ratios. At the same time, the amount of hardware and software costs in practical implementation is small. An additional positive effect is that compressed images have the properties of numbers.
The research results demonstrate the effectiveness of the use of compression based on binary binomial numbers in information systems in order to increase their productivity and reduce the cost of data processing. At the same time, compared with similar known methods, there are minimal costs for their implementation when achieving a high conversion rate and a good degree of compression of binary data of any kind.
References
- Sayood, Kh. (2017). Introduction to Data Compression. Morgan Kaufmann, 790.
- Vatolin, D., Ratushnjak, A., Smirnov, M., Jukin, V. (2003). Metody szhatia dannyh. Ustrojstvo arhivatorov, szhatie izobrazhenii i video. Moscow: DIALOG-MIFI, 384.
- Smirnov, M. А. (2004). Obzor primeneniya metodov bezusherbnogo szhatiya dannyh v SUBD. Saint Petersburg, 58. Available at: http://compression.ru/download/articles/db/smirnov_2003_database_compression_review.pdf
- Sayood, K., Memon, N. (2012). Lossless Compression Handbook. Academic Press, 488. doi: http://doi.org/10.1201/9781420041163-101
- Borysenko, О. А. (2007). Chislo i sistemi chislennya v elektronnih cifrovih sistemah. Bulletin of Sumy State University, 4, 71–76.
- Borysenko, O. A., Kulyk, I. A. (2010). Binomial'noe kodirovanie. Sumy: Sumy State University, 206.
- Borysenko, A. A. (2004). Binomialnyi schet. Teoriya i praktika. Sumy: ITD Universitetskaya kniga, 170.
- Kulyk, I. A., Cherednichenko, V. B., Kostel, S. V. (2008). Algoritm generirovaniya dvoichnyh binomialnyh chisel na osnove minimalnyh sistem kodoobrazuyushih ogranichenii. Bulletin of Sumy State University, Series Technical Sciences, 2, 45–52.
- Schalkwijk, J. (1972). An algorithm for source coding. IEEE Transactions on Information Theory, 18 (3), 395–399. doi: http://doi.org/10.1109/tit.1972.1054832
- Cover, T. (1973). Enumerative source encoding. IEEE Transactions on Information Theory, 19 (1), 73–77. doi: http://doi.org/10.1109/tit.1973.1054929
- Amelkin, V. A. (1986). Metody numeracionnogo kodirovaniya. Novosibirsk: Nauka, 155.
- Amelkin, V. A. (2008). Perechislitelnye zadachi serijnyh posledovatelnostei. Novosibirsk: IVMiMG SO RAN, 317.
- Kulyk, I. A., Borysenko, O. A., Onoriukpe, Adzhiri (2016). Modeli szhatija i vosstanovlenija dannyh na osnove dvoichnyh binomial'nyh chisel. Methods of information coding, defence and compression. Vinnytsya: Vinnitsa National Technical University, 101–105.
- Kulyk, I. A., Skordina, E. M., Kostel, S. V. (2011). Generirovanie kodov-sochetanij dlya resheniya informacionnyh zadach IUS. Automated management systems and automation devices, 155, 15–23.
- Greenfield, T., Reingold, E. M., Nievergeld, J., Deo, N. (1978). Combinatorial Algorithms: Theory and Practice. The Statistician, 27 (2), 138. doi: http://doi.org/10.2307/2987917
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2019 Igor Kulyk, Olga Berezhna, Marina Shevchenko
This work is licensed under a Creative Commons Attribution 4.0 International License.
The consolidation and conditions for the transfer of copyright (identification of authorship) is carried out in the License Agreement. In particular, the authors reserve the right to the authorship of their manuscript and transfer the first publication of this work to the journal under the terms of the Creative Commons CC BY license. At the same time, they have the right to conclude on their own additional agreements concerning the non-exclusive distribution of the work in the form in which it was published by this journal, but provided that the link to the first publication of the article in this journal is preserved.
