Skip to Main Content
A parallel lossless image compression engine based on memory efficient tiling and context-based predictive coding is presented for high performance embedded systems. The engine compresses n pixels in parallel with n elementary processing units (EPUs). The low complexity of the JPEG-LS algorithm, combined with its competitive performance, is an advantage for embedded systems. Our algorithm driving the EPU further extends this advantage by memory-reduced context modeling and adjusted Golomb coding. The n parallel codeword streams are fed into a multiplexer tree for a single codeword stream, which is then fed into a buffer for fixed-length output. The compression performance of the proposed engine is closely comparable to the original JPEG-LS, while the pixel throughput is increased by a factor of 1.2n for n EPUs. Hardware implementation of a single EPU requires 25% less resources compared to the original JPEG-LS for the same pixel throughput.