Development and investigation of a novel compression technique using Boolean minimization
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.
compression minimization quine-mcclusky huffman coding decompression