Efficient on-line schemes for encoding individual sequences with side information at the decoder
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Optimal design of sequential real-time communication systems
IEEE Transactions on Information Theory
Universal randomized switching
IEEE Transactions on Signal Processing
Tracking the best level set in a level-crossing analog-to-digital converter
Digital Signal Processing
| Hi-index | 754.90 |
We consider adaptive sequential lossy coding of bounded individual sequences when the performance is measured by the sequentially accumulated mean-squared distortion. The encoder and the decoder are connected via a noiseless channel of capacity R and both are assumed to have zero delay. No probabilistic assumptions are made on how the sequence to be encoded is generated. For any bounded sequence of length n, the distortion redundancy is defined as the normalized cumulative distortion of the sequential scheme minus the normalized cumulative distortion of the best scalar quantizer of rate R which is matched to this particular sequence. We demonstrate the existence of a zero-delay sequential scheme which uses common randomization in the encoder and the decoder such that the normalized maximum distortion redundancy converges to zero at a rate n-1/5 log n as the length of the encoded sequence n increases without bound