Witsenhausen's counterexample as Assisted Interference Suppression

Pulkit Grover, Anant SahaiInternational Journal of Systems Control and Communications 2010 · DOI

Abstract

Motivated by the existence of an implicit channel in Witsenhausen's counterexample, we formulate a vector extension that can be viewed as a toy wireless communication problem "Assisted Interference Suppression" (AIS). Information-theoretic lower and upper bounds (based respectively on ideas from rate-distortion theory and dirty-paper coding) are then derived on the optimal cost and the asymptotic optimal cost is characterised to within a factor of 2 regardless of the problem parameters. Restricted to the scalar problem, it is shown that the new lower bound can be better than Witsenhausen's bound by an arbitrarily large factor.
BibTeX
@article{grover2010witsenhausen,
  author = {Pulkit Grover and Anant Sahai},
  title = {{Witsenhausen's counterexample as Assisted Interference Suppression}},
  journal = {International Journal of Systems Control and Communications},
  year = {2010},
  doi = {10.1504/ijscc.2010.031164},
}

Loading related content...

Figure