Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/inderscience-publishers/witsenhausen-s-counterexample-as-assisted-interference-suppression-GZ1wO80tIW
References
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
- Publisher
- Inderscience Publishers
- Copyright
- Copyright © Inderscience Enterprises Ltd. All rights reserved
- ISSN
- 1755-9340
- eISSN
- 1755-9359
- DOI
- 10.1504/IJSCC.2010.031164
- Publisher site
- See Article on Publisher Site
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.
Journal
International Journal of Systems, Control and Communications – Inderscience Publishers
Published: Jan 1, 2010