This paper proposes implements and evaluates an image compression method called YALMIC (Yet Another Logic Minimization Based Image Compression) which depends on logic function minimization. This method considers adjacent pixels of the image as disjointed minterms constructing a logic function and compresses the 24-bit color images through minimizing the function. We compare the compression ratio of the proposed method to those of existing methods and show that YALMIC improves the compression ratio by about 25% on average.

CRC (Cyclic Redundancy Check) is an error detection method commonly used in data communication

This paper proposes and evaluates a novel image compression approach and also a software tool named YALMIC that implements the approach. The main idea behind the proposed approach is considering segments of consecutive bytes in the image file as 8-variable minterms and using them to construct implicants. The implicatns are simplified through discarding some variables. Storing the simplified forms of the implicants instead of the original bytes causes some bits to be discarded. YAALMIC stores some extra bits in the compressed file in addition to the simplified implicant. These extra bits are necessary to determine the discarded variables and also to show the order of the disjointed minterms. The compression ratio of the tool is evaluated and compared to that of previous image compression tools and techniques through analytical modeling and experimental results.

No abstract

This paper introduces a software tool named SPIDERS which uses a novel iterative algorithm to derive prime implicants from logic functions. The algorithm takes the logic function as a list of binary numbers indicating the minterms to be disjointed. The numbers are first sorted using a special sorting algorithm with a time complexity of order O(n). Then they are rotated and sorted again in each iteration. Thus, the ith iteration of the algorithm places minterms differing only in the ith literal in successive locations of the list. By doing so, prime implicants appear as consecutive blocks of numbers in the list. The SPIDERS algorithm exhaustively derives all prime implicant from the input function during a number of iterations which is equal to the number of logic variables.