Conditional Run-Length and Variable-Length Coding of Digital Pictures

In earlier publications, we have presented two coding schemes which take into account the conditional statistics of input signals. In the first scheme, the codewords are assigned in such a way as to provide a signal with long runs of zeros and ones. In the second scheme, each picture element is coded by variable-length codewords according to the values of previously transmitted PEL´s. In this paper, by providing further results, we examine these coding schemes in greater detail. The performance of both schemes in terms of entropy and bit rate are compared with an optimum predictive coder. The simulation results indicate that these schemes have a significant advantage over standard predictive encoders. Methods to reduce the storage requirement for the encoder and decoder codebooks are also discussed.