A Study on Data Compression Algorithms for Its Efficiency Analysis

INTRODUCTION: Genetic data plays a key role in the healthcare area in specific, but they are typically very large in size. Many research shows that absence of DNA information at the right time is one of the major causes of error in the healthcare area. The more genomics information that analysts secure, the better the prospects for individual and general wellbeing. Persevering and retrieving genetic information in the right form within the given time is a big challenge in the field of Healthcare. Effectively, pre-birth DNA tests screen for formative variations from the norm. Before long, patients will have their blood sequenced to detect any nonhuman DNA that may flag an irresistible illness. Later on, somebody managing malignancy will most likely track the movement of the sickness by having the DNA and RNA of single cells from various tissues sequenced every day. DNA sequencing of whole population will give a complete and better prediction of population wellbeing.OBJECTIVES: Hereditary data is growing exponentially; hence it is hard to deal with the consistently developing hereditary database. The human genome in its base configuration occupies almost thirty terabyte of storage space. Computational assets are constrained. Not just storage, transmission abilities and run time memory is likewise constrained. Data Compression is a test when the hereditary information is exponentially expanding. It is critical to save the integrity of hereditary information while packing it. Hence the main objective of this paper is to develop a lossless DNA compression algorithm that not only gives better compression but also help in retrieval of Information for efficient use in the area of Healthcare.METHODS: In this paper a lossless hereditary data compression method is being proposed. The proposed calculation works in a horizontal mode and utilization a reference based substitution technique for compression. The principle thought of this paper is in the kind of similarity scanned. All the predominant hereditary Compression methods search for similarity within the chromosome. These calculations either pursue flat mode or vertical mode for accomplishing compression. But whichever method the existing genetic compression algorithms use, they are all based on searching similarities within the chromosome i.e. they exploit only inter chromosomal similarities. The current studies focus will show that compression ratio achieved by analyzing individual chromosome is always less than the method in which we analyze and compress intra chromosomal similarities.RESULTS: This study shows that by simply using exactly matching repeats amongst all the chromosomes of the same genome, not only the compression ratio is improving but also a detailed study of all the similarities and differences between two genomes of the same species can be conducted.CONCLUSION: In this study, a new compression algorithm is being proposed for compressing DNA. Along with Inter chromosomal similarities, Intra chromosomal similarities are considered for this method. The results clearly shows that intra chromosomal matches are bigger and more than inter chromosomal matches which helps us to achieve better compression ratio.

This paper conducts a comparative analysis of the impact of unsparsing by data scaling on lossless data compression methods. The most commonly used data compression algorithms such as gzip, zlib, bzip2, and lzma are tested by their compression efficiency in unsparsed datasets by the performance metrics such as compression time, decompression time, and compression ratio for both the original and scaled datasets. Five different data scaling techniques are investigated to transform the original data into unsparsed data such as min-max, robust, absolute max, standardization, and normalization. Our research reveals relationships between data scaling methodologies and compression performance, with disparities in compression efficiency and computational complexity. Fur-thermore, we investigate the effects of scaling on compression ratio and provide results for improving the understanding of the factors that influence lossless data compression methods for non-sparse tabular data.

Telemetric information is great in size, requiring extra room and transmission time. There is a significant obstruction of storing or sending telemetric information. Lossless data compression (LDC) algorithms have evolved to process telemetric data effectively and efficiently with a high compression ratio and a short processing time. Telemetric information can be packed to control the extra room and association data transmission. In spite of the fact that different examinations on the pressure of telemetric information have been conducted, the idea of telemetric information makes pressure incredibly troublesome. The purpose of this study is to offer a subsampled and balanced recurrent neural lossless data compression (SB-RNLDC) approach for increasing the compression rate while decreasing the compression time. This is accomplished through the development of two models: one for subsampled averaged telemetry data preprocessing and another for BRN-LDC. Subsampling and averaging are conducted at the preprocessing stage using an adjustable sampling factor. A balanced compression interval (BCI) is used to encode the data depending on the probability measurement during the LDC stage. The aim of this research work is to compare differential compression techniques directly. The final output demonstrates that the balancing-based LDC can reduce compression time and finally improve dependability. The final experimental results show that the model proposed can enhance the computing capabilities in data compression compared to the existing methodologies.

