WE1.R5.1

Blahut-Arimoto Algorithm for Computing Capacity Region of Gaussian Vector Broadcast Channels

Tian Jiao, Xi'an Jiaotong University, China; Yanlin Geng, Xidian University, China; Zai Yang, Xi'an Jiaotong University, China

Session:
Broadcast Channels

Track:
7: Network Information Theory

Location:
Omikron I

Presentation Time:
Wed, 10 Jul, 09:50 - 10:10

Session Chair:
Hamdi Joudeh,
Abstract
THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD. We design an algorithm from the perspective of information theory to calculate the capacity region of the Gaussian vector broadcast channel with private messages. For a continuous channel, a classic method to approximately calculate its capacity is to apply the Blahut-Arimoto algorithm after discretization. In this work, we decouple the coupled variables in the original problem by exploiting the property that a Gaussian distribution is uniquely determined by its mean and variance. Furthermore, we derive an equivalent form of the objective function that facilitates simpler projection operations, and thus develop a Gaussian Blahut-Arimoto algorithm without discretization.
Resources