Summary
This paper suggests a new algorithm for data compression that depends on Boolean minimization of binary data. On the compressor side, the input bitstream is chopped into chunks of 16-bit each, and a "sum of products" function is found for each chunk of bits using the Quine-McClusky algorithm. The minimized "sum of products" function is 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 experimental 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 technique can be used for various file formats including images and videos.
See the full content of this document
Extract
Development and Investigation of a Novel Compression Technique Using Boolean Minimization
1. Introduction
Data compression aims to remove redundant data in order to reduce the size of a data file (Mathews, 1995; Ziviani, et al., 2000). For example, an ASCII file is compressed into a new file which contains the same information, but with smaller size. The compression of a file into half of its original size increases the free memory that is available for use (Mandai, 2000). The same idea applies to transmission of messages through the network with limited bandwidth channels.Data compression has a wide range of applications especially in data storage and data transmission (Ziviani, et al., 2000; Brisaboa, et al., 2003). Some of these applications include: 1) Voice compression applications such as "satellite connectivity, international voice trunking, Wireless Local Loop and rural telephony" (Cutter Network, 2006), 2) Video compression, and 3) Image compression (Servetto, 1999). Other applications include virus scanning software, archiving systems, and realtime interactive control of large-scale simulations at remote super computer sit...See the full content of this document
Sponsored links
