Variable-Rate Universal Slepian-Wolf Coding with Feedback

Simple item page
dc.citation.bibtexNameinproceedingsen_US
dc.citation.conferenceNameAsilomar Conference on Signals, Systems, and Computersen_US
dc.citation.firstpage8en_US
dc.citation.lastpage12en_US
dc.citation.locationPacific Grove, CAen_US
dc.contributor.authorSarvotham, Shriramen_US
dc.contributor.authorBaron, Droren_US
dc.contributor.authorBaraniuk, Richard G.en_US
dc.contributor.orgDigital Signal Processing (http://dsp.rice.edu/)en_US
dc.date.accessioned2007-10-31T01:03:50Zen_US
dc.date.available2007-10-31T01:03:50Zen_US
dc.date.issued2005-11-01en_US
dc.date.modified2006-07-19en_US
dc.date.note2006-06-06en_US
dc.date.submitted2005-11-01en_US
dc.descriptionConference Paperen_US
dc.description.abstractTraditional Slepian-Wolf coding assumes known statistics and relies on asymptotically long sequences. However, in practice the statistics are unknown, and the input sequences are of finite length. In this finite regime, we must allow a non-zero probability of codeword error and also pay a penalty by adding redundant bits in the encoding process. In this paper, we develop a universal scheme for Slepian-Wolf coding that allows encoding at variable rates close to the Slepian-Wolf limit. We illustrate our scheme in a setup where we encode a uniform Bernoulli source sequence and the second sequence, which is correlated to the first via a binary symmetric correlation channel, is available as side information at the decoder. This specific setup is easily extended to more general settings. For length n source sequences and a fixed, we show that the redundancy of our scheme is O(vnF-1()) bits over the Slepian-Wolf limit. The prior art for Slepian-Wolf coding with known statistics shows that the redundancy is O(vnF-1()). Therefore, we infer that for Slepian-Wolf coding, the penalty needed to accommodate universality is T(vnF-1()).en_US
dc.identifier.citationS. Sarvotham, D. Baron and R. G. Baraniuk, "Variable-Rate Universal Slepian-Wolf Coding with Feedback," 2005.en_US
dc.identifier.urihttps://hdl.handle.net/1911/20321en_US
dc.language.isoengen_US
dc.subjectuniversalityen_US
dc.subject.keyworduniversalityen_US
dc.subject.otherDSP for Communicationsen_US
dc.titleVariable-Rate Universal Slepian-Wolf Coding with Feedbacken_US
dc.typeConference paperen_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Sar2005Nov5VariableRa.PDF
Size:
312.07 KB
Format:
Adobe Portable Document Format
Download
Collections
ECE Publications
DSP Publications