Development and investigation of a new compression technique using Boolean minimizations

This paper suggests a new algorithm for compression based on Boolean minimization of binary data. On the compressor side, the input bitstream is divided into blocks of N-bits each, and a "sum of products" function is found for each block using Quine-McCluskey algorithm. The minimized "sum of products" function is stored in a file, after that 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. Since we are combining Quine-McCluskey with Huffman coding we called the proposed algorithm as QMHuff(N). The experimental investigation showed that a good compression have been achieved for files with low number of binary "Is" or "Os" only. While more work need to be done to improve the performance of this technique over the whole space.