This paper discusses the performance of bilevel-image arithmetic coders, AB
IC and JBIG, and Lempel-Ziv string compressors, ALDC and BLDC. Images are a
nalyzed 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. Gener
ally, throughput performance of the bilevel-image arithmetic coders decreas
ed as image entropy increased. Inversely, the bilevel-image string compress
or (BLDC) revealed that increased entropy improved throughput performance.
Experimental results based on hardware implementations have been provided a
nd analyzed.