pith. sign in

arxiv: 1311.4634 · v1 · pith:5RVNZ6FOnew · submitted 2013-11-19 · 💻 cs.IT · math.IT

Sampling versus Random Binning for Multiple Descriptions of a Bandlimited Source

classification 💻 cs.IT math.IT
keywords descriptionssamplingsourcecodingk-setsreceivedbandlimitedbinning
0
0 comments X
read the original abstract

Random binning is an efficient, yet complex, coding technique for the symmetric L-description source coding problem. We propose an alternative approach, that uses the quantized samples of a bandlimited source as "descriptions". By the Nyquist condition, the source can be reconstructed if enough samples are received. We examine a coding scheme that combines sampling and noise-shaped quantization for a scenario in which only K < L descriptions or all L descriptions are received. Some of the received K-sets of descriptions correspond to uniform sampling while others to non-uniform sampling. This scheme achieves the optimum rate-distortion performance for uniform-sampling K-sets, but suffers noise amplification for nonuniform-sampling K-sets. We then show that by increasing the sampling rate and adding a random-binning stage, the optimal operation point is achieved for any K-set.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.