Key points are not available for this paper at this time.
This paper discusses the performance of bilevel-image arithmetic coders, ABIC and JBIG, and Lempel-Ziv string compressors, ALDC and BLDC. Images are analyzed for typical and worst-case throughput and latency as a function of compression. A relationship between the compressibility of an image and the throughput performance of the compression algorithm is demonstrated. Generally, throughput performance of the bilevel-image arithmetic coders decreased as image entropy increased. Inversely, the bilevel-image string compressor (BLDC) revealed that increased entropy improved throughput performance. Experimental results based on hardware implementations have been provided and analyzed.
F. A. Kampf (Sun,) studied this question.