Universal quantization for separate encodings and joint decoding of correlated sources

Avraham Reani, Neri Merhav
2014 2014 IEEE International Symposium on Information Theory  
TO BE CONSIDERED FOR THE IEEE JACK KEIL WOLF ISIT STUDENT PAPER AWARD. We consider the multi-user lossy source-coding problem for continuous alphabet sources. In previous work, Ziv proposed a universal coding scheme which uses uniform quantization with dither, followed by a lossless source encoder (entropy coder). In this paper, we generalize Ziv's scheme to the multi-user setting. For this generalized scheme, upper bounds are derived on the redundancies, defined as the differences between the
more » ... ctual rates and the closest corresponding rates on the boundary of the rate region. It is shown that this scheme can achieve redundancies of no more than 0.754 bits per sample, for each user. These results are obtained without knowledge of the multi-user rate region, which is an open problem in general.
doi:10.1109/isit.2014.6874935 dblp:conf/isit/ReaniM14 fatcat:kxuk45p2pjha3op5hflojst6eq