Conditional entropy encoding of log-PCM speech

The conditional dependence between the current and previously quantised samples in 64 kbit/s ?-law PCM speech is exploited to noiselessly reduce the average transmitted bit rate. From the conditional probabilities, the conditional entropy and average Huffman code word lengths were computed. The average data rate reduction for the first-order noiseless encoder was found to be 12 kbit/s.

[1]  Lee D. Davisson,et al.  Universal noiseless coding , 1973, IEEE Trans. Inf. Theory.

[2]  H. Gharavi Conditional variable-length coding for gray-level pictures , 1984, AT&T Bell Laboratories Technical Journal.