Development and investigation of a novel compression technique using Boolean minimization

Title:

Development and investigation of a novel compression technique using Boolean minimization

Creator:

El-Qawasmeh , Eyas and Kattan, Ahmed

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:5b8065ce-981a-4bb1-851d-e84e2d8d7d79
uuid:5b8065ce-981a-4bb1-851d-e84e2d8d7d79

Subject:

Compression, decompression, Huffman coding, minimization, and Quine McClusky

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

This paper suggests a new algorithm for data compression that depends on Boolean minimization of binary data. On the compressor side, the input bit-stream 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.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Source:

Neural network world: international journal on neural and mass-parallel computing and information systems | 2006 Volume:16 | Number:4

Harvested from:

CDK

Metadata only:

false