Witsenhausen's counterexample as Assisted Interference Suppression
by Pulkit Grover, Anant Sahai
International Journal of Systems, Control and Communications (IJSCC), Vol. 2, No. 1/2/3, 2010

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.

Online publication date: Sat, 23-Jan-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Systems, Control and Communications (IJSCC):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com