Data compression using Shannon-fano algorithm implemented by VHDL

People tend to store a lot of files inside theirs storage. When the storage nears it limit, they then try to reduce those files size to minimum by using data compression software. In this paper we propose a new algorithm for data compression, called j-bit encoding (JBE). This algorithm will manipulates each bit of data inside file to minimize the size without losing any data after decoding which is classified to lossless compression. This basic algorithm is intended to be combining with other data compression algorithms to optimize the compression ratio. The performance of this algorithm is measured by comparing combination of different data compression algorithms.

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

For many computerized applications, data compression is a standard requirement. In order to minimize the capacity needed for that data, it decreases the redundancy in data representation and thus therefore reduces the connectivity cost by efficiently utilizing the available bandwidth. There are a range of algorithms for data compression that are used to compress various formats of data. There are also sets of different compression algorithms for a single data form, which use different approaches. This paper assesses lossless algorithms for compression of data and compares their performance. To assess the performance of compressing text data, images, audio, a set of selected algorithms are used. Experimental findings and comparisons of algorithms for lossless compression using methods for compression. It gives contrasting conclusions on the size and time ratios toward existing research. Different information that can be compressed not only text but it can be Audio, pictures and video information. In this article, there are variety of various forms of lossless compression algorithms discussed.KeywordsData compressionLossless data compressionText compressionImage compressionAudio compression

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.

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.

In a recent era of modern technology, there are many problems for storage, retrieval and transmission of data. Data compression is necessary due to rapid growth of digital media and the subsequent need for reduce storage size and transmit the data in an effective and efficient manner over the networks. It reduces the transmission traffic on internet also. Data compression try to reduce the number of bits required to store digitally. The various data and image compression algorithms are widely use to reduce the original data bits into lesser number of bits. Lossless data and image compression is a special class of data compression. This algorithm involves in reducing numbers of bits by identifying and eliminating statistical data redundancy in input data. It is very simple and effective method. It provides good lossless compression of input data. This is useful on data that contains many consecutive runs of the same values. This paper presents the implementation of Run Length Encoding for data compression.

Electrocardiogram (ECG) is one of the best representatives of physiological signal that provides the state of the autonomic nervous system, primarily responsible for the cardiac activity. The ECG data compression plays a significant role in localized digital storage or efficient communication channel utilization in telemedicine applications. The lossless and lossy compression system’s compressor efficiency depends on the methodologies used for compression and the quality measure used to evaluate distortion. Based on domain ECG, data compression can be performed either one-dimensional (1D) or two-dimensional (2D) for utilization of inter and inter with intra beat correlation, respectively. In this paper, a comparative study between 1D and 2D ECG data compression methods was taken out from the existing literature to provide an update in this regard. ECG data compression techniques and algorithms in 1D and 2D domain have their own merits and limitations. Recently, numerous research and techniques in 1D ECG data compression have been developed, including direct and transformed domain. Additionally, 2D ECG data compression research is reported based on period normalization and complexity sorting in recent times. Finally, several practical issues highlight the assessment of reconstructed signal quality and performance comparisons with an average comparative of exhaustive existing 1D and 2D ECG compression methods based on the utilized digital signal processing systems.

The development of telecommunications technology in the era of globalization happens very rapidly to help people to communication and one of the communication technology is using telephone device. However, the absence of security in securing data/information of delivery Short Message Service (SMS) that is confidential causes the message easily stolen by unauthorized parties. SMS sent via the BTS will be accepted Message Service Center (SMSC) been causing a crack misuse of the information. One way to secure the data from the data communication process is by cryptography. This research using descriptive statistical research methods. This research was conducted by analyzing the security by implementing the RC6 algorithm in cryptography and compression applications based on android SMS. The RC6 algorithm is an symmetric cryptographic algorithm that use the same key in encryption and decryption of SMS message. The encryption process that changes the number bits of data affects the number of SMSs that need to be sent, so text compression is required. The Huffman algorithm is a lossless data compression algorithm in which data compression does not eliminate one byte and is stored as originally. So the result of decompress is same with original ciphertext. Testing is done using Blackbox Method.This research was conducted to solve the security problem of sending SMS with cryptography and send data can be compressed to save SMS cost.Keywords : Cryptography, Encryption, Decryption, SMS, Mobile, RC6, Huffman,android

In this study, the authors present an energy-efficient data compression protocol for data collection in wireless sensor networks (WSNs). WSNs are essentially constrained by motes’ limited battery power and networks bandwidth. The authors focus on data compression algorithms and protocol development to effectively support data compression for data gathering in WSNs. Their design of compressed data-stream protocol (CDP) is generic in the sense that other lossless or lossy compression algorithms can be easily ‘plugged’ into the proposed protocol system without any changes to the rest of the CDP. This design intends to support various different WSN applications where users may prefer more specific compression algorithms, tailored to the sensing data characteristics in question, to their general algorithm. CDP is not only able to significantly reduce energy consumptions of data gathering in multi-hop WSNs, but also able to reduce sensor network traffic and thus avoid congestion accordingly. The proposed CDP is implemented on the tinyOS platform using the nesC programming language. To evaluate their work, the authors conduct simulations via TOSSIM and PowerTOSSIM-z with real-world sensor data. The results demonstrate the significance of CDP.

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.

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.

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.

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.

The secure communication of information is a major concern over the internet. The information must be protected before transmitting over a communication channel to avoid security violations. In this paper, a new hybrid method called compressed encrypted data embedding (CEDE) is proposed. In CEDE, the secret information is first compressed with Lempel Ziv Welch (LZW) compression algorithm. Then, the compressed secret information is encrypted using the Advanced Encryption Standard (AES) symmetric block cipher. In the last step, the encrypted information is embedded into an image of size 512 × 512 pixels by using image steganography. In the steganographic technique, the compressed and encrypted secret data bits are divided into pairs of two bits and pixels of the cover image are also arranged in four pairs. The four pairs of secret data are compared with the respective four pairs of each cover pixel which leads to sixteen possibilities of matching in between secret data pairs and pairs of cover pixels. The least significant bits (LSBs) of current and imminent pixels are modified according to the matching case number. The proposed technique provides double-folded security and the results show that stego image carries a high capacity of secret data with adequate peak signal to noise ratio (PSNR) and lower mean square error (MSE) when compared with existing methods in the literature.

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.