TY - JOUR
T1 - Adaptive Buffer-Instrumented Entropy-Coded Quantizer Performance for Memoryless Sources
AU - Farvardin, Nariman
AU - Modestino, James W.
PY - 1986/1
Y1 - 1986/1
N2 - Variable-length codes can be used in entropy coding the outputs of an optimum entropy-constrained quantizer. Transmitting these codes over a synchronous channel, however, requires a buffer connecting the entropy coder to the channel. In a practical application, this buffer is of finite size and hence might overflow or underflow. To alleviate this difficulty, we use an adaptive scheme in which the quantizer parameters are changed successively according to the state of the buffer. Rate-distortion performance of optimum entropy-constrained quantizers in conjunction with this adaptive scheme is studied for the class of generalized Gaussian sources. It is demonstrated through simulations that the overflow / underflow problem can be practically eliminated at the cost of a negligible increase in average distortion. Furthermore, it is shown that the efficiency of this system is more pronounced at high rates and for more broad-tailed source densities. Easily computable upper and lower bounds on the average distortion of the adaptive system are developed.
AB - Variable-length codes can be used in entropy coding the outputs of an optimum entropy-constrained quantizer. Transmitting these codes over a synchronous channel, however, requires a buffer connecting the entropy coder to the channel. In a practical application, this buffer is of finite size and hence might overflow or underflow. To alleviate this difficulty, we use an adaptive scheme in which the quantizer parameters are changed successively according to the state of the buffer. Rate-distortion performance of optimum entropy-constrained quantizers in conjunction with this adaptive scheme is studied for the class of generalized Gaussian sources. It is demonstrated through simulations that the overflow / underflow problem can be practically eliminated at the cost of a negligible increase in average distortion. Furthermore, it is shown that the efficiency of this system is more pronounced at high rates and for more broad-tailed source densities. Easily computable upper and lower bounds on the average distortion of the adaptive system are developed.
UR - http://www.scopus.com/inward/record.url?scp=0022594190&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0022594190&partnerID=8YFLogxK
U2 - 10.1109/TIT.1986.1057133
DO - 10.1109/TIT.1986.1057133
M3 - Article
AN - SCOPUS:0022594190
SN - 0018-9448
VL - 32
SP - 9
EP - 22
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 1
ER -