New technique for data compression

Authors:
Eyas El-Qawasmeh;Ahmed Kattan
Affiliations:
Computer Science Dept., Jordan University of Science and Technology;Computer Science Dept., Jordan University of Science and Technology
Venue:
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
Year:
2005

Citing 6
Cited 0

An efficient decoding technique for Huffman codes

Information Processing Letters
Introduction to Digital Systems

Introduction to Digital Systems
Compression: A Key for Next-Generation Text Retrieval Systems

Computer
Towards Compressing Web Graphs

DCC '01 Proceedings of the Data Compression Conference
An efficient compression code for text databases

ECIR'03 Proceedings of the 25th European conference on IR research
Streaming video over the Internet: approaches and directions

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper suggests a new algorithm for data compression that reverses the usage of K-map. On the compressor side, the stream of the data is transferred into 1s and 0s. Then it is divided into blocks where each block consists of 16 bits. Each block is used as an input to 4- variables K-map. Quine-McClusky approach is applied to this input in order to find the minimized expression. The minimized expressions of the input data stream are stored in a file. Later, the Huffman coding is applied to this file. The obtained Huffman code is used to convert the original file into a compressed one. On the decompression side, the Huffman tree is used to retrieve the original file. The experimentation results of the proposed algorithm showed that the saving ratio on average is around 50%. In addition, the worst case was investigated and a remedy to it was suggested. The proposed algorithm can be used for various file formats including images and videos.