Abstract: This image compression applies a mixture compression algorithm to code the differential value of the adjacent pixels. The first table saves a predetermined number of the most frequent patterns and the second table saves another predetermined number of the most frequent patterns and both apply fixed length code to represent the matched pattern of current pixel.

Abstract: The present invention provides method of a variable length coding for data compression. The first coding algorithm is applied to encode the data with the value less than half of the calculated divider and another coding algorithm encoding the subtracted value of the data. Another algorithm applies at least two predetermined “marker bits” to indicate the range of data with concatenated binary code encoding the shifted value of the data. Another algorithm deciding the boundary separating the first range and other ranges of the data and encode the data by applying at least two different algorithms accordingly.

Abstract: An image compression method and fast storage device accessing and pixel decompression is achieved by asserting the starting location of one or more groups of compress pixels. Information of at least one upper line of pixel's pattern complexity is temporarily saved into a register for predicting the code length of the targeted pixel of the current line and deciding the coding method.

Abstract: The present invention provides method of a variable length coding for data compression. The first coding algorithm is applied to encode the data with the value less than half of the calculated divider and another coding algorithm encoding the subtracted value of the data. Another algorithm applies at least two predetermined “marker bits” to indicate the range of data with concatenated binary code encoding the shifted value of the data. Another algorithm deciding the boundary separating the first range and other ranges of the data and encode the data by applying at least two different algorithms accordingly.