Journal ArticleDOI
Witsenhausen's counterexample as Assisted Interference Suppression
Pulkit Grover,Anant Sahai +1 more
TLDR
A vector extension that can be viewed as a toy wireless communication problem "Assisted Interference Suppression" and it is shown that the new lower bound can be better than Witsenhausen's bound by an arbitrarily large factor.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.read more
Citations
More filters
Proceedings ArticleDOI
Witsenhausen's counterexample: A view from optimal transport theory
Yihong Wu,Sergio Verdu +1 more
TL;DR: Witsenhausen's decentralized stochastic control setup is formulated as an optimization problem involving the quadratic Wasserstein distance and the minimum mean-square error and it is shown that the optimal controller is a strictly increasing function with a real analytic left inverse.
Journal ArticleDOI
On the Existence of Optimal Policies for a Class of Static and Sequential Dynamic Teams
TL;DR: It is shown that a large class of dynamic linear-quadratic-Gaussian teams, including the vector version of the well-known Witsenhausen's counterexample and the Gaussian relay channel problem viewed as a dynamic team, admit team-optimal solutions.
Proceedings ArticleDOI
The finite-dimensional Witsenhausen counterexample
TL;DR: Finite vector lengths are considered with the vector length being viewed as an additional problem parameter and a lower bound to the optimal cost for this finite-length problem is derived that uses appropriate shadows of the infinite-length bounds.
Journal ArticleDOI
An optimizer's approach to stochastic control problems with nonclassical information structures
TL;DR: This work solves the instance solved by Bansal and Başar with a particular application of this approach that uses the data processing inequality for constructing the convex relaxation in stochastic control problems with nonclassical information structures.
References
More filters
Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Book
Convex Optimization
Stephen Boyd,Lieven Vandenberghe +1 more
TL;DR: In this article, the focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them, and a comprehensive introduction to the subject is given. But the focus of this book is not on the optimization problem itself, but on the problem of finding the appropriate technique to solve it.
Journal ArticleDOI
Fundamentals of statistical signal processing: estimation theory
TL;DR: The Fundamentals of Statistical Signal Processing: Estimation Theory as mentioned in this paper is a seminal work in the field of statistical signal processing, and it has been used extensively in many applications.
Book
Fundamentals of Wireless Communication
David Tse,Pramod Viswanath +1 more
TL;DR: In this paper, the authors propose a multiuser communication architecture for point-to-point wireless networks with additive Gaussian noise detection and estimation in the context of MIMO networks.
Book
Information Theory and Reliable Communication
TL;DR: This chapter discusses Coding for Discrete Sources, Techniques for Coding and Decoding, and Source Coding with a Fidelity Criterion.