Variable-length coding schemes can be employed in entropy encoding of finite-alphabet sources. To transmit these codes over a synchronous channel, however, need arises for a buffer. Since, in practice, this buffer is of finite size, it is subject to both overflow and underflow. We study the buffer behavior with particular application to Huffman coding of the outputs of an optimum uniform-threshold quantizer driven by a memoryless Gaussian source. General upper and lower bounds on the average terminal time are developed. Under certain conditions, the tightness of these bounds are verified and asymptotic formulas are developed. Numerical results concerning the rate-distortion performance of Huffman codes in conjunction with uniform quantization of memoryless Gaussian sources are provided. The buffer behavior as a function of the buffer size and output rate is studied.
|Title of host publication||Unknown Host Publication Title|
|Place of Publication||Princeton, NJ, USA|
|Publisher||Princeton Univ, Dep of Electrical Engineering & Computer Science|
|Number of pages||6|
|State||Published - Dec 1 1984|
ASJC Scopus subject areas