scholarly journals Performance Evaluation of Data Compression Algorithms for IoT-Based Smart Water Network Management Applications

2020 ◽  
Vol 7 (2) ◽  
pp. 554-563
Author(s):  
Kazeem B. Adedeji
Keyword(s):  
Performance Evaluation ◽  
Water Supply ◽  
Network Management ◽  
Data Compression ◽  
Compression Ratio ◽  
Water Network ◽  
Compression Algorithms ◽  
Compression Factor ◽  
Smart Water ◽  
Lzw Algorithm

IoT-based smart water supply network management applications generate a huge volume of data from the installed sensing devices which are required to be processed (sometimes in-network), stored and transmitted to a remote centre for decision making. When the volume of data produced by diverse IoT smart sensing devices intensify, processing and storage of these data begin to be a serious issue. The large data size acquired from these applications increases the computational complexities, occupies the scarce bandwidth of data transmission and increases the storage space. Thus, data size reduction through the use of data compression algorithms is essential in IoT-based smart water network management applications. In this paper, the performance evaluation of four different data compression algorithms used for this purpose is presented. These algorithms, which include RLE, Huffman, LZW and Shanon-Fano encoding were realised using MATLAB software and tested on six water supply system data. The performance of each of these algorithms was evaluated based on their compression ratio, compression factor, percentage space savings, as well as the compression gain. The results obtained showed that the LZW algorithm shows better performance base on the compression ratio, compression factor, space savings and the compression gain. However, its execution time is relatively slow compared to the RLE and the two other algorithms investigated. Most importantly, the LZW algorithm has a significant reduction in the data sizes of the tested files than all other algorithms

scholarly journals FPGA implementation of Lempel-Ziv data compression

2021 ◽  
Vol 10 (2) ◽  
pp. 99
Author(s):  
Gody Mostafa ◽  
Abdelhalim Zekry ◽  
Hatem Zakaria
Keyword(s):  
Data Compression ◽  
Compression Ratio ◽  
Digital Communication ◽  
Compression Rate ◽  
High Compression Ratio ◽  
Compression Algorithms ◽  
High Compression ◽  
Space Saving ◽  
Fpga Chip ◽  
Lossless Data Compression

When transmitting the data in digital communication, it is well desired that the transmitting data bits should be as minimal as possible, so many techniques are used to compress the data. In this paper, a Lempel-Ziv algorithm for data compression was implemented through VHDL coding. One of the most lossless data compression algorithms commonly used is Lempel-Ziv. The work in this paper is devoted to improve the compression rate, space-saving, and utilization of the Lempel-Ziv algorithm using a systolic array approach. The developed design is validated with VHDL simulations using Xilinx ISE 14.5 and synthesized on Virtex-6 FPGA chip. The results show that our design is efficient in providing high compression rates and space-saving percentage as well as improved utilization. The Throughput is increased by 50% and the design area is decreased by more than 23% with a high compression ratio compared to comparable previous designs.

scholarly journals Second compression for pixelated images under edge-based compression algorithms: JPEG-LS as an example

2021 ◽  
pp. 1-9
Author(s):  
Kamal Al-Khayyat ◽  
Imad Al-Shaikhli ◽  
Mohamad Al-Hagery
Keyword(s):  
Data Compression ◽  
Compression Ratio ◽  
Lossless Compression ◽  
General Purpose ◽  
Compression Algorithm ◽  
Random Data ◽  
Data Set ◽  
Compression Algorithms ◽  
Edge Based

This paper details the examination of a particular case of data compression, where the compression algorithm removes the redundancy from data, which occurs when edge-based compression algorithms compress (previously compressed) pixelated images. The newly created redundancy can be removed using another round of compression. This work utilized the JPEG-LS as an example of an edge-based compression algorithm for compressing pixelated images. The output of this process was subjected to another round of compression using a more robust but slower compressor (PAQ8f). The compression ratio of the second compression was, on average,  18%, which is high for random data. The results of the second compression were superior to the lossy JPEG. Under the used data set, lossy JPEG needs to sacrifice  10% on average to realize nearly total lossless compression ratios of the two-successive compressions. To generalize the results, fast general-purpose compression algorithms (7z, bz2, and Gzip) were used too.

IoT-Based Smart Water Network Management: Challenges and Future Trend

2019 ◽  
Author(s):  
Kazeem B. Adedeji ◽  
Nnamdi I. Nwulu ◽  
Aigbavboa Clinton
Keyword(s):  
Network Management ◽  
Future Trend ◽  
Water Network ◽  
Smart Water

Enhancing Computational Time of Lempel-Ziv-Welch-Based Text Compression with Chinese Remainder Theorem.

2020 ◽  
Vol 27 (1) ◽  
Author(s):  
MB Ibrahim ◽  
KA Gbolagade
Keyword(s):  
Data Compression ◽  
Compression Ratio ◽  
Performance Metrics ◽  
Chinese Remainder Theorem ◽  
Computational Time ◽  
Compact Representation ◽  
Text Compression ◽  
Compression Time ◽  
Lzw Algorithm ◽  
Better Than