A prototype chip, called RD53A, has been designed by the RD53 collaboration to face the very high hit and trigger rate requirements (up to 3 GHz/cm2 and 1 MHz, respectively) of the High Luminosity LHC experiment upgrades. In this paper, an improved algorithm for data compression, capable of sustaining the very high data volume and proposed to be implemented in the periphery of the chip, is presented: it exploits Run Length Encoding (RLE) and Variable Length Coding (VLC) to compact chip pixel hit patterns. The compression and decompression algorithms are implemented with MATLAB, and the performance is calculated taking into account the RD53A data readout implementation and its chip simulation and verification framework (called VEPIX53). In all considered cases, the results show that the RLE and VLC combination achieves a data compression ratio between 1.57 and 1.62, resulting in a bitstream size reduction between 36.2% and 38.4% with respect to the rate of the current data transmission format.

With the resolution enhancement techniques such as OPC (Optical Proximity Correction) and SRAF (Sub-Resolution Assist Features), the size of layout data have grown significantly. It is quite common now to find layout files that are tens of GBs in size. Unlike GDSII which can store data hierarchically, mask data formats such as MEBES are essentially flat and more voluminous. Moreover, polygonal data present in layout data files is fractured, thereby increasing the data volume before getting stored in MEBES data format. This results in huge MEBES files. As per the ITRS roadmap of 2005, for a 45nm half-pitch node that is expected to be in use by 2010, the mask data volume for a single layer is expected to reach up to 825 GB. Storing and transferring such large mask data are issues for which the mask industry needs solutions. Historically, MEBES is the most prevalent EB format in the industry. Moreover, in many Mask Data Preparation (MDP) flows, the MEBES format is being used as the de-facto standard for specifying the fractured EB data even though the final target EB machine might be different. In this paper we present techniques for lossless reversible compression of MEBES data, i.e., when the compressed file is decompressed, the generated uncompressed file matches the original MEBES file bit- by-bit. By applying these compression techniques a compression ratio of 5X to 15X can be obtained. In practice, compressing MEBES files is usually a one-time task, but decompression of compressed files is expected to be done multiple times as every time a compressed MEBES file needs processing, it has to be decompressed. MEBES is essentially an efficient data format and the geometries are stored compactly. As a result the compression/decompression techniques described in this paper are quite computation intensive in order to achieve higher compression ratio. This in turn leads to higher CPU time for compression/decompression compared to generic compressors such as gzip. However, as the format-specific compressors produce higher compression ratios, the disk I/O time for compression and decompression is expected to be less compared to the generic compressors such as gzip and gunzip. In spite of this, the format-specific decompressor is usually 3-5X times slower than the generic decompressor such as gunzip. Since decompression is expected to be done more frequently as compared to compression, speeding up decompression is highly desirable. We present a compression technique for MEBES data which enables multiple process threads to decompress the compressed MEBES data. With the multi-core multiprocessor machines becoming quite inexpensive and common, the multi-threaded decompression is expected to perform close to the disk I/O time on such machines. The paper details out the techniques, experimental results in terms of comparative compression ratios, compression and decompression speed using single threads and multiple threads. The possibility of getting higher compression ratios as well as higher or comparable decompression speed makes it more practical to use format specific reversible compression schemes rather than using generic compressors. Even though, the paper focuses on compression and decompression of MEBES, it can be easily extended to the compression of GDSII [1].

Data compression techniques in IoT-enabled wireless body sensor networks: A systematic literature review and research trends for QoS improvement

The subject of study. A new algorithm for real-time data compression in a video surveillance system from an unmanned aerial vehicle is proposed. The algorithm makes it possible to obtain different degrees of video data compression using different codecs for specific video recording conditions (UAV altitude and flight speed, nature of the observed terrain, etc.), and also provides the ability to transmit video data to the flight control point via radio channel. A detailed analysis of the quality of the proposed algorithm for shooting in various video formats that meet international standards (HD and Full HD) was carried out, both in terms of visual perception and objective criteria. The purpose of the study was to conduct a comprehensive research on the problem of improving the quality of the video surveillance system from the UAV and to create a video compression algorithm that allows broadcasting video data to the control center in real time with high quality. Objectives. To develop and programmatically implement a video compression algorithm based on modern codecs for video surveillance sys­tems on board a UAV. To use modern video cameras and a microcomputer platform as hardware. To analyze the quality indicators of the algorithm in different conditions. Methods used. Evaluation of visual perception of video compression results, statistical analysis and processing of the parameters of the analyzed video sequence as a random spatio-temporal process. Results. A new video data compression algorithm for the UAV video surveillance system based on the Raspberry Pi 5 microcomputer using modern video compression codecs H.264 and H.265 was synthesized. The algorithm provides the required compression ratio and data transmission rate over the radio channel between the UAV and the flight control center. Detailed estimates of the quality of the algorithm are obtained. Conclusions. Scientific novelty of the results: A new universal video data compression algorithm for video surveillance systems on board UAVs with the ability to transmit video over a radio channel in real time has been proposed and implemented. The quality of the proposed algorithm is verified on real video surveillance results. The proposed algorithm is implemented in the Python software environment.

