MIMO Gaussian broadcast channels with confidential messages

  • Authors:
  • Ruoheng Liu;Tie Liu;H. Vincent Poor;Shlomo Shamai

  • Affiliations:
  • Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical and Computer Engineering, Texas A&M University, College Station, TX;Department of Electrical Engineering, Princeton University, Princeton, NJ;Department of Electrical Engineering, Technion-Israel Institute of Technology, Technion City, Haifa, Israel

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

Quantified Score

Hi-index 0.06

Visualization

Abstract

This paper considers the problem of secret communication over a two-receiver multiple-input multiple-output (MIMO) Gaussian broadcast channel. The transmitter has two independent messages, each of which is intended for one of the receivers but needs to be kept asymptotically perfectly secret from the other. It is shown that, surprisingly, under a matrix power constraint both messages can be simultaneously transmitted at their respective maximal secrecy rates. To prove this result, the MIMO Gaussian wiretap channel is revisited and a new characterization of its secrecy capacity is provided via a new coding scheme that uses artificial noise (a prefix channel) and random binning.