12,743 research outputs found
Strong Coordination over Noisy Channels: Is Separation Sufficient?
We study the problem of strong coordination of actions of two agents and
that communicate over a noisy communication channel such that the actions
follow a given joint probability distribution. We propose two novel schemes for
this noisy strong coordination problem, and derive inner bounds for the
underlying strong coordination capacity region. The first scheme is a joint
coordination-channel coding scheme that utilizes the randomness provided by the
communication channel to reduce the local randomness required in generating the
action sequence at agent . The second scheme exploits separate coordination
and channel coding where local randomness is extracted from the channel after
decoding. Finally, we present an example in which the joint scheme is able to
outperform the separate scheme in terms of coordination rate.Comment: 9 pages, 4 figures. An extended version of a paper accepted for the
IEEE International Symposium on Information Theory (ISIT), 201
Robust Location-Aided Beam Alignment in Millimeter Wave Massive MIMO
Location-aided beam alignment has been proposed recently as a potential
approach for fast link establishment in millimeter wave (mmWave) massive MIMO
(mMIMO) communications. However, due to mobility and other imperfections in the
estimation process, the spatial information obtained at the base station (BS)
and the user (UE) is likely to be noisy, degrading beam alignment performance.
In this paper, we introduce a robust beam alignment framework in order to
exhibit resilience with respect to this problem. We first recast beam alignment
as a decentralized coordination problem where BS and UE seek coordination on
the basis of correlated yet individual position information. We formulate the
optimum beam alignment solution as the solution of a Bayesian team decision
problem. We then propose a suite of algorithms to approach optimality with
reduced complexity. The effectiveness of the robust beam alignment procedure,
compared with classical designs, is then verified on simulation settings with
varying location information accuracies.Comment: 24 pages, 7 figures. The short version of this paper has been
accepted to IEEE Globecom 201
Strong Coordination with Polar Codes
In this paper, we design explicit codes for strong coordination in two-node
networks. Specifically, we consider a two-node network in which the action
imposed by nature is binary and uniform, and the action to coordinate is
obtained via a symmetric discrete memoryless channel. By observing that polar
codes are useful for channel resolvability over binary symmetric channels, we
prove that nested polar codes achieve a subset of the strong coordination
capacity region, and therefore provide a constructive and low complexity
solution for strong coordination.Comment: 7 pages doublespaced, presented at the 50th Annual Allerton
Conference on Communication, Control and Computing 201
Coordination and Bargaining over the Gaussian Interference Channel
This work considers coordination and bargaining between two selfish users
over a Gaussian interference channel using game theory. The usual information
theoretic approach assumes full cooperation among users for codebook and rate
selection. In the scenario investigated here, each selfish user is willing to
coordinate its actions only when an incentive exists and benefits of
cooperation are fairly allocated. To improve communication rates, the two users
are allowed to negotiate for the use of a simple Han-Kobayashi type scheme with
fixed power split and conditions for which users have incentives to cooperate
are identified. The Nash bargaining solution (NBS) is used as a tool to get
fair information rates. The operating point is obtained as a result of an
optimization problem and compared with a TDM-based one in the literature.Comment: 5 pages, 4 figures, to appear in Proceedings of IEEE ISIT201
- …