Data compression is an essential process due to the need to reduce the average time required to send messages and reduce the data size for storage purposes. There is a vital need for lossless compression especially for text and binary compression because it is important to ensure that the restructured text is identical to the original text. The predictive by partial matching (PPM) data compression scheme has set the performance standard in lossless compression throughout the past decade. PPM is chosen as it is capable of very good compression on a variety of data. In this paper, we present the realization of data compression using PPM on Altera FLEX10K FPGA device that allows for efficient hardware implementation. The PPM algorithm for binary data compression was successfully written and modeled in VHDL. The design is followed by the timing analysis and circuit synthesis for the validation, functionality and performance of the designated circuit which supports the practicality, advantages and effectiveness of the proposed hardware realization for the application. The designed was verified using both 16- bit input and 32-bit input. The hardware prototype utilized 1164 logic cells with a maximum system frequency of 95.3MHz.

In data compression or source coding algorithms, input sequences of symbols are converted to shorter sequences while the original information remains unchanged. One of the well-known data compression algorithms is Deflate which is designed based on the LZ method. Deflate method has three different modes where its second mode is applicable for real-time applications. In this mode, a certain static table of Huffman codes is employed during the coding procedure. In this paper, a new version of deflate algorithm is proposed and implemented in hardware. In the proposed method, a new basic coding table is employed. This table is modified adaptively based on the input sequence. Simulation results show that in this adaptive algorithm, the coding performance is improved. In the hardware implementation of the new method, through some parallelism concepts, we try to improve the hardware utilization and throughput.

The traffic of mobile network environment is increasing day by day. When a large amount of data need to be transmitted, the low-speed wireless network today is hard to meet users' needs. Long response time of operation and high requirements of terminal's performance will keep user annoy and away. Existing independent data compression and transmission algorithm can't solve this problem effectively. In this paper, data compression and transmission considered as a whole, a new kind of data compression and transmission method was designed in this paper to solve the problem and achieved good results finally.

An antidictionary is particularly useful for data compression, and on-line electrocardiogram (ECG) lossless compression algorithms using antidictionaries have been proposed. They work in real-time with constant memory and give better compression ratios than traditional lossless data compression algorithms, while they only deal with ECG data on a binary alphabet. This paper proposes on-line ECG lossless compression for a given data on a finite alphabet. The proposed algorithm gives not only better compression ratios than those algorithms but also uses less computational space than they do. Moreover, the proposed algorithm work in real-time. Its effectiveness is demonstrated by simulation results.

Space research organizations, hospitals and military air surveillance activities, among others, produce a huge amount of data in the form of images hence a large storage space is required to record this information. In hospitals, data produced during medical examination is in the form of a sequence of images and are very much correlated; because these images have great importance, some kind of lossless image compression technique is needed. Moreover, these images are often required to be transmitted over the network. Since the availability of storage and bandwidth is limited, a compression technique is required to reduce the number of bits to store these images and take less time to transmit them over the network. For this purpose, there are many state-of the-art lossless image compression algorithms like CALIC, LOCO-I, JPEG-LS, JPEG20000; Nevertheless, these compression algorithms take only a single file to compress and cannot exploit the correlation among the sequence frames of MRI or CE images. To exploit the correlation, a new algorithm is proposed in this paper. The primary goals of the proposed compression method are to minimize the memory resource during storage of compressed data as well as minimize the bandwidth requirement during transmission of compressed data. For achieving these goals, the proposed compression method combines the single image compression technique called super spatial structure prediction with inter-frame coding to acquire grater compression ratio. An efficient compression method requires elimination of redundancy of data during compression; therefore, for elimination of redundancy of data, initially, the super spatial structure prediction algorithm is applied with the fast block matching approach and later Huffman coding is applied for reducing the number of bits required for transmitting and storing single pixel value. Also, to speed up the block-matching process during motion estimation, the proposed method compares those blocks that have identical sum and leave the others; therefore, the time taken by the block-matching process is reduced by minimizing the unnecessary overhead during the blockmatching process. Thus, in the proposed fast lossless compression method for medical image sequences, the twostage redundant data elimination process ultimately reduces the memory resource required for storing and transmission. The method is tested on the sequences of MRI and CE images and produces an improved compression rate.

