Title: Witsenhausen's counterexample as Assisted Interference Suppression

Authors: Pulkit Grover, Anant Sahai

Addresses: Wireless Foundations, Department of EECS, University of California at Berkeley, CA 94720, USA. ' Wireless Foundations, Department of EECS, University of California at Berkeley, CA 94720, USA

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.

Keywords: Witsenhausen|s counterexample; distributed control; information theory.

DOI: 10.1504/IJSCC.2010.031164

International Journal of Systems, Control and Communications, 2010 Vol.2 No.1/2/3, pp.197 - 237

Published online: 23 Jan 2010 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article