TY - GEN
T1 - Sampling versus random binning for multiple descriptions of a bandlimited source
AU - Mashiach, Adam
AU - Østergaard, Jan
AU - Zamir, Ram
PY - 2013
Y1 - 2013
N2 - 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
AB - 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
UR - http://www.scopus.com/inward/record.url?scp=84893328587&partnerID=8YFLogxK
U2 - 10.1109/ITW.2013.6691315
DO - 10.1109/ITW.2013.6691315
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84893328587
SN - 9781479913237
T3 - 2013 IEEE Information Theory Workshop, ITW 2013
BT - 2013 IEEE Information Theory Workshop, ITW 2013
T2 - 2013 IEEE Information Theory Workshop, ITW 2013
Y2 - 9 September 2013 through 13 September 2013
ER -