With the development of modern computer technology, the growth of purchase funds for storage equipment is far behind the growth of data. How to effectively use the limited storage resources to store data becomes the focus of our research and the data compression technology is the key to solve this problem. The traditional compression technology on the CPU platform could not meet the requirements for processing massive data in the compression rate and the energy cost. The GPU provides a new solution for its strong parallel computation ability. In this paper we present an implementation of Parallel Matching Lempel-Ziv-Storer-Szymanski (PMLZSS), a high speed lossless data compression algorithm by using CUDA framework. The basic idea of our implementation of the PMLZSS algorithm on GPUs is the introduction of a paralleled matrix matching. The data needed to be compressed are divided into multiple dictionary strings and pre-read strings as the vertical axis and horizontal axis of the matrices, respectively. All of the matrices are paralleled matched in the different blocks. Compared with the traditional serial CPU platform LZSS compression algorithm and BZIP2 compression algorithm, the experimental data shows that on the premise of the basic compression rate unchanged, relative to the serial LZSS, the compression speed of PMLZSS is improved about 16x, while to the BZIP2, about 12x.

As the data volume continues to grow exponentially, there is an increasing demand for large storage system capacity. Data compression techniques effectively reduce the volume of written data, enhancing space efficiency. As a result, many modern SSDs have already incorporated data compression capabilities. However, data compression introduces additional processing overhead in critical I/O paths, potentially affecting system performance. Currently, most compression solutions in flash-based storage systems employ fixed compression algorithms for all incoming data without leveraging differences among various data access patterns. This leads to sub-optimal compression efficiency. This article proposes a data-type-aware Flash Translation Layer (DAFTL) scheme to maximize space efficiency without compromising system performance. First, we propose an I/O behavior prediction method to forecast future access on specific data. Then, DAFTL matches data types with distinct I/O behaviors to compression algorithms of varying intensities, achieving an optimal balance between performance and space efficiency. Specifically, it employs higher-intensity compression algorithms for less frequently accessed data to maximize space efficiency. For frequently accessed data, it utilizes lower-intensity but faster compression algorithms to maintain system performance. Finally, an improved compact compression method is proposed to effectively eliminate page fragmentation and further enhance space efficiency. Extensive evaluations using a variety of real-world workloads, as well as the workloads with real data we collected on our platforms, demonstrate that DAFTL achieves more data reductions than other approaches. When compared to the state-of-the-art compression schemes, DAFTL reduces the total number of pages written to the SSD by an average of 8%, 21.3%, and 25.6% for data with high, medium, and low compressibility, respectively. In the case of workloads with real data, DAFTL achieves an average reduction of 10.4% in the total number of pages written to SSD. Furthermore, DAFTL exhibits comparable or even improved read and write performance compared to other solutions.

Energy saving is an important issue in wireless sensor networks (WSNs) since the nodes are typically powered by batteries with a limited capacity and the energy is limited. As data communication usually consumes much energy and bandwidth, decreasing energy consumption can be generally achieved by reducing the communication of data, for instance, through data compression. Thus, it is an important research issue that how to decrease energy consumption as well as maximize the lifetime of WSNs and increase the efficiency of data communication through data compression on the WSNs nodes where energy supply, memory space and processing resources are constrained. Considering the basic idea of edge operator in the field of image processing and the characteristic that the data stream collected by the nodes of WSNs is time series data, this paper proposes a nonthreshold-based node level algorithm of data compression over the WSNs. The algorithm, with simple calculating and low complexity, compresses the time series data collected by sensor nodes into many piecewise linear representations by extracting some points named edge-points that can indicate the trends of time series data, and especially dose not require any prior knowledge of the monitored objects as well as any predefined threshold value related to the time series data. The experiments on real public sensor data series show that the proposed algorithm can compress data effectively and reduce the communication of data obviously. Moreover, compared with some other data compression algorithms, the proposed algorithm appears better compression performance, reconstructed error and stability which allows the algorithm being applied to the collected data series with different fluctuation characteristics. Consequently, it can save the energy of wireless communication of senor nodes and prolong the lifetime of WSNs better.