Analysis for Lossless Data Compression Algorithms for Low Bandwidth Networks

Analysis for loss less data compression delivers the relevant data about variations of them as well as to describe the possible causes for each algorithm and best performing data types. It describes the basic lossless techniques of data compression Huffman encodes, Arithmetic Encoding, and Lempel Zi...

Full description

Saved in:
Bibliographic Details
Published in:Journal of physics. Conference series Vol. 1964; no. 4; pp. 42046 - 42050
Main Authors: Semunigus, Wogderes, Pattanaik, Balachandra
Format: Journal Article
Language:English
Published: Bristol IOP Publishing 01.07.2021
Subjects:
Algorithms
Arithmetic
Audio data
Compression Factor
Compression Ratio
Data compression
Lossless equipment
Saving Percentage
Time of Compression and Lempel Ziv algorithms
Video compression
ISSN:1742-6588, 1742-6596
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Analysis for loss less data compression delivers the relevant data about variations of them as well as to describe the possible causes for each algorithm and best performing data types. It describes the basic lossless techniques of data compression Huffman encodes, Arithmetic Encoding, and Lempel Ziv Encodings then briefly with their effectiveness under varying data types of Latin text, audio and video. These properties give the solution of which lossless compression algorithm more suitable compared to other from the Saving Percentage, compression ratio, time of compression and time of decompression with Low Bandwidth Network. Moreover here Lossless Data Compression Algorithms (LDCA) being implemented and tested Huffman compression, Arithmetic compression, and Lempel Ziv algorithms, the implemented result shows that LZW algorithm saves more size than that of the others two with text file, Huffman compression algorithm saves more file sizes and the time takes to compressed decompress is higher than that of other two for audio file type and finally Huffman performs greater on very huge data compressions that is due to much compressing capability.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1964/4/042046