On the compound MIMO broadcast channels with confidential messages

  • Authors:
  • Mari Kobayashi;Yingbin Liang;Shlomo Shamai;Mérouane Debbah

  • Affiliations:
  • SUPELEC, Gif-sur-Yvette, France;University of Hawaii, Honolulu, HI;Technion-Israel Institute of Technology, Haifa, Israel;SUPELEC, Gif-sur-Yvette, France

  • Venue:
  • ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study the compound multi-input multi-output (MIMO) broadcast channel with confidential messages (BCC), where one transmitter sends a common message to two receivers and two confidential messages respectively to each receiver. The channel state may take one of a finite set of states, and the transmitter knows the state set but does not know the realization of the state. We study achievable rates with perfect secrecy in the high SNR regime by characterizing an achievable secrecy degree of freedom (s.d.o.f.) region for two models, the Gaussian MIMO-BCC and the ergodic fading multi-input single-output (MISO)-BCC without a common message. We show that by exploiting an additional temporal dimension due to state variation in the ergodic fading model, the achievable s.d.o.f, region can be significantly improved compared to the Gaussian model with a constant state, although at the price of a larger delay.