The science and art of data compression is presenting information in a compact form. This compact representation of information is generated by recognizing the use of structures that exist in the data. The Lempel-Ziv-Welch (LZW) algorithm is known to be one of the best compressors of text which achieve a high degree of compression. This is possible for text files with lots of redundancies. Thus, the greater the redundancies, the greater the compression achieved. In this paper, the LZW algorithm is further enhanced to achieve a higher degree of compression without compromising its performances through the introduction of an algorithm, called Chinese Remainder Theorem (CRT), is presented. Compression Time and Compression Ratio was used for performance metrics. Simulations was carried out using MATLAB for five (5) text files (of varying sizes) in determining the efficiency of the proposed CRT-LZW technique. This new technique has opened a new development of increasing the speed of compressing data than the traditional LZW. The results show that the CRT-LZW performs better than LZW in terms of computational time by 0.12s to 15.15s, while the compression ratio remains same with 2.56% respectively. The proposed compression time also performed better than some investigative papers implementing LZW-RNS by 0.12s to 2.86s and another by 0.12s to 0.14s. Keywords: Data Compression, Lempel-Ziv-Welch (LZW) algorithm, Enhancement, Chinese Remainder Theorem (CRT), Text files.

scholarly journals Comparison of Entropy and Dictionary Based Text Compression in English, German, French, Italian, Czech, Hungarian, Finnish, and Croatian

Mathematics ◽  
2020 ◽  
Vol 8 (7) ◽  
pp. 1059
Author(s):  
Matea Ignatoski ◽  
Jonatan Lerga ◽  
Ljubiša Stanković ◽  
Miloš Daković
Keyword(s):  
Data Compression ◽  
Compression Ratio ◽  
Data Transmission ◽  
Storage Capacity ◽  
Text Compression ◽  
Video Content ◽  
Text File ◽  
Digital World ◽  
Arithmetic Algorithm ◽  
Lzw Algorithm

The rapid growth in the amount of data in the digital world leads to the need for data compression, and so forth, reducing the number of bits needed to represent a text file, an image, audio, or video content. Compressing data saves storage capacity and speeds up data transmission. In this paper, we focus on the text compression and provide a comparison of algorithms (in particular, entropy-based arithmetic and dictionary-based Lempel–Ziv–Welch (LZW) methods) for text compression in different languages (Croatian, Finnish, Hungarian, Czech, Italian, French, German, and English). The main goal is to answer a question: ”How does the language of a text affect the compression ratio?” The results indicated that the compression ratio is affected by the size of the language alphabet, and size or type of the text. For example, The European Green Deal was compressed by 75.79%, 76.17%, 77.33%, 76.84%, 73.25%, 74.63%, 75.14%, and 74.51% using the LZW algorithm, and by 72.54%, 71.47%, 72.87%, 73.43%, 69.62%, 69.94%, 72.42% and 72% using the arithmetic algorithm for the English, German, French, Italian, Czech, Hungarian, Finnish, and Croatian versions, respectively.

scholarly journals Intensification of Lempel-ZIV-Welch Algorithm

2019 ◽  
Vol 8 (9S) ◽  
pp. 587-591
Keyword(s):  
Data Compression ◽  
Compression Ratio ◽  
Text Compression ◽  
Code Length ◽  
File Size ◽  
Compression Scheme ◽  
Compression Algorithms ◽  
Original Algorithm ◽  
Using Data

There is a necessity to reduce the consumption of exclusive resources. This is achieved using data compression. The data compression is one well known technique which can reduce the file size. A plethora of data compression algorithms are available which provides compression in various ratios. LZW is one of the powerful widely used algorithms. This paper attempts to propose and apply some enhancements to LZW, hence comes out with an efficient lossless text compression scheme that can compress a given file at better compression ratio. The paper proposes three approaches which practically enhances the original algorithm. These approaches try to gain better compression ratio. In approach1, it exploits the notion of using existing string code with odd code for a newly encounter string which is reverse of existing. In approach2 it uses a choice of code length for the current compression, so avoiding the problem of dictionary overflow. In approach3 it appends some selective set of frequently encountered string patterns. So the intensified LZW method provides better compression ratio with the inclusion of the above features.

Achieving Low Unaccounted-For-Water through Reliable Supply to Customers and Efficient Network Management

2008 ◽  
Vol 3 (4) ◽  
Author(s):  
T.K. Tay ◽  
R. Singh ◽  
C.L. Lim ◽  
W.L. Yeo ◽  
H.C. Chong
Keyword(s):  
Water Supply ◽  
Network Management ◽  
Management System ◽  
Strong Support ◽  
Level Of Service ◽  
Water Network ◽  
Network Management System ◽  
The World ◽  
High Level ◽  
Unaccounted For Water

Since the early 1980s, PUB has been conscious of the need to manage the water supply network efficiently and to account for the amount of water distributed through the network. This concern is primarily motivated by PUB's goal to provide a high level of service to customers with reliable supply of water at affordable cost. With the strong support of the top management and the active participation of everyone in PUB, an Integrated Water Network Management System has been adopted to ensure that leakage in new networks is kept to a minimum through proper planning, design and the use of good quality materials that are installed with good workmanship. Losses in existing network are reduced through network management and leakage controls as well as accounting for water distributed with full and accurate metering. Consequently, these deliberate efforts have enabled Singapore to achieve one of the lowest Unaccounted-For-Water in the world (below 5%).

Sign in / Sign up

Export Citation Format

Share Document