Channel Coding and Source Coding with Increased Partial Side Information
| Autor: | Uria Basher, Haim H. Permuter, Avihay Shirazi |
|---|---|
| Rok vydání: | 2013 |
| Předmět: |
FOS: Computer and information sciences
E.4 H.1.1 Source code Computer science channel coding Computer Science - Information Theory media_common.quotation_subject channel capacity Tunstall coding General Physics and Astronomy Distributed source coding lcsh:Astrophysics 02 engineering and technology source coding Rate–distortion theory Combinatorics Channel capacity Shannon–Fano coding lcsh:QB460-466 0202 electrical engineering electronic engineering information engineering Gelfand–Pinsker channel coding lcsh:Science partial side information media_common Mathematics Computer Science::Information Theory Sequence Blahut–Arimoto algorithm business.industry Information Theory (cs.IT) Variable-length code 020206 networking & telecommunications Binary erasure channel lcsh:QC1-999 duality rate-distortion Wyner-Ziv source coding lcsh:Q Telecommunications business Encoder Algorithm lcsh:Physics Decoding methods |
| Zdroj: | Entropy; Volume 19; Issue 9; Pages: 467 Entropy, Vol 19, Iss 9, p 467 (2017) |
| DOI: | 10.48550/arxiv.1304.3280 |
| Popis: | Let (S1,i, S2,i), distributed according to i.i.d p(s1, s2), i = 1, 2, . . . be a memoryless, correlated partial side information sequence. In this work we study channel coding and source coding problems where the partial side information (S1, S2) is available at the encoder and the decoder, respectively, and, additionally, either the encoder's or the decoder's side information is increased by a limited-rate description of the other's partial side information. We derive six special cases of channel coding and source coding problems and we characterize the capacity and the rate-distortion functions for the different cases. We present a duality between the channel capacity and the rate-distortion cases we study. In order to find numerical solutions for our channel capacity and rate-distortion problems, we use the Blahut-Arimoto algorithm and convex optimization tools. As a byproduct of our work, we found a tight lower bound on the Wyner-Ziv solution by formulating its Lagrange dual as a geometric program. Previous results in the literature provide a geometric programming formulation that is only a lower bound, but not necessarily tight. Finally, we provide several examples corresponding to the channel capacity and the rate-distortion cases we presented